|
||||||||||
Maximum Number Of DivisorsTime Limit: 20000/10000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 510 Accepted Submission(s): 153 Problem Description You are given an integer P, please find an integer K that has the maximum number of divisors under the condition that K <= P. Note that if multiple integers have the same number of divisors, please choose the smallest one. Input The input consists of multiple test cases. For each case, the input contains a single line with one integer P(1 <= P <= 1080) Output For each test case, output K and the number of K's divisors. The number of K's divisors is guaranteed to be smaller than 262. Sample Input
Sample Output
Source | ||||||||||
|