239192026-01-31 18:50:37TakacsAndrasJárdakövezés háromféle elemmelcpp17Wrong answer 0/302ms1080 KiB
#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    vector<pair<int,int>> dp(n+1);
    dp[0].first = 1;
    for (int i = 1; i <= n; i++) {
        dp[i].first = 2*dp[i-1].first+2*dp[i-1].second+(i > 1 ? dp[i-2].first+4*dp[i-2].second : 0);
        dp[i].second = dp[i].first+dp[i-1].first+dp[i-1].second;
        dp[i].first %= 2023;
        dp[i].second %= 2023;
    }
    cout << dp[n].first << '\n';
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms316 KiB
2Wrong answer0/01ms500 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/22ms332 KiB
7Wrong answer0/22ms508 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms564 KiB
10Wrong answer0/21ms564 KiB
11Wrong answer0/22ms1012 KiB
12Wrong answer0/32ms768 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/32ms1080 KiB