You are viewing a single comment's thread. Return to all comments →
like g(41) is 2355679, my code has to run 2355679 loops to find g41, it will eventually find it, but code runs out of time, how to deal with it.
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
like g(41) is 2355679, my code has to run 2355679 loops to find g41, it will eventually find it, but code runs out of time, how to deal with it.