241272026-02-04 16:14:07KristófToronyépítés (1,1,3,3)cpp17Accepted 50/5048ms8160 KiB
#include <iostream>
#include <vector>

using namespace std;

int MOD=20210108;

int main()
{
    int n;
    cin>>n;
    vector<long long> dp (n+1,0);
    dp[0]=1;
    dp[1]=2;
    dp[2]=4;

    for(int i=3;i<=n;i++)
        {
        dp[i]=(dp[i]+dp[i-1]*2)%MOD;
        if(i>=3)
            {
            dp[i]=(dp[i]+dp[i-3]*2)%MOD;
            }
        }
    cout<<dp[n];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms508 KiB
6Accepted4/41ms316 KiB
7Accepted4/446ms8160 KiB
8Accepted4/47ms1264 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms500 KiB
11Accepted4/410ms1992 KiB
12Accepted4/448ms8140 KiB
13Accepted4/441ms7220 KiB
14Accepted4/417ms2868 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB