217042026-01-13 18:14:35algoproJárda-L (40)cpp17Wrong answer 2/402ms508 KiB
// UUID: 9b80038a-67f0-470c-b1cc-2b0f2d92de97
#include <bits/stdc++.h>
using namespace std;

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

        a[i]=a[i-1]+a[i-2]+2*b[i-1];
        b[i]=a[i-2]+b[i-1];
    }
    cout << a[N]-1;
    //ha csak rendessel csinalnank nem tudnank a vegen kimaradna e egy kocka











}
SubtaskSumTestVerdictTimeMemory
base2/40
1Accepted0/02ms508 KiB
2Wrong answer0/01ms500 KiB
3Wrong answer0/21ms316 KiB
4Accepted2/21ms316 KiB
5Wrong answer0/21ms508 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/31ms316 KiB
9Wrong answer0/31ms348 KiB
10Wrong answer0/31ms500 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms316 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms508 KiB
15Wrong answer0/31ms316 KiB
16Wrong answer0/31ms316 KiB
17Wrong answer0/31ms316 KiB