Submission #20,978

20978

2026-01-11 22:45:36

cpp17

Accepted 30/30

3ms

1076 KiB

#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, mod = 2023;
	cin >> n;
	vector <int> a(n + 1, 0);
	vector <int> b(n + 1, 0);
	b[0] = 1; a[1] = 1; b[1] = 2;
	for (int i = 2; i <= n; i++) {
		a[i] = (b[i - 1] + a[i - 1] + b[i - 2]) % mod;
		b[i] = (2 * b[i - 1] + 4 * a[i - 1] + 3 * b[i - 2]) % mod;
	}
	cout << b[n];
}

	Sum	Test	Verdict		Time	Memory
base	30/30
		1	Accepted	0/0	1ms	508 KiB
		2	Accepted	0/0	1ms	316 KiB
		3	Accepted	2/2	1ms	500 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	2/2	1ms	316 KiB
		9	Accepted	2/2	1ms	456 KiB
		10	Accepted	2/2	1ms	748 KiB
		11	Accepted	2/2	2ms	820 KiB
		12	Accepted	3/3	2ms	820 KiB
		13	Accepted	3/3	1ms	316 KiB
		14	Accepted	3/3	1ms	316 KiB
		15	Accepted	3/3	3ms	1076 KiB