Help needed in one of the Hackerearth Problem!

[https://www.hackerearth.com/practice/algorithms/searching/binary-search/practice-problems/algorithm/the-furious-five-69521576/editorial/]

I am not getting How to solve this problem and even after watching out the editorials, the solution went out of my head please help.

This is just binary search.
We can compute \sum_{x=1}^k f(x) in O(\log k). Let’s replace 5 with 10. The number of times we can divide by 10 is just the number 0s at the end. So for any number x, let us count the sum of number of 0s, for numbers less than x.
x/10 numbers will have the units digit as 0
x/100 numbers will have units and tens digit as 0.
x/1000 number will have hundreds digit 0 as well.

So this is just counting the number of times the units digit, tens digit, and hundreds digit will be counted.

So answer is

x/10 + x/100 + x/1000 ....

Obviously, we are using floor division.

1 Like

Thank you so much bro, Got it