ABC129 C - Typical Stairs

提出

code: python

n, m = map(int, input().split())

dp = []

now = 0

解答

code: python

n, m = map(int, input().split())

broken = [[] for _ in range(n+1)]

for i in a:

# 1つ多めに取る

mod = 1000000007

# 最上段

# 最上段より1つ下の段から順に下っていく

for i in range(n-1, -1, -1):

continue

テーマ

提出

AC

code: python

n, m = list(map(int, input().split()))

a = set(a)

# 0 1 2 3 4 5 6

# . x

mod = 1000000007

if 1 not in a:

else:

for i in range(2, n+1):

if i - 1 not in a:

if i - 2 not in a: