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.
Project Euler #254: Sums of Digit Factorials
Project Euler #254: Sums of Digit Factorials
Sort by
recency
|
200 Discussions
|
Please Login in order to post a comment
This is really a hard problem. There is a way to calculate sums in O(logn), but that requires carefull analysis. There is also a challenge in modulo arithmetic because we must avoid divisions as there are often no inverses. (there is no guarantee that gcd(m, denominator) = 1).
IN JAVA BY: TANUSHREE SARKAR
this is far more a problem of math than it is of alg dude must have a masters degree in math to solve this