Submission #18,157

2025-10-06 20:26:29

cpp17

Accepted 40/40

1ms

508 KiB

#include <bits/stdc++.h>
using namespace std;
int n;
vector<long long> DP;

long long d(int k){
    if(k == n)
        return DP[k];
    if(k+2 < n+1)
        DP[k+2] += DP[k];
    if(k+1 < n+1)
        DP[k+1] += DP[k];

    for(int i = k+3; i< n+1; i++){
        DP[i] += DP[k]*2;
    }

    return d(k+1);
}

int main(){
    cin >> n;
    DP.resize(n+1,0);
    DP[0] = 1;
    cout << d(0);
}

	Sum	Test	Verdict		Time	Memory
base	40/40
		1	Accepted	0/0	1ms	316 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	2/2	1ms	340 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	316 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	3/3	1ms	316 KiB
		9	Accepted	3/3	1ms	508 KiB
		10	Accepted	3/3	1ms	316 KiB
		11	Accepted	3/3	1ms	316 KiB
		12	Accepted	3/3	1ms	508 KiB
		13	Accepted	3/3	1ms	372 KiB
		14	Accepted	3/3	1ms	316 KiB
		15	Accepted	3/3	1ms	316 KiB
		16	Accepted	3/3	1ms	316 KiB
		17	Accepted	3/3	1ms	316 KiB