221442026-01-14 17:24:47algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/302ms1024 KiB
// UUID: fce891af-fb9f-4e71-b618-21642921b3a6
#include <bits/stdc++.h>
using namespace std;

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