You are viewing a single comment's thread. Return to all comments →
but we need value of g(i) where i can be 100 also
Agree, this problem requires a lot more thinking then being able to compute the firsts few G(i) values. Answering 100000 queries which ask the sum all digits of G(i) values between 1 and 10^18 mod m does indeed involve dicovering related concepts.
mod
Seems like cookies are disabled on this browser, please enable them to open this website
I agree to HackerRank's Terms of Service and Privacy Policy.
Project Euler #254: Sums of Digit Factorials
You are viewing a single comment's thread. Return to all comments →
but we need value of g(i) where i can be 100 also
Agree, this problem requires a lot more thinking then being able to compute the firsts few G(i) values.
Answering 100000 queries which ask the sum all digits of G(i) values between 1 and 10^18
mod
m does indeed involve dicovering related concepts.