233092026-01-18 20:02:30abcdToronyépítés (2,2,3,3)cpp17Accepted 40/403ms1160 KiB
#include <bits/stdc++.h>
using namespace std;

const int m=20210108;

int main(){
    int n;cin>>n;
    vector<int> dp(n+1);
    dp[0]=1;
    for(int i=2;i<=n;i++){
        if(i==2)dp[2]=2;
        else dp[i]=1LL*(1LL*dp[i-2]*2%m+1LL*dp[i-3]*2%m)%m;
    }
    cout<<dp[n]<<'\n';
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms324 KiB
4Accepted2/21ms316 KiB
5Accepted3/31ms316 KiB
6Accepted3/31ms316 KiB
7Accepted3/33ms1076 KiB
8Accepted3/32ms820 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/33ms1092 KiB
12Accepted3/33ms1160 KiB
13Accepted4/43ms1076 KiB
14Accepted4/42ms820 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB