#include<cstdio>
#include<algorithm>
#include<iostream>
using namespace std;
const int maxn = 100000;
int dfs(int num);
int map[maxn]={0};
int main()
{
int num;
while(~scanf("%d",&num))
{
printf("%d\n",dfs(num));
}
return 0;
}
int dfs(int num)
{
if(map[num]>0){
return map[num];
}else if(num==1 || num==2){
return 1;
}
return map[num]=dfs(num-1)+dfs(num-2);
}
Last modification:September 19th, 2019 at 12:27 am
© 允许规范转载