4272021-11-03 09:06:41SzankaBenedekToronyépítés (1,1,3,3)cpp11Accepted 50/5012ms9504 KiB
#include <iostream>
#include <vector>

using namespace std;

int f(int input)
{
    vector<int> v(input);
    v[0] = 2;
    v[1] = 4;
    v[2] = 10; //8+2
    for (int n = 3; n < input; n++)
    {
        v[n] = (2 * v[n - 1] + 2 * v[n - 3]) % 20210108;
    }
    return v[input-1];

    // vector<int> v;
    // v.push_back(2);
    // v.push_back(4);
    // v.push_back(10);
    // for (int n = 3; n < input; n++)
    // {
    //     v.push_back((2 * v[n - 1] + 2 * v[n - 3]) % 20210108);
    // }
    // return v[input - 1];
}

int main()
{
    int a;
    cin >> a;
    cout << f(a) << "\n";
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/02ms1808 KiB
2Accepted0/01ms1840 KiB
3Accepted3/31ms1892 KiB
4Accepted3/31ms1892 KiB
5Accepted4/41ms1892 KiB
6Accepted4/41ms1892 KiB
7Accepted4/410ms9504 KiB
8Accepted4/42ms2616 KiB
9Accepted4/41ms1888 KiB
10Accepted4/41ms1884 KiB
11Accepted4/43ms3260 KiB
12Accepted4/412ms9500 KiB
13Accepted4/49ms8460 KiB
14Accepted4/44ms4304 KiB
15Accepted2/21ms1888 KiB
16Accepted2/21ms1888 KiB