day8, part2

This commit is contained in:
efim
2023-12-08 10:07:11 +00:00
parent 3300a8bf3e
commit 77d7355eb7
2 changed files with 7 additions and 2 deletions

View File

@@ -27,3 +27,4 @@ so take the difference, if divisible by cycle - yay. just multiply, if not divis
if all are same, that's solution.
if one is farthest, repeat
* i stopped bruteforce at 4080000000
the answer was 14935034899483