[hdu2018]母牛的故事
斐波纳切数列·二改

1 #include <iostream> 2 #include <algorithm> 3 #include <cstdio> 4 #include <cstring> 5 #include <cstdlib> 6 #include <queue> 7 #include <string> 8 #include <vector> 9 using namespace std; 10 11 int f[100],n; 12 13 int main(){ 14 f[1]=1; 15 f[2]=2; 16 f[3]=3; 17 f[4]=4; 18 for(int i=5;i<100;i++)f[i]=f[i-1]+f[i-3]; 19 while(scanf("%d",&n)==1&&n){ 20 printf("%d\n",f[n]); 21 } 22 }