154152025-02-19 12:44:49mateToronyépítés (1,1,3,3)cpp17Accepted 50/509ms4164 KiB
#include <bits/stdc++.h>
using namespace std;
const int MOD = 20210108;

int main() {
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int n; cin >> n;
    int dp[n+1];
    dp[0] = 0;
    dp[1] = 2;
    dp[2] = 4;
    dp[3] = 10;
    for(int i = 4; i <= n; i++){
        dp[i] = (dp[i-1] * 2 + dp[i-3] * 2) % MOD;
    }
    cout << dp[n];
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms508 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms524 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms316 KiB
7Accepted4/49ms4120 KiB
8Accepted4/42ms820 KiB
9Accepted4/41ms508 KiB
10Accepted4/41ms316 KiB
11Accepted4/43ms1076 KiB
12Accepted4/49ms4164 KiB
13Accepted4/48ms3636 KiB
14Accepted4/44ms1588 KiB
15Accepted2/21ms508 KiB
16Accepted2/21ms316 KiB