Submission #25,234

2026-02-18 17:30:57

cpp17

Accepted 40/40

1ms

512 KiB

// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;
#define int long long

const int MOD=20200111;

signed main() {
    int n;cin>>n;
    vector<array<int,3>> dp(n+1);
    dp[0][0]=1;
    for(int i = 1;i<=n;i++){
        dp[i][0]=(dp[i-1][0]+(i>1?dp[i-2][0]+dp[i-2][1]+dp[i-2][2]:0LL))%MOD;
        dp[i][1]=(dp[i-1][2]+dp[i-1][0]+(i>1?dp[i-2][2]:0))%MOD;
        dp[i][2]=(dp[i-1][1]+dp[i-1][0]+(i>1?dp[i-2][1]:0))%MOD;
    }                    
    cout<<dp[n][0];
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	1/1	1ms	316 KiB
		4	Accepted	1/1	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	320 KiB
		7	Accepted	3/3	1ms	392 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	316 KiB
		10	Accepted	3/3	1ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	3/3	1ms	508 KiB
		13	Accepted	3/3	1ms	316 KiB
		14	Accepted	3/3	1ms	512 KiB
		15	Accepted	3/3	1ms	316 KiB
		16	Accepted	3/3	1ms	316 KiB
		17	Accepted	4/4	1ms	316 KiB