229452026-01-16 09:24:14AKrisztianToronyépítés (1,1,3,3)cpp17Wrong answer 26/508ms8200 KiB
#include <iostream>

using namespace std;

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

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

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

    cout << M[N]%20210108;

    return 0;
}
SubtaskSumTestVerdictTimeMemory
base26/50
1Accepted0/01ms500 KiB
2Wrong answer0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Wrong answer0/47ms8200 KiB
8Wrong answer0/42ms1332 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms548 KiB
11Wrong answer0/42ms1844 KiB
12Wrong answer0/48ms7924 KiB
13Wrong answer0/46ms7192 KiB
14Wrong answer0/43ms2896 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB