Question

This problem is as simple as short. Just find how many numbers from A to B with sum of digits from X to Y are divisible by K.

Input
The first line contains 5 space-separated positive integers: A, B, X, Y, K

Output
Output one number - answer for the question.

Constraints

0 < A, B, K ≤ 1013
0 < X, Y ≤ 1000
A ≤ B
0 < A, B, ≤ 107 in 32 % of the test data
Sample Input(Plaintext Link)
5 86 1 6 4
Sample Output(Plaintext Link)
6

Answer 1

@hartnn @hba @dan815 @asnaseer @KaylaIsBae @xavierbo2 @zepdrix @SkyeWutRUdoin @Goku-Kai @DullJackel09

Answer 2

Explanation
There are 6 such numbers: 12, 20, 24, 32, 40, 60

Answer 3

@Lyrae

Answer 4

In what language? C / C++/ Python?????

Answer 5

C/C++ @Nixy

Answer 6

People aren't here to supply answers for homework-ish questions. More so for teaching; if you put forth an effort to solve the problem, and you get stuck somewhere - that's when you should come ask for help.

Answer 7

@Woodrow73 I 'd suggest if you can't help out anyone better you don't post such ill-bred comments .
without knowing that if it's my home work or not,no one have right to give such discourteous suggestions!
THANKS!

Answer 8

Sorry; since it wasn't anything positive to add, I shouldn't have commented.

Though, I will say - from the perspective of someone in the position to help - in order to further your understanding, you should try the problem first and report of what obstacles you ran into. Then, we can help remove those obstacles until you have an understanding of how to solve the problem yourself.

Answer 9

Maybe I got tired of saying 'what did you get so far' in a number of posts - but now I realize, that I don't have time to walk people through understanding a problem if they don't first attempt it.

Though those same questions get people who just post the answer, or people who can take the time to make sure one understands a problem.. that's fine too.