Spoj-FACVSPOW Factorial vs Power

Consider two integer sequences f(n) = n! and g(n) = aⁿ, where n is a positive integer. For any integer a > 1 the second sequence is greater than the first for a finite number of values. But starting from some integer k, f(n) is greater than g(n) for all n >= k. You are to find the least positive value of n for which f(n) > g(n), for a given positive integer a > 1.

Input

The first line of the input contains number t – the amount of tests. Then t test descriptions follow. Each test consist of a single number a.

Constraints

1 <= t <= 100000
2 <= a <= 10⁶

Output

For each test print the least positive value of n for which f(n) > g(n).

Example

Input:
3
2
3
4

Output:
4
7
9

有很多组询问，给个常数1<=a<=100w，求使得n! > a^n 的最小整数n

构造f(n)=n!,g(n)=a^n,a是常数，由高中知识就很容易知道f(n)趋近极限的速度最后会更快

不妨令h(n)=f(n)-g(n)，则h(n)应当是递增的（吧？）

只要求h(n)=(n!-a^n) > 0的最小n

因此可知当a增加的时候，h(n)的零点应当也是增加的

所以可以枚举个a的值，不断增加n的值，只要n!>a^n，即log(n!)>nloga

即log1+log2+...+logn>nloga

左边的部分可以在枚举a的时候顺便求得

 #include<cstdio>
 #include<iostream>
 #include<cstring>
 #include<cstdlib>
 #include<algorithm>
 #include<cmath>
 #include<queue>
 #include<deque>
 #include<set>
 #include<map>
 #include<ctime>
 #define LL long long
 #define inf 0x7ffffff
 #define pa pair<int,int>
 #define mkp(a,b) make_pair(a,b)
 #define pi 3.1415926535897932384626433832795028841971
 using namespace std;
 inline LL read()
 {
     LL x=,f=;char ch=getchar();
     while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}
     return x*f;
 }
 int n;
 int ans[];
 int main()
 {
     double s=;int t=;
     for (int i=;i<=;i++)
     {
         while (s<=t*log(i)){t++;s+=log(t);}
         ans[i]=t;
     }
     int T=read();
     while (T--){printf("%d\n",ans[read()]);}
 }

Spoj FACVSPOW