216402026-01-13 17:36:59algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/303ms756 KiB
// UUID: b0580f9a-0e18-4ea7-9d77-f07237374d5d
#include <bits/stdc++.h>
using namespace std;
const int mod = 2023;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector <int> pos(n+1);
    pos[0] = 1;
    pos[1] = 2;
    pos[2] = 11;
    for(int i = 3; i <= n; i++){
        pos[i] = pos[i-1]*2 % mod + pos[i-2]*7 % mod + pos[i-3]*6 % mod;
        pos[i] %= mod;
    }
    cout << pos[n];
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms500 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms324 KiB
7Wrong answer0/21ms520 KiB
8Wrong answer0/21ms332 KiB
9Wrong answer0/22ms316 KiB
10Wrong answer0/22ms548 KiB
11Wrong answer0/22ms568 KiB
12Wrong answer0/33ms756 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/33ms564 KiB