230782026-01-16 11:42:26MagyarKendeSZLGJárdakövezés háromféle elemmelcpp17Accepted 30/304ms1084 KiB
#include <bits/stdc++.h>
using namespace std;
#define int int64_t

const int MOD = 2023;

int32_t main() {
    cin.tie(0), ios::sync_with_stdio(0);
    int n;
    cin >> n;
    vector<int> dp(n + 1);
    dp[0] = 1;
    int ps = 0;
    for (int i = 1; i <= n; i++) {
        (dp[i] += 2 * dp[i - 1]) %= MOD;
        if (i >= 2) (dp[i] += 7 * dp[i - 2]) %= MOD;
        if (i >= 3) (ps += 8 * dp[i - 3]) %= MOD;
        (dp[i] += ps) %= MOD;
    }
    cout << dp[n] << "\n";
}
SubtaskSumTestVerdictTimeMemory
base30/30
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted2/21ms316 KiB
9Accepted2/22ms564 KiB
10Accepted2/22ms564 KiB
11Accepted2/24ms820 KiB
12Accepted3/33ms820 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/34ms1084 KiB