結果

問題 No.314 ケンケンパ
ユーザー irumo8202
提出日時 2022-01-30 15:03:48
言語 PyPy3
(7.3.15)
結果
AC  
実行時間 219 ms / 1,000 ms
コード長 700 bytes
コンパイル時間 147 ms
コンパイル使用メモリ 82,304 KB
実行使用メモリ 171,664 KB
最終ジャッジ日時 2024-06-11 08:16:58
合計ジャッジ時間 5,334 ms
ジャッジサーバーID
(参考情報)
judge5 / judge1
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

# Live as if you were to die tomorrow.
# Learn as if you were to live forever.
MOD = 10 ** 9 + 7
def solve():
# dp[i][0] means that i-th one ended in "first ken".
# dp[i][1] means that i-th one ended in "second ken".
# dp[i][2] means that i-th one ended in "pa".
dp = [[0, 0, 0] for _ in range(10 ** 6 + 1)]
dp[1][0] = 1
for i in range(2, 10 ** 6 + 1):
dp[i][0] += dp[i - 1][2]
dp[i][0] %= MOD
dp[i][1] += dp[i - 1][0]
dp[i][1] %= MOD
dp[i][2] += dp[i - 1][0] + dp[i - 1][1]
dp[i][2] %= MOD
return dp
def main():
N = int(input())
dp = solve()
print(sum(dp[N]) % MOD)
if __name__ == "__main__":
main()
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0