You are viewing a single comment's thread. Return to all comments →
Case 1 in .2 sec, case 2 in .23 sec, but my method has no chance for N = 10^18.
I generate and save a list of solutions for i = 1, ..., 1000000 mod 1e9+7. Not happening with N = 10^18.
Do I need a different method or am I missing something?
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #138: Special isosceles triangles
You are viewing a single comment's thread. Return to all comments →
Case 1 in .2 sec, case 2 in .23 sec, but my method has no chance for N = 10^18.
I generate and save a list of solutions for i = 1, ..., 1000000 mod 1e9+7. Not happening with N = 10^18.
Do I need a different method or am I missing something?