zoj 3622 Magic Number (构造?)

2015年10月19日 0 作者 CrazyKK
A – Magic Number

Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit Status


A positive number y is called magic number if for every positive integer x it satisfies that put y to the right of x, which will form a new integer zz mod y = 0.


The input has multiple cases, each case contains two positve integers mn(1 <= m <= n <= 2^31-1), proceed to the end of file.


For each case, output the total number of magic numbers between m and n(mn inclusively).

Sample Input

Sample Output

View Code