Un paio di lettori sono riusciti a decifrare la breve frase che avevo proposto alla vostra attenzione crittografica qualche giorno fa (...)
www.borborigmi.org/2025/01/19/p...
#borborigmi #primolevi #crittografia
Un paio di lettori sono riusciti a decifrare la breve frase che avevo proposto alla vostra attenzione crittografica qualche giorno fa (...)
www.borborigmi.org/2025/01/19/p...
#borborigmi #primolevi #crittografia
github.com/marcodelmast...
(using a dictionary for Part 1, networkx FTW for Part 2!)
github.com/marcodelmast...
(using a dictionary for Part 1, networkx FTW for Part 2!)
github.com/marcodelmast...
github.com/marcodelmast...
github.com/marcodelmast...
github.com/marcodelmast...
github.com/marcodelmast...
(There might be some mathematical shortcut, but I went for the brute force solution)
github.com/marcodelmast...
(There might be some mathematical shortcut, but I went for the brute force solution)
github.com/marcodelmast...
(for Part 2 I initially tested all position on map to place obstacles, then realised I only need to place them on the initial path of the guard)
github.com/marcodelmast...
(for Part 2 I initially tested all position on map to place obstacles, then realised I only need to place them on the initial path of the guard)
Wrote a custom `compare` function, passed to sorting algorithm via `functools.cmp_to_key()`. After that, part 1 and part 2 are basically solved in the same way:
github.com/marcodelmast...
Wrote a custom `compare` function, passed to sorting algorithm via `functools.cmp_to_key()`. After that, part 1 and part 2 are basically solved in the same way:
github.com/marcodelmast...