Submission #2,226

2023-01-03 16:03:14

cpp11

Accepted 40/40

3ms

3708 KiB

#include <iostream>

using namespace std;

int n;

int main()
{
    cin >> n;

    int valaszok[100];
    valaszok[0] = 1;
    valaszok[1] = 2;
    valaszok[2] = 5;
    valaszok[3] = 11;

    int i = 4;
    do {
        valaszok[i] = (((valaszok[i-1] * 2) % 20200111 + valaszok[i-2]) % 20200111 - valaszok[i-4]) % 20200111;
        valaszok[i] = valaszok[i] < 0 ? valaszok[i] + 20200111 : valaszok[i];
    } while (++i < n);

    cout << valaszok[n-1] << "\n";
    return 0;
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	3ms	1872 KiB
		2	Accepted	0/0	2ms	2124 KiB
		3	Accepted	1/1	2ms	2168 KiB
		4	Accepted	1/1	2ms	2372 KiB
		5	Accepted	2/2	2ms	2576 KiB
		6	Accepted	2/2	2ms	2688 KiB
		7	Accepted	3/3	2ms	2776 KiB
		8	Accepted	3/3	2ms	2896 KiB
		9	Accepted	3/3	2ms	3140 KiB
		10	Accepted	3/3	2ms	3212 KiB
		11	Accepted	3/3	2ms	3212 KiB
		12	Accepted	3/3	2ms	3344 KiB
		13	Accepted	3/3	2ms	3304 KiB
		14	Accepted	3/3	2ms	3304 KiB
		15	Accepted	3/3	2ms	3432 KiB
		16	Accepted	3/3	2ms	3640 KiB
		17	Accepted	4/4	2ms	3708 KiB