252312026-02-18 17:29:16999JardaTcpp17Wrong answer 12/401ms508 KiB
// Source: https://usaco.guide/general/io

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

signed main() {
    int n;cin>>n;
    vector<array<int,3>> dp(n+1);
    dp[0][0]=1;
    for(int i = 1;i<=n;i++){
        dp[i][0]=dp[i-1][0]+(i>1?dp[i-2][0]+dp[i-2][1]+dp[i-2][2]:0LL);
        dp[i][1]=dp[i-1][2]+dp[i-1][0]+(i>1?dp[i-2][2]:0);
        dp[i][2]=dp[i-1][1]+dp[i-1][0]+(i>1?dp[i-2][1]:0);
    }                    
    cout<<dp[n][0];
}
SubtaskSumTestVerdictTimeMemory
base12/40
1Accepted0/01ms316 KiB
2Wrong answer0/01ms316 KiB
3Accepted1/11ms328 KiB
4Accepted1/11ms316 KiB
5Accepted2/21ms316 KiB
6Accepted2/21ms316 KiB
7Accepted3/31ms316 KiB
8Accepted3/31ms316 KiB
9Wrong answer0/31ms316 KiB
10Wrong answer0/31ms508 KiB
11Wrong answer0/31ms316 KiB
12Wrong answer0/31ms316 KiB
13Wrong answer0/31ms316 KiB
14Wrong answer0/31ms316 KiB
15Wrong answer0/31ms316 KiB
16Wrong answer0/31ms316 KiB
17Wrong answer0/41ms316 KiB