235712026-01-25 10:01:46KristófToronyépítés (1,1,3,3)cpp17Wrong answer 18/5017ms4148 KiB
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int MOD=20201114;


int main() {
	int n;
    cin>>n;
    vector<int> dp(n+1);
    dp[0]=1;
    dp[1]=2;
    dp[2]=4;
    for(int i=3;i<=n;i++)
        {
        dp[i]=(dp[i-1]*2+dp[i-3]*2)%MOD;
        }
    cout<<dp[n];
}
SubtaskSumTestVerdictTimeMemory
base18/50
1Accepted0/01ms512 KiB
2Wrong answer0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Wrong answer0/41ms316 KiB
6Wrong answer0/41ms316 KiB
7Wrong answer0/417ms4148 KiB
8Wrong answer0/43ms820 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Wrong answer0/44ms1080 KiB
12Wrong answer0/417ms4148 KiB
13Wrong answer0/417ms3848 KiB
14Wrong answer0/47ms1752 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms508 KiB