5012021-11-03 18:38:18SzankaBenedekToronyépítés (1,1,3,3)cpp11Wrong answer 20/507ms1972 KiB
#include <iostream>
#include <vector>

using namespace std;

int fast_mod(const int input, const int ceil) {
    return input >= ceil ? input % ceil : input;
}

int main()
{
    cin.sync_with_stdio(false);
    cin.tie(nullptr);

    int N;
    cin >> N;

    int a = 2;
    int b = 4;
    int c = 10;
    for (int n = 3; n < N; n += 3)
    {
        a = 2 * (c + a);
        a = fast_mod(a , 20210108);
        b = 2 * (a + b);
        b = fast_mod(b , 20210108);
        c = 2 * (b + c);
        c = fast_mod(c , 20210108);

        // a = 2 * (c + a) % 20210108;
        // b = 2 * (a + b) % 20210108;
        // c = 2 * (b + c) % 20210108;
    }

    switch (fast_mod(N,3))
    {
    case 1:
        cout << a;
        break;
    case 2:
        cout << b;
        break;
    case 3:
        cout << c;
        break;
    }
}

// int t[3];
// a = 2;
// b = 4;
// c = 10;
// for (; i > 3; i -= 3)
// {
//     a = (2 * c + 2 * a) % 20210108;
//     b = (2 * a + 2 * b) % 20210108;
//     c = (2 * b + 2 * c) % 20210108;
// }
// cout << t[i - 1] << "\n";

// 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;
// }
// cout << v[input - 1] << "\n";
SubtaskSumTestVerdictTimeMemory
base20/50
1Accepted0/02ms1880 KiB
2Accepted0/01ms1904 KiB
3Accepted3/31ms1968 KiB
4Accepted3/31ms1968 KiB
5Wrong answer0/41ms1968 KiB
6Accepted4/41ms1964 KiB
7Wrong answer0/47ms1964 KiB
8Wrong answer0/42ms1968 KiB
9Accepted4/41ms1964 KiB
10Accepted4/41ms1972 KiB
11Wrong answer0/42ms1972 KiB
12Wrong answer0/47ms1972 KiB
13Wrong answer0/46ms1972 KiB
14Wrong answer0/43ms1968 KiB
15Wrong answer0/21ms1968 KiB
16Accepted2/21ms1968 KiB