You are viewing a single comment's thread. Return to all comments →
Oh. Could somebody share a test case with huge M and N values, along with the corresponding solution?
Want to convince myself my algorithm is correct, albeit slow.
Thx
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #231: The prime factorisation of binomial coefficients
You are viewing a single comment's thread. Return to all comments →
Oh. Could somebody share a test case with huge M and N values, along with the corresponding solution?
Want to convince myself my algorithm is correct, albeit slow.
Thx