|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|2 초||512 MB||88||66||53||79.104%|
Count the divisors of every value in the range [L, U] (both L and U included) and return the biggest divisor count you can find.
The first line will contain an integer C with the number of ranges to process. The next C lines will contain a pair of integers L, U.
You have to count the divisors for each number in the range and output the biggest count.
For each range a line containing the biggest divisor count found.
5 1 10 1000 1000 9999900 10000000 35 999 25 25
4 16 256 32 3