HDU - 超级楼梯

Posted 2020-11-25 shallow-dream

http://acm.hdu.edu.cn/showproblem.php?pid=2041

 

#include <stdio.h>
#include <cstring>
#include <algorithm>
#include <vector>
#include <map>
#include <assert.h>
#include <set>
#include <cmath>
#include <queue>
#include <cstdlib>
#include <iostream>
#include <bitset>
#define pii pair<int,int>
#define fi first
#define se second
#define pb push_back
using namespace std;
typedef long long ll;
const int mxn = 1e2+5;
ll n,m,k,t,dp[mxn],a[mxn];
int main()
{
    for(int i=1;i<55;i++)
        dp[i] = i<=3 ? i : dp[i-1]+dp[i-2] ;
    cin>>t;
    while(t--)
    {
        cin>>n;
        cout<<dp[n-1]<<endl;
    }
    return 0 ;
}