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.
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).
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
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).