212112026-01-12 17:06:20algoproJárdakövezés háromféle elemmelcpp17Accepted 30/3010ms5684 KiB
// UUID: 3cebdc0d-1232-4e90-ab1b-6af27f352bef
#include <bits/stdc++.h>
using namespace std;
using ll = long long int;

int main() {
	int n;
	cin >> n;
	vector<vector<ll>> dp(n+1, vector<ll>(2, 1));	//0 - egy kilóg, 1 - teli
	dp[1][0] = 1;
	dp[1][1] = 2;
	for(int i=2;i<=n;i++){
		dp[i][0] = dp[i-1][0] + dp[i-1][1] + dp[i-2][1];
		dp[i][1] = dp[i-1][1] + dp[i-1][0]*3 + dp[i][0] + dp[i-2][1] * 2;
		dp[i][0] %= 2023;
		dp[i][1] %= 2023;
	}
	cout << dp[n][1];
}
SubtaskSumTestVerdictTimeMemory
base30/30
1Accepted0/01ms316 KiB
2Accepted0/01ms316 KiB
3Accepted2/21ms500 KiB
4Accepted2/21ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted2/21ms508 KiB
8Accepted2/21ms316 KiB
9Accepted2/24ms1844 KiB
10Accepted2/24ms1972 KiB
11Accepted2/28ms3952 KiB
12Accepted3/39ms4444 KiB
13Accepted3/32ms820 KiB
14Accepted3/32ms836 KiB
15Accepted3/310ms5684 KiB