235702026-01-25 10:00:55KristófToronyépítés (1,1,3,3)cpp17Wrong answer 5/5017ms4324 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])%MOD;
        }
    cout<<dp[n];
}
SubtaskSumTestVerdictTimeMemory
base5/50
1Wrong answer0/01ms500 KiB
2Wrong answer0/02ms512 KiB
3Wrong answer0/31ms500 KiB
4Accepted3/32ms316 KiB
5Wrong answer0/41ms316 KiB
6Wrong answer0/41ms316 KiB
7Wrong answer0/417ms4324 KiB
8Wrong answer0/43ms820 KiB
9Wrong answer0/41ms316 KiB
10Wrong answer0/41ms316 KiB
11Wrong answer0/44ms1200 KiB
12Wrong answer0/417ms4292 KiB
13Wrong answer0/416ms3844 KiB
14Wrong answer0/47ms1588 KiB
15Wrong answer0/21ms316 KiB
16Accepted2/21ms332 KiB