237902026-01-29 18:10:46algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/303ms1092 KiB
// UUID: bd21352f-5d6a-48ba-bc69-f6c0755e81e8
#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);
		b[i]+=2*b[i-1]+4*a[i-1]+3*(2<=i?b[i-2]:0);
	}
	cout << a[n-1]+b[n-1];
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms500 KiB
2Wrong answer0/01ms508 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/21ms564 KiB
10Wrong answer0/21ms588 KiB
11Wrong answer0/21ms820 KiB
12Wrong answer0/32ms1024 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/33ms1092 KiB