226672026-01-15 14:40:29algoproJárdakövezés háromféle elemmelcpp17Accepted 30/303ms1076 KiB
// UUID: a242b53a-783e-40b4-b1a7-f2b0c5d9ba05
#include <bits/stdc++.h>
using namespace std;

int main() {

	int n;
	cin >> n;
	vector<array<int, 2> > sor(n + 1);

	sor[0][0] = 1;
	sor[0][1] = 0;
	sor[1][0] = 2;
	sor[1][1] = 1;

	for (int i = 2; i <= n; i++){
		sor[i][1] = (sor[i - 1][0] + sor[i - 1][1] + sor[i - 2][0]) % 2023;
		sor[i][0] = (sor[i][1] + 
					 sor[i - 1][0] + sor[i - 2][0] + sor[i - 1][1] +
					 sor[i - 2][0] + sor[i - 1][1] + sor[i - 1][1]) % 2023;
	}

	cout << sor[n][0];
}
SubtaskSumTestVerdictTimeMemory
base30/30
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms324 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms316 KiB
8Accepted2/21ms500 KiB
9Accepted2/22ms564 KiB
10Accepted2/22ms568 KiB
11Accepted2/23ms1004 KiB
12Accepted3/33ms820 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/33ms1076 KiB