Submission #23,015

2026-01-16 10:43:14

cpp17

Accepted 50/50

18ms

8244 KiB

#include <bits/stdc++.h>

using namespace std;

int main()
{
    const long long MOD =20210108;
    long long N;
    cin >> N;
    vector<long long> Tornyokszama(N + 1, 0);
    Tornyokszama[0] = 1;
    for (int mag=1; mag <= N; mag++)
    {
        if (mag - 1 >= 0)
        {
            Tornyokszama[mag] = (Tornyokszama[mag] + 2LL * Tornyokszama[mag - 1])%MOD;
        }

        if (mag - 3 >= 0)
        {
            Tornyokszama[mag] = (Tornyokszama[mag] + 2LL * Tornyokszama[mag - 3])%MOD;
        }
    }
    cout << Tornyokszama[N] << '\n';
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	50/50
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	3/3	1ms	316 KiB
		4	Accepted	3/3	1ms	316 KiB
		5	Accepted	4/4	1ms	552 KiB
		6	Accepted	4/4	1ms	316 KiB
		7	Accepted	4/4	18ms	8244 KiB
		8	Accepted	4/4	3ms	1332 KiB
		9	Accepted	4/4	1ms	316 KiB
		10	Accepted	4/4	1ms	508 KiB
		11	Accepted	4/4	4ms	1844 KiB
		12	Accepted	4/4	18ms	8140 KiB
		13	Accepted	4/4	17ms	7268 KiB
		14	Accepted	4/4	8ms	3044 KiB
		15	Accepted	2/2	1ms	316 KiB
		16	Accepted	2/2	1ms	316 KiB