207382026-01-08 18:27:57KoszorusBlankaToronyépítés (1,1,3,3)cpp17Accepted 50/5010ms4248 KiB
#include <iostream>
#include <vector>

using namespace std;

int main()
{
    int N;
    cin >> N;
    vector <int> Torony(N+1);

    Torony[0] = 1; Torony[1] = 2; Torony[2] = 4; Torony[3] = 10;
    for (int i = 4; i <=N; i++) { Torony[i] = (Torony[i-1]*2+Torony[i-3]*2)%20210108; }

    cout << Torony[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/410ms4248 KiB
8Accepted4/42ms820 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/43ms1076 KiB
12Accepted4/49ms4152 KiB
13Accepted4/48ms3740 KiB
14Accepted4/44ms1732 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB