#include <iostream> #include <cstdio> using namespace std; const int maxn = 52; long long dp[maxn]; void prepare(){ dp[1] = 1; dp[2] = 2; int i; for(i = 3 ; i < maxn ; ++i){ dp[i] = dp[i-1] + dp[i-2]; } } int main(){ prepare(); int n; while(scanf("%d",&n)!=EOF){ printf("%lld\n",dp[n]); } return 0; }
S - 骨牌铺方格
猜你喜欢
转载自www.cnblogs.com/fhzy291146030/p/9288428.html
今日推荐
周排行