Submission #621

2021-11-04 20:47:08

cpp14

Wrong answer 38/50

12ms

9568 KiB

#include <iostream>
#include <vector>

using namespace std;

#define MOD 20210108

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

    vector<int> dp(n + 1);

    dp[0] = 1;

    for (int i = 1; i <= n; i++) {
        dp[i] = (dp[i - 1] * 2) % MOD;

        if (i >= 3) {
            dp[i] += (dp[i - 3] * 2) % MOD;
        }
    }

    cout << dp[n] << endl;
}

	Sum	Test	Verdict		Time	Memory
base	38/50
		1	Accepted	0/0	2ms	1752 KiB
		2	Accepted	0/0	1ms	1852 KiB
		3	Accepted	3/3	1ms	1844 KiB
		4	Accepted	3/3	1ms	1840 KiB
		5	Wrong answer	0/4	1ms	1852 KiB
		6	Accepted	4/4	1ms	1856 KiB
		7	Accepted	4/4	12ms	9568 KiB
		8	Wrong answer	0/4	2ms	2596 KiB
		9	Accepted	4/4	1ms	1860 KiB
		10	Accepted	4/4	1ms	1868 KiB
		11	Accepted	4/4	3ms	3248 KiB
		12	Accepted	4/4	12ms	9540 KiB
		13	Accepted	4/4	10ms	8580 KiB
		14	Wrong answer	0/4	4ms	4356 KiB
		15	Accepted	2/2	1ms	1892 KiB
		16	Accepted	2/2	1ms	1908 KiB