211952026-01-12 17:00:13algoproJárda-L (40)pypy3Accepted 40/4045ms19640 KiB
# UUID: 480a3855-7fe2-4a2b-a52b-bb5499e6f8c7
import sys
input = sys.stdin.readline

def solve():
    n = int(input())
    dp = [[0 for _ in range(3)] for _ in range(n+2)]
    dp[1][0] = 1
    for i in range(2, n+2):
        dp[i][0] = dp[i-1][0] + dp[i-1][1] + dp[i-1][2] + dp[i-2][0]
        dp[i][1] = dp[i-1][2] + dp[i-2][0]
        dp[i][2] = dp[i-1][1] + dp[i-2][0]
    print(dp[n+1][0])

solve()
SubtaskSumTestVerdictTimeMemory
base40/40
1Accepted0/039ms19440 KiB
2Accepted0/037ms19424 KiB
3Accepted2/243ms19444 KiB
4Accepted2/243ms19532 KiB
5Accepted2/239ms19492 KiB
6Accepted2/245ms19428 KiB
7Accepted2/237ms19436 KiB
8Accepted3/337ms19436 KiB
9Accepted3/345ms19400 KiB
10Accepted3/339ms19536 KiB
11Accepted3/343ms19640 KiB
12Accepted3/337ms19564 KiB
13Accepted3/339ms19552 KiB
14Accepted3/339ms19548 KiB
15Accepted3/345ms19428 KiB
16Accepted3/337ms19412 KiB
17Accepted3/339ms19436 KiB