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 #156: Counting Digits
Project Euler #156: Counting Digits
Sort by
recency
|
7 Discussions
|
Please Login in order to post a comment
bayleef needs to spend time trying to get his explainations better
f(n,1) could any one explain this
Can anyone tell what the excatly function f(n,d) is ?
Let s(d) be the sum of all the solutions for which f(n,d) = n.
Does this mean that s(d) is the total number of solutions, or it is the summation of the number n for which the statement is true? The example in the instructions doesn't help clarify this...
I am not able to get problem exactely. Can any one Around Here Who tell about problem statement clear to me just explain the problem not the solution.