A Math Problem

A Math Problem

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 237    Accepted Submission(s): 117

Problem Description

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

 

Input

There are no more than 50 test cases.

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

1≤n≤1018

 

Output

For each test case, output an integer indicates the number of positive integers k satisfy kk≤n in a line.

 

Sample Input

1 4

 

Sample Output

1 2

 

直接打表从1打到15

#include <bits/stdc++.h>
#define ll long long int
using namespace std;
ll k[15]={1,4,27,256,3125,46656,823543,16777216,387420489,10000000000,
285311670611,8916100448256,302875106592253,11112006825558016,437893890380859375};
int main(){
  ll n;
  while(cin>>n){
    for(int i=14;i>=0;i--){
      if(n>=k[i]){
        cout<<i+1<<endl;
        break;
      }
    }
  }
  return 0;
}