数列递推关系式
#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN = 91;
long long dp[MAXN];
int main(int argc, char** argv) {
dp[0] = 0;
dp[1] = 1;
for(int i = 2; i < MAXN; i++){
dp[i] = dp[i - 1] + dp[i - 2];
}
int n;
while(scanf("%d", &n) != EOF){
printf("%lld\n", dp[n]);
}
return 0;
}