From b861399bcd2d75c17e0d63c0b08067c3550054d9 Mon Sep 17 00:00:00 2001 From: Akuli Date: Tue, 26 Dec 2023 02:34:45 +0200 Subject: [PATCH] complete AoC 2023 --- README.md | 4 ++-- examples/aoc2023/day25/part1.jou | 2 +- 2 files changed, 3 insertions(+), 3 deletions(-) diff --git a/README.md b/README.md index 5cbe0e75..e912570f 100644 --- a/README.md +++ b/README.md @@ -13,8 +13,8 @@ def main() -> int: See the [examples](./examples/) and [tests](./tests/) directories for more example programs or read [the Jou tutorial](./doc/tutorial.md). -So far, Jou is usable enough to do [Advent of Code 2023](https://adventofcode.com/). -We'll see whether I get 50 stars with Jou this year. +So far, Jou is usable enough for writing small programs. +For example, I solved all problems of [Advent of Code 2023](https://adventofcode.com/2023/) in Jou. See [examples/aoc2023](./examples/aoc2023/) for the code. Goals: diff --git a/examples/aoc2023/day25/part1.jou b/examples/aoc2023/day25/part1.jou index 8ab309bc..17bbf3de 100644 --- a/examples/aoc2023/day25/part1.jou +++ b/examples/aoc2023/day25/part1.jou @@ -278,6 +278,6 @@ def main() -> int: #graph.visualize_with_graphviz() assert graph.num_nodes == 2 - printf("%d\n", graph.weights[0] * graph.weights[1]) + printf("%d\n", graph.weights[0] * graph.weights[1]) # Output: 54 graph.free() return 0