175282025-07-18 10:57:37KristófToronyépítés (1,1,3,3)cpp17Wrong answer 45/5048ms8084 KiB
#include <iostream>
#include <vector>

using namespace std;

int MOD=20210108;

int main()
{
    int n;
    cin>>n;
    vector<long long> dp (n);
    dp[0]=2;
    dp[1]=4;
    dp[2]=10;
    int i=3;
    while(i<n)
        {
        dp[i]=(dp[i]+dp[i-1]*2)%MOD;
        dp[i]=(dp[i]+dp[i-3]*2)%MOD;
        i++;
        }
    cout<<dp[i-1];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base45/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms500 KiB
4Wrong answer0/31ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/448ms7988 KiB
8Accepted4/47ms1172 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms316 KiB
11Accepted4/410ms1844 KiB
12Accepted4/446ms8084 KiB
13Accepted4/441ms7252 KiB
14Accepted4/416ms2868 KiB
15Accepted2/21ms316 KiB
16Wrong answer0/21ms316 KiB