Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 350 Accepted Submission(s): 166
#include<stdio.h> #include<string.h> #include<stdlib.h> #include<algorithm> #define MAX 100100 #define INF 0x3f3f3f #define LL long long using namespace std; LL fb[10010]; LL f[1001]; void biao() { LL i,j; fb[1]=1; fb[2]=2; for(i=3;i<120;i++) fb[i]=fb[i-1]+fb[i-2]; f[1]=fb[1]; for(i=2;i<120;i++) f[i]=f[i-1]+fb[i]; } int main() { int t,i,j; LL n; biao(); scanf("%d",&t); while(t--) { scanf("%lld",&n); for(i=1;i<120;i++) { if(n==f[i]) { printf("%d\n",i); break; } if(n<f[i]) { printf("%d\n",i-1); break; } } } return 0; }
BestCoder Round #71 (div.2) (hdu 5620 菲波那切数列变形)
原文:http://www.cnblogs.com/tonghao/p/5188883.html