A positive number y is called magic number if for every positive integerx it satisfies that puty to the right ofx, which will form a new integerz,
z mod y = 0.
Input
The input has multiple cases, each case contains two positve integers m,n(1 <=m <=n <= 2^31-1), proceed to the end of file.
Output
For each case, output the total number of magic numbers between m andn(m,n inclusively).
Sample Input
1 1
1 10
Sample Output
1
4
解出题目:求满足这样的条件:给出两个数m,n,m<=y<=n......
阅读全文