画图可以发现这是一个斐波那契数列,所以可以直接使用打表的方法,依次将所有的结果都打出来,同时注意数字会非常大,所以自己实现了一个加法操作,具体实现见如下代码:
#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;
int n;
int F[10001][2500];
int main(){
memset(F, 0, sizeof(F));
F[3][1] = 4, F[3][0] = 1;
F[4][1] = 7, F[4][0] = 1;
for (int i = 5; i <= 10000; i++){
int in = 0;
int j;
for (j = 1; j <= F[i - 1][0]; j++){
F[i][j] = F[i - 1][j] + F[i - 2][j] + in;
in = F[i][j] / 10;
F[i][j] = F[i][j] % 10;
F[i][0]++;
}
if (in){
F[i][j] = in;
F[i][0]++;
}
}
while (cin >> n){
for (int j = F[n][0]; j >= 1; j--)
cout << F[n][j];
cout << endl;
}
return 0;
}