AOJ 8.童年生活二三事

最新推荐文章于 2024-09-16 01:56:04 发布

weixin_30644369

最新推荐文章于 2024-09-16 01:56:04 发布

阅读量70

点赞数

文章标签：数据结构与算法

原文链接：http://www.cnblogs.com/ohyee/p/5251588.html

版权

动态规划+打表

 1 #include <cstdio>
 2 #include <algorithm>
 3 #include <cstring>
 4 #include <cmath>
 5 using namespace std;
 6 
 7 #define REP(n) for(int o=0;o<n;o++)
 8 
 9 const int maxn = 41;
10 int ans[maxn]={1,1,2,3,5,8,13,21,34,55,89,144,233,377,610,
11 987,1597,2584,4181,6765,10946,17711,28657,46368,75025,121393,
12 196418,317811,514229,832040,1346269,2178309,3524578,5702887,
13 9227465,14930352,24157817,39088169,63245986,102334155,165580141};
14 
15 int main() {
16 
17     //ans[0] = 1;
18     //ans[1] = 1;
19     //for(int i = 2;i < maxn;i++) {
20     //    ans[i] = ans[i - 1] + ans[i - 2];
21     //}
22 
23     //printf("ans[]={");
24     //REP(maxn)
25     //    printf("%d,",ans[o]);
26     //printf("};\n");
27 
28     int n;
29     while(scanf("%d",&n),n != 0) {
30         printf("%d\n",ans[n]);
31     }
32 
33     return 0;
34 }