227322026-01-15 17:26:17algoproJárdakövezés háromféle elemmelcpp17Accepted 30/304ms1844 KiB
// UUID: b4f53838-1be4-481f-8644-62eca29fdeff
#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
base30/30
1Accepted0/01ms316 KiB
2Accepted0/01ms508 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms332 KiB
8Accepted2/21ms316 KiB
9Accepted2/22ms836 KiB
10Accepted2/22ms820 KiB
11Accepted2/23ms1356 KiB
12Accepted3/33ms1604 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms564 KiB
15Accepted3/34ms1844 KiB