A Math Problem

//这儿直接用pow函数会出错WA，不明白
#include<iostream>
#include<stdio.h>
#include<string.h>
#include<math.h>
typedef long long LL;


int main()
{
    long long n;
    while(scanf("%lld", &n) != EOF)
    {
       long long i, k;
       for(i=15; i>=1; i--)
       {
           if(pow(i, i) <= n)
           {
               k = i;
               break;
           }
       }
       printf("%lld\n", k);
    }
    return 0;
}

You are given a positive integer n, please count how many positive integers k satisfy  kk≤nkk≤n. 

InputThere are no more than 50 test cases. 

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

1≤n≤10181≤n≤1018 
OutputFor 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

#include<iostream>
#include<stdio.h>
#include<math.h>
typedef long long LL;

/*LL pow(LL a, int b)
{
    LL ans=1, base=a;
    while (b > 0)
    {
        if (b & 1)
            ans *= base;
        base = base*base;
        b >>= 1;
    }
    return ans;
}
*/
LL a[17] = {0, 1, 4, 27, 256, 3125, 46656, 823543, 16777216, 387420489, 10000000000, 285311670611, 8916100448256, 302875106592253, 11112006825558016, 437893890380859375};
int main()
{
    long long n;

/*    for(int i=1; i<=15; i++)

        printf("%lld\n", (long long)pow(i, i));//这儿必须强制类型转换，目前还不明白
*/

   while(scanf("%lld", &n) != EOF)
    {

       int i, k;

       for(i=15; i>=1; i--)
            {
             if(a[i] <= n)
                {
                    k = i;
                    break;
                }
           }
            printf("%d\n", k);


/*       for(i=15; i>=1; i--)
       {
          if(pow(i, i) <= n)
           {
               k = i;
               break;
           }
      }
       printf("%lld\n", k);
*/    }
    return 0;
}