Added first day in zig
This commit is contained in:
parent
1108812492
commit
3587c73fea
3 changed files with 66 additions and 0 deletions
10
2021/01/example
Normal file
10
2021/01/example
Normal file
|
@ -0,0 +1,10 @@
|
||||||
|
199
|
||||||
|
200
|
||||||
|
208
|
||||||
|
210
|
||||||
|
200
|
||||||
|
207
|
||||||
|
240
|
||||||
|
269
|
||||||
|
260
|
||||||
|
263
|
26
2021/01/first.zig
Normal file
26
2021/01/first.zig
Normal file
|
@ -0,0 +1,26 @@
|
||||||
|
const std = @import("std");
|
||||||
|
|
||||||
|
const example = @embedFile("example");
|
||||||
|
const input = @embedFile("input");
|
||||||
|
|
||||||
|
pub fn main() anyerror!void {
|
||||||
|
try std.testing.expectEqual(solve(example), 7);
|
||||||
|
const result = try solve(input);
|
||||||
|
try std.io.getStdOut().writer().print("{}\n", .{result});
|
||||||
|
}
|
||||||
|
|
||||||
|
fn solve(puzzle: []const u8) !u64 {
|
||||||
|
var it = std.mem.tokenize(u8, puzzle, " \n");
|
||||||
|
var tot: u64 = 0;
|
||||||
|
var prev: ?u64 = null;
|
||||||
|
while (it.next()) |value| {
|
||||||
|
const n = try std.fmt.parseInt(u64, value, 10);
|
||||||
|
if (prev) |p| {
|
||||||
|
if (p < n) {
|
||||||
|
tot += 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
prev = n;
|
||||||
|
}
|
||||||
|
return tot;
|
||||||
|
}
|
30
2021/01/second.zig
Normal file
30
2021/01/second.zig
Normal file
|
@ -0,0 +1,30 @@
|
||||||
|
const std = @import("std");
|
||||||
|
|
||||||
|
const example = @embedFile("example");
|
||||||
|
const input = @embedFile("input");
|
||||||
|
|
||||||
|
pub fn main() anyerror!void {
|
||||||
|
try std.testing.expectEqual(solve(example), 5);
|
||||||
|
const result = try solve(input);
|
||||||
|
try std.io.getStdOut().writer().print("{}\n", .{result});
|
||||||
|
}
|
||||||
|
|
||||||
|
fn solve(puzzle: []const u8) !u64 {
|
||||||
|
var it = std.mem.tokenize(u8, puzzle, " \n");
|
||||||
|
var tot: u64 = 0;
|
||||||
|
var prev = [_]?u64{null} ** 3;
|
||||||
|
while (it.next()) |value| {
|
||||||
|
const n = try std.fmt.parseInt(u64, value, 10);
|
||||||
|
if (prev[0]) |p| {
|
||||||
|
if (p < n) {
|
||||||
|
tot += 1;
|
||||||
|
}
|
||||||
|
}
|
||||||
|
var i: usize = 0;
|
||||||
|
while (i < prev.len - 1) : (i += 1) {
|
||||||
|
prev[i] = prev[i + 1];
|
||||||
|
}
|
||||||
|
prev[2] = n;
|
||||||
|
}
|
||||||
|
return tot;
|
||||||
|
}
|
Loading…
Add table
Reference in a new issue