adyxax/advent-of-code
1
0
Fork 0
Code Issues Pull requests Activity

2022-06 in zig

Browse source
This commit is contained in:
Julien Dessaux 2022-12-06 11:56:29 +01:00
parent f93b2ed7a9
commit 68f3c84d68
Signed by: adyxax
GPG key ID: F92E51B86E07177E
8 changed files with 71 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

28
2022/06-tuning-trouble/first.zig Normal file
View file

@ -0,0 +1,28 @@
const std = @import("std");
const example = @embedFile("example");
const example2 = @embedFile("example2");
const example3 = @embedFile("example3");
const example4 = @embedFile("example4");
const example5 = @embedFile("example5");
const input = @embedFile("input");
pub fn main() anyerror!void {
try std.testing.expectEqual(solve(example), 7);
try std.testing.expectEqual(solve(example2), 5);
try std.testing.expectEqual(solve(example3), 6);
try std.testing.expectEqual(solve(example4), 10);
try std.testing.expectEqual(solve(example5), 11);
const result = solve(input);
try std.io.getStdOut().writer().print("{}\n", .{result});
}
fn solve(puzzle: []const u8) u64 {
var i: u64 = 3;
while (true) : (i += 1) {
if (puzzle[i] == puzzle[i - 1] or puzzle[i] == puzzle[i - 2] or puzzle[i] == puzzle[i - 3] or puzzle[i - 1] == puzzle[i - 2] or puzzle[i - 1] == puzzle[i - 3] or puzzle[i - 2] == puzzle[i - 3]) {
continue;
}
return i + 1;
}
}