We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
Damn, that was tough. I'm curious if there is a way to do it without big integers... My guess is not
I found dealing with a different moduli for each query a little annoying and needlessly burdensome. But besides that, great job problem setters for pushing the problem so far!
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
Damn, that was tough. I'm curious if there is a way to do it without big integers... My guess is not
I found dealing with a different moduli for each query a little annoying and needlessly burdensome. But besides that, great job problem setters for pushing the problem so far!