mirror of
https://github.com/cupcakearmy/advent-of-code.git
synced 2024-11-17 10:30:29 +01:00
14 lines
451 B
Markdown
14 lines
451 B
Markdown
|
# 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>
|