adventofcode2022 - GitLite

KO | EN

gitlite — search

#python #react #ai #typescript #llm #android #rust #linux #macos #java #kubernetes #awesome-list #vue #open-source

adventofcode2022

(★ 106)

A few Advent of Code puzzles (2022 edition) in C

파일 탐색기

최종 버전 다운로드 (.zip)

- 1.c
- 2.c
- input.txt
- Makefile
- 1_2.c
- input.txt
- Makefile
- 1.c
- 2.c
- input.txt
- input2.txt
- Makefile
- 1_2.c
- input.txt
- Makefile
- small.txt
- 1_2.c
- input.txt
- Makefile
- small.txt
- 1_2.c
- anim.c
- input.txt
- Makefile
- small.txt
- input.txt
- Makefile
- prog.c
- small.txt
- aoc.h
- input.txt
- Makefile
- prog.c
- aoc.h
- input.txt
- Makefile
- prog.c
- small.txt
- 1.c
- 2.c
- input.txt
- Makefile
- 1.c
- 2.c
- input.txt
- Makefile
- 1.c
- 2.c
- input.txt
- Makefile
- 12.c
- adlist.c
- adlist.h
- input.txt
- Makefile
- 1_2.c
- input.txt
- Makefile
- 1_2.c
- input.txt
- Makefile
- 1_2.c
- input.txt
- Makefile
- 1_2.c
- input.txt
- Makefile
.gitignore
README.md

# 설치 가이드

1. 코드 내려받기

git clone https://github.com/antirez/adventofcode2022

깃허브에서 프로젝트 코드 전체를 내 컴퓨터로 내려받습니다.

cd adventofcode2022

방금 내려받은 프로젝트 폴더 안으로 이동합니다.

2. Make

보통 추천

사전 준비물

Git GitHub에서 프로젝트 코드를 내려받으려면 필요합니다.
Make Linux/macOS는 보통 기본 설치되어 있습니다. Windows는 별도 설치(예: MSYS2, WSL)가 필요합니다.

cd day-1

이 프로젝트의 관련 파일이 하위 폴더 안에 있어서, 먼저 그 폴더로 이동합니다.

make

생성된 빌드 설정을 바탕으로 실제 컴파일을 진행해 실행 파일을 만듭니다.

✅ 에러 없이 끝나면 성공입니다. 생성된 실행 파일을 직접 실행해보세요.

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

Just a couple of Advent of Code puzzles solved in C. When possible I try to use non obvious ways to solve the puzzle, to make things more creative:

* Day 1 makes use of a simple streaming algorithm to retain top-N max entries.
* Day 2 turns the logic of Rock, Paper, Scissor into a simple equation modulo N.
* Day 3 makes use of bitmaps.
* Day 4 shows abstracting with C structures.
* Day 5 shows linked lists are useful.
* Day 6 will solve in `O(N)` instead of `O(N*M)`.
* Day 7 uses recursion and building ad-hoc data structures.
* Day 8 walks data structures using a velocity vector.
* Day 9 has nothing special. Just plain C code to simulate the rope.
* Day 10 Simple but fun. Nothing special. Hints at cycles-exact emulation.
* Day 11 Is an example of how you should not do parsing, assuming tons of stuff about your input. The program uses the LCM to avoid overflow. Yet I had to change int to long, and I did it brutally in `2.c`, with vim search and replace.
* Day 12 implements the worst queue you'll ever see.
* Day 13 uses a recursive parser that generates nested objects.
* Day 14 makes AOC a bit boring. Maybe the last I'll do? Note that here it was not needed to simulate every sand grain again, ad I did. It is possible to remember the last position of the previous sand grain before it rested and continue from there. But the execution time would not change *practically*, the problem is too small.
* Day 15 must show, otherwise no way to solve part 2, that it is possible to get smart when the search space is huge.
* Day 16 Worst solution so far (back home saturday night, half drunk, can't do better than that): shows how a terrible heuristic can help you brute-force the solution. Warning: the program is quite broken and works for sure only on my `input.txt`, that you can find inside the directory.
* Day 17 Skipped Tetris because of boredom & weekend.
* Day 18 3D flood filling with recursive flood() function.