Submission

Score: 30

User: tull

Problemset: Amazing tiling

Language: cpp

Time: 0.002 second

Submitted On: 2026-06-01 01:33:28

#include <bits/stdc++.h>
using namespace std;
signed main(){
    int n;
    cin>>n;
    int dp[50];
    memset(dp,0,sizeof(dp));
    dp[0]=1;
    for(int i=1;i<=n;++i){
        dp[i]+=dp[i-1];
        if(i>=2)
            dp[i]+=dp[i-2];
        if(i>=3)
            dp[i]+=dp[i-3]*2;
    }
    cout<<dp[n];
}