137122025-01-08 13:30:34kukkermanToronyépítés (1,1,3,3)cpp17Accepted 50/507ms508 KiB
#include <iostream>

int main() {
    int n;
    std::cin >> n;
    if (n <= 2) {
        std::cout << (1 << n) << '\n';
        return 0;
    }

    int sor[4] { 1, 2, 4 };
    int e = 0, v = 2;

    --n;
    while (--n) {
        const auto kov = (v + 1) & 3;
        sor[kov] = ((sor[v] + sor[e]) << 1) % 20210108;
        v = kov;
        e = (e + 1) & 3;
    }

    std::cout << sor[v] << '\n';
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms508 KiB
6Accepted4/41ms316 KiB
7Accepted4/47ms396 KiB
8Accepted4/42ms316 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/42ms316 KiB
12Accepted4/47ms508 KiB
13Accepted4/46ms396 KiB
14Accepted4/43ms316 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB