|
||||||||||
A Math ProblemTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11325 Accepted Submission(s): 3403 Problem Description You are given a positive integer n, please count how many positive integers k satisfy $k^k \leq n$. Input There are no more than 50 test cases. Each case only contains a positivse integer n in a line. $1 \leq n \leq 10^{18}$ Output For each test case, output an integer indicates the number of positive integers k satisfy $k^k \leq n$ in a line. Sample Input
Sample Output
Source | ||||||||||
|