Problem C
Colossal Candy Counts
Colin wants to buy some candy. In fact, he wants to buy a colossal amount of candy, but that doesn’t necessarily mean what you think it does. Colin is obsessed with number theory and has invented a type of number called a colossal number.
An integer
Given the minimum and maximum amounts of candy Colin is willing to buy, he needs your help figuring out how many different choices he has if he wants to buy a colossal amount.
Input
The input consists of two space-separated integers,
Output
Output a single line containing the number of colossal
integers
Sample Input 1 | Sample Output 1 |
---|---|
15 5000 |
4 |
Sample Input 2 | Sample Output 2 |
---|---|
512 512 |
1 |