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.
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...
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #156: Counting Digits
You are viewing a single comment's thread. Return to all comments →
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...