145532025-01-15 17:11:46badamToronyépítés (1,1,3,3)cpp17Accepted 50/509ms4148 KiB
#include <iostream>

using namespace std;

int main()
{
int n;
cin >> n;
if(n==1)
{
    cout << 2;
}
if(n==2)
{
    cout << 4;
}
if(n==3)
{
    cout << 10;
}
if(n>3)
{
    int t[n];
    t[0]=2;
    t[1]=4;
    t[2]=10;
    for(int i=3;i<n;i++)
    {
        t[i]=(2*t[i-1]+2*t[i-3])%20210108;
    }
    cout << t[n-1];
}
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/49ms4148 KiB
8Accepted4/42ms692 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms500 KiB
11Accepted4/43ms1076 KiB
12Accepted4/49ms4104 KiB
13Accepted4/48ms3636 KiB
14Accepted4/44ms1588 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB