input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N+1)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N+1)]
dp[0] = 1
MOD = 1000000007
for i in range(1, N+1):
if stair[i] == 1:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[N]))
|
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N+1)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N+2)]
dp[1] = 1
MOD = 1000000007
for i in range(2, N+2):
if stair[i-1] == 1:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[N+1]))
|
p03013
|
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N+1)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N+2)]
dp[1] = 1
MOD = 1000000007
for i in range(2, N+2):
if stair[i-1] == 1:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[N+1]))
|
N, M = list(map(int, input().split()))
a = []
stair = [1 for i in range(N+2)]
for i in range(M):
stair[int(eval(input()))] = 0
dp = [0 for i in range(N+2)]
dp[0] = 1
MOD = 1000000007
for i in range(1, N+1):
if stair[i] == 1:
if i == 1:
dp[i] = dp[i - 1] % MOD
else:
dp[i] = (dp[i-1] % MOD + dp[i-2] % MOD) % MOD
print((dp[N]))
|
p03013
|
n,m = list(map(int,input().split()))
lis = [int(eval(input())) for i in range(m)]
dp = [0 for i in range(n+2)]
dp[0] = 1
for i in range(n):
if i+1 not in lis:
dp[i+1] += dp[i]
dp[i+1] %= 10 ** 9+7
if i+2 not in lis:
dp[i+2] += dp[i]
dp[i+2] %= 10 ** 9 + 7
print((dp[n]))
|
n,m = list(map(int,input().split()))
lis = [int(eval(input())) for i in range(m)]
dp = [0 for i in range(n+2)]
lis.append(0)
dp[0] = 1
cou = 0
co = 0
if lis[0] == 1:co += 1
for i in range(n):
if i+1 != lis[cou]:
dp[i+1] += dp[i]
dp[i+1] %= 10 ** 9+7
else:
cou +=1
if i+2 != lis[co]:
dp[i+2] += dp[i]
dp[i+2] %= 10 ** 9 + 7
else:
co += 1
print((dp[n]))
|
p03013
|
BASE = 1000000007
class Route(object):
def __init__(self):
self.counter = [1]
def getCounter(self, idx):
if idx == -1:
return 0
try:
return self.counter[idx]
except IndexError:
return 0
def getList(self):
return self.counter
def append(self, elem):
self.counter.append(elem)
if __name__ == '__main__':
N, M = [int(i) for i in input().split()]
not_available = []
for i in range(M):
not_available.append(int(eval(input())))
route_counter = Route()
for idx in range(1, N + 1):
if idx in not_available:
route_counter.append(0)
continue
route_counter.append(route_counter.getCounter(idx - 1) + route_counter.getCounter(idx - 2))
print((route_counter.getCounter(N) % BASE))
|
BASE = 1000000007
if __name__ == '__main__':
N, M = [int(i) for i in input().split()]
not_available = []
for i in range(M):
not_available.append(int(eval(input())))
x = 0
y = 1
predicted_next = 1
is_available = [True] * N
for idx in not_available:
is_available[idx - 1] = False
for flag in is_available:
if flag:
z = x + y
x = y
y = z
else:
x = y
y = 0
print((y % BASE))
|
p03013
|
n,m = list(map(int, input().split()))
broken_stairs = []
INF = 1000000007
broken_stairs = [int(eval(input())) for i in range(m)]
dp = [0] * (n + 1)
dp[0] = 1
if 1 not in broken_stairs:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, n + 1):
if i in broken_stairs:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print((dp[-1]))
|
n,m = list(map(int, input().split()))
INF = 1000000007
broken_stairs = set([int(eval(input())) for i in range(m)])
dp = [0] * (n + 1)
dp[0] = 1
if 1 not in broken_stairs:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, n + 1):
if i in broken_stairs:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print((dp[n]))
|
p03013
|
# coding: utf-8
# Your code here!
import sys
def input():
return sys.stdin.readline().strip()
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
li = [1] + [0 for _ in range(N)]
for i in range(1, N + 1):
if i in a:
continue
else:
li[i] = li[i - 1] + li[i - 2]
print((li[-1] % 1000000007))
|
# coding: utf-8
# Your code here!
import sys
def input():
return sys.stdin.readline().strip()
N, M = list(map(int, input().split()))
a = set(int(eval(input())) for _ in range(M))
li = [1] + [0 for _ in range(N)]
for i in range(1, N + 1):
if i in a:
continue
else:
li[i] = li[i - 1] + li[i - 2]
print((li[-1] % 1000000007))
|
p03013
|
mod = 10**9+7
n,m = list(map(int,input().split()))
lst = [int(eval(input())) for _ in range(m)]
dp = [0]*(n+1)
for i in range(1,n+1):
if i in lst:
continue
elif i==1:
dp[i] = 1
elif i==2:
dp[i] = dp[1]+1
else:
dp[i] = (dp[i-1] + dp[i-2])%mod
print((dp[n]))
|
mod = 10**9+7
n,m = list(map(int,input().split()))
dp = [0]*(n+2)
dp[0] = 1
for i in range(m):
dp[int(eval(input()))] = -1
for i in range(n):
if dp[i] != -1:
if dp[i+1] != -1:
dp[i+1] += dp[i]
if dp[i+2] != -1:
dp[i+2] += dp[i]
print((dp[n]%mod))
|
p03013
|
#coding utf-8
N,M=list(map(int,input().split()))
a =[int(eval(input())) for i in range(M)]
mod =10**9+7
dp = [1]
for i in range(1,N+1):
if i not in a:
if i ==1:
dp.append(dp[-1])
else:
dp.append((dp[-1]+dp[-2])%mod)
else:
dp.append(0)
print((dp[-1]))
|
#coding utf-8
N,M=list(map(int,input().split()))
a =[int(eval(input())) for i in range(M)]
a.append(0)
mod =10**9+7
dp = [1]
j = 0
for i in range(1,N+1):
if i != a[j]:
if i ==1:
dp.append(dp[-1])
else:
dp.append((dp[-1]+dp[-2])%mod)
else:
dp.append(0)
j +=1
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split(' ')))
bads = []
for i in range(m):
bads.append(int(eval(input())))
dp = [1, 1]
for i in range(2, n+1):
dp.append(0)
if i-1 not in bads:
dp[i] += dp[i-1]
if i-2 not in bads:
dp[i] += dp[i-2]
dp[i] %= 1000000007
print((dp[-1]))
|
n, m = list(map(int, input().split(' ')))
bads = {}
for i in range(m):
bads[int(eval(input()))] = None
dp = [1]
if 1 not in bads:
dp.append(1)
else:
dp.append(0)
for i in range(2, n+1):
dp.append(0)
if i-1 not in bads:
dp[i] += dp[i-1]
if i-2 not in bads:
dp[i] += dp[i-2]
dp[i] %= 1000000007
print((dp[-1]))
|
p03013
|
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
cnt2 = 0
cnt1 = 1
for i in range(1,n):
if i in a:
cnt2, cnt1 = cnt1, 0
else:
cnt2, cnt1 = cnt1, cnt2+cnt1
else:
ans = (cnt2+cnt1)%1000000007
print(ans)
|
n,m = list(map(int,input().split()))
aa = [int(eval(input())) for i in range(m)]
cnt2 = 0
cnt1 = 1
aa.append(-1)
a = aa.pop(0)
for i in range(1,n):
if i == a:
cnt2, cnt1 = cnt1, 0
a = aa.pop(0)
else:
cnt2, cnt1 = cnt1, cnt2+cnt1
else:
ans = (cnt2+cnt1)%1000000007
print(ans)
|
p03013
|
n,m = list(map(int,input().split()))
aa = [int(eval(input())) for i in range(m)]
cnt2 = 0
cnt1 = 1
aa.append(-1)
a = aa.pop(0)
for i in range(1,n):
if i == a:
cnt2, cnt1 = cnt1, 0
a = aa.pop(0)
else:
cnt2, cnt1 = cnt1, cnt2+cnt1
else:
ans = (cnt2+cnt1)%1000000007
print(ans)
|
n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
a.append(-1)
idx = 0
mod = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
if a[idx] == 1: idx += 1
else: dp[1] = 1
for i in range(2,n+1):
if i == a[idx]:
dp[i] = 0
idx += 1
else:
dp[i] = (dp[i-1] + dp[i-2])%mod
print((dp[n]))
|
p03013
|
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
a = []
for i in range(m):
a.append(int(eval(input())))
pat = [1]
zero = False
for i in range(1, n + 1):
if i - 1 in a and i - 2 in a:
zero = True
break
if i in a:
pat.append(0)
continue
cnt = 0
if i - 1 not in a:
cnt = (cnt + pat[i - 1]) % mod
if i - 2 >= 0 and i - 2 not in a:
cnt = (cnt + pat[i - 2]) % mod
pat.append(cnt)
if zero:
print((0))
else:
print((pat[n]))
|
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
pat = [0] * (n + 2)
pat[0] = 1
pat[1] = 1
for i in range(m):
a = int(eval(input()))
pat[a] = -1
for i in range(2, n + 1):
if pat[i] < 0:
continue
if pat[i - 1] > 0:
pat[i] = (pat[i] + pat[i - 1]) % mod
if pat[i - 2] > 0:
pat[i] = (pat[i] + pat[i - 2]) % mod
print((pat[n]))
|
p03013
|
n, m = list(map(int, input().split()))
A = []
for i in range(m):
A.append(int(eval(input())))
dp = [0 for i in range(n + 1)]
dp[0] = 1
for i in range(n+1):
if not i in A:
if i >= 2:
dp[i] += (dp[i-2] + dp[i-1]) % (10 ** 9 + 7)
elif i == 1:
dp[i] += dp[i-1] % (10 ** 9 + 7)
else:
A.remove(i)
print((dp[-1] % (10 ** 9 + 7)))
|
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
A = []
for i in range(m):
A.append(int(eval(input())))
dp = [None for i in range(n + 1)]
dp[0] = 1
for a in A:
dp[a] = 0
for i in range(1,n+1):
if dp[i] != 0:
dp[i] = 0
if i >= 2:
dp[i] += (dp[i-2] + dp[i-1]) % mod
elif i == 1:
dp[i] += dp[i-1] % mod
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
a = tuple(map(int, [eval(input()) for _ in range(m)]))
dp = [0] * (n+1)
# 0段目と1段目は1通り（但し、１段目が壊れていない場合）（0 段目は「なにもしない」という から1 通り）
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, n+1):
if i in a:
continue
else:
dp[i] = (dp[i-1] + dp[i-2])
print((dp[-1] % (10**9+7)))
|
n, m = list(map(int, input().split()))
a = set(map(int, [eval(input()) for _ in range(m)]))
dp = [0] * (n+1)
# 0段目と1段目は1通り（但し、１段目が壊れていない場合）（0 段目は「なにもしない」という から1 通り）
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, n+1):
if i in a:
continue
else:
dp[i] = (dp[i-1] + dp[i-2])
print((dp[-1] % (10**9+7)))
|
p03013
|
n, m = list(map(int, input().split()))
a = set(map(int, [eval(input()) for _ in range(m)]))
dp = [0] * (n+1)
# 0段目と1段目は1通り（但し、１段目が壊れていない場合）（0 段目は「なにもしない」という から1 通り）
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, n+1):
if i in a:
continue
else:
dp[i] = (dp[i-1] + dp[i-2])
print((dp[-1] % (10**9+7)))
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
broken_steps = set([int(eval(input())) for _ in range(m)])
#print(broken_steps)
def ptn_num(x): # 'x'stepまでのパターン数
if x == 1:
print((1))
else:
dp = [0] * (x+1) # DP枠_including step'0'
cnt = 0
if 1 in broken_steps: # in case, step'1' broken
dp[:2] = 1, 0
else:
dp[:2] = 1, 1 # Usually
for i in range(2, x+1):
if i in broken_steps: # 階段が壊れている場合...
cnt += 1
if cnt == 2:
print((0))
exit()
else: # 階段が壊れてない場合...
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7)
cnt = 0
print((dp[-1]))
ptn_num(n)
|
p03013
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
broken_steps = [int(eval(input())) for _ in range(m)]
#print(broken_steps)
def ptn_num(x): # 'x'stepまでのパターン数
if x == 1:
print((1))
else:
dp = [0] * (x+1) # DP枠_including step'0'
cnt = 0
if 1 in broken_steps: # in case, step'1' broken
dp[:2] = 1, 0
else:
dp[:2] = 1, 1 # Usually
for i in range(2, x+1):
if i in broken_steps: # 階段が壊れている場合...
cnt += 1
if cnt == 2:
print((0))
exit()
else: # 階段が壊れてない場合...
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7)
cnt = 0
print((dp[-1]))
ptn_num(n)
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
broken = set([int(eval(input())) for _ in range(m)]) # ここが'list'だとPypyでも通らない
#print(broken_steps)
def ptn_num(x): # 'x'stepまでのパターン数
if x == 1:
print((1))
else:
dp = [0] * (x+1) # DP枠_including step'0'
cnt = 0 # 連続して壊れている階段を記録, '2'でゴール不可
if 1 in broken: # in case, step'1' broken
dp[:2] = 1, 0
else:
dp[:2] = 1, 1 # Usually
for i in range(2, x+1):
if i in broken: # 階段が壊れている場合...
cnt += 1
if cnt == 2: # 2段連続壊れている場合は...
print((0))
exit()
else: # 階段が壊れてない場合...
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7)
cnt = 0
print((dp[-1]))
ptn_num(n)
|
p03013
|
n, m = list(map(int, input().split()))
a = set(map(int, [eval(input()) for _ in range(m)]))
dp = [0] * (n+1)
# 0段目と1段目は1通り（但し、１段目が壊れていない場合）（0 段目は「なにもしない」という から1 通り）
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, n+1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2])
print((dp[-1] % (10**9+7)))
|
n, m = list(map(int, input().split()))
a = set(map(int, [eval(input()) for _ in range(m)]))
dp = [0] * (n+1)
# 0段目と1段目は1通り（但し、１段目が壊れていない場合）（0 段目は「なにもしない」という から1 通り）
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, n+1):
if i not in a:
dp[i] = ((dp[i-1] + dp[i-2]) % (10**9+7))
print((dp[-1]))
|
p03013
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
broken = set([int(eval(input())) for _ in range(m)]) # ここが'list'だとPypyでも通らない
def ptn_num(x): # 'x'stepまでのパターン数
dp = [0] * (x+1) # DP枠_including step'0'
if 1 in broken: # in case, step'1' broken
dp[:2] = 1, 0
else:
dp[:2] = 1, 1 # Usually
for i in range(2, x+1):
if i not in broken: # 階段が壊れてない場合...
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7) # -1段目と-2段目の合計
print((dp[-1]))
ptn_num(n)
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
broken = set([int(eval(input())) for _ in range(m)]) # ここが'list'だとPypyでも通らない
def ptn_num(x): # 'x'stepまでのパターン数
dp = [0] * (x+1) # DP枠_including step'0'
if 1 in broken: # 固定部分_in case, step'1' broken
dp[:2] = 1, 0
else:
dp[:2] = 1, 1 # 固定部分_Usually
for i in range(2, x+1):
if i not in broken: # 階段が壊れてない場合...
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7) # -1段目と-2段目の合計
print((dp[-1]))
ptn_num(n)
|
p03013
|
from sys import exit
N, M = list(map(int, input().split()))
_a = -1
A = []
ans = 0
for _ in range(M):
a_ = int(eval(input()))
if _a + 1 == a_:
print((0))
exit()
_a = a_
A.append(_a)
step = [0] * (N + 1)
step[0] = 1
for s in range(1, N + 1):
if s in A:
step[s] = 0
continue
if s == 1:
step[s] = 1
continue
else:
step[s] = (step[s - 1] + step[s - 2]) % 1000000007
print((step[N]))
|
N, M = list(map(int, input().split()))
A = [False] * (N + 1)
for _ in range(M):
A[int(eval(input()))] = True
step = [0] * (N + 1)
step[0] = 1
for s in range(1, N + 1):
if A[s]:
step[s] = 0
continue
if s == 1:
step[s] = 1
continue
else:
step[s] = step[s - 1] + step[s - 2]
step[s] %= 1000000007
print((step[N]))
|
p03013
|
# coding: utf-8
import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
A=[0]*M
for i in range(M):
A[i]=int(eval(input()))
#print(A)
def dp(n):
dp=[0]*(N+1)
dp[0]=1
dp[1]=0 if 1 in A else 1
for i in range(N-1):
if (i+2) in A:
dp[i+2]=0
else:
dp[i+2]=dp[i+1]+dp[i]
return dp[n]
print((dp(N)%(10**9+7)))
|
# coding: utf-8
import sys
input = sys.stdin.readline
N,M=list(map(int,input().split()))
A=[0]*M
dp=[-1]*(N+1)
for i in range(M):
tmp=int(eval(input()))
dp[tmp]=0
#print(dp)
dp[0]=1
dp[1]=0 if dp[1]==0 else 1
for i in range(2,N+1):
if dp[i]!=0:
dp[i]=dp[i-1]+dp[i-2]
print((dp[N]%(10**9+7)))
|
p03013
|
import math
def move(n):
twonum = n // 2
com = 0
for i in range(twonum + 1):
up = n - i
com += math.factorial(up) // (math.factorial(up - i) * math.factorial(i))
return com
N, M = list(map(int, input().split()))
a = []
a.append(0)
for i in range(M):
a.append(int(eval(input())))
a.append(N+1)
s = 1
for i in range(M+1):
step = a[i+1] - a[i] - 1
m = move(step)
s = s * m
a[i+1] += 1
print((s % 1000000007))
|
N, M = list(map(int, input().split()))
a = []
for i in range(M):
a.append(int(eval(input())))
a.append(-1)
m = []
for i in range(N):
if i == a[0] - 1:
del a[0]
m.append(0)
elif i == 0:
m.append(1)
elif i == 1:
m.append(m[0]+1)
else:
m.append(m[i-1]+m[i-2])
print((m[N-1] % 1000000007))
|
p03013
|
N, M=list(map(int, input().split()))
items=[int(eval(input())) for i in range(M)]
mod=10**9+7
dp=[0 for i in range(N+1)]
dp[0] = 1
is_broken =[1 for i in range(N+1)]
for i in range(M):
is_broken[items[i]] = 0
for i in range(N):
if i-1 >= 0:
dp[i+1] = dp[i]*is_broken[i] + dp[i-1]*is_broken[i-1]
else:
dp[i+1] = dp[i]*is_broken[i]
dp[i+1] %= mod
print((dp[N]))
|
N, M=list(map(int, input().split()))
mod=10**9+7
dp=[0 for i in range(N+2)]
dp[N] = 1
is_broken =[False for i in range(N+1)]
for i in range(M):
a=int(eval(input()))
is_broken[a] = True
for i in reversed(list(range(N))):
if is_broken[i]:
dp[i] = 0
continue
dp[i] = (dp[i+1] + dp[i+2]) % mod
print((dp[0]))
|
p03013
|
N, M= list(map(int, input().split()))
a =[str(eval(input())) for _ in range(M)]
DP = [0]*(N+2)
num = 1000000007
DP[0] = 1
for i in range(N):
if str(i) in a:
DP[i] = 0
else:
DP[i] = DP[i] % num
if i < N:
DP[i+1] += DP[i]
DP[i+2] += DP[i]
print((DP[-2]%num))
|
N, M, = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(M)])
DP = [0]*(N+2)
num = 1000000007
DP[0] = 1
for i in range(N):
if i in a:
DP[i] = 0
else:
DP[i] = DP[i] % num
if i < N:
DP[i+1] += DP[i]
DP[i+2] += DP[i]
print((DP[-2]%num))
|
p03013
|
N, M = list(map(int, input().split()))
broken_lst = []
for _ in range(M):
broken_lst.append(int(eval(input())))
counter_arr = [0]*(N+1)
counter_arr[0] = 1
next_broken = -1
if len(broken_lst) != 0:
next_broken = broken_lst.pop(0)
last_broken = -1
for i in range(0, N-1):
flug = 0
if i+1 == next_broken:
flug = 1
# print("p0", i, counter_arr)
elif i+1 == last_broken:
pass
# print("p1",i, counter_arr)
else:
counter_arr[i+1] += counter_arr[i]
counter_arr[i+1] %= 10**9 + 7
# print("p2",i, counter_arr)
if i + 2 == next_broken:
flug = 1
# print("p3",i, counter_arr)
else:
if i == 0 and len(broken_lst) != 0:
if broken_lst[0] == 2 and next_broken == 1:
continue
counter_arr[i+2] += counter_arr[i]
counter_arr[i+2] %= 10**9 + 7
# print("p4",i, counter_arr)
if flug == 1:
last_broken = next_broken
if len(broken_lst) != 0:
next_broken = broken_lst.pop(0)
if last_broken != N - 1:
counter_arr[-1] += counter_arr[-2]
counter_arr[-1] %= 10**9 + 7
print((counter_arr[-1]))
|
N, M = list(map(int, input().split()))
broken_lst = [1]*(N+1)
for _ in range(M):
broken_lst[int(eval(input()))] = 0
counter_arr = [0]*(N+1)
counter_arr[0] = 1
for i in range(0, N-1):
counter_arr[i+1] += counter_arr[i] * broken_lst[i+1]
counter_arr[i+1] %= 10**9 + 7
counter_arr[i+2] += counter_arr[i] * broken_lst[i+2]
counter_arr[i+2] %= 10**9 + 7
counter_arr[-1] += counter_arr[-2] * broken_lst[-1]
counter_arr[-1] %= 10**9 + 7
print((counter_arr[-1]))
|
p03013
|
N, M = list(map(int,input().split()))
data = []
for i in range(M):
data.append(int(eval(input())))
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1
if 1 in data:
dp[1] = 0
mod = 10**9 + 7
for i in range(2,N + 1):
if not i in data:
dp[i] = dp[i - 1] + dp[i - 2]
print((dp[N] % mod))
|
N, M = list(map(int,input().split()))
data = []
dp = ['.' for i in range(N + 1)]
dp[0] = 1
dp[1] = 1
for i in range(M):
k = int(eval(input()))
data.append(k)
dp[k] = 0
mod = 10**9 + 7
for i in range(2,N + 1):
if dp[i] != 0:
dp[i] = (dp[i - 1] + dp[i - 2]) % mod
print((dp[N] % mod))
|
p03013
|
n, m = list(map(int, input().split()))
mod = 10**9 + 7
dp = [0 for i in range(n+1)]
for i in range(m):
dp[int(eval(input()))] = -1
dp[0] = 1
for i in range(n):
if dp[i] != -1:
if dp[i+1] != -1:
dp[i+1] += dp[i]
dp[i+1] %= mod
if i+2 <= n and dp[i+2] != -1:
dp[i+2] += dp[i]
dp[i+2] %= mod
print((dp[n]))
|
n, m = list(map(int, input().split()))
dp = [0 for i in range(n + 1)]
mod = 10 ** 9 + 7
broke = set()
for i in range(m):
broke.add(int(eval(input())))
dp[0] = 1
for i in range(n):
if i + 1 <= n and i + 1 not in broke:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
if i + 2 <= n and i + 2 not in broke:
dp[i + 2] += dp[i]
dp[i + 2] %= mod
print((dp[-1] % mod))
|
p03013
|
N, B = list(map(int, input().split()))
ana = []
dp = [0] * (N+2)
for i in range(B):
ana.append(int(eval(input())))
mod = 1000000007
dp[N] = 1
for i in reversed(list(range(N))):
if i in ana:
dp[i] = 0
ana.pop(len(ana)-1)
continue
dp[i] = dp[i + 1] + dp[i + 2]
print((dp[0] % mod))
|
N, B = list(map(int, input().split()))
ana = []
dp = [0] * (N+2)
for i in range(B):
ana.append(int(eval(input())))
mod = 1000000007
dp[N] = 1
for i in reversed(list(range(N))):
if len(ana) >= 1 and i == ana[-1]:
dp[i] = 0
if len(ana) != 0:
ana.pop(-1)
continue
dp[i] = dp[i + 1] + dp[i + 2]
print((dp[0] % mod))
|
p03013
|
#3問目
NM = input().split()
N,M = int(NM[0]), int(NM[1])
A = []
dp = [0] * (N+1)
dp[0] = 1
dp[1] = 1
MOD = 1000000007
for _ in range(M):
A.append(int(eval(input())))
if(1 in A):
dp[1] = 0
for i in range(2, N+1):
#貰うdp
if(i in A):
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] = dp[i] % MOD
print((dp[N]))
|
N, M = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(M)])
INF = 1000000007
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, N + 1):
if i in a:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print((dp[N]))
|
p03013
|
n,m = list(map(int,input().split()))
a = [int(eval(input())) for x in range(m)]
mod = 1000000007
dp = [0] * (n+1)
dp[0] = 1 #0段目へ行く移動方法は1通りしかない
if 1 not in a:#もし階段がぶっ壊れてるリストに1段目が入っていないならば1段目へ行く移動方法は1通り、そうでないなら0通り
dp[1] = 1
else:
dp[1] = 0
for i in range(2,n+1):#2段目から調べていく
if i in a:#現在のi段目がぶっ壊れリストに含まれてるなら何もせず飛ばす
continue
dp[i] = dp[i-1] + dp[i-2]#フィボナッチで処理
dp[i] %= mod#modで割っていく
print((dp[n]))#n+1番目を出力する
|
N, M = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(M)])
INF = 1000000007
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, N + 1):
if i in a:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print((dp[N]))
|
p03013
|
n,m = list(map(int,input().split()))
a = []
for i in range(m):
A = int(eval(input()))
a.append(A)
mod = 1000000007
dp = [0] * (n+1)
dp[0] = 1#0段目へ行く移動方法は1通りしかない
if 1 not in a:#もし階段がぶっ壊れてるリストに1段目が入っていないならば1段目へ行く移動方法は1通り、そうでないなら0通り
dp[1] = 1
else:
dp[1] = 0
for i in range(2,n+1):#2段目から調べていく
if i in a:#現在のi段目がぶっ壊れリストに含まれてるなら何もせず飛ばす
continue
dp[i] = dp[i-1] + dp[i-2]#フィボナッチで処理
dp[i] %= mod#modで割っていく
print((dp[n]))#n+1番目を出力する
|
n,m = list(map(int,input().split()))
a = set([int(eval(input())) for _ in range(m)])
mod = 1000000007
dp = [0] * (n+1)
dp[0] = 1#0段目へ行く移動方法は1通りしかない
if 1 not in a:#もし階段がぶっ壊れてるリストに1段目が入っていないならば1段目へ行く移動方法は1通り、そうでないなら0通り
dp[1] = 1
else:
dp[1] = 0
for i in range(2,n+1):#2段目から調べていく
if i in a:#現在のi段目がぶっ壊れリストに含まれてるなら何もせず飛ばす
continue
dp[i] = dp[i-1] + dp[i-2]#フィボナッチで処理
dp[i] %= mod#modで割っていく
print((dp[n]))#n+1番目を出力する
|
p03013
|
n, m = list(map(int, input().split()))
a = list(int(eval(input())) for _ in range(m))
for i in range(m-1):
if m == 1:
break
if a[i+1] - a[i] == 1:
print((0))
exit()
dp = [0] * (n+1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(2, n+1):
if i in a:
continue
dp[i] = dp[i-1] + dp[i - 2]
dp[i] %= 1000000007
print((dp[n]))
|
n, m = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(m)])
dp = [0] * (n+1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(2, n+1):
if i in a:
continue
dp[i] = dp[i-1] + dp[i - 2]
dp[i] %= 1000000007
print((dp[n]))
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input()))for i in range(M)]
MOD = 10 ** 9 + 7
ans = []
dp = [1] * N
for i in range(N):
if (i + 1) in a:
dp[i] = 0
elif i == 0:
dp[i] = 1
elif i == 1 and dp[0] == 1:
dp[i] = 2
elif i == 1 and dp[0] == 0:
dp[i] = 1
else:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[N-1] % MOD))
|
N, M = list(map(int, input().split()))
a = [int(eval(input()))for i in range(M)]
MOD = 10 ** 9 + 7
ans = []
dp = [1] * (N + 1)
for i in a:
dp[i] = 0
for i in range(2, N + 1):
if dp[i] != 0:
dp[i] = (dp[i - 1] + dp[i - 2])
print((dp[N] % MOD))
|
p03013
|
N,M = list(map(int, input().split()))
ng = set()
for i in range(M):
ng.add(int(eval(input())))
dp = [0] * (N + 5)
dp[0] = 1
for i in range(N):
for j in range(1, 3):
if (i + j) not in ng:
dp[i + j] += dp[i]
dp[i + j] %= 1000000007
print((dp[N]))
|
N,M = list(map(int, input().split()))
ng = set()
for i in range(M):
ng.add(int(eval(input())))
dp = [0] * (N + 5)
dp[0] = 1
for i in range(N):
if i + 1 not in ng:
dp[i + 1] += dp[i]
dp[i + 1] %= 1000000007
if i + 2 not in ng:
dp[i + 2] += dp[i]
dp[i + 2] %= 1000000007
print((dp[N]))
|
p03013
|
# -*- coding: utf-8 -*-
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
inf=float("inf")
fib_memo = [-inf for i in range(n+1)]
fib_memo[0] = 1
if 1 in a:
fib_memo[1]=0
else:
fib_memo[1]=1
if 1 in [a[i] - a[i-1] for i in range(1,m)]:
print((0))
import sys
sys.exit()
else:
cur_fib_i = 2
while cur_fib_i <= n:
if cur_fib_i in a:
fib_memo[cur_fib_i]=0
else:
fib_memo[cur_fib_i] = fib_memo[cur_fib_i-1] + fib_memo[cur_fib_i-2]
cur_fib_i += 1
print((fib_memo[n]%1000000007))
#print(fib_memo)
|
# -*- coding: utf-8 -*-
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
inf=float("inf")
fib_memo = [-inf for i in range(n+1)]
fib_memo[0] = 1
if 1 in a:
fib_memo[1]=0
else:
fib_memo[1]=1
for i in a:
fib_memo[i]=0
if 1 in [a[i] - a[i-1] for i in range(1,m)]:
print((0))
import sys
sys.exit()
else:
cur_fib_i = 2
while cur_fib_i <= n:
if fib_memo[cur_fib_i]==0:
pass
else:
fib_memo[cur_fib_i] = fib_memo[cur_fib_i-1] + fib_memo[cur_fib_i-2]
cur_fib_i += 1
print((fib_memo[n]%1000000007))
#print(fib_memo)
|
p03013
|
mod = 1000000007
n,m = list(map(int, input().split(" ")))
a = [int(eval(input())) for i in range(m)]
ans = [0]*(n+1)
ans[0] = 1
for j in range(1,n+1):
if j in a:
ans[j] = 0
else:
ans[j] = ans[j-1] + ans[j-2]
ans[j] = ans[j]%mod
print((ans[-1]))
|
mod = 1000000007
n,m = list(map(int, input().split(" ")))
a = set([int(eval(input())) for i in range(m)])
ans = [0]*(n+1)
ans[0] = 1
for j in range(1,n+1):
if j in a:
ans[j] = 0
else:
ans[j] = (ans[j-1] + ans[j-2])%mod
print((ans[-1]))
|
p03013
|
import math
N,M = list(map(int,input().split()))
a = [-1]
for i in range(M):
a.append(int(eval(input())))
a.append(N+1)
b = []
c = []
fac_N =[1]
for i in range(M+1):
b.append(a[i+1]-a[i]-2)
for i in range(1,max(b)+1):
fac_N.append(fac_N[-1]*i)
for i in range(len(b)):
counter= 0
for num2 in range(b[i]//2+1):
counter += fac_N[num2+(b[i]-2*num2)]//fac_N[num2]//fac_N[b[i]-2*num2]
c.append(counter)
ans = 1
for i in range(len(c)):
ans *= c[i]
print((ans%1000000007))
|
import math
N,M = list(map(int,input().split()))
a = [-1]
for i in range(M):
a.append(int(eval(input())))
a.append(N+1)
b = []
c = []
fac_N =[1]
for i in range(M+1):
b.append(a[i+1]-a[i]-2)
for i in range(1,max(b)+1):
fac_N.append(fac_N[-1]*i)
for i in range(len(b)):
counter= 0
for num2 in range(b[i]//2+1):
counter += fac_N[num2+(b[i]-2*num2)]//fac_N[num2]//fac_N[b[i]-2*num2]%1000000007
c.append(counter)
ans = 1
for i in range(len(c)):
ans *= c[i]%1000000007
print((ans%1000000007))
|
p03013
|
import math
N,M = list(map(int,input().split()))
a = [-1]
for i in range(M):
a.append(int(eval(input())))
a.append(N+1)
b = []
c = []
fac_N =[1]
for i in range(M+1):
b.append(a[i+1]-a[i]-2)
for i in range(1,max(b)+1):
fac_N.append(fac_N[-1]*i)
for i in range(len(b)):
counter= 0
for num2 in range(b[i]//2+1):
bi = b[i]-2*num2
counter += fac_N[num2+bi]//fac_N[num2]//fac_N[bi]%1000000007
c.append(counter)
ans = 1
for i in range(len(c)):
ans *= c[i]%1000000007
print((ans%1000000007))
|
import math
N,M = list(map(int,input().split()))
a = [-1]
for i in range(M):
a.append(int(eval(input())))
a.append(N+1)
b = []
c = []
fac_N =[1]
ans = 1
for i in range(M+1):
b.append(a[i+1]-a[i]-2)
for i in range(1,max(b)+1):
fac_N.append(fac_N[-1]*i)
for i in range(len(b)):
counter= 0
for num2 in range(b[i]//2+1):
bi = b[i]-2*num2
counter += fac_N[num2+bi]//fac_N[num2]//fac_N[bi]
ans*=counter%1000000007
print((ans%1000000007))
|
p03013
|
import math
N,M = list(map(int,input().split()))
a = [-1]
for i in range(M):
a.append(int(eval(input())))
a.append(N+1)
b = []
c = []
fac_N =[1]
ans = 1
for i in range(M+1):
b.append(a[i+1]-a[i]-2)
for i in range(1,max(b)+1):
fac_N.append(fac_N[-1]*i)
for i in range(len(b)):
counter= 0
for num2 in range(b[i]//2+1):
bi = b[i]-2*num2
counter += fac_N[num2+bi]//fac_N[num2]//fac_N[bi]
ans*=counter%1000000007
print((ans%1000000007))
|
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(M)]
a2 = 1
a1 = 0 if 1 in A else 1
for i in range(2,N+1):
if i in A:
a = 0
a2 = a1
a1 = a
else:
a = a2+a1
a2 = a1
a1 = a
print((1 if N == 1 else a%1000000007))
|
p03013
|
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
dp[i] = 0
else:
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD
print((dp[N]))
|
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
dp = [[0, 0] for _ in range(N + 1)]
dp[0][0] = 1
for _ in range(M):
x = int(eval(input()))
dp[x][1] = 1
for i in range(1, N + 1):
if dp[i][1] == 0:
dp[i][0] = (dp[i - 2][0] + dp[i - 1][0]) % MOD
print((dp[N][0]))
|
p03013
|
n,m=list(map(int,input().split()))
a=[]
for _ in range(m):
a.append(int(eval(input())))
ans=1
a.sort()
d={0:1,1:1,2:2,3:3,4:5,5:8,6:13,99500:49759705584609,99501:49760296517401}
def func(n):
if n in d:
return d[n]
else:
v = (func(n-1)+func(n-2))%(10**9+7)
d[n]=v
return v
ps=-1
a.append(n+1)
for ai in a:
c=ai-ps-2
ps=ai
if c<0:
print((0))
exit()
c=func(c)
ans*=c
ans%=10**9+7
print((ans%(10**9+7)))
|
n,m=list(map(int,input().split()))
dp=[1]*n
mod=10**9+7
for i in range(m):
a=int(eval(input()))
dp[a-1]=0
ans=[]
ans.append(1 if dp[0]==1 else 0)
if len(dp)>1 and dp[0]==1 and dp[1]==1:
ans.append(2)
elif len(dp)>1 and dp[0]==1 and dp[1]==0:
ans.append(0)
elif len(dp)>1 and dp[0]==0 and dp[1]==1:
ans.append(1)
elif len(dp)>1 and dp[0]==0 and dp[1]==0:
print((0))
exit()
for i in range(2,n):
ans.append((ans[i-1]+ans[i-2])*dp[i]%mod)
print((ans[-1]%mod))
|
p03013
|
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ng = list([int(eval(input())) for _ in range(M)])
ans = [0, 1]
for i in range(1, N+1):
if i in ng:
ans.append(0)
else:
ans.append((ans[-2] + ans[-1]) % MOD)
print((ans[-1] % MOD))
|
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
ng = set([int(eval(input())) for _ in range(M)])
ans = [0, 1]
for i in range(1, N+1):
if i in ng:
ans.append(0)
else:
ans.append((ans[-2] + ans[-1]) % MOD)
print((ans[-1] % MOD))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10**9+7
step = [0] * (n+1)
step[0] = 1
step[1] = 1
for i in range(n+1):
if i == 0 or i == 1:
if i in a:
step[i] = 0
else:
step[i] = step[i-1] + step[i-2]
if i in a:
step[i] = 0
step[i] %= MOD
print((step[-1]))
|
n, m = list(map(int, input().split()))
a = [0]*(n+1)
for j in range(m):
pos = int(eval(input()))
a[pos] = 1
MOD = 10**9+7
step = [0] * (n+1)
step[0] = 1
step[1] = 1
for i in range(n+1):
if a[i] == 1:
step[i] = 0
else:
if i != 0 and i != 1:
step[i] = (step[i-1] + step[i-2]) % MOD
print((step[-1]))
|
p03013
|
#4
#1 3 1 1
G, N = [int(_) for _ in input().split(" ")]
ret = ()
for i in range(N):
ret += (int(eval(input())),)
T = [0]*(G+1)
T[0] = 1
T[1] = 1
if 1 in ret:
T[1] = 0
for i in range(2, G+1):
if i in ret:
T[i] = 0
continue
T[i] = (T[i-1] + T[i-2]) % 1000000007
print((T[G]))
|
G, N = [int(_) for _ in input().split(" ")]
ret = ()
T = [-1]*(G+1)
T[0] = 1
T[1] = 1
for i in range(N):
t = int(eval(input()))
T[t] = 0
for i in range(2, G+1):
if T[i] == -1:
T[i] = (T[i-1] + T[i-2]) % 1000000007
print((T[G]))
|
p03013
|
# n = int(sys.stdin.readline())
# a, b = map(int, sys.stdin.readline().split())
# c = list(map(int, sys.stdin.readline().split()))
# s = [list(map(int,list(sys.stdin.readline()))) for i in range(h)] # 二次元配列入力 二次元マップみたいな入力のとき
# a = 100
# b = 0.987654321
# print('{0:06d}-{1:6f}'.format(a,b)) # 0埋め, 小数点出力桁指定時のときの出力
# 000100-0.987654
import math
import sys
import itertools
import queue
mod = 1000000007
if __name__ == "__main__":
N, M = list(map(int, sys.stdin.readline().split()))
broken = [int(sys.stdin.readline()) for _ in range(M)]
dp = [0 for _ in range(N + 2)]
dp[N] = 1
for i in range(0, N)[::-1]:
if i not in broken:
dp[i] = dp[i + 1] + dp[i + 2]
print((dp[0] % mod))
|
# n = int(sys.stdin.readline())
# a, b = map(int, sys.stdin.readline().split())
# c = list(map(int, sys.stdin.readline().split()))
# s = [list(map(int,list(sys.stdin.readline()))) for i in range(h)] # 二次元配列入力 二次元マップみたいな入力のとき
# a = 100
# b = 0.987654321
# print('{0:06d}-{1:6f}'.format(a,b)) # 0埋め, 小数点出力桁指定時のときの出力
# 000100-0.987654
import math
import sys
import itertools
import queue
mod = 1000000007
if __name__ == "__main__":
N, M = list(map(int, sys.stdin.readline().split()))
broken = [False for _ in range(N + 2)]
for _ in range(M):
broken[int(sys.stdin.readline())] = True
dp = [0 for _ in range(N + 2)]
dp[N] = 1
for i in range(0, N)[::-1]:
if not broken[i]:
dp[i] = dp[i + 1] + dp[i + 2]
print((dp[0] % mod))
|
p03013
|
import math
mod = 10**9 + 7
import sys
sys.setrecursionlimit(2147483647)
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
pat = [0 for _ in range(N+1)]
pat[0] = 1
if 1 in a :
pat[1] = 0
else :
pat[1] = 1
for i in range(2,N+1) :
if i in a :
pat[i] = 0
else :
pat[i] = (pat[i-1] + pat[i-2])%mod
print((pat[N]))
|
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
mod = 10**9 + 7
pat = [1 for _ in range(N+1)]
for j in a :
pat[j] = 0
for i in range(2,N+1) :
if pat[i] == 0 :
continue
else :
pat[i] = (pat[i-1] + pat[i-2])%mod
print((pat[N]))
|
p03013
|
import sys
sys.setrecursionlimit(10**6)
N,M = list(map(int,input().split()))
A = []
MOD = 10**9+7
memo = {}
for _ in range(M):
A.append(int(eval(input())))
def step(cur):
if cur in memo:
return memo[cur]
if cur == N:
memo[cur] = 1
return memo[cur]
if cur > N or cur in A:
memo[cur] = 0
return memo[cur]
memo[cur] = (step(cur+1) + step(cur+2))%MOD
return memo[cur]
print((step(0)%MOD))
|
N,M = list(map(int,input().split()))
MOD = 10**9+7
dp = [0] * (N+1)
dp[1] = 1
for _ in range(M):
dp[int(eval(input()))] = -1
if N<2:
print((dp[N]))
exit()
if dp[2] != -1:
dp[2] = 1
for i in range(N+1):
if dp[i] == -1: continue
if i-1>=0 and dp[i-1] != -1:
dp[i] += dp[i-1]
if i-2>=0 and dp[i-2] != -1:
dp[i] += dp[i-2]
dp[i] %= MOD
print((dp[N]))
|
p03013
|
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')
N,M = inpl()
alist = list()
for _ in range(M):
alist.append(int(eval(input())))
dp = [0]*(N+1)
dp[0] = 1
if 1 not in alist:
dp[1] = 1
for i in range(2,N+1):
if i <= N and i not in alist:
dp[i] += dp[i-1] + dp[i-2]
print((dp[N]%1000000007))
|
import sys,queue,copy
sys.setrecursionlimit(10**8)
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())
INF = float('inf')
N,M = inpl()
alist = [False for _ in range(N+1)]
for _ in range(M):
alist[int(eval(input()))] = True
dp = [0 for _ in range(N+1)]
dp[0] = 1
if not alist[1]:
dp[1] = 1
for i in range(2,N+1):
if alist[i]:
continue
dp[i] += dp[i-1] + dp[i-2]
print((dp[N]%1000000007))
|
p03013
|
N, M = list(map(int, input().split(" ")))
AL = list(map(int, [eval(input()) for _ in range(M)]))
# DP
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1 if 1 not in AL else 0
divisor = 10 ** 9 + 7
for i in range(2, N + 1):
if i in AL:
continue
dp[i] = (dp[i-1] + dp[i-2]) % divisor
print((dp[N]))
|
N, M = list(map(int, input().split(" ")))
AL = list(map(int, [eval(input()) for _ in range(M)]))
# DP
dp = [1] * (N + 1)
for A in AL:
dp[A] = 0
for i in range(2, N + 1):
if dp[i] == 1:
dp[i] = (dp[i-1] + dp[i-2]) % (10**9 + 7)
print((dp[N]))
|
p03013
|
from sys import stdin
N, M = [int(_) for _ in stdin.readline().rstrip().split()]
A = [int(stdin.readline().rstrip()) for _ in range(M)]
def solve(n):
dp = []
for i in range(n+1):
if i in A:
dp.append(0)
else:
dp.append(1)
for i in range(2, n+1):
if dp[i] == 0:
continue
dp[i] = dp[i-1]+dp[i-2]
return dp[n] % 1000000007
print((solve(N)))
|
from sys import stdin
N, M = [int(_) for _ in stdin.readline().rstrip().split()]
dp = [1 for i in range(N+1)]
MOD = 1000000007
for _ in range(M):
a = int(stdin.readline().rstrip())
dp[a] = 0
for i in range(2, N+1):
if dp[i] == 0:
continue
dp[i] = dp[i-1]+dp[i-2]
print((dp[N] % MOD))
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
a.sort()
a.append(10 ** 9 + 7)
a.append(10 ** 9 + 7)
memo = [0] * (N + 1)
memo[0] = 1
idx = 0
for pos in range(1, N + 1):
if a[idx] == pos:
memo[pos] = 0
for i in range(idx, N):
if a[i] > pos: break
idx = i
continue
else:
if pos > a[idx]:
for i in range(idx, N):
if a[i] > pos: break
idx = i
#
if pos == 1:
memo[1] = (memo[0]) % (10 ** 9 + 7)
else:
memo[pos] = (memo[pos - 2] + memo[pos - 1]) % (10 ** 9 + 7)
# print("#", memo)
print((memo[-1]))
|
# -*- coding: utf-8 -*-
MOD = 1000000007
N, M = list(map(int, input().split()))
a = []
for _ in range(M):
a.append(int(eval(input())))
def getPatternNum(num):
pattern = [0] * (num + 2)
pattern[0] = 0
for i in range(1, num + 2):
if i == 0 or i == 1:
pattern[i] = 1
continue
pattern[i] = (pattern[i - 2] + pattern[i - 1]) % MOD
return pattern
def solve():
# 階段の連続してる数のリスト
stepsList = [0] * (M + 1)
maxSteps = 0
if M > 0:
stepsList[0] = a[0]
for j in range(1, M):
stepsList[j] = a[j] - a[j - 1] - 1
if stepsList[j] == 0:
return 0
stepsList[M] = N - a[M - 1]
else:
stepsList = [N + 1]
pattern = getPatternNum(max(stepsList) + 1)
# こわれてるところ以外のパターンを掛ける
# print("#", pattern)
for k in range(len(stepsList)):
if k == 0:
total = pattern[stepsList[k]]
else:
total = (total * pattern[stepsList[k]]) % MOD
# print("##", k, stepsList[k], pattern[stepsList[k]], total)
return total
ans = solve()
print(ans)
|
p03013
|
n,_,*a=list(map(int,open(0).read().split()))
c,d=1,0
for i in range(n):n=(c+d)%(10**9+7)*(not-~i in set(a));c,d=n,c
print(n)
|
n,_,*a=list(map(int,open(0).read().split()))
a=set(a)
c,d=1,0
for i in range(n):n=(c+d)%(10**9+7)*(not-~i in a);c,d=n,c
print(n)
|
p03013
|
# --*-coding:utf-8-*--
MOD = 1000000007
def f(N, A):
A.append(-1)
a = A.pop(0)
c0 = 0
c1 = 1
for i in range(1, N+1):
c0, c1 = c1, (c0+c1)%MOD
if i == a:
c1 = 0
a = A.pop(0)
return c1
def main():
N,M = list(map(int, input().split()))
A = [int(eval(input())) for i in range(M)]
print((f(N, A)))
if __name__ == '__main__':
main()
|
# --*-coding:utf-8-*--
MOD = 1000000007
def f(N, A):
c0 = 0
c1 = 1
for i in range(1, N+1):
c0, c1 = c1, (c0+c1)%MOD
if i in A:
c1 = 0
return c1
def main():
N,M = list(map(int, input().split()))
A = set(int(eval(input())) for i in range(M))
print((f(N, A)))
if __name__ == '__main__':
main()
|
p03013
|
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
DP = [0] * (n + 1)
DP[0] = 1
for i in range(n):
if i + 1 not in A:
DP[i + 1] += DP[i]
if i + 2 not in A and i + 2 <= n:
DP[i + 2] += DP[i]
print((DP[-1] % 1000000007))
|
n, m = list(map(int, input().split()))
denger = [False] * (n + 1)
for i in range(m):
denger[int(eval(input()))] = True
DP = [0] * (n + 1)
DP[0] = 1
for i in range(n):
if not denger[i + 1]:
DP[i + 1] += DP[i]
if i + 2 <= n and not denger[i + 2]:
DP[i + 2] += DP[i]
print((DP[-1] % 1000000007))
|
p03013
|
N,M = list(map(int,input().split()))
mod=10**9+7
A=[]
for i in range(M):
A +=[int(eval(input()))]
B=[1]
if 1 in A:
B +=[0]
else:
B +=[1]
for i in range(2,N+1):
if i in A:
B +=[0]
else:
B +=[(B[i-1]+B[i-2])%mod]
print((B[-1]%mod))
|
N,M = list(map(int,input().split()))
mod=10**9+7
A = {int(eval(input())) for i in range(M)}
if 1 in A:
x=0
else:
x=1
B=[1,x]
for i in range(2,N+1):
if i in A:
B +=[0]
else:
B +=[(B[i-1]+B[i-2])%mod]
print((B[-1]%mod))
|
p03013
|
n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [0] * (n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[n]))
|
n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [float('inf')] * (n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
dp[i] = min(dp[i], (dp[i-1] + dp[i-2]) % 1000000007)
print((dp[n]))
|
p03013
|
#!/usr/bin/env python
import sys
N, M = list(map(int, input().split()))
A = [int(eval(input())) for i in range(M)]
m = 10**9+7
def Fib(n):
a, b = 0, 1
if n == 1:
return a
elif n == 2:
return b
else:
for i in range(n-2):
a, b = b, a + b
return b
for i, a in enumerate(A[:-1]):
if a+1 == A[i+1]:
print((0))
sys.exit()
ans = 1
s = 0
for i in range(N):
if i in A:
ans *= Fib(i-s+1)
ans %= m
s = i+1
ans *= Fib(N-s+2)
ans %= m
print(ans)
|
#!/usr/bin/env python
N, M = list(map(int, input().split()))
m = 10**9+7
F = [0]*N
for _ in range(M):
F[int(eval(input()))-1] = 1
a, b = 0, 1
for n in range(N):
if F[n]:
a, b = b, 0
else:
a, b = b, (a+b) % m
print(b)
|
p03013
|
n,m=list(map(int,input().split()))
mod=10**9+7
a=[]
for i in range(m):
a.append(int(eval(input())))
aa=set(a)
l=[0 for i in range(n+1)]
l[0]=1
for i in range(n):
if i+1 not in aa:
l[i+1]+=l[i]
l[i+1]=l[i+1]%mod
if i+2 not in aa and i+2<n+1:
l[i+2]+=l[i]
l[i+2]=l[i+2]%mod
print((l[n]))
|
n,m = list(map(int,input().split()))
L = set(int(eval(input())) for _ in range(m))
dp = [0]*(n+1)
mod = 10**9+7
dp[0] = 1
for i in range(n):
if i + 1 not in L:
dp[i+1] += dp[i]
dp[i+1] %= mod
if i+2 not in L and i+2 < n+1 :
dp[i+2] += dp[i]
dp[i+2] %= mod
print((dp[n]))
|
p03013
|
N, M = list(map(int, input().split()))
arr = []
for i in range(M):
arr.append(int(eval(input())))
arr.append(10**10)
dp = [0 for i in range(N+1)]
dp[0] = 1
tmp = 0
if arr[0] == 1:
dp[1] = 0
tmp += 1
else:
dp[1] = 1
for i in range(N-1):
if arr[tmp] == i+2:
dp[i+2] = 0
tmp += 1
continue
dp[i+2] = dp[i+1] + dp[i]
print((dp[N]%(1000000007)))
|
N, M = list(map(int, input().split()))
arr = []
MOD = 1000000007
for i in range(M):
arr.append(int(eval(input())))
arr.append(10**10)
dp = [0 for i in range(N+1)]
dp[0] = 1
tmp = 0
if arr[0] == 1:
dp[1] = 0
tmp += 1
else:
dp[1] = 1
for i in range(N-1):
if arr[tmp] == i+2:
dp[i+2] = 0
tmp += 1
continue
dp[i+2] = (dp[i+1] + dp[i]) % MOD
print((dp[N]))
|
p03013
|
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 1000000007
# DPテーブル
dp = [0]*(N+1)
dp[0] = 1
if 1 not in A: # 1段目が壊れている場合もあるので注意
dp[1] = 1
for i in range(2, N+1):
if i in A: # 壊れている場合
continue
else:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[-1]))
|
N, M = list(map(int, input().split()))
BrokenSteps = [int(eval(input())) for _ in range(M)]
MOD = 1000000007
# DPテーブル
dp = [0]*(N+1)
dp[0] = 1
if 1 not in BrokenSteps: # 1段目が壊れている場合もあるので注意
dp[1] = 1
steps = list(range(2, N+1)) # 0,1段目は計算済みなので2段目以降
NoBrokenSteps = list(set(steps) - set(BrokenSteps))
for i in NoBrokenSteps:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[-1]))
|
p03013
|
n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [0]*(n+1)
dp[0] = 1
for i in range(1, n+1):
dp[i] = (dp[i-1]+dp[i-2]) % (10**9+7)
if i in a:
dp[i] = 0
print((dp[n]))
|
n,m=list(map(int,input().split()))
a=set([int(eval(input())) for i in range(m)])
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in a:dp[i]=0
print((dp[n]))
|
p03013
|
MOD = 1000000007
N, M = list(map(int, input().split()))
a_list = set()
for _ in range(M):
a_list.add(int(eval(input())))
#print(a_list)
counts = [0] * (N + 3)
counts[0] = 1
for i in range(N):
if not i in a_list:
counts[i + 1] = (counts[i + 1] + counts[i]) % MOD
counts[i + 2] = (counts[i + 2] + counts[i]) % MOD
#print(counts)
print((counts[N]))
|
MOD = 1000000007
N, M = list(map(int, input().split()))
a_list = set()
for _ in range(M):
a_list.add(int(eval(input())))
#print(a_list)
counts = [0] * (N + 10)
counts[0] = 1
for i in range(N):
if not i in a_list:
counts[i + 1] = (counts[i + 1] + counts[i]) % MOD
counts[i + 2] = (counts[i + 2] + counts[i]) % MOD
#print(counts)
print((counts[N]))
|
p03013
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
l=[1]+[0 for _ in range(n+5)]
for x in range(n):
if not x in a:
l[x+1]+=l[x]
l[x+2]+=l[x]
print((l[n]%(10**9+7)))
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
l=[1]+[0 for _ in range(n+5)]
if m==0:a=[200000]
for x in range(n):
if x<a[0]:
l[x+1]+=l[x]
l[x+2]+=l[x]
if x==a[0]:
if len(a)>=2:a.pop(0)
else:a[0]=200000
print((l[n]%(10**9+7)))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
dp = [0] * (n + 1)
dp[0] = 1 if 0 not in a else 0
dp[1] = 1 if 1 not in a else 0
for i in range(2, n + 1):
if i in a:
dp[i] = 0
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[n]))
|
n, m = list(map(int, input().split()))
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1
for i in [int(eval(input())) for _ in range(m)]:
dp[i] = -1
for i in range(n + 1):
if i < 2:
if dp[i] == -1:
dp[i] = 0
else:
if dp[i] == -1:
dp[i] = 0
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[n]))
|
p03013
|
def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
a = [int(input().rstrip('\n')) for _ in range(m)]
dp = [0] * (n + 1)
dp[0] = 1 if 0 not in a else 0
dp[1] = 1 if 1 not in a else 0
for i in range(2, n + 1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2]) % (10 ** 9 + 7)
else:
dp[i] = 0
print((dp[-1]))
if __name__ == '__main__':
slove()
|
def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
a = dict([[int(input().rstrip('\n')), 0] for i in range(m)])
dp = [0] * (n + 1)
dp[0] = 1 if 0 not in a else 0
dp[1] = 1 if 1 not in a else 0
for i in range(2, n + 1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2]) % (10 ** 9 + 7)
else:
dp[i] = 0
print((dp[-1]))
if __name__ == '__main__':
slove()
|
p03013
|
def slove():
import sys
input = sys.stdin.readline
n, m = list(map(int, input().rstrip('\n').split()))
a = dict([[int(input().rstrip('\n')), 0] for _ in range(m)])
x = [0] * (n + 1)
x[0] = 1 if 0 not in a else 0
x[1] = 1 if 1 not in a else 0
for i in range(2, n+1):
if i not in a:
x[i] = (x[i-1] + x[i-2]) % 1000000007
else:
x[i] = 0
print((x[-1]))
if __name__ == '__main__':
slove()
|
def slove():
import sys
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, m = list(map(int, input().rstrip('\n').split()))
a = {int(input().rstrip('\n')): 0 for _ in range(m)}
dp = [0] * (n + 1)
dp[0] = 1 if 0 not in a else 0
dp[1] = 1 if 1 not in a else 0
for i in range(2, n + 1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2]) % mod
else:
dp[i] = 0
print((dp[-1]))
if __name__ == '__main__':
slove()
|
p03013
|
n, m = list(map(int, input().split()))
a = [ int(eval(input())) for _ in range(m) ]
dp = [0]*n
for i in range(n):
if not i+1 in a:
if i == 0:
dp[i] = 1
elif i == 1:
dp[i] = 1 + dp[i-1]
else:
dp[i] = dp[i-2] + dp[i-1]
if dp[i] >= 1000000007:
dp[i] %= 1000000007
print((dp[n-1]%1000000007))
|
n, m = list(map(int, input().split()))
A = [ int(eval(input())) for _ in range(m) ]
dp = [0]*(n+1)
broken = [False]*(n+1)
for i in A:
broken[i] = True
dp[0] = 1
if not broken[1]:
dp[1] = 1
for i in range(2, n+1):
if broken[i]:
continue
else:
dp[i] = dp[i-2] + dp[i-1]
print((dp[n]%(10**9+7)))
|
p03013
|
# -*- coding: utf-8 -*-
n,m=list(map(int,input().split()))
a=[]
mod=1000000007
for _ in range(m):
a.append(int(eval(input())))
ans=[1]+[0]*(n)
for i in range(1,n+1):
if i in a:
ans[i]=0
else:
ans[i]=(ans[i-1]+ans[i-2])%mod
print((ans[n]))
|
# -*- coding: utf-8 -*-
n,m=list(map(int,input().split()))
a=[]
mod=1000000007
for _ in range(m):
a.append(int(eval(input())))
a=set(a)
ans=[1]+[0]*(n)
for i in range(1,n+1):
if i in a:
ans[i]=0
else:
ans[i]=(ans[i-1]+ans[i-2])%mod
print((ans[n]))
|
p03013
|
N,M=list(map(int,input().split()))
a=[]
for i in range(M):
a.append(int(eval(input())))
dp=[0]*(N+1)
dp[0]=1
if 1 not in a:
dp[1]=1
for i in range(2,N+1):
if i in a:
continue
dp[i]=(dp[i-1]+dp[i-2])
print((dp[-1]%1000000007))
|
N,M=list(map(int,input().split()))
dp=[1]*(N+1)
for i in range(M):
dp[int(eval(input()))]=0
for i in range(2,N+1):
if dp[i]!=0:
dp[i]=(dp[i-1]+dp[i-2])
print((dp[-1]%1000000007))
|
p03013
|
N,M = list(map(int,input().split()))
A = [int(eval(input())) for m in range(M)]
dp = (N+1)*[0]
dp[0] = 1
for n in range(1,N+1):
if n in A:
dp[n] = 0
else:
dp[n] = (dp[n-2]+dp[n-1])%(10**9+7)
print((dp[-1]))
|
N,M = list(map(int,input().split()))
A = set(int(eval(input())) for m in range(M))
dp = (N+1)*[0]
dp[0] = 1
for n in range(1,N+1):
if n not in A:
dp[n] = (dp[n-2]+dp[n-1])%(10**9+7)
print((dp[-1]))
|
p03013
|
N,M = list(map(int,input().split()))
A = []
MOD = 1000000007
for _ in range(M):
a = int(eval(input()))
A.append(a)
DP = [0]*(N+1)
DP[0] = 1
DP[1] = 1
if 1 in A:
DP[1] = 0
for i in range(1,N):
DP[i+1] = DP[i-1]+DP[i]
if i+1 in A:
DP[i+1] = 0
print((DP[-1]%MOD))
|
N,M = list(map(int,input().split()))
A = []
MOD = 1000000007
for _ in range(M):
a = int(eval(input()))
A.append(a)
DP = [1]*(N+1)
for i in A:
DP[i] = 0
for i in range(2,N+1):
DP[i] = (DP[i-1]+DP[i-2])%MOD*DP[i]
print((DP[-1]))
|
p03013
|
N, M = list(map(int, input().split()))
aset = set([int(eval(input())) for _ in range(M)])
MOD = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 0 if 1 in aset else 1
for i in range(2, N + 1):
if i not in aset:
dp[i] = dp[i - 1] + dp[i - 2]
print((dp[-1] % MOD))
|
N, M = list(map(int, input().split()))
aset = set([int(eval(input())) for _ in range(M)])
dp = [0] * (N + 1)
dp[0] = 1
for i in range(N):
for j in range(i + 1, min(N, i + 2) + 1):
if j not in aset:
dp[j] += dp[i]
dp[j] %= 10**9 + 7
print((dp[N]))
|
p03013
|
N, M = list(map(int, input().split()))
aset = set([int(eval(input())) for _ in range(M)])
dp = [0] * (N + 1)
dp[0] = 1
for i in range(N):
for j in range(i + 1, min(N, i + 2) + 1):
if j not in aset:
dp[j] += dp[i]
dp[j] %= 10**9 + 7
print((dp[N]))
|
N, M = list(map(int, input().split()))
aset = set([int(eval(input())) for _ in range(M)])
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in aset:
dp[1] = 1
for i in range(2, N + 1):
if i in aset:
dp[i] = 0
else:
dp[i] = (dp[i - 1] + dp[i - 2]) % (10**9 + 7)
print((dp[-1]))
|
p03013
|
INF = 1_000_000_007
def comb(n, k):
k = min(n - k, k)
if n == 0 or k == 0:
return 1
a = n
for i in range(n - 1, n - k, -1):
a *= i
b = 1
for i in range(2, k + 1):
b *= i
return a // b
N, M = list(map(int, input().split()))
A = [-1] + [int(eval(input())) for _ in range(M)] + [N + 1]
res = 1
for i in range(M + 1):
t = A[i + 1] - A[i] - 2
if t < 0:
res = 0
else:
_t = 0
for i in range(t // 2 + 1):
_t += comb(t - i, i)
res *= _t
print((res % INF))
|
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
B = [True] * (N + 1)
D = [1] + [0] * N
for _ in range(M):
a = int(eval(input()))
B[a] = False
for i in range(N):
for j in range(i + 1, min(N, i + 2) + 1):
if B[j]:
D[j] = (D[j] + D[i]) % MOD
print((D[N]))
|
p03013
|
import itertools
N,M=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(M)]
def count_step(n):
num=n//2
count=0
for i in range(num+1):
step=[]
for _ in range(n-2*i):
step.append(1)
for _ in range(i):
step.append(2)
count+=len(list(itertools.combinations(step,i)))
return count
if M!=0:
a2=[a[0]-1]
for i in range(M-1):
p=a[i+1]-a[i]-2
a2.append(p)
a2.append(N-a[M-1]-1)
p=1
for i in range(M-1):
if a[i]+1==a[i+1]:
p=0
break
if p==0:
pattern=0
else:
pattern=1
if M==0:
pattern=count_step(N)
else:
for i in range(len(a2)):
pattern*=count_step(a2[i])
print((pattern%1000000007))
|
N,M=list(map(int,input().split()))
a=[0]
for _ in range(M):
a.append(int(eval(input())))
b=[]
num=0
if len(a)>1:
b.append(a[1]-a[0]-1)
for i in range(1,M):
b.append(a[i+1]-a[i]-2)
b.append(N-a[M]-1)
else:
b.append(N)
num=max(b)
mod=1000000007
def fib(n,num):
fib=[0 for i in range(num+10)]
fib[0]=1
fib[1]=1
for i in range(2,num+1):
fib[i]=fib[i-1]+fib[i-2]
return fib[n]
if -1 in b:
print((0))
else:
p=1
for j in range(M+1):
p*=fib(b[j],num)
print((p%mod))
|
p03013
|
from itertools import product
INF = 1000000007
def mat2_mul(X, Y):
z = [[0, 0], [0, 0]]
for (i, j, k) in product(list(range(2)), list(range(2)), list(range(2))):
z[i][j] += X[i][k] * Y[k][j]
return z
def mat2_pow(X, n):
if n == 0:
return [[1, 0], [0, 1]]
elif n % 2:
return mat2_mul(X, mat2_pow(X, n - 1))
else:
half_pow = mat2_pow(X, n / 2)
return mat2_mul(half_pow, half_pow)
def fib(n):
if n == 0:
return 0
else:
f = [[0, 1], [1, 1]]
return mat2_pow(f, n - 1)[1][1]
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
ans, start = 1, 0
tmp = []
for i in range(len(a)):
if a[i] - a[i - 1] == 1:
print((0))
exit()
for k in a:
tmp.append(fib(k - start) % INF)
start = k + 1
for j in tmp:
ans *= j
ans %= INF
ans *= fib(N - start + 1)
print((ans % INF))
|
from itertools import product
INF = 1000000007
def mat2_mul(X, Y):
z = [[0, 0], [0, 0]]
for (i, j, k) in product(list(range(2)), list(range(2)), list(range(2))):
z[i][j] += X[i][k] * Y[k][j]
return z
def mat2_pow(X, n):
if n == 0:
return [[1, 0], [0, 1]]
elif n % 2:
return mat2_mul(X, mat2_pow(X, n - 1))
else:
half_pow = mat2_pow(X, n / 2)
return mat2_mul(half_pow, half_pow)
def fib(n):
if n == 0:
return 0
else:
f = [[0, 1], [1, 1]]
return mat2_pow(f, n - 1)[1][1]
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
ans, start = 1, 0
tmp = []
for i in range(len(a)):
if a[i] - a[i - 1] == 1:
print((0))
exit()
for k in a:
ans *= fib(k - start)
ans %= INF
start = k + 1
ans *= fib(N - start + 1)
print((ans % INF))
|
p03013
|
from itertools import product
INF = 1000000007
def mat2_mul(X, Y):
z = [[0, 0], [0, 0]]
for (i, j, k) in product(list(range(2)), list(range(2)), list(range(2))):
z[i][j] += X[i][k] * Y[k][j]
return z
def mat2_pow(X, n):
if n == 0:
return [[1, 0], [0, 1]]
elif n % 2:
return mat2_mul(X, mat2_pow(X, n - 1))
else:
half_pow = mat2_pow(X, n / 2)
return mat2_mul(half_pow, half_pow)
def fib(n):
if n == 0:
return 0
else:
f = [[0, 1], [1, 1]]
return mat2_pow(f, n - 1)[1][1]
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
ans, start = 1, 0
tmp = []
for i in range(len(a)):
if a[i] - a[i - 1] == 1:
print((0))
exit()
for k in a:
ans *= fib(k - start)
ans %= INF
start = k + 1
ans *= fib(N - start + 1)
print((ans % INF))
|
from itertools import product
INF = 1000000007
def mat2_mul(X, Y):
z = [[0, 0], [0, 0]]
for (i, j, k) in product(list(range(2)), list(range(2)), list(range(2))):
z[i][j] += X[i][k] * Y[k][j]
return z
def mat2_pow(X, n):
if n == 0:
return [[1, 0], [0, 1]]
elif n % 2:
return mat2_mul(X, mat2_pow(X, n - 1))
else:
half_pow = mat2_pow(X, n / 2)
return mat2_mul(half_pow, half_pow)
def fib(n):
if n == 0:
return 0
else:
f = [[0, 1], [1, 1]]
return mat2_pow(f, n - 1)[1][1]
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
ans, start = 1, 0
tmp = []
for k in a:
ans *= fib(k - start)
ans %= INF
start = k + 1
ans *= fib(N - start + 1)
print((ans % INF))
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
INF = 1000000007
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, N + 1):
if i in a:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print((dp[N]))
|
N, M = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(M)])
INF = 1000000007
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2, N + 1):
if i in a:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= INF
print((dp[N]))
|
p03013
|
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a_=int(eval(input()))
a.append(a_)
dp=[0]*(n+1)
dp[0]=1
if 1 in a:
dp[1]=0
else:
dp[1]=1
for i in range(2,n+1):
if i in a:
dp[i]=0
continue
dp[i]=dp[i-1]+dp[i-2]
#print(dp)
print((dp[n]%(1000000007)))
|
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a_=int(eval(input()))
a.append(a_)
dp=[-1]*(n+1)
dp[0]=1
dp[1]=1
for i in a:
dp[i]=0
for i in range(2,n+1):
if dp[i]==-1:
dp[i]=dp[i-1]+dp[i-2]
#print(dp)
print((dp[n]%(1000000007)))
|
p03013
|
import math
from collections import deque
memo = deque([1, 2])
floor = 1
def search(x):
global memo, floor
while x > floor:
memo.append(memo[-1] + memo[-2])
floor += 1
return memo[x-1]
CONST = 1000000007
n,m = list(map(int,input().split()))
lis = []
prev = -1
for _ in range(m):
a = int(eval(input()))
if prev + 1 == a:
print((0))
exit()
lis.append(a-prev-2)
prev = a
lis.append(n-prev-1)
ans = 1
for v in lis:
if v == 0: continue
ans = (ans * search(v)) % CONST
print(ans)
|
from collections import deque
CONST = 1000000007
n,m = list(map(int,input().split()))
lis = deque([int(eval(input())) for _ in range(m)])
lis.append(n+1)
nhole = lis.popleft()
memo = deque([0, 1])
for i in range(1,n+1):
if i == nhole:
memo.append(0)
nhole = lis.popleft()
else:
memo.append((memo[-1] + memo[-2])%CONST)
print((memo[-1]))
|
p03013
|
N,M=list(map(int,input().split()))
a=[int(eval(input())) for i in range(M)]
dp=[0]*(N+1)
dp[0]=1
dp[1]=0 if 1 in a else 1
mod=10**9+7
for i in range(2,N+1):
if i in a:
continue
else:
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[N]))
|
N,M=list(map(int,input().split()))
dp=[0]*(N+3)
dp[0]=1
a=[0]*(N+3)
for i in range(M):
a[int(eval(input()))]=1
mod=10**9+7
for i in range(N+1):
if a[i+1] != 1:
dp[i+1]+=dp[i]
dp[i+1]%=mod
if a[i+2] != 1:
dp[i+2]+=dp[i]
dp[i+2]%=mod
print((dp[N]))
|
p03013
|
N,M=list(map(int,input().split()))
dp=[0]*(N+3)
dp[0]=1
a=[0]*(N+3)
for i in range(M):
a[int(eval(input()))]=1
mod=10**9+7
for i in range(N+1):
if a[i+1] != 1:
dp[i+1]+=dp[i]
dp[i+1]%=mod
if a[i+2] != 1:
dp[i+2]+=dp[i]
dp[i+2]%=mod
print((dp[N]))
|
N,M=list(map(int,input().split()))
a=[int(eval(input())) for i in range(M)]
tf=[0]*(N+1)
for i in a:
tf[i]=1
dp=[0]*(N+1)
dp[0]=1
dp[1]=0 if 1 in a else 1
mod=10**9+7
for i in range(2,N+1):
if tf[i] == 1:
continue
else:
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[N]))
|
p03013
|
import sys
n,m = list(map(int,input().split()))
t = [0] * 2
t[0] = 1
t[1] = 2
a = []
for _ in range(m):
a.append(int(eval(input())))
mod = 10**9 + 7
for i in range(1,m):
if a[i] - a[i-1] == 1:
print((0))
sys.exit()
a.append(n+1)
l = []
dan = 0
for i in range(m+1):
l.append(a[i]-1-dan)
dan = a[i] + 1
if dan == n+2:
break
if max(l) > 2:
for i in range(2,max(l)):
t.append(t[i-1] + t[i-2])
ans = 1
for i in l:
if i != 0 and t[i-1] != 0:
ans *= t[i-1]
ans %= mod
print(ans)
|
import sys
n,m = list(map(int,input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
if n == 1:
print((1))
sys.exit()
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1
dp[2] = 2
if m == 0:
for i in range(2,n+1):
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%(10**9+7)))
else:
c = 0
for i in range(1,n+1):
if i == a[c]:
dp[i] = 0
if c < m-1:
c += 1
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%(10**9+7)))
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for i in range(M)]
MOD = 10 ** 9 + 7
dp = [1]
if 1 in a:
dp.append(0)
else:
dp.append(1)
for ith_stair in range(2, N + 1):
if ith_stair in a:
dp.append(0)
else:
dp.append((dp[ith_stair - 1] + dp[ith_stair - 2]) % MOD)
print((dp[N] % MOD))
|
N, M = list(map(int, input().split()))
a = set([int(eval(input())) for i in range(M)])
MOD = 10 ** 9 + 7
dp = [1]
if 1 in a:
dp.append(0)
else:
dp.append(1)
for ith_stair in range(2, N + 1):
if ith_stair in a:
dp.append(0)
else:
dp.append((dp[ith_stair - 1] + dp[ith_stair - 2]) % MOD)
print((dp[N] % MOD))
|
p03013
|
#python3
MOD = int(1e9+7)
def main():
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
broken = [0]*(n+1)
for i in a:
broken[i] = 1;
dp = [0]*(n+2)
dp[n] = 1
for i in reversed(list(range(n))):
if broken[i]:
dp[i] = 0;
continue;
dp[i] = (dp[i+1] + dp[i+2]) % MOD
print((dp[0]))
main()
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N, M, *a = list(map(int, read().split()))
A = set()
P = (10**9)+7
for i in a:
A.add(i)
dp = [0 for _ in range(N+1)]
dp[0] = 1
if not (1 in A):
dp[1] = 1
for i in range(2, N+1):
if i in A:
continue
else:
dp[i] = (dp[i-1] + dp[i-2])%P
print((dp[N]))
if __name__ == '__main__':
main()
|
p03013
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N, M, *a = list(map(int, read().split()))
A = set()
P = (10**9)+7
for i in a:
A.add(i)
dp = [0 for _ in range(N+1)]
dp[0] = 1
if not (1 in A):
dp[1] = 1
for i in range(2, N+1):
if i in A:
continue
else:
dp[i] = (dp[i-1] + dp[i-2])%P
print((dp[N]))
if __name__ == '__main__':
main()
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def main():
N, M, *a = list(map(int, read().split()))
A = {i for i in a}
P = (10**9)+7
dp = [0]*(N+1)
dp[0] = 1
if not (1 in A):
dp[1] = 1
for i in range(2, N+1):
if i in A:
continue
else:
dp[i] = (dp[i-1] + dp[i-2])%P
print((dp[N]))
if __name__ == '__main__':
main()
|
p03013
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in a:
dp[i]=0
print((dp[n]))
|
n,m=list(map(int,input().split()))
a=set([int(eval(input())) for i in range(m)])
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in a:
dp[i]=0
print((dp[n]))
|
p03013
|
n, m = list(map(int, input().split()))
broken = [0] * (n+1)
dp = [0] * (n+1)
for _ in range(m):
broken[int(eval(input()))] = 1
if broken[-1] == 1 and broken[-2] == 1:
print((0))
exit()
dp[0] = 1
if broken[1] == 1:
dp[1] = 0
else:
dp[1] = 1
if n == 1:
print((dp[n]))
exit()
else:
for i in range(2, n+1):
if broken[i] == 1:
continue
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[n]))
|
n, m = list(map(int, input().split()))
dp = [0] * (n+1)
broken = [0] * (n+1)
for i in range(m):
broken[int(eval(input()))] = 1
dp[0] = 1
if broken[1] == 1:
dp[1] = 0
else:
dp[1] = 1
if n == 1:
print((dp[n]))
exit()
else:
for i in range(2, n+1):
if broken[i] == 1:
continue
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[n]))
|
p03013
|
from operator import mul
from functools import reduce
def cmb(n,r):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
def sumcmb(T):
count=0
m=T
while m>=0:
count+=cmb(T,m)
T-=1
m-=2
count%=mod
return(count)
N,M=list(map(int,input().split()))
A=[int(eval(input())) for i in range(M)]
mod=10**9+7
for i in range(M-1):
if A[i]+1==A[i+1]:
print((0))
exit()
if 1 not in A:
A.insert(0,-1)
if N not in A:
A.append(N+1)
count=1
for i in range(len(A)-1):
T=max(A[i+1]-1 - (A[i]+1),1)
#print(sumcmb(T))
count*=sumcmb(T)
count%=mod
print(count)
|
N,M=list(map(int,input().split()))
mod=10**9+7
A=set([int(eval(input())) for i in range(M)])
data=[0 for i in range(N)]
if 1 not in A:
data[0]=1
if N>=2:
if 2 not in A:
data[1]=1+data[0]
for i in range(2,N):
if i+1 not in A:
data[i]=data[i-1]+data[i-2]
data[i]%=mod
#print(data)
print((data[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
if m > n // 2:
print((0))
else:
dp = [0] * (n+1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
for i in range(2, n+1):
if i not in a:
dp[i] = dp[i-1] + dp[i-2]
print((dp[-1]%(10 ** 9 + 7)))
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
l = [1] * (n+1)
for j in a:
l[j] = 0
x = 10 ** 9 + 7
if m > n // 2:
print((0))
else:
dp = [0] * (n+1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
for i in range(2, n+1):
if l[i]:
dp[i] = (dp[i-1] + dp[i-2]) % x
print((dp[-1]))
|
p03013
|
mod = 10**9+7
n, m = list(map(int, input().split()))
stairs = [0]*(n+1)
broken = []
stairs[0] = 1
for i in range(m):
b = int(eval(input()))
if broken and b-1 == broken[-1]:
print((0))
exit(0)
broken.append(b)
for i in range(n+1):
if i in broken:
continue
if i >= 2:
stairs[i] = stairs[i-1] + stairs[i-2]
elif i == 1:
stairs[i] = stairs[i-1]
print((stairs[-1]%mod))
|
mod = 10**9+7
n, m = list(map(int, input().split()))
stairs = [0]*(n+1)
broken = []
stairs[0] = 1
def binSearch(broken, e):
l, r = 0, m-1
while l <= r:
mid = (l+r)//2
if broken[mid] > e:
r = mid - 1
elif broken[mid] < e:
l = mid + 1
else:
return True
return False
for i in range(m):
b = int(eval(input()))
if broken and b-1 == broken[-1]:
print((0))
exit(0)
broken.append(b)
for i in range(n+1):
if binSearch(broken, i):
continue
if i >= 2:
stairs[i] = stairs[i-1] + stairs[i-2]
elif i == 1:
stairs[i] = stairs[i-1]
print((stairs[-1]%mod))
|
p03013
|
N,M=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(M)]
dp=[0]*(N+1)
dp[0]=1
for i in range(1,N+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in A:
dp[i]=0
print((dp[N]))
|
N,M=list(map(int,input().split()))
A=set([int(eval(input())) for _ in range(M)])
dp=[0]*(N+1)
dp[0]=1
for i in range(1,N+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in A:
dp[i]=0
print((dp[N]))
|
p03013
|
N, M=list(map(int, input().split()))
mod=10**9+7
pre=-1
hole=[]
for i in range(M):
a=int(eval(input()))
hole.append(a-1-pre)
pre=a
hole.append(N-pre)
dp=[0]*(N+3)
dp[1]=1
dp[2]=1
for i in range(3,N+3):
dp[i]=(dp[i-1]+dp[i-2])%mod
#print(dp)
#print(hole)
ans=1
for h in hole:
ans*=dp[h]
ans%=mod
print(ans)
|
N, M=list(map(int, input().split()))
mod=10**9+7
pre=-1
hole=[]
for i in range(M):
a=int(eval(input()))
hole.append(a-1-pre)
pre=a
hole.append(N-pre)
dp=[0]*(N+3)
dp[1]=1
dp[2]=1
for i in range(3,N+3):
dp[i]=(dp[i-1]+dp[i-2])%mod
if len(hole)==1:
print((dp[N+1]))
exit()
#print(dp)
#print(hole)
ans=1
for h in hole:
ans*=dp[h]
ans%=mod
print(ans)
|
p03013
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
N, M = list(map(int, input().split()))
dp = [0 for i in range(N+1)]
dp[0] = 1
dp[1] = 1
for i in range(2,N+1):
dp[i] = dp[i-1] + dp[i-2]
ans = 1
a = -1
for i in range(M):
b = int(eval(input()))
c = b - a - 2
if c < 0:
print((0))
sys.exit()
else:
ans = (ans * dp[c]) % mod
a = b
ans = (ans * dp[N-a-1]) % mod
print(ans)
|
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF = float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353
N, M = list(map(int, input().split()))
a = set()
for i in range(M):
a.add(int(eval(input())))
dp = [0 for i in range(N+1)]
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2,N+1):
if i not in a:
dp[i] = (dp[i-1] + dp[i-2]) % mod
else:
dp[i] = 0
print((dp[N] % mod))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10**9+7
INF = -1
dp = [INF]*(n+1)
if n == 1:
if 1 in a:
print((0))
else:
print((1))
exit()
dp[0] = dp[1] = 1
if 0 in a:
dp[0] = INF
if 1 in a:
dp[1] = INF
for i in range(2, n+1):
if i in a:
dp[i] = INF
continue
if dp[i-1] == INF and dp[i-2] == INF:
break
elif dp[i-1] == INF or dp[i-2] == INF:
dp[i] = max(dp[i-1], dp[i-2])
else:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= MOD
print((dp[n] if dp[n] != INF else 0))
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10**9+7
INF = MOD-1
dp = [INF]*(n+1)
if n == 1:
if 1 in a:
print((0))
else:
print((1))
exit()
dp[0] = dp[1] = 1
if 0 in a:
dp[0] = INF
if 1 in a:
dp[1] = INF
for x in a:
dp[x] = 0
for i in range(2, n+1):
if dp[i] == 0:
continue
if dp[i-1] == INF and dp[i-2] == INF:
break
elif dp[i-1] == INF or dp[i-2] == INF:
dp[i] = max(dp[i-1], dp[i-2])
else:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= MOD
print((dp[n] if dp[n] != INF else 0))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10**9+7
INF = MOD-1
dp = [INF]*(n+1)
if n == 1:
if 1 in a:
print((0))
else:
print((1))
exit()
dp[0] = dp[1] = 1
for x in a:
dp[x] = 0
for i in range(2, n+1):
if dp[i] == 0:
continue
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= MOD
print((dp[n] if dp[n] != INF else 0))
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10**9+7
INF = MOD-1
dp = [INF]*(n+1)
dp[0] = dp[1] = 1
for x in a:
dp[x] = 0
for i in range(2, n+1):
if dp[i] == 0:
continue
dp[i] = (dp[i-1]+dp[i-2]) % MOD
print((dp[n] if dp[n] != INF else 0))
|
p03013
|
OK = "O"
BRO = "B"
MOD = 1000000007
N,M=list(map(int, input().split()))
Broken=[int(eval(input())) for i in range(M)]
K = "".join(list(BRO if i in Broken else OK for i in range(N+1)))
dp=[0 for i in range(N+1)]
dp[0]=1
for i in range(N):
for j in range(i+1,min(i+2+1,N+1)):
if K[j]==OK:
dp[j]+=dp[i]
dp[j]%=MOD
print((dp[N]))
|
OK = 0
BRO = 1
MOD = 1000000007
N,M=list(map(int, input().split()))
Broken=[int(eval(input())) for i in range(M)]
#K = "".join(list(BRO if i in Broken else OK for i in range(N+1)))
K = list(0 for i in range(N+1))
for i in range(M):
K[Broken[i]] = 1
dp=[0 for i in range(N+1)]
dp[0]=1
for i in range(N):
for j in range(i+1,min(i+2+1,N+1)):
if K[j]==OK:
dp[j]+=dp[i]
dp[j]%=MOD
print((dp[N]))
|
p03013
|
OK = 0
BRO = 1
MOD = 1000000007
N,M=list(map(int, input().split()))
Broken=[int(eval(input())) for i in range(M)]
#K = "".join(list(BRO if i in Broken else OK for i in range(N+1)))
K = list(0 for i in range(N+1))
for i in range(M):
K[Broken[i]] = 1
dp=[0 for i in range(N+1)]
dp[0]=1
for i in range(N):
for j in range(i+1,min(i+2+1,N+1)):
if K[j]==OK:
dp[j]+=dp[i]
dp[j]%=MOD
print((dp[N]))
|
OK = 0
BRO = 1
N,M=list(map(int, input().split()))
Broken=[int(eval(input())) for i in range(M)]
#K = "".join(list(BRO if i in Broken else OK for i in range(N+1)))
K = list(0 for i in range(N+1))
for i in range(M):
K[Broken[i]] = 1
if N == 1:
print((1))
exit()
c=[0 for i in range(N+1)]
if K[N-1]==OK:
c[1]=1
if K[N-2]==OK and K[N-1]==OK:
c[2]=2
if K[N-2]==OK and K[N-1]==BRO:
c[2]=1
for i in range(3,N+1):
if K[N-i]==OK:
if K[N-i+1]==OK and K[N-i+2]==OK:
c[i]=c[i-1]+c[i-2]
if K[N-i+1]==OK and K[N-i+2]==BRO:
c[i]=c[i-1]
if K[N-i+1]==BRO and K[N-i+2]==OK:
c[i]=c[i-2]
c[i]%=1000000007
print((c[N] % 1000000007))
|
p03013
|
N, M = list(map(int, input().split()))
lista = []
for m in range(M):
am = int(eval(input()))
lista. append(am)
an = 0
an1 = 1
for n in range(N):
if n+1 in lista:
an, an1 = an1, 0
else:
an, an1 = an1, (an+an1)%1000000007
print(an1)
|
N, M = list(map(int, input().split()))
lista = []
for m in range(M):
am = int(eval(input()))
lista.append(am)
lista.append(0)
an = 0
an1 = 1
for n in range(N):
if n+1 == lista[0]:
del lista[0]
#print(lista)
an, an1 = an1, 0
else:
an, an1 = an1, (an+an1)%1000000007
print(an1)
|
p03013
|
N , M = (int(a) for a in input().split())
stair = [1]
brake = []
for i in range(1 , M+1) :
a = int(eval(input()))
brake.append(a)
for i in range(1, N+1) :
if i in brake :
stair.append(0)
elif i == 1 :
stair.append(1)
else : stair.append((stair[i-1] + stair[i-2]) % (10**9+7))
print((stair[N]))
|
N , M = (int(a) for a in input().split())
stair = [1]*(N+1)
for i in range(1 , M+1) :
a = int(eval(input()))
stair[a] = 0
for i in range(2, N+1) :
stair[i] *= (stair[i-1] + stair[i-2]) % (10**9+7)
print((stair[N]))
|
p03013
|
from sys import stdin
INF = int(1e9+7)
def modadd(a, b):
# aとbを足した値をmodする(a + b mod p)
return (a + b) % INF
def main():
lines = stdin.readlines()
N = int(lines[0].split()[0])
M = [True] * (N + 1)
for i in map(int, lines[1:]):
M[i] = False
dp = [0] * (N + 1)
dp[0] = 1
for cur in range(N + 1):
for i in range(cur + 1, min(cur + 2, N) + 1):
if M[i]:
dp[i] = modadd(dp[cur], dp[i])
print((dp[N]))
return
main()
|
from sys import stdin
INF = int(1e9+7)
def modadd(a, b):
# aとbを足した値をmodする(a + b mod p)
return (a + b) % INF
def main():
lines = stdin.readlines()
N = int(lines[0].split()[0])
M = [True] * (N + 1)
for i in map(int, lines[1:]):
M[i] = False
dp = [0] * (N + 1)
dp[:2] = 1, 1 if M[1] else 0
for i in range(2, N + 1):
if M[i]:
dp[i] = modadd(dp[i - 1], dp[i - 2])
print((dp[N]))
return
main()
|
p03013
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.