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.
Baby steps :)
This one is really tough. I have been dealing with this problem for almost a week and still I have not figured it out. After doing some research on DP, math induction, I was able to pass test #1 (brute force only allows you to pass test #0). Now my algorithm can calculate in fractions of secs up to g(74). I am suspecting that test #2+ are numbers where g(100)+. Any idea on how to predict?
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
An unexpected error occurred. Please try reloading the page. If problem persists, please contact support@hackerrank.com
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
Baby steps :) This one is really tough. I have been dealing with this problem for almost a week and still I have not figured it out. After doing some research on DP, math induction, I was able to pass test #1 (brute force only allows you to pass test #0). Now my algorithm can calculate in fractions of secs up to g(74). I am suspecting that test #2+ are numbers where g(100)+. Any idea on how to predict?