Problem M
Yet Another Divisor Problem

There have been many problems involving divisors. This is yet another one.
Input
The input consists of a single line containing two space-separated positive integers, $a$ and $b$, satisfying $a\leq b\leq 10^8$.
Output
Output a single integer: the number of odd integers $n$ such that $a\leq n\leq b$ and the number of divisors of the number of divisors of $n^ n$ is a divisor of $n$. For the purposes of this problem, a divisor is a positive integer.
Sample Input 1 | Sample Output 1 |
---|---|
1 10 |
2 |
Sample Input 2 | Sample Output 2 |
---|---|
5 10 |
0 |