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.
Actually, g(1) should be 0, since 0!=1, and 0 is an integer.....
However this problem considers g(1) as 1.... which is indeed, not the smallest integer which you can sum it's factorials to get 1.... 0 is.
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 →
Actually, g(1) should be 0, since 0!=1, and 0 is an integer..... However this problem considers g(1) as 1.... which is indeed, not the smallest integer which you can sum it's factorials to get 1.... 0 is.