199432025-12-30 11:31:03PappMatyasToronyépítés (1,1,3,3)cpp17Accepted 50/5013ms8124 KiB
#include <iostream>

using namespace std;

long long sols[1000000];

int main()
{
	int n;
	cin >> n;
	sols[0] = 2;
	sols[1] = 4;
	sols[2] = 10;
	for (int i = 3; i < n; i++)
	{
		sols[i] = (2 * (sols[i - 3] + sols[i - 1])) % 20210108;
	}
	cout << sols[n - 1];
}
SubtaskSumTestVerdictTimeMemory
base50/50
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted3/31ms316 KiB
4Accepted3/31ms316 KiB
5Accepted4/41ms316 KiB
6Accepted4/41ms336 KiB
7Accepted4/412ms8072 KiB
8Accepted4/42ms1172 KiB
9Accepted4/41ms316 KiB
10Accepted4/41ms508 KiB
11Accepted4/43ms1844 KiB
12Accepted4/413ms8124 KiB
13Accepted4/410ms7220 KiB
14Accepted4/44ms2868 KiB
15Accepted2/21ms316 KiB
16Accepted2/21ms316 KiB