230242026-01-16 10:49:38algoproJárdakövezés háromféle elemmelcpp17Accepted 30/303ms1844 KiB
// UUID: 3544f4a8-9dc8-47da-ba48-ab324effac94
#include <bits/stdc++.h>
using namespace std;

#define int long long

signed main() {
	int n; cin >> n;
    vector<int>a(n+1), b(n+1);
    a[1] = 1, b[1] =2, a[2] = 4, b[2] = 11;
    for(int i = 3; i <= n; i++)a[i] = (a[i-1]+b[i-1]+b[i-2]) % 2023 , b[i] = (2*b[i-1] + 3*b[i-2] + 4*a[i-1]) % 2023;
    cout << b[n];
}
SubtaskSumTestVerdictTimeMemory
base30/30
1Accepted0/01ms508 KiB
2Accepted0/02ms316 KiB
3Accepted2/22ms316 KiB
4Accepted2/22ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms352 KiB
9Accepted2/22ms820 KiB
10Accepted2/22ms820 KiB
11Accepted2/23ms1332 KiB
12Accepted3/33ms1596 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms564 KiB
15Accepted3/33ms1844 KiB