lucia/aoc2024
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

day 7

Browse Source
This commit is contained in:
Lucia Ceionia
2024-12-07 17:06:19 -06:00
parent dabcdfc2e1
commit 601e70a9a7
3 changed files with 345 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

67
07/build.zig Normal file
View File

@@ -0,0 +1,67 @@
const std = @import("std");
// Although this function looks imperative, note that its job is to
// declaratively construct a build graph that will be executed by an external
// runner.
pub fn build(b: *std.Build) void {
// Standard target options allows the person running `zig build` to choose
// what target to build for. Here we do not override the defaults, which
// means any target is allowed, and the default is native. Other options
// for restricting supported target set are available.
const target = b.standardTargetOptions(.{});
// Standard optimization options allow the person running `zig build` to select
// between Debug, ReleaseSafe, ReleaseFast, and ReleaseSmall. Here we do not
// set a preferred release mode, allowing the user to decide how to optimize.
const optimize = b.standardOptimizeOption(.{});
const exe = b.addExecutable(.{
.name = "07",
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
// This declares intent for the executable to be installed into the
// standard location when the user invokes the "install" step (the default
// step when running `zig build`).
b.installArtifact(exe);
// This *creates* a Run step in the build graph, to be executed when another
// step is evaluated that depends on it. The next line below will establish
// such a dependency.
const run_cmd = b.addRunArtifact(exe);
// By making the run step depend on the install step, it will be run from the
// installation directory rather than directly from within the cache directory.
// This is not necessary, however, if the application depends on other installed
// files, this ensures they will be present and in the expected location.
run_cmd.step.dependOn(b.getInstallStep());
// This allows the user to pass arguments to the application in the build
// command itself, like this: `zig build run -- arg1 arg2 etc`
if (b.args) |args| {
run_cmd.addArgs(args);
}
// This creates a build step. It will be visible in the `zig build --help` menu,
// and can be selected like this: `zig build run`
// This will evaluate the `run` step rather than the default, which is "install".
const run_step = b.step("run", "Run the app");
run_step.dependOn(&run_cmd.step);
const exe_unit_tests = b.addTest(.{
.root_source_file = b.path("src/main.zig"),
.target = target,
.optimize = optimize,
});
const run_exe_unit_tests = b.addRunArtifact(exe_unit_tests);
run_exe_unit_tests.has_side_effects = true;
// Similar to creating the run step earlier, this exposes a `test` step to
// the `zig build --help` menu, providing a way for the user to request
// running the unit tests.
const test_step = b.step("test", "Run unit tests");
test_step.dependOn(&run_exe_unit_tests.step);
}

72
07/build.zig.zon Normal file
View File

@@ -0,0 +1,72 @@
.{
// This is the default name used by packages depending on this one. For
// example, when a user runs `zig fetch --save <url>`, this field is used
// as the key in the `dependencies` table. Although the user can choose a
// different name, most users will stick with this provided value.
//
// It is redundant to include "zig" in this name because it is already
// within the Zig package namespace.
.name = "07",
// This is a [Semantic Version](https://semver.org/).
// In a future version of Zig it will be used for package deduplication.
.version = "0.0.0",
// This field is optional.
// This is currently advisory only; Zig does not yet do anything
// with this value.
//.minimum_zig_version = "0.11.0",
// This field is optional.
// Each dependency must either provide a `url` and `hash`, or a `path`.
// `zig build --fetch` can be used to fetch all dependencies of a package, recursively.
// Once all dependencies are fetched, `zig build` no longer requires
// internet connectivity.
.dependencies = .{
// See `zig fetch --save <url>` for a command-line interface for adding dependencies.
//.example = .{
// // When updating this field to a new URL, be sure to delete the corresponding
// // `hash`, otherwise you are communicating that you expect to find the old hash at
// // the new URL.
// .url = "https://example.com/foo.tar.gz",
//
// // This is computed from the file contents of the directory of files that is
// // obtained after fetching `url` and applying the inclusion rules given by
// // `paths`.
// //
// // This field is the source of truth; packages do not come from a `url`; they
// // come from a `hash`. `url` is just one of many possible mirrors for how to
// // obtain a package matching this `hash`.
// //
// // Uses the [multihash](https://multiformats.io/multihash/) format.
// .hash = "...",
//
// // When this is provided, the package is found in a directory relative to the
// // build root. In this case the package's hash is irrelevant and therefore not
// // computed. This field and `url` are mutually exclusive.
// .path = "foo",
// // When this is set to `true`, a package is declared to be lazily
// // fetched. This makes the dependency only get fetched if it is
// // actually used.
// .lazy = false,
//},
},
// Specifies the set of files and directories that are included in this package.
// Only files and directories listed here are included in the `hash` that
// is computed for this package. Only files listed here will remain on disk
// when using the zig package manager. As a rule of thumb, one should list
// files required for compilation plus any license(s).
// Paths are relative to the build root. Use the empty string (`""`) to refer to
// the build root itself.
// A directory listed here means that all files within, recursively, are included.
.paths = .{
"build.zig",
"build.zig.zon",
"src",
// For example...
//"LICENSE",
//"README.md",
},
}

206
07/src/main.zig Normal file
View File

@@ -0,0 +1,206 @@
// tedious and bad code but zig is mostly fine ig
const std = @import("std");
var arena = std.heap.ArenaAllocator.init(std.heap.page_allocator);
const alloc = arena.allocator();
const test_data = @embedFile("test");
const input_data = @embedFile("input");
pub fn main() !void {
const stdout = std.io.getStdOut().writer();
const value1 = try run1(input_data);
try stdout.print("{d}\n", .{value1});
const value2 = try run2(input_data);
try stdout.print("{d}\n", .{value2});
}
test "test input part 1" {
std.debug.print("\n", .{});
const value = try run1(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(3749, value);
}
test "test input part 2" {
std.debug.print("\n",.{});
const value = try run2(test_data);
std.debug.print("{d}\n", .{value});
try std.testing.expectEqual(11387, value);
}
fn parseIntFromReader(reader: anytype) anyerror!u64 {
const f = try reader.readByte();
if (f < '0' or f > '9') return error.BadCharacter;
var v: u64 = f - '0';
while (true) {
const c = try reader.readByte();
if (c < '0' or c > '9') {
break;
} else {
v = (v * 10) + (c - '0');
}
}
return v;
}
fn run2(s: []const u8) !u64 {
var total: u64 = 0;
const Entry = struct {
n: u64,
nums: std.ArrayList(u64)
};
var entries = std.ArrayList(Entry).init(alloc);
var s_fbs = std.io.fixedBufferStream(s);
var s_reader = s_fbs.reader();
l: while (true) {
const err: anyerror!void = b: {
const n = parseIntFromReader(s_reader) catch |e| break :b e;
try s_fbs.seekBy(-1);
if ((s_reader.readByte() catch |e| break :b e) != ':') break :b error.BadCharacter;
var e: Entry = Entry {
.n = n,
.nums = std.ArrayList(u64).init(alloc)
};
while ((s_reader.readByte() catch |er| break :b er) != '\n') {
const i = parseIntFromReader(s_reader) catch |er| break :b er;
try s_fbs.seekBy(-1);
try e.nums.append(i);
}
try entries.append(e);
};
_ = err catch |e| switch (e) {
error.EndOfStream => { break :l; },
else => return e
};
}
var str_buf: [64]u8 = undefined;
var str_buf_fbs = std.io.fixedBufferStream(&str_buf);
var str_buf_writer = str_buf_fbs.writer();
for (entries.items) |entry| {
const nums: []u64 = entry.nums.items;
std.debug.print("{}:", .{entry.n});
for (nums) |i| {
std.debug.print(" {}", .{i});
}
std.debug.print("\n",.{});
const OP = enum { ADD, MUL, CAT };
var ops: [32]OP = .{OP.ADD}**32;
check: while (true) {
var op_i: usize = 0;
var v = nums[0];
for (nums[1..]) |n| {
switch (ops[op_i]) {
OP.ADD => v += n,
OP.MUL => v *= n,
OP.CAT => {
try str_buf_fbs.seekTo(0);
try std.fmt.formatInt(v, 10, std.fmt.Case.lower, .{}, &str_buf_writer);
try std.fmt.formatInt(n, 10, std.fmt.Case.lower, .{}, &str_buf_writer);
v = try std.fmt.parseInt(u64, str_buf[0..str_buf_fbs.pos], 10);
},
}
op_i += 1;
}
if (v == entry.n) {
std.debug.print("good!\n",.{});
total += entry.n;
break :check;
}
var i: usize = 0;
while (true) {
switch(ops[i]) {
OP.ADD => ops[i] = OP.MUL,
OP.MUL => ops[i] = OP.CAT,
OP.CAT => { ops[i] = OP.ADD; i += 1; continue; }
}
if (i >= nums.len - 1) break :check;
break;
}
}
}
total += 0;
return total;
}
fn run1(s: []const u8) !u64 {
var total: u64 = 0;
const Entry = struct {
n: u64,
nums: std.ArrayList(u64)
};
var entries = std.ArrayList(Entry).init(alloc);
var s_fbs = std.io.fixedBufferStream(s);
var s_reader = s_fbs.reader();
l: while (true) {
const err: anyerror!void = b: {
const n = parseIntFromReader(s_reader) catch |e| break :b e;
try s_fbs.seekBy(-1);
if ((s_reader.readByte() catch |e| break :b e) != ':') break :b error.BadCharacter;
var e: Entry = Entry {
.n = n,
.nums = std.ArrayList(u64).init(alloc)
};
while ((s_reader.readByte() catch |er| break :b er) != '\n') {
const i = parseIntFromReader(s_reader) catch |er| break :b er;
try s_fbs.seekBy(-1);
try e.nums.append(i);
}
try entries.append(e);
};
_ = err catch |e| switch (e) {
error.EndOfStream => { break :l; },
else => return e
};
}
for (entries.items) |entry| {
const nums: []u64 = entry.nums.items;
std.debug.print("{}:", .{entry.n});
for (nums) |i| {
std.debug.print(" {}", .{i});
}
std.debug.print("\n",.{});
var ops: u32 = 0;
const op_mask = (@as(u32,1) << @intCast(nums.len - 1)) - 1;
check: while (true) {
var no = ops;
var v = nums[0];
for (nums[1..]) |n| {
if (no & 1 == 1) {
v *= n;
} else {
v += n;
}
no >>= 1;
}
if (v == entry.n) {
std.debug.print("good!\n",.{});
total += entry.n;
break :check;
}
ops += 1;
if (ops & op_mask == 0) {
break :check;
}
}
}
total += 0;
return total;
}