hdoj5620KK's Steel

KK's Steel

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 20    Accepted Submission(s): 13

Problem Description

Our lovely KK has a difficult mathematical problem:he has a N(1≤N≤1018) meters steel,he will cut it into steels as many as possible,and he doesn't want any two of them be the same length or any three of them can form a triangle.

 

Input

The first line of the input file contains an integer T(1≤T≤10), which indicates the number of test cases.

Each test case contains one line including a integer N(1≤N≤1018),indicating the length of the steel.

 

Output

For each test case, output one line, an integer represent the maxiumum number of steels he can cut it into.

 

Sample Input

16

 

Sample Output

3
Hint
1+2+3=6 but 1+2=3  They are all different and cannot make a triangle.
 

 

#include<cstdio>#include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<list>#include<queue>#include<vector>using namespace std;const int maxn=10010;long long num[maxn];void init(){    num[1]=1;num[2]=1;num[3]=2;    for(int i=4;i<100;++i){        num[i]=num[i-1]+num[i-2];    }}int main(){    init();    int t,i,j,k;    long long n;    scanf("%d",&t);    while(t--){        scanf("%I64d",&n);        long long ans=0;        for(i=2;;++i){            ans+=num[i];            if(ans>=n)break;        }        if(ans==n){            printf("%d\n",i-1);        }        else {            printf("%d\n",i-2);        }    }    return 0;}