154132025-02-19 12:39:10mateToronyépítés (1,1,3,3)cpp17Wrong answer 38/509ms4216 KiB
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const int MOD = 20210108;

int main() {
	int n; cin >> n;
    vector <int> dp(n+1);
    dp[0] = 1;
    dp[1] = 2;
    dp[2] = 4;
    dp[3] = 10;
    for(int i = 4; i <= n; i++){
        dp[i] = dp[i-1] * 2 % MOD + dp[i-3] * 2 % MOD;
    }
    cout << dp[n];
}
SubtaskSumTestVerdictTimeMemory
base38/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms500 KiB
4Accepted3/31ms500 KiB
5Wrong answer0/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/49ms4216 KiB
8Wrong answer0/42ms896 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms508 KiB
11Accepted4/43ms1076 KiB
12Accepted4/49ms4148 KiB
13Accepted4/48ms3836 KiB
14Wrong answer0/44ms1636 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB