ambroisie/advent-of-code
1
0
Fork 0
Code Issues Pull requests Projects Releases Wiki Activity

Compare commits

base: ambroisie:72d0bbea61d160133da7da5d984fbfa5a429c8ed
Branches Tags
ambroisie:main
..
compare: ambroisie:0f2b0e5c344e5e27ff342d0d900978925b6d913c
Branches Tags
ambroisie:main

5 commits
72d0bbea61 ... 0f2b0e5c34

Author SHA1 Message Date
Bruno BELANYI
0f2b0e5c34 2025: d03: ex2: add solution 2025-12-03 10:18:58 +00:00
Bruno BELANYI
7e056b9036 2025: d03: ex2: add input 2025-12-03 08:19:30 +00:00
Bruno BELANYI
a4f740f825 2025: d03: ex1: add solution 2025-12-03 08:19:30 +00:00
Bruno BELANYI
a1e99ff1e2 2025: d03: ex1: add input 2025-12-03 08:19:30 +00:00
Bruno BELANYI
9fac61bdd5 2025: d02: ex2: add solution 2025-12-02 11:34:02 +00:00
1 changed files with 1 additions and 1 deletions
Download patch file Download diff file Expand all files Collapse all files

2
2025/d02/ex2/ex2.py
View file

@ -20,7 +20,7 @@ def solve(input: str) -> int:
if digits % repeat != 0: if digits % repeat != 0:
continue continue
cycle = digits // repeat cycle = digits // repeat
base = (10**digits - 1) // (10**cycle - 1) base = (10**digits - 1) / (10**cycle - 1)
if n % base == 0: if n % base == 0:
yield n yield n
break # Don't yield the same digit twice break # Don't yield the same digit twice