212232026-01-12 17:13:15algoproJárdakövezés háromféle elemmelcpp17Wrong answer 0/3010ms5900 KiB
// UUID: df5a4203-2826-445a-af76-90b6e2dee7d1
#include <bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
	int n;
    cin>>n;
    vector<vector<int>>dp(n,vector<int>(2));
    dp[0][0]=1;
    dp[0][1]=2;
    dp[1][0]=4;
    dp[1][1]=11;
    for(int i=2;i<n;i++)
    {
        dp[i][0]=(dp[i-1][1]+dp[i-1][0]+dp[i-2][1])%2023;
        dp[i][1]=(dp[i-1][0] + 2*dp[i-1][1])%2023;
    }
    cout<<dp[n-1][1]<<'\n';
}
SubtaskSumTestVerdictTimeMemory
base0/30
1Accepted0/01ms500 KiB
2Wrong answer0/01ms500 KiB
3Wrong answer0/21ms316 KiB
4Wrong answer0/21ms316 KiB
5Wrong answer0/21ms316 KiB
6Wrong answer0/21ms316 KiB
7Wrong answer0/21ms316 KiB
8Wrong answer0/21ms316 KiB
9Wrong answer0/24ms1888 KiB
10Wrong answer0/24ms2100 KiB
11Wrong answer0/28ms3928 KiB
12Wrong answer0/38ms4608 KiB
13Wrong answer0/32ms820 KiB
14Wrong answer0/32ms1012 KiB
15Wrong answer0/310ms5900 KiB