A Math Problem ——2017ACM/ICPC广西邀请赛

You are given a positive integer n, please count how many positive integers k satisfy kk≤nkk≤n.
Input
There are no more than 50 test cases.

Each case only contains a positivse integer n in a line.

1≤n≤10181≤n≤1018
Output
For each test case, output an integer indicates the number of positive integers k satisfy kk≤nkk≤n in a line.
Sample Input
1
4
Sample Output
1
2
输出k的k次方小于n的个数。

#include<stdio.h>

typedef long long ll;
ll cf(ll a)
{
    ll x=1;
    ll t=a;
    ll b=a;
    while(t)
    {
        if(t%2==1)
        x*=b;
        b*=b;
        t/=2; 
    }
    return x;
}
int main()
{
    ll n,i,k;
    while(scanf("%lld",&n)!=EOF)
    {

        for(i=15;i>=0;i--)
        {
            if(cf(i)<=n)
            {
                printf("%lld\n",i);
                break;
            }
        }

    }
    return 0;
}