82012024-01-12 18:23:14CWMToronyépítés (2,2,3,3)cpp17Accepted 40/404ms4780 KiB
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

//#define int long long

int mod = 20210108;

signed main()
{
	int num;
	cin >> num;
	vector<int> DP(num+1);
	DP[2] = 2;
	DP[3] = 2;
	for (size_t i = 4; i < num+1; i++)
	{
		DP[i] = (2 * (DP[i - 2] + DP[i - 3]))%mod;
	}
	cout << DP[num];
}
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/03ms1812 KiB
2Accepted0/03ms1864 KiB
3Accepted2/23ms1940 KiB
4Accepted2/23ms2072 KiB
5Accepted3/33ms2288 KiB
6Accepted3/33ms2504 KiB
7Accepted3/34ms4076 KiB
8Accepted3/34ms3512 KiB
9Accepted3/33ms2936 KiB
10Accepted3/33ms3212 KiB
11Accepted3/34ms4752 KiB
12Accepted3/34ms4512 KiB
13Accepted4/44ms4780 KiB
14Accepted4/44ms4308 KiB
15Accepted2/23ms3608 KiB
16Accepted2/23ms3804 KiB