标签:
Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 4512 Accepted Submission(s):
2068
题解:
这题要利用到数列的公式:an=(1/√5) * [((1+√5)/2)^n-((1-√5)/2)^n](n=1,2,3.....)
#include<stdio.h> #include<math.h> int main() { int n,i; int f[21]={0,1,1}; double a=(1.0+sqrt(5.0))/2.0; for(i=3;i<=20;i++)//产生前20项 f[i]=f[i-1]+f[i-2]; while(scanf("%d",&n)!=EOF) { if(n<=20) printf("%d\n",f[n]); else { double ans=-0.5*log10(5.0)+n*log10(a); int answer; ans =ans-floor(ans);//取小数部分 ans=pow(10,ans);//取一次幂 answer=(int)(ans*1000);//类型转换 printf("%d\n",answer); } } return 0; }
标签:
原文地址:http://www.cnblogs.com/Ritchie/p/5425342.html