Fibnacci 数列: F(N)=F(N-1)+F(N-2);这个不解释! #include<stdio.h> int main() { int n,i; __int64 a[55]; a[1]=1;a[2]=2; for(i=3;i<=51;i++) a[i]=a[i-1]+a[i-2]; while(scanf("%d",&n)!=EOF) printf("%I64d\n",a[n]); return 0; }