Y
Hacker News
new
|
ask
|
show
|
jobs
by
contravariant
1951 days ago
With a better chosen dp approach you can even solve it in O(log(n)). Though at that point the extra cost of multiplying large integers becomes non-negligible.
1 comments
maxmaio
1945 days ago
I'm having trouble coming up with this approach on my own. could you share it please?
link