Submission #7,506

2024-01-09 11:44:26

cpp17

Accepted 50/50

14ms

18772 KiB

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll MOD = 20210108;

int main()
{
    int n;
    cin >> n;

    vector<ll> dp(n + 1, 1);

    for(int i = 1; i <= n; i++){
        dp[i] = (2 * (i > 0 ? dp[i - 1] : 0) + 2 * (i > 2 ? dp[i - 3] : 0)) % MOD;
    }

    cout << dp[n] << "\n";
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	3ms	1808 KiB
		2	Accepted	0/0	3ms	2076 KiB
		3	Accepted	3/3	3ms	2224 KiB
		4	Accepted	3/3	3ms	2460 KiB
		5	Accepted	4/4	3ms	2580 KiB
		6	Accepted	4/4	3ms	2532 KiB
		7	Accepted	4/4	14ms	18296 KiB
		8	Accepted	4/4	4ms	4988 KiB
		9	Accepted	4/4	3ms	3080 KiB
		10	Accepted	4/4	3ms	3212 KiB
		11	Accepted	4/4	4ms	6240 KiB
		12	Accepted	4/4	14ms	18772 KiB
		13	Accepted	4/4	14ms	17152 KiB
		14	Accepted	4/4	7ms	8816 KiB
		15	Accepted	2/2	3ms	3944 KiB
		16	Accepted	2/2	3ms	3936 KiB