229612026-01-16 09:49:50AKrisztianToronyépítés (1,1,3,3)cpp17Accepted 50/5013ms8176 KiB
#include <iostream>

using namespace std;

int main()
{
    unsigned long long N;
    cin >> N;

    unsigned long long M[N+1];
    M[0]=1;
    M[1]=2;
    M[2]=4;

    for (unsigned long long i=3; i<=N; i++)
    {
        M[i]=(2*(M[i-1]+M[i-3]))%20210108;
    }

    cout << M[N];

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/413ms8176 KiB
8Accepted4/42ms1332 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/43ms1964 KiB
12Accepted4/413ms7940 KiB
13Accepted4/49ms7232 KiB
14Accepted4/44ms2868 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB