217322026-01-13 18:38:43algoproJárda-L (40)cpp17Accepted 40/401ms508 KiB
// UUID: b89488c1-9686-475c-8f54-c26c6a0729d3
#include <bits/stdc++.h>
using namespace std;


int main() {
    
	long long N;
    cin >> N;
    vector<long long >a(N+2);//rendes
    vector<long long>b(N+2);//hianyzik egy kocka
    a[0] = 0;
    a[1] = 1;
    b[0] = 0;
    b[1] = 0;
    for(int i = 2; i < N+2; i++){
        b[i]=a[i-2]+b[i-1];
        a[i]=a[i-1]+a[i-2]+2*b[i-1];
        
    }
    cout << a[N+1];

    //ha csak rendessel csinalnank nem tudnank a vegen kimaradna e egy kocka










}

SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms508 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms508 KiB
7Accepted2/21ms316 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms500 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms316 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/31ms316 KiB
16Accepted3/31ms332 KiB
17Accepted3/31ms316 KiB