130922025-01-06 14:25:14ercseferencToronyépítés (1,1,3,3)cpp17Accepted 50/509ms4508 KiB
#include <iostream>
using namespace std;
int a[1000001];
int main()
{
    int mod=20210108,n; cin>>n;
    a[0]=0; a[1]=2; a[2]=4; a[3]=10;
    for(int i=4; i<=1000000; i++)
        {a[i]=2*(a[i-1]+a[i-3])%mod;}
    cout<<a[n];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/08ms4148 KiB
2Accepted0/09ms4148 KiB
3Accepted3/39ms4148 KiB
4Accepted3/38ms4332 KiB
5Accepted4/48ms4148 KiB
6Accepted4/49ms4388 KiB
7Accepted4/49ms4508 KiB
8Accepted4/49ms4148 KiB
9Accepted4/48ms4116 KiB
10Accepted4/49ms4092 KiB
11Accepted4/48ms4316 KiB
12Accepted4/49ms4148 KiB
13Accepted4/48ms4184 KiB
14Accepted4/48ms4260 KiB
15Accepted2/29ms4148 KiB
16Accepted2/29ms4164 KiB