Submission #23,921

2026-01-31 19:17:30

cpp17

Accepted 30/30

3ms

1116 KiB

#include <bits/stdc++.h>
using namespace std;
int main() {
    int n; cin >> n;
    vector<pair<int,int>> dp(n+1);
    dp[0].first = 1;
    dp[1] = {2,2};
    for (int i = 2; i <= n; i++) {
        dp[i].first = (2*dp[i-1].first+2*dp[i-1].second+3*dp[i-2].first+2*dp[i-2].second)%2023;
        dp[i].second = (2*dp[i-1].first+dp[i-1].second)%2023;
    }
    cout << dp[n].first << '\n';
}

	Sum	Test	Verdict		Time	Memory
base	30/30
		1	Accepted	0/0	1ms	500 KiB
		2	Accepted	0/0	1ms	332 KiB
		3	Accepted	2/2	1ms	316 KiB
		4	Accepted	2/2	1ms	316 KiB
		5	Accepted	2/2	1ms	316 KiB
		6	Accepted	2/2	1ms	380 KiB
		7	Accepted	2/2	1ms	316 KiB
		8	Accepted	2/2	1ms	316 KiB
		9	Accepted	2/2	1ms	748 KiB
		10	Accepted	2/2	1ms	568 KiB
		11	Accepted	2/2	2ms	820 KiB
		12	Accepted	3/3	2ms	820 KiB
		13	Accepted	3/3	1ms	508 KiB
		14	Accepted	3/3	1ms	316 KiB
		15	Accepted	3/3	3ms	1116 KiB