226652026-01-15 14:31:19algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/303ms1076 KiB
// UUID: 4d1600aa-972c-416a-95db-d42b98289b50
#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 - 1][0]) % 2023;
		sor[i][0] = (sor[i][1] + sor[i - 1][0] + sor[i - 2][0] + sor[i - 2][1] + sor[i - 2][0] + sor[i - 1][1] + sor[i - 1][1]) % 2023;
	}

	cout << sor[n][0];
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms508 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms332 KiB
7Wrong answer0/21ms500 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms564 KiB
10Wrong answer0/22ms748 KiB
11Wrong answer0/22ms700 KiB
12Wrong answer0/33ms820 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/33ms1076 KiB