adam/AdventOfCode
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Day 2 part 2

Browse source
This commit is contained in:
Adam Millerchip 2022-08-11 23:53:24 +09:00
parent be7c251662
commit 462ab21364
1 changed files with 28 additions and 3 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

29
2020/zig/src/day02.zig
View file

@ -12,6 +12,13 @@ const gpa = util.gpa;
const data = @embedFile("input");
pub fn main() !void {
print("Part 1: {d}\n", .{part1()});
print("Part 2: {d}\n", .{part2()});
}
// TODO remove duplication by building a struct from the input?
fn part1() !u16 {
var it = tokenize(u8, data, "\n");
var valid_pw_count: u16 = 0;
while (it.next()) |line| {
@ -30,12 +37,30 @@ pub fn main() !void {
if (min_val <= count and count <= max_val)
valid_pw_count += 1;
}
return valid_pw_count;
}
print("{d}-{d} {c}: {s} => {d}\n", .{min_val, max_val, req_char, password, count});
fn part2() !u16 {
var it = tokenize(u8, data, "\n");
var valid_pw_count: u16 = 0;
while (it.next()) |line| {
var line_it = tokenize(u8, line, ": -");
const pos_a = try parseInt(u8, line_it.next().?, 10);
const pos_b = try parseInt(u8, line_it.next().?, 10);
const req_char = line_it.next().?[0];
const password = line_it.next().?;
const a_match = password[pos_a-1] == req_char;
const b_match = password[pos_b-1] == req_char;
// No xor in zig?
if (a_match and !b_match or !a_match and b_match)
valid_pw_count += 1;
}
print("{d}\n", .{valid_pw_count});
return valid_pw_count;
}
// Useful stdlib functions
const tokenize = std.mem.tokenize;
const split = std.mem.split;