239202026-01-31 19:05:56TakacsAndrasJárdakövezés háromféle elemmelcpp17Wrong answer 0/303ms1076 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;
    dp[1] = {2,3};
    for (int i = 2; i <= n; i++) {
        dp[i].first = (2*dp[i-1].first+2*dp[i-1].second+dp[i-2].first+2*dp[i-2].second)%2023;
        dp[i].second = (dp[i].first+dp[i-1].first+dp[i-1].second)%2023;
    }
    cout << dp[n].first << '\n';
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms508 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms332 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms500 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/22ms564 KiB
10Wrong answer0/22ms640 KiB
11Wrong answer0/22ms820 KiB
12Wrong answer0/33ms820 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/33ms1076 KiB