cupcakearmy/advent-of-code
1
0
Fork 0
mirror of https://github.com/cupcakearmy/advent-of-code.git synced 2025-12-14 05:44:59 +00:00
Code Issues Packages Projects Releases Wiki Activity

14

Browse Source
This commit is contained in:
cupcakearmy
2022-11-28 23:51:45 +01:00
parent 607651d3ba
commit e3fe7fb6bc
2 changed files with 99 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
2021/14/README.md Normal file
View File

@@ -0,0 +1,13 @@
# 14
This was nice! Similar to the Lanterfish one. The naive way is to have a big string, but that becomes unfeasible quickly.
The solution was to keep track of the number of combinations available and at the end divide by 2 the counted elements. Rounding up so that the first and last element is not neglected as they are not doubled.
<details>
<summary>Solutions</summary>
<ol>
<li>2988</li>
<li>3572761917024</li>
</ol>
</details>