237912026-01-29 18:11:14algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/303ms1076 KiB
// UUID: b23a0a1c-e8c4-4c94-b962-13850964ce31
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<int> a(n), b(n);
	a[0]=1;
	b[0]=2;
	for(int i=1;i<n;i++){
		a[i]+=(a[i-1]+b[i-1]+(2<=i?b[i-2]:0))%2023;
		b[i]+=(2*b[i-1]+4*a[i-1]+3*(2<=i?b[i-2]:0))%2023;
	}
	cout << a[n-1]+b[n-1];
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms500 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms580 KiB
10Wrong answer0/21ms648 KiB
11Wrong answer0/22ms820 KiB
12Wrong answer0/32ms772 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/33ms1076 KiB