diff options
| author | June McEnroe <june@causal.agency> | 2018-12-03 00:25:08 -0500 |
|---|---|---|
| committer | June McEnroe <june@causal.agency> | 2020-11-22 00:14:25 -0500 |
| commit | c37ba018558ad65a3c20d21bc28683f9ee127145 (patch) | |
| tree | ba33daa9e6f5f7a8d52193fee342cf3835d50d5a | |
| parent | Un-hardcode width of input in day 2 (diff) | |
| download | aoc-c37ba018558ad65a3c20d21bc28683f9ee127145.tar.gz aoc-c37ba018558ad65a3c20d21bc28683f9ee127145.zip | |
Solve day 3 part 1
| -rw-r--r-- | 2018/day03.c | 27 |
1 files changed, 27 insertions, 0 deletions
diff --git a/2018/day03.c b/2018/day03.c new file mode 100644 index 0000000..b4544c1 --- /dev/null +++ b/2018/day03.c @@ -0,0 +1,27 @@ +#include <stdio.h> +#include <stdlib.h> + +typedef unsigned char byte; +typedef unsigned uint; + +enum { Len = 1000 }; +static byte fabric[Len][Len]; + +int main() { + while (!feof(stdin)) { + uint d, x, y, w, h; + scanf("#%u @ %u,%u: %ux%u\n", &d, &x, &y, &w, &h); + for (uint i = 0; i < w; ++i) { + for (uint j = 0; j < h; ++j) { + fabric[x + i][y + j]++; + } + } + } + uint count = 0; + for (uint x = 0; x < Len; ++x) { + for (uint y = 0; y < Len; ++y) { + if (fabric[x][y] > 1) count++; + } + } + printf("%u\n", count); +} |