227312026-01-15 17:25:20algoproJárdakövezés háromféle elemmelcpp17Wrong answer 4/303ms1844 KiB
// UUID: 99a75322-be12-497a-b8d6-6818f7b87f52
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n; cin >> n;
	vector<long long>a(n+1),b(n+1);
	a[0] = 1; a[1] = 2; b[0] = 0; b[1] = 1;
	for(int i = 2; i <= n; i++){
		b[i] = (a[i-1]+b[i-1]+a[i-2])%2023;
		a[i] = b[i]+a[i-1]+a[i-2]+b[i-1]+a[i-2]+b[i-1]+b[i-1]%2023;
	}	
	cout << a[n];
}
SubtaskSumTestVerdictTimeMemory
base4/30
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/22ms820 KiB
10Wrong answer0/22ms820 KiB
11Wrong answer0/23ms1216 KiB
12Wrong answer0/33ms1588 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms564 KiB
15Wrong answer0/33ms1844 KiB