euler/048.bruijn

Problem description

# TODO: also very slow

:import std/Combinator .
:import std/Math .

solve [∑ (+1) → 0 | [pow-mod 0 0 (+10000000000)]]

:test ((solve (+10)) =? (+405071317)) ([[1]])

main [solve (+1000)]