summaryrefslogtreecommitdiff
path: root/day_04.zig
diff options
context:
space:
mode:
authorChristian Segundo2022-12-05 17:00:08 +0100
committerChristian Segundo2022-12-05 22:16:11 +0100
commit061a5bae272f45db6dcde99746922735f9769d25 (patch)
treee4dd9b6d903930c5c1b76286b4a08beea6f59162 /day_04.zig
parent8817203517907ef4248bde7474e6fb566515d6a7 (diff)
downloadadvent-of-zig-2022-061a5bae272f45db6dcde99746922735f9769d25.tar.gz
add day 5
Diffstat (limited to 'day_04.zig')
-rw-r--r--day_04.zig48
1 files changed, 48 insertions, 0 deletions
diff --git a/day_04.zig b/day_04.zig
new file mode 100644
index 0000000..0fa2fdb
--- /dev/null
+++ b/day_04.zig
@@ -0,0 +1,48 @@
+const std = @import("std");
+const Result = @import("util/aoc.zig").Result;
+
+pub fn puzzle_1(input: []const u8) !Result {
+ var iter = std.mem.split(u8, input, "\n");
+
+ var count: u16 = 0;
+ while (iter.next()) |line| {
+ const range = try parse_range(line);
+
+ if ((range[0][0] >= range[1][0] and range[0][1] <= range[1][1]) or
+ (range[0][0] <= range[1][0] and range[0][1] >= range[1][1]))
+ count += 1;
+ }
+
+ return .{ .int = count };
+}
+
+pub fn puzzle_2(input: []const u8) !Result {
+ var iter = std.mem.split(u8, input, "\n");
+
+ var count: u16 = 0;
+ while (iter.next()) |line| {
+ const range = try parse_range(line);
+
+ if ((range[0][0] >= range[1][0] and range[0][0] <= range[1][1]) or
+ (range[0][0] <= range[1][0] and range[0][1] >= range[1][0]))
+ count += 1;
+ }
+
+ return .{ .int = count };
+}
+
+fn parse_range(line: []const u8) ![2][2]u8 {
+ var r = std.mem.zeroes([2][2]u8);
+
+ var parts = std.mem.split(u8, line, ",");
+ var p1 = std.mem.split(u8, parts.next().?, "-");
+ var p2 = std.mem.split(u8, parts.next().?, "-");
+
+ r[0][0] = try std.fmt.parseInt(u8, p1.next().?, 0);
+ r[0][1] = try std.fmt.parseInt(u8, p1.next().?, 0);
+
+ r[1][0] = try std.fmt.parseInt(u8, p2.next().?, 0);
+ r[1][1] = try std.fmt.parseInt(u8, p2.next().?, 0);
+
+ return r;
+}