222082026-01-14 17:50:49algoproJárda-L (40)cpp17Accepted 40/401ms508 KiB
// UUID: cab6ad62-a379-49e5-ac90-b41a1ff4e730
#include <bits/stdc++.h>
using namespace std;

int main() {
	int N; cin>>N;
	vector<long long>dp(max(N+1, 3), 0);
	dp[0]=1;
	dp[1]=1;
	dp[2]=2;
	for(int i=3; i<=N; i++)
	{
		dp[i]+=dp[i-1]+dp[i-2];
		for(int j=i-3; j>=0; j--)
		{
			dp[i]+=2*dp[j];
		}
	}
	cout<<dp[N];
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/01ms316 KiB
2Accepted0/01ms500 KiB
3Accepted2/21ms316 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted3/31ms316 KiB
9Accepted3/31ms316 KiB
10Accepted3/31ms316 KiB
11Accepted3/31ms332 KiB
12Accepted3/31ms316 KiB
13Accepted3/31ms316 KiB
14Accepted3/31ms316 KiB
15Accepted3/31ms316 KiB
16Accepted3/31ms316 KiB
17Accepted3/31ms316 KiB