题目1387：斐波那契数列

纯斐波那契数列，没longlong挂了一次。先预处理是为了节省时间，最简单的dp

#include<cstdio>#include<cstring>int main(){long long f[99];f[0]=0;f[1]=1;for(int i=2;i<=70;++i){f[i]=f[i-1]+f[i-2];}int n;while(scanf("%d",&n) != EOF){printf("%lld\n",f[n]);}return 0;}