约数 Divisors
题意翻译
给定 $n$ 个数值区间 $[l,r]$，求出每个区间内约数个数最大的数，并按照以下格式输出：
```plain
Between [l] and [r], [maxn_num] has a maximum of [maxn_divisor] divisors.
```
样例输入：
```plain
3
1 10
1000 1000
999999900 1000000000
```
样例输出：
```plain
Between 1 and 10, 6 has a maximum of 4 divisors.
Between 1000 and 1000, 1000 has a maximum of 16 divisors.
Between 999999900 and 1000000000, 999999924 has a maximum of 192 divisors.
```
对于 $100\%$ 的数据：
$1 \leq l_i<r_i \leq 10^{10}$，$1 \leq r-l \leq 10^{4}$
题目描述
[problemUrl]: https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=4&page=show_problem&problem=230
[PDF](https://uva.onlinejudge.org/external/2/p294.pdf)
输入输出格式
输入格式
输出格式
输入输出样例
输入样例 #1
3
1 10
1000 1000
999999900 1000000000输出样例 #1
Between 1 and 10, 6 has a maximum of 4 divisors.
Between 1000 and 1000, 1000 has a maximum of 16 divisors.
Between 999999900 and 1000000000, 999999924 has a maximum of 192 divisors.