227142026-01-15 17:04:36algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/303ms1076 KiB
// UUID: 3fa453ca-c169-4eef-a408-aae1229e82a8
#include <bits/stdc++.h>
#include <vector>
using namespace std;

int main() {
	int n; cin >> n;
	vector<pair<int,int>> dp(n + 1);
	dp[1].first = 2;
	dp[1].second = 2;
	dp[0].second = 1;
	for (int i = 2;i <= n;i++) {
		dp[i].first = (2 * dp[i - 2].second + dp[i - 1].first + 2 * dp[i - 1].second) % 2023;
		dp[i].second = ((dp[i].first - dp[i - 1].second/2) + dp[i - 1].second + dp[i - 1].first) % 2023;
	}
	cout << dp[n].second;
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms508 KiB
2Wrong answer0/01ms316 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms388 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms368 KiB
9Wrong answer0/21ms636 KiB
10Wrong answer0/22ms568 KiB
11Wrong answer0/23ms820 KiB
12Wrong answer0/32ms820 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/32ms508 KiB
15Wrong answer0/33ms1076 KiB