StrangeStandard
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 363 Accepted Submission(s): 37
Problem Description
Nowadays, WHUACMer use a strange standard to evaluate a natural number.The evaluating value of a natural number is the amount of it’s divisors.If a number m has bigger evaluating value than all the numbers smaller than it, we call it a good number. Now give you a number n, find the maximum good number which is not bigger than n.
Input
The first line contains a single integer T(T<=10), indicating the number of test cases.
For each test case,there is only one line which only contains one number n(1 <= n <= 2 000 000 000)
For each test case,there is only one line which only contains one number n(1 <= n <= 2 000 000 000)
Output
For each test case,output the case number first,then output the maximum good number which is not bigger than n.
Sample Input
1 1000
Sample Output
Case #1: 840