blob: a2f85f6a40b68653f66ab570dca7289bfa741d19 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
|
const std = @import("std");
const problem = struct {n: []u64, mult: bool};
pub fn main() !void {
var gpa = std.heap.GeneralPurposeAllocator(.{}){};
defer _ = gpa.deinit();
const alloc = gpa.allocator();
const path = "input.txt";
const fp = try std.fs.cwd().openFile(path, .{.mode = std.fs.File.OpenMode.read_only});
defer fp.close();
var reader = fp.reader();
var buffer: [8000]u8 = undefined;
var list = std.ArrayList(problem).init(alloc);
defer list.deinit();
defer for(list.items) |v| alloc.free(v.n);
while(try reader.readUntilDelimiterOrEof(&buffer, '\n')) |line| {
if(line[0] == '*' or line[0] == '+'){
var next_mult: bool = line[0] == '*';
var i: usize = 1;
var w: usize = 1;
while(i < line.len) : ({i += 1; w += 1;}) {
if(line[i] != ' '){
var l = try alloc.alloc(u64, w - 1);
@memset(l[0..], 0);
try list.append(problem{.n = l, .mult = next_mult});
next_mult = line[i] == '*';
w = 0;
}
}
var l = try alloc.alloc(u64, w);
@memset(l[0..], 0);
try list.append(problem{.n = l, .mult = next_mult});
}
}
try fp.seekTo(0);
while(try reader.readUntilDelimiterOrEof(&buffer, '\n')) |line| {
if(line[0] == '*' or line[0] == '+') break;
var chunk: usize = 0;
var count: u64 = 0;
for(line) |c| {
if(count >= list.items[chunk].n.len + 1){
chunk += 1;
count = 0;
}
if(c != ' '){
list.items[chunk].n[count] *= 10;
list.items[chunk].n[count] += c - '0';
}
count += 1;
}
}
var total: u64 = 0;
for(list.items) |v| {
var n: u64 = 0;
if(v.mult){
n = 1;
for(v.n) |a| n *= a;
} else {
for(v.n) |a| n += a;
}
total += n;
}
std.debug.print("{d}\n", .{total});
}
|
