Algorithm/boj

[파이썬] 9657 돌 게임 3

takeU 2022. 9. 22. 03:40
반응형
n = int(input())
dp = [0] * 1001
dp[1] = dp[3] = dp[4] = 1

for i in range(5, n + 1):
    if not min(dp[i - 1], dp[i - 3], dp[i - 4]):
        dp[i] = 1

print('SK' if dp[n] else 'CY')

dp, 게임이론