2017ACM/ICPC广西邀请赛-重现赛 hdu 6182

 

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

给你一个n，问你有多少个k，使得k的k次方小于等于n  注意用longlong

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1e5+10;ll n,ans;
ll fpow(ll a,ll b){ll res=1;while(b){if(b&1)res*=a;a*=a;b>>=1;}return res;}
int main()
{
	while(cin>>n)
	{
		ans=0;
		for(ll i=1;i<15;i++)if(1LL*fpow(i,i)<=n)ans++;cout<<ans<<endl;
	}
	return 0;
}