You are viewing a single comment's thread. Return to all comments →
nice problem. found a method to compute F(m,n) in O((n/m)^2) time which causes it to run instantly
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #115: Counting block combinations II
You are viewing a single comment's thread. Return to all comments →
nice problem. found a method to compute F(m,n) in O((n/m)^2) time which causes it to run instantly