input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
import sys
sys.setrecursionlimit(500000)
def f(i):
if dp[i] != -1 and dp[i] != 0: return dp[i]
if dp[i] == -1: return 0
if i == -1:
return f(i - 1)
elif i > 1:
dp[i] = f(i - 1) + f(i - 2)
else:
dp[i] = f(i - 1)
return dp[i]
n,m = list(map(int,input().split()))
dp = [0]*(n+1)
ary = [int(eval(input())) for _ in range(m)]
dp[0] = 1
for i in ary:
dp[i] = -1
if dp[i-1] == -1 and dp[i] == -1:print((0));exit()
print((f(n)%(10**9+7)))
|
n,m = list(map(int,input().split()))
dp = [0]*(n+1)
for i in range(m):
x = int(eval(input()))
dp[x] = -1
dp[0] = 1
for i in range(1,n+1):
if dp[i] == -1:continue
elif dp[i-1] == -1:dp[i] = dp[i-2]
elif dp[i-2] == -1:dp[i] = dp[i-1]
elif i > 1:
dp[i] = dp[i-2]+dp[i-1]
else:dp[i] = dp[i-1]
print((dp[n]%(10**9+7) if dp[n] != -1 else 0))
|
p03013
|
n, m = list(map(int, input().split(' ')))
arr = set()
for _ in range(m):
x = int(eval(input()))
arr.add(x)
MOD = int(1e9) + 7
w = [0 for _ in range(n + 1)]
w[0] = 1
for i in range(1, n+1):
if i in arr:
continue
if i - 1 >= 0 and i - 1 not in arr:
w[i] += w[i-1]
if i - 2 >= 0 and i - 2 not in arr:
w[i] += w[i-2]
w[i] %= MOD
# print(w)
print((w[n]))
|
n, m = list(map(int, input().split(' ')))
arr = set()
for _ in range(m):
x = int(eval(input()))
arr.add(x)
MOD = int(1e9) + 7
w = [0 for _ in range(n + 1)]
if 0 not in arr:
w[0] = 1
for i in range(n + 1):
if i in arr:
continue
if i - 1 >= 0 and i - 1 not in arr:
w[i] += w[i-1]
if i - 2 >= 0 and i - 2 not in arr:
w[i] += w[i-2]
w[i] %= MOD
print((w[n]))
|
p03013
|
mod=10**9+7
n,m=list(map(int,input().split()))
dp=[0]*(n+1)
dp[0]=1
a=[int(eval(input())) for _ in range(m)]
if 0 in a:
print((0))
exit()
for i in range(n):
if i+1 not in a:
dp[i+1]+=dp[i]
dp[i+1]%=mod
if i+2<=n and i+2 not in a:
dp[i+2]+=dp[i]
dp[i+1]%=mod
print((dp[-1]%mod))
|
N,M = list(map(int,input().split()))
A = set([int(eval(input())) for i in range(M)])
MOD = 10**9+7
if 0 in A:
print((0))
exit()
dp = [0]*(N+1)
dp[0] = 1
for i in range(N):
if i+1 not in A:
dp[i+1] += dp[i]
dp[i+1] %= MOD
if i+2 <= N and i+2 not in A:
dp[i+2] += dp[i]
dp[i+2] %= MOD
print((dp[-1]))
|
p03013
|
N,M = list(map(int,input().split()))
A = set([int(eval(input())) for i in range(M)])
MOD = 10**9+7
if 0 in A:
print((0))
exit()
dp = [0]*(N+1)
dp[0] = 1
for i in range(N):
if i+1 not in A:
dp[i+1] += dp[i]
dp[i+1] %= MOD
if i+2 <= N and i+2 not in A:
dp[i+2] += dp[i]
dp[i+2] %= MOD
print((dp[-1]))
|
N,M = list(map(int,input().split()))
A = set([int(eval(input())) for i in range(M)])
MOD = 10**9+7
dp = [0]*(N+1)
dp[0] = 1
for i in range(N):
if i+1 not in A:
dp[i+1] += dp[i]
dp[i+1] %= MOD
if i+2 <= N and i+2 not in A:
dp[i+2] += dp[i]
dp[i+2] %= MOD
print((dp[-1]%MOD))
|
p03013
|
N,M=list(map(int,input().split()))
a=list(int(eval(input())) for _ in range(M) )
ans=0
ansn1=0
ansn2=0
mod=1000000007
for i in range(N):
if i>=2 and i+1 not in a:
ans=(ansn1+ansn2)%mod
ansn2 = ansn1
ansn1=ans
continue
elif i+1 in a:
ans = 0
ansn2 = ansn1
ansn1 = ans
continue
if i==0:
if i+1 not in a:
ans=1
ansn2 = 0
ansn1=ans
elif i==1:
if i+1 not in a:
ans=1+ansn1
ansn2 = ansn1
ansn1=ans
else:
ans=0
ansn2=ansn1
ansn1=ans
print(ans)
|
N,M=list(map(int,input().split()))
a=list(int(eval(input()))for _ in range(M))
L=[1 for i in range(N+1)]
dp=[0 for _ in range(N+1)]
#L[0]=0
dp[0]=1
mod=1000000007
for j in a:
L[j]=0
for i in range(1,N+1):
if i>=2:
dp[i]=(dp[i-1]*L[i-1]+dp[i-2]*L[i-2])*L[i]
elif i==1:
dp[i]=1
dp[i]%=mod
print((dp[N]))
|
p03013
|
n, m = list(map(int, input().split()))
a_list=[]
for index in range(m):
a_list.append(int(eval(input())))
ans_list=[]
for index in range(n + 1):
ans_list.append(0)
for index in range(n + 1):
if index == 0:
ans_list[index] += 1
continue
if index == 1 and (index not in a_list):
ans_list[index] += ans_list[index - 1]
continue
if index not in a_list:
if (index - 1) not in a_list:
ans_list[index] += ans_list[index - 1]
ans_list[index] %= 1000000007
if (index - 2) not in a_list:
ans_list[index] += ans_list[index - 2]
ans_list[index] %= 1000000007
print((ans_list[n]))
|
n, m = list(map(int, input().split()))
a_set=set()
for index in range(m):
a_set.add(int(eval(input())))
ans_list=[]
for index in range(n + 1):
ans_list.append(0)
for index in range(n + 1):
if index == 0:
ans_list[index] += 1
continue
if index == 1 and (index not in a_set):
ans_list[index] += ans_list[index - 1]
continue
if index not in a_set:
if (index - 1) not in a_set:
ans_list[index] += ans_list[index - 1]
ans_list[index] %= 1000000007
if (index - 2) not in a_set:
ans_list[index] += ans_list[index - 2]
ans_list[index] %= 1000000007
print((ans_list[n]))
|
p03013
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a_list = []
for index in range(m):
a_list.append(int(eval(input())))
ans_list = []
ans_list = [0] * (n + 1)
for index in range(n + 1):
if index == 0:
ans_list[index] += 1
continue
if index == 1 and (index not in a_list):
ans_list[index] += ans_list[index - 1]
continue
if index not in a_list:
if (index - 1) not in a_list:
ans_list[index] += ans_list[index - 1]
ans_list[index] %= 1000000007
if (index - 2) not in a_list:
ans_list[index] += ans_list[index - 2]
ans_list[index] %= 1000000007
print((ans_list[n]))
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a_set = {int(eval(input())) for _ in range(m)}
ans_list = []
ans_list = [0] * (n + 1)
for index in range(n + 1):
if index == 0:
ans_list[index] += 1
continue
if index == 1 and (index not in a_set):
ans_list[index] += ans_list[index - 1]
continue
if index not in a_set:
if (index - 1) not in a_set:
ans_list[index] += ans_list[index - 1]
ans_list[index] %= 1000000007
if (index - 2) not in a_set:
ans_list[index] += ans_list[index - 2]
ans_list[index] %= 1000000007
print((ans_list[n]))
|
p03013
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a_set = {int(eval(input())) for _ in range(m)}
ans_list = []
ans_list = [0] * (n + 1)
for index in range(n + 1):
if index == 0:
ans_list[index] += 1
continue
if index == 1 and (index not in a_set):
ans_list[index] += ans_list[index - 1]
continue
if index not in a_set:
if (index - 1) not in a_set:
ans_list[index] += ans_list[index - 1]
ans_list[index] %= 1000000007
if (index - 2) not in a_set:
ans_list[index] += ans_list[index - 2]
ans_list[index] %= 1000000007
print((ans_list[n]))
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
a = {int(eval(input())) for _ in range(m)}
count = 0
stair = [0] * (n + 1)
for index, value in enumerate(stair):
if index == 0:
stair[index] = 1
continue
if index == 1:
if index - 1 not in a:
stair[index] += stair[index-1]
continue
if index - 1 not in a:
stair[index] += stair[index - 1]
stair[index] %= 1000000007
if index - 2 not in a:
stair[index] += stair[index - 2]
stair[index] %= 1000000007
print((stair[len(stair) - 1]))
|
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[:2] = 1, 1 if 1 not in a else 0
for i in range(2, N+1):
if not i in a:
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1]))
|
mod = 10**9+7
N, M = list(map(int, input().split()))
a = set(int(eval(input())) for _ in range(M))
dp = [0] * (N + 1)
dp[:2] = 1, 1 if 1 not in a else 0
for i in range(2, N+1):
# in listでは間に合わない
if not i in a:
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 _ in range(m)]
dp = [0] * (n + 1)
dp[0] = 1
mod = 10**9+7
for i in range(1,n+1):
if i in a:
dp[i] = 0
elif i == 1:
dp[i] = 1
else:
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1]))
|
n,m = list(map(int,input().split()))
a = set([int(eval(input())) for _ in range(m)])
dp = [0] * (n + 1)
dp[0] = 1
mod = 10**9+7
for i in range(1,n+1):
if i in a:
dp[i] = 0
elif i == 1:
dp[i] = 1
else:
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1]))
|
p03013
|
n,m = list(map(int,input().split()))
a = set([int(eval(input())) for _ in range(m)])
dp = [0] * (n + 1)
dp[0] = 1
mod = 10**9+7
for i in range(1,n+1):
if i in a:
dp[i] = 0
elif i == 1:
dp[i] = 1
else:
dp[i] = (dp[i-1] + dp[i-2]) % mod
print((dp[-1]))
|
n,m = list(map(int,input().split()))
a = set([int(eval(input())) for _ in range(m)])
mod = 10 ** 9 + 7
dp = [float("inf")] * (n+1)
dp[0] = 1
for i in range(1,n+1):
if i in a:
dp[i] = 0
elif i < 2:
dp[i] = i
else:
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)]
p,q=(0,1)
#累積和っぽい考え
for i in range(1, n+1):
p,q = q,(p+q)*(not i in a)
print((q%(10**9+7)))
|
n, m = list(map(int,input().split()))
a = set([int(eval(input())) for i in range(m)])
p,q=(0,1)
#累積和っぽい考え
for i in range(1, n+1):
p,q = q,(p+q)*(not i in a)
print((q%(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
for i in range(-1, N - 1):
if i + 2 in A:
dp[i + 2] = 0
elif i + 2 == 1:
dp[i + 2] = dp[i + 1]
else:
dp[i + 2] = (dp[i + 1] + dp[i]) % (10 ** 9 + 7)
print((dp[-1]))
|
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
B = [-1] + A + [N + 1]
B = [B[i + 1] - B[i] - 2 for i in range(M + 1)]
total = max(B)
dp = [1, 1] + [0] * (total - 1)
for i in range(total - 1):
dp[i + 2] = (dp[i + 1] + dp[i]) % (10 ** 9 + 7)
ans = 1
for i in range(M + 1):
ans *= dp[B[i]]
ans %= 10 ** 9 + 7
print((ans if -1 not in B[1:] else 0))
|
p03013
|
n, m = list(map(int, input().split()))
a = [0]*m
for _ in range(m):
a[_] = int(eval(input()))
s = [1]*(n+1)
if 1 in a:
s[1] = 0
for i in range(2,n+1):
if i in a:
s[i] = 0
continue
s[i] = (s[i-1] + s[i-2]) % (10**9+7)
print((s[-1]))
|
n, m = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(m)])
s = [1]*(n+1)
if 1 in a:
s[1] = 0
for i in range(n-1):
if i+2 in a:
s[i+2] = 0
continue
s[i+2] = (s[i+1] + s[i]) % (10**9+7)
print((s[-1]))
|
p03013
|
N,M=(int(x) for x in input().split())
a=[int(eval(input())) for i in range(M)]
x=[0]*(N+1)
if len(x)!=0:
x[0]=1
if len(x) >0:
x[1]=1 if not 1 in a else 0
for i in range(2,N+1):
if not i in a:
x[i]=x[i-1]+x[i-2]
else:
x[i]=0
print((int(x[N]%(1000000007))))
|
N,M=(int(x) for x in input().split())
a=[int(eval(input())) for i in range(M)]
x=[0]*(N+1)
j=0
if N!=0:
x[0]=1
if N>1 and M!= 0 and a[0]==1:
j+=1
else:
x[1]=1
for i in range(2,N+1):
if j==M or i!=a[j]:
x[i]=x[i-1]+x[i-2]
else:
x[i]=0
j+=1
print((int(x[N]%(1000000007))))
|
p03013
|
n, m = list(map(int, input().split()))
mod = 1000000007
a = [True] * (n + 1)
for i in range(m):
a[int(eval(input()))] = False
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = dp[0] if a[1] else 0
for i in range(2, n + 1):
if a[i]:
dp[i] = (dp[i - 1] + dp[i - 2]) % mod
print((dp[n]))
|
import sys
n, m = list(map(int,input().split()))
mod = 1000000007
a = [True] * (n + 1)
for i in range(m):
a[int(sys.stdin.readline())] = False
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = dp[0] if a[1] else 0
for i in range(2, n + 1):
if a[i]:
dp[i] = (dp[i - 1] + dp[i - 2]) % mod
print((dp[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 in A:
dp[1] = 0
else:
dp[1] = 1
div = 1000000007
for i in range(2,N+1):
if (dp[i-1] == 0) & (dp[i-2]==0):
print((0))
exit()
elif i in A:
continue
else:
dp[i] = dp[i-1]+dp[i-2]
print((dp[N]%div))
|
N, M = list(map(int, input().split()))
A = []
for i in range(M):
A.append(int(eval(input())))
A = set(A)
dp = [0] * (N+1)
dp[0] = 1
if 1 in A:
dp[1] = 0
else:
dp[1] = 1
mod = 1000000007
for i in range(2,N+1):
if (dp[i-1] == 0) & (dp[i-2]==0):
print((0))
exit()
elif i in A:
continue
else:
dp[i] = dp[i-1]+dp[i-2]
print((dp[N]%mod))
|
p03013
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
n, m = list(map(int, readline().split()))
a = list(map(int, read().split()))
dp = [0] * (n + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
cnt = 0
for i in range(2, n + 1):
if i not in a:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
cnt = 0
else:
cnt += 1
if cnt == 2:
print('0')
exit()
print((dp[n]))
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
MOD = 10**9+7
n, m = list(map(int, readline().split()))
a = set(map(int, read().split()))
dp = [0] * (n + 1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
cnt = 0
for i in range(2, n + 1):
if i not in a:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
cnt = 0
else:
cnt += 1
if cnt == 2:
print('0')
exit()
print((dp[n]))
|
p03013
|
N, M = list(map(int, input().split()))
lst_a = [int(eval(input())) for _ in range(M)]
MOD = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 0 if 1 in lst_a else 1
for i in range(2, N+1):
dp[i] = 0 if i in lst_a else dp[i-1] + dp[i-2]
dp[i] %= MOD
ans = dp[N] % MOD
print(ans)
|
N, M = list(map(int, input().split()))
set_a = 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 set_a else 1
for i in range(2, N+1):
dp[i] = 0 if i in set_a else dp[i-1] + dp[i-2]
ans = dp[N] % MOD
print(ans)
|
p03013
|
import sys
input=sys.stdin.readline
def main():
n,m=list(map(int,input().split()))
a=tuple(int(eval(input())) for _ in range(m))
mod=10**9+7
pattern=[0]*(n+1)
pattern[0]=pattern[1]=1
if 1 in a:
pattern[1]=0
for i in range(2,n+1):
if i in a:
pattern[i]=0
else:
pattern[i]=(pattern[i-1]+pattern[i-2])%mod
print((pattern[n]))
main()
|
import sys
input=sys.stdin.readline
def main():
n,m=list(map(int,input().split()))
a=tuple(int(eval(input())) for _ in range(m))
a=set(a)
mod=10**9+7
pattern=[0]*(n+1)
pattern[0]=pattern[1]=1
if 1 in a:
pattern[1]=0
for i in range(2,n+1):
if i in a:
pattern[i]=0
else:
pattern[i]=(pattern[i-1]+pattern[i-2])%mod
print((pattern[n]))
main()
|
p03013
|
import sys
sys.setrecursionlimit(10 ** 6)
n, m = [int(i) for i in input().split()]
fibo_l = [1] + [0] * n
a = [int(eval(input())) for i in range(m)]
for i in a:
fibo_l[i] = None
def fibo(x):
if x >= 0 and fibo_l[x] is not None:
if fibo_l[x] == 0:
fibo_l[x] = fibo(x-1) % 1000000007 + fibo(x-2) % 1000000007
return fibo_l[x]
else: return 0
print((fibo(n) % 1000000007))
|
import sys
sys.setrecursionlimit(10 ** 6)
n, m = [int(i) for i in input().split()]
fibo_l = [1] + [None] * n
a = set([int(eval(input())) for i in range(m)])
def fibo(x):
if x not in a and x >= 0:
if fibo_l[x] is None:
fibo_l[x] = fibo(x-1) % 1000000007 + fibo(x-2) % 1000000007
return fibo_l[x]
else: return 0
print((fibo(n) % 1000000007))
|
p03013
|
import sys
sys.setrecursionlimit(10**6)
large_p = 10**9 + 7
a = []
kazu_memo = {}
def f(target_step):
global kazu_memo
#print(target_step)
if target_step in a:
return 0
elif target_step < 0:
return 0
elif target_step == 0:
return 1
else:
if kazu_memo[target_step] > 0:
return kazu_memo[target_step]
else:
kazu_tmp = 0
kazu_tmp += f(target_step - 1)
kazu_tmp += f(target_step - 2)
kazu_memo[target_step] = kazu_tmp % large_p
return kazu_tmp % large_p
def main():
global a, kazu_memo
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
kazu_memo = {e: -1 for e in range(1, n + 1)}
r = f(n)
print((r % large_p))
if __name__ == '__main__':
main()
|
import sys
sys.setrecursionlimit(10**6)
large_p = 10**9 + 7
a = []
kazu_memo = {}
kazu_tmp = 0
def f(target_step):
global kazu_memo, kazu_tmp
#print(target_step)
if target_step < 0:
return 0
else:
if kazu_memo[target_step] >= 0:
return kazu_memo[target_step]
else:
kazu_tmp = (f(target_step - 1) + f(target_step - 2)) % large_p
kazu_memo[target_step] = kazu_tmp
return kazu_tmp
def main():
global a, kazu_memo
n, m = list(map(int, input().split()))
kazu_memo = {e: -1 for e in range(0, n + 1)}
kazu_memo[0] = 1
for _ in range(m):
ta = int(eval(input()))
kazu_memo[ta] = 0
r = f(n)
print((r % large_p))
if __name__ == '__main__':
main()
|
p03013
|
mod = 1000000007
n, m = list(map(int, input().split()))
dat_m = []
dp = []
for i in range(n + 1):
dp.append([0] * (n + 1))
for i in range(m):
dat_m.append(int(eval(input())))
dp[0][0] = 1
#print(dp[0][0])
for i in range(1, n + 1):
#dp[i][:i-1] = dp[i-1][:i - 1]
dp[i][i-1] = dp[i - 1][i - 1]
dp[i][i] = dp[i - 1][i - 1]
if i > 1:
dp[i][i] += dp[i - 1][i - 2]
dp[i][i-2] = dp[i - 1][i - 2]
if i in dat_m:
dp[i][i] = 0
dp[i][i] = dp[i][i] % mod
import pprint
print((dp[n][n]))
#pprint.pprint(dp)
|
mod = 1000000007
n, m = list(map(int, input().split()))
dat_m = []
dp = [0] * (n + 1)
for i in range(m):
dat_m.append(int(eval(input())))
dp[0] = 1
for i in range(1, n + 1):
#print(dp)
dp[i] = dp[i - 1]
if i > 1:
dp[i] += dp[i - 2]
if i in dat_m:
dp[i] = 0
dp[i] = dp[i] % mod
#import pprint
print((dp[n]))
#pprint.pprint(dp)
|
p03013
|
mod = 1000000007
import collections
n, m = list(map(int, input().split()))
dat_m = []
dp = collections.deque([])
for i in range(m):
dat_m.append(int(eval(input())))
dp.append(1)
for i in range(1, n + 1):
t = 0
t = dp[i - 1]
if i > 1:
t += dp[i - 2]
if i in dat_m:
t = 0
t = t % mod
dp.append(t)
print((dp[n]))
|
mod = 1000000007
n, m = list(map(int, input().split()))
dat_m = []
dp = [0] * (n + 1)
for i in range(m):
t = int(eval(input()))
dp[t] = -1
dp[0] = 1
for i in range(1, n + 1):
if dp[i] == -1:
dp[i] = 0
continue
dp[i] = dp[i - 1]
if i > 1:
dp[i] += dp[i - 2]
if i in dat_m:
dp[i] = 0
dp[i] = dp[i] % mod
print((dp[n]))
|
p03013
|
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
Broken = [0] * (N + 2)
for i in range(M):
ai = int(eval(input()))
Broken[ai] = 1
dp = [0] * (N + 1)
dp[0] = 1
for i in range(N):
if (Broken[i + 1] == 0) and (i + 1) <= N:
dp[i + 1] += dp[i]
dp[i + 1] %= MOD
if (Broken[i + 2] == 0) and (i + 2) <= N:
dp[i + 2] += dp[i]
dp[i + 2] %= MOD
print((dp[N] % MOD))
|
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
Broken = [0] * (N + 100)
for i in range(M):
ai = int(eval(input()))
Broken[ai] = 1
dp = [0] * (N + 100)
dp[0] = 1
for i in range(N):
if (Broken[i + 1] == 0) and (i + 1 <= N):
dp[i + 1] += dp[i]
dp[i + 1] %= MOD
if (Broken[i + 2] == 0) and (i + 2 <= N):
dp[i + 2] += dp[i]
dp[i + 2] %= MOD
print((dp[N] % MOD))
|
p03013
|
import sys
input=sys.stdin.readline
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
dp[1] = 0 if 1 in a else 1
for i in range(2,n+1):
if i in a:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%(10**9+7)))
|
import sys
input=sys.stdin.readline
n,m = list(map(int, input().split()))
a = {}
for i in range(m):
a[int(eval(input()))] = 0
dp = [0]*(n+1)
dp[0] = 1
dp[1] = 0 if 1 in a else 1
for i in range(2,n+1):
if i in a:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%(10**9+7)))
|
p03013
|
n, m = list(map(int, input().split()))
s = set(map(int, [eval(input()) for _ in range(m)]))
MOD = 10 ** 9 + 7
a = 1 if not 0 in s else 0
b = 1 if not 1 in s else 0
for i in range(2, n + 1):
if i in s:
a, b = b, 0
else:
a, b = b, (a + b) % MOD
print(b)
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
s = set(map(int, [eval(input()) for _ in range(m)]))
MOD = 10 ** 9 + 7
a = 1 if not 0 in s else 0
b = 1 if not 1 in s else 0
for i in range(2, n + 1):
if i in s:
a, b = b, 0
else:
a, b = b, (a + b) % MOD
print(b)
|
p03013
|
# ABC129C - Typical Stairs
import sys
input = sys.stdin.readline
def main():
n, m = tuple(map(int, input().split()))
A = set(map(int, [eval(input()) for _ in range(m)]))
MOD = 10 ** 9 + 7
a, b = 1, 1 if not 1 in A else 0
for i in range(2, n + 1):
if i in A:
a, b = b, 0
else:
a, b = b, (a + b) % MOD
print(b)
if __name__ == "__main__":
main()
|
# ABC129C - Typical Stairs
import sys
input = sys.stdin.readline
def main():
N, M = tuple(map(int, input().split()))
A = set(map(int, [eval(input()) for _ in range(M)]))
MOD = 10 ** 9 + 7
dp = [0] * (N + 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]) % MOD
print((dp[-1]))
if __name__ == "__main__":
main()
|
p03013
|
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
if any([abs(A[i+1] - A[i] == 1) for i in range(len(A)-1)]):
print((0))
exit()
mod = pow(10, 9) + 7
dp = [0] * (N+1+2)
dp[0] = 1
if 1 not in A:
dp[1] = 1
for i in range(2, N+1):
if i not in A:
if i-1 not in A:
dp[i] = (dp[i] + dp[i-1]) % mod
if i-2 not in A:
dp[i] = (dp[i] + dp[i-2]) % mod
print((dp[N]))
|
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
if any([abs(A[i+1] - A[i] == 1) for i in range(len(A)-1)]):
print((0))
exit()
is_ok = [True] * (N+1)
for a in A:
is_ok[a] = False
mod = pow(10, 9) + 7
dp = [0] * (N+1+2)
dp[0] = 1
if is_ok[1]:
dp[1] = 1
for i in range(2, N+1):
if is_ok[i]:
if is_ok[i-1]:
dp[i] = (dp[i] + dp[i-1]) % mod
if is_ok[i-2]:
dp[i] = (dp[i] + dp[i-2]) % mod
print((dp[N]))
|
p03013
|
# -*- coding: utf-8 -*-
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
INF = 10 ** 9 + 7
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]))
|
# -*- coding: utf-8 -*-
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
|
#!/usr/bin/env python
# coding: utf-8
# In[15]:
from collections import deque
# In[9]:
N,M = list(map(int, input().split()))
alist = []
for _ in range(M):
alist.append(int(eval(input())))
# In[31]:
dp = deque([0]*2)
dp[0] = 1
ans = 0
mod = 1000000007
if N == 1:
ans = 1
else:
if 1 in alist:
dp[1] = 0
else:
dp[1] = 1
for i in range(2,N+1):
if i in alist:
dp.append(0)
else:
dp.append((dp[0] + dp[1])%mod)
dp.popleft()
ans = dp[-1]
print(ans)
# In[ ]:
|
#!/usr/bin/env python
# coding: utf-8
# In[15]:
from collections import deque
# In[38]:
N,M = list(map(int, input().split()))
alist = [False]*N
for _ in range(M):
alist[int(eval(input()))-1] = True
# In[41]:
dp = deque([0]*2)
dp[0] = 1
ans = 0
mod = 10**9+7
if N == 1:
ans = 1
else:
if alist[0]:
dp[1] = 0
else:
dp[1] = 1
for i in range(2,N+1):
if alist[i-1]:
dp.append(0)
else:
dp.append((dp[0]+dp[1])%mod)
dp.popleft()
ans = dp[-1]
print(ans)
# In[ ]:
|
p03013
|
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
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 not in a:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[-1]))
|
n, m = list(map(int, input().split()))
a = [0] * (n + 1)
for _ in range(m):
a[int(eval(input()))] = True
MOD = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
if not a[1]:
dp[1] = 1
for i in range(2, n + 1):
if not a[i]:
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)]
x=(10**9)+7
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]%x))
|
n,m=list(map(int, input().split()))
a=set(int(eval(input())) for i in range(m))
x=(10**9)+7
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)
print((dp[-1]%x))
|
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
|
def inpl():
return list(map(int, input().split()))
MOD = 10**9 + 7
N, M = inpl()
A = [False for i in range(N + 1)]
for i in range(M):
a = int(eval(input()))
A[a] = True
p = 1
pp = 0
ans = 0
for i in range(1, N + 1):
if A[i] is True:
pp = p
p = 0
else:
ans = p + pp
pp = p
p = ans
# print(ans)
print((ans % MOD))
|
def inpl():
return list(map(int, input().split()))
MOD = 10**9 + 7
N, M = inpl()
A = [False for i in range(N + 1)]
for i in range(M):
a = int(eval(input()))
A[a] = True
p = 1
pp = 0
ans = 0
for i in range(1, N + 1):
if A[i] is True:
pp = p
p = 0
else:
ans = (p + pp) % MOD
pp = p
p = ans
# print(ans)
print((ans % MOD))
|
p03013
|
N,M=list(map(int, input().split()))
a=[0]*M
for i in range(M):
a[i]=int(eval(input()))
dp=[0]*(N+1)
dp[0]=1
if 1 in a:
dp[1]=0
else:
dp[1]=1
for j in range(2,N+1):
if j in a:
dp[j]=0
else:
dp[j]=dp[j-2]+dp[j-1]
#print(dp)
print((dp[-1]%1000000007))
|
N,M=list(map(int, input().split()))
a=[0]*M
for i in range(M):
a[i]=int(eval(input()))
b=set(a)
dp=[0]*(N+1)
dp[0]=1
if 1 in b:
dp[1]=0
else:
dp[1]=1
for j in range(2,N+1):
if j in b:
dp[j]=0
else:
dp[j]=dp[j-2]+dp[j-1]
#print(dp)
print((dp[-1]%1000000007))
|
p03013
|
inf = 7 + (10 ** 9)
n, m = list(map(int, input().split()))
dp = [0] * (n + 1)
out = []
dp[0] = 1
for _ in range(m):
out.append(int(eval(input())))
for i in range(n):
if ((i + 1) not in out) & (i not in out):
if i < n:
dp[i + 1] = dp[i + 1] + dp[i]
if ((i + 2) not in out) & (i not in out):
if i + 1 < n:
dp[i + 2] = dp[i + 2] + dp[i]
print((dp[-1] % inf))
|
inf = 7 + (10 ** 9)
n, m = list(map(int, input().split()))
dp1 = [0] * (n + 1)
dp1[0] = 1
for _ in range(m):
a = int(eval(input()))
dp1[a] = - inf
for i in range(n):
if i < n:
if (dp1[i + 1] != -inf) & (dp1[i] != -inf):
dp1[i + 1] = dp1[i + 1] + dp1[i]
if i + 1 < n:
if (dp1[i + 2] != -inf) & (dp1[i] != -inf):
dp1[i + 2] = dp1[i + 2] + dp1[i]
print((dp1[-1] % inf))
|
p03013
|
import sys
N,M = list(map(int, input().split()))
a = [int(eval(input())) - 1 for i in range(M)]
memo = [0 for i in range(N)]
for i in range(N):
if i in a:
memo[i] = 0
continue
if i == 0:
memo[i] = 1
continue
if i == 1:
memo[i] = 1 + memo[0]
continue
memo[i] = memo[i-1] + memo[i-2]
print((memo[N-1] % 1000000007))
|
N,M = list(map(int, input().split()))
a = [int(eval(input())) - 1 for i in range(M)]
memo = [0 for i in range(N)]
for i in range(N):
if i in a:
memo[i] = 0
continue
if i == 0:
memo[i] = 1
continue
if i == 1:
memo[i] = 1 + memo[0]
continue
memo[i] = (memo[i-1] + memo[i-2]) % 1000000007
print((memo[N-1]))
|
p03013
|
n,m=[int(i) for i in input().split()]
dp=[1,1] ;a=set() ; mod=(10**9+7)
for i in range(m):
a.add(int(eval(input())))
if 1 in a: dp[1]=0
for i in range(2,n+1):
if i not in a:
dp.append((dp[-1]+dp[-2])%mod)
else:
dp.append(0)
print((dp[-1]))
|
import sys
input = lambda: sys.stdin.readline().rstrip()
n,m=[int(i) for i in input().split()]
dp=[1,1] ;a=set() ; mod=(10**9+7)
for i in range(m):
a.add(int(eval(input())))
if 1 in a: dp[1]=0
for i in range(2,n+1):
if i not in a:
dp.append((dp[-1]+dp[-2])%mod)
else:
dp.append(0)
print((dp[-1]))
|
p03013
|
import sys
sys.setrecursionlimit(1000000000)
input = sys.stdin.readline
N,M = (int(x) for x in input().split())
a = set(int(eval(input())) for _ in range(M))
mem = [0] * N
def count_steps(n):
if mem[n-1]:
return mem[n-1]
elif n - 1 in a and n - 2 in a:
return 0
elif n - 1 in a:
if n > 2:
mem[n-1] = count_steps(n-2)
return mem[n-1]
else:
mem[1] = 1
return 1
elif n - 2 in a:
mem[n-1] = count_steps(n-1)
return mem[n-1]
elif n == 1:
mem[0] = 1
return 1
elif n == 2:
mem[1] = 2
return 2
else:
mem[n-1] = (count_steps(n-1) + count_steps(n-2)) % 1000000007
return mem[n-1]
print((count_steps(N)))
|
N,M = (int(x) for x in input().split())
a = set(int(eval(input())) for _ in range(M))
dp = [0] * N
broke = False
if N == 1:
print('1')
broke = True
elif 1 in a and 2 not in a:
dp[1] = 1
elif 1 not in a and 2 in a:
dp[0] = 1
else:
dp[0] = 1
dp[1] = 2
if 1 in a and 2 in a:
print('0')
broke = True
else:
for i in range(3,N+1):
if i-1 in a and i-2 in a:
print('0')
broke = True
break
elif i-1 in a:
dp[i-1] = dp[i-3]
elif i-2 in a:
dp[i-1] = dp[i-2]
else:
dp[i-1] = (dp[i-2] + dp[i-3]) % 1000000007
if broke == False:
print((dp[N-1]))
|
p03013
|
N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 0 if 0 in A else 1
memo[1] = 0 if 1 in A else 1
for i in range(2, N + 1):
if i in A:
continue
memo[i] = memo[i - 2] + memo[i - 1]
print((memo[N] % 1000000007))
|
N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 1
memo[1] = 0 if 1 in A else 1
if N == 1:
print((memo[1]))
else:
for i in range(2, N + 1):
if i in A:
continue
memo[i] = (memo[i - 2] + memo[i - 1]) % 1000000007
print((memo[N]))
|
p03013
|
N, M = list(map(int, input().split(" ")))
A = {int(eval(input())) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 1
memo[1] = 0 if 1 in A else 1
if N == 1:
print((memo[1]))
else:
for i in range(2, N + 1):
if i in A:
continue
memo[i] = (memo[i - 2] + memo[i - 1]) % 1000000007
print((memo[N]))
|
N, M = list(map(int, input().split(" ")))
A = {int(input()) for _ in range(M)}
memo = [0] * (N + 1)
memo[0] = 1
memo[1] = 0 if 1 in A else 1
if N == 1:
print((memo[1]))
else:
for i in range(2, N + 1):
if i in A:
continue
memo[i] = (memo[i - 2] + memo[i - 1]) % 1000000007
print((memo[N]))
|
p03013
|
while True:
try:
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
if (1 in a):
f = [1, 0]
else:
f = [1, 1]
for i in range(2, N+1):
if i in a:
f.append(0)
else:
f.append((f[i-1] + f[i-2])%1000000007)
print((f[N]))
except:
break
|
mod = 1000000007
while True:
try:
N, M = list(map(int, input().split()))
# check obstacles: O(1)
a = [0] * (N+1)
for _ in range(M):
a[int(eval(input()))] = 1
dp = [0] * (N+1)
dp[0] = 1
dp[1] = 0 if a[1] else 1
for i in range(2, N+1):
if a[i]:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[N] % mod))
except:
break
|
p03013
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
def count(n):
if n < 2:
return 1
return count(n - 1) + count(n - 2)
n, m, *a = list(map(int, open(0).read().split()))
if sum(a[i + 1] == a[i] + 1 for i in range(m - 1)) > 0:
print((0))
exit()
a.append(n + 1)
c = -1
ans = 1
for i in a:
ans = ans * count(i - c - 2) % (10**9 + 7)
c = i
print(ans)
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
memo = [0]*(10**5+1)
def count(n):
if n < 2:
return 1
if memo[n] != 0:
return memo[n]
memo[n] = count(n-1) + count(n-2)
return memo[n]
n, m, *a = list(map(int, open(0).read().split()))
if sum(a[i + 1] == a[i] + 1 for i in range(m - 1)) > 0:
print((0))
exit()
a.append(n + 1)
c = -1
ans = 1
for i in a:
ans = ans * count(i - c - 2) % (10**9 + 7)
c = i
print(ans)
|
p03013
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
n, m, *a = list(map(int, open(0).read().split()))
dp = [0] * (n + 1)
ok = [True] * (n + 1)
for i in a:
ok[i] = False
def count(n):
if ok[n]:
if n < 2:
return 1
if dp[n] != 0:
return dp[n]
dp[n] = (count(n - 1) + count(n - 2)) % (10**9 + 7)
return dp[n]
else:
return 0
print((count(n)))
|
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(1000000)
n, m, *a = list(map(int, open(0).read().split()))
dp = [1] + [-1] * n
dp[1] = 1
for i in a:
dp[i] = 0
def count(n):
if dp[n] != -1:
return dp[n]
dp[n] = (count(n - 1) + count(n - 2)) % (10**9 + 7)
return dp[n]
print((count(n)))
|
p03013
|
import math
n, m = list(map(int, input().split()))
p = []
pre = 0
def pattern_count(a,b):
if a == 0 or b == 0:
return 1
else:
return math.factorial(a+b)//(math.factorial(a)*math.factorial(b))
def count(a):
ret = 0
for i in range(a//2 + 1):
ret += pattern_count(i, a-i*2)
if ret == 0:
return 1
else:
return ret
fault = False
for _ in range(m):
a = int(eval(input()))
if a == pre:
fault = True
break
p.append(count(a-pre-1))
pre = a+1
if fault:
print((0))
else:
p.append(count(n-pre))
ans = 1
for a in p:
ans *= a
print((ans % 1000000007))
|
n, m = list(map(int, input().split()))
hole_count = 0
pattern = [0,1]
if m != 0:
a = int(eval(input()))
hole_count += 1
else:
a = n+1
for i in range(n):
index = i + 1
if index == a:
pattern.append(0)
if hole_count < m:
a = int(eval(input()))
hole_count += 1
else:
pattern.append(pattern[-1] + pattern[-2])
print((pattern[-1] % 1000000007))
|
p03013
|
from collections import defaultdict
N, M = [int(x) for x in input().split()]
a = []
for _ in range(M):
a.append(int(eval(input())))
MOD = 1000000007
dict = defaultdict(int)
for i in range(M):
if i >= 1 and a[i] - a[i - 1] == 1:
print("0")
exit()
dict[0] = 1
for i in range(N):
if not i in a:
dict[i + 1] += dict[i]
dict[i + 2] += dict[i]
else:
a.pop(0)
print((dict[N] % MOD))
|
from collections import defaultdict
N, M = [int(x) for x in input().split()]
a = []
for _ in range(M):
a.append(int(eval(input())))
MOD = 1000000007
dict = defaultdict(int)
for i in range(M):
if i >= 1 and a[i] - a[i - 1] == 1:
print("0")
exit()
dict[0] = 1
a_s = set(a)
for i in range(N):
if not i in a_s:
dict[i + 1] += dict[i]
dict[i + 2] += dict[i]
print((dict[N] % MOD))
|
p03013
|
from collections import defaultdict
N, M = [int(x) for x in input().split()]
a = []
for _ in range(M):
a.append(int(eval(input())))
MOD = 1000000007
stair_list = [0] * (N + 2)
stair_list[0] = 1
a_s = set(a)
for i in range(N):
if not i in a_s:
stair_list[i + 1] += stair_list[i]
stair_list[i + 2] += stair_list[i]
print((stair_list[N] % MOD))
|
N, M = [int(x) for x in input().split()]
A = [int(eval(input())) for _ in range(M)]
aset = set(A)
MOD = 10 ** 9 + 7
dp = [0] * (N + 1)
if 1 not in aset:
dp[1] = 1
if 2 not in aset and N >= 2:
dp[2] += dp[1] + 1
for i in range(3, N + 1):
if i in aset:
continue
dp[i] += dp[i - 1]
dp[i] += dp[i - 2]
print((dp[N] % MOD))
|
p03013
|
def makelist(n, m):
return [[0 for _ in range(m)] for _ in range(n)]
MOD = int(1e9) + 7
N, M = list(map(int, input().split()))
a = [True]*(N+1)
for i in range(1, M+1):
n = int(eval(input()))
a[n] = False
##
dp = [0]*(N+1)
dp[0] = 1
for i in range(1, N+1):
if a[i]:
if i == 1:
dp[i] = dp[i-1]
else:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[-1]))
|
MOD = int(1e9) + 7
N, M = list(map(int, input().split()))
a = [True]*(N+1)
for _ in range(1, M+1):
n = int(eval(input()))
a[n] = False
##
dp = [0]*(N+1)
dp[0] = 1
for i in range(1, N+1):
if a[i]:
if i == 1:
dp[i] = dp[i-1]
else:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[-1]))
|
p03013
|
N, M = list(map(int, input().split()))
a = [0 for i in range(M)]
sosu = 10 ** 9 + 7
for i in range(M):
a[i] = int(eval(input()))
dp = [0 for i in range(N+1)]
dp[0] = 1
for i in range(1, N+1):
if i in a:
pass
else:
dp[i] = (dp[i-1] + dp[i-2]) % sosu
print((dp[N]))
|
N, M = list(map(int, input().split()))
a = [0 for i in range(M)]
sosu = 10 ** 9 + 7
for i in range(M):
a[i] = int(eval(input()))
seta = list(set(a))
seta.sort()
dp = [0 for i in range(N+1)]
dp[0] = 1
now = 0
for i in range(1, N+1):
if now <= M-1 and i == seta[now]:
now += 1
elif i >= 2:
dp[i] = (dp[i-2] + dp[i-1]) % sosu
elif i == 1:
dp[i] = dp[i-1]
#print(seta)
print((dp[N]))
|
p03013
|
n, m = list(map(int, input().split()))
a = [0 for _ in range(n + 1)]
for i in range(m):
A = int(eval(input()))
a[A] = 1
tmp = [0 for _ in range(n + 1)]
tmp[0] = 1
for i in range(1, n + 1):
if a[i] == 1:
tmp[i] = 0
else:
if i - 2 >= 0:
tmp[i] += tmp[i - 2]
if i - 1 >= 0:
tmp[i] += tmp[i - 1]
tmp[i] %= 1000000007
print((tmp[-1] % 1000000007))
|
n, m = list(map(int, input().split()))
a = [0 for _ in range(n + 1)]
for i in range(m):
A = int(eval(input()))
a[A] = 1
tmp = [0 for _ in range(n + 1)]
tmp[0] = 1
for i in range(1, n + 1):
if a[i] == 1:
tmp[i] = 0
else:
if i - 2 >= 0:
tmp[i] += tmp[i - 2]
if i - 1 >= 0:
tmp[i] += tmp[i - 1]
tmp[i] %= 1000000007
print((tmp[n] % 1000000007))
|
p03013
|
MOD = 10**9 + 7
N,M = list(map(int,input().split()))
dp = [0]*(N+1)
dp[0] = 1
A = set(int(eval(input())) for _ in range(M)) # 禁止地帯
for i in range(1,N+1):
if i in A:
continue
x = dp[i-1]
if i > 1:
x += dp[i-2]
dp[i] = x%MOD
answer = dp[N]
print(answer)
|
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,M,*A = list(map(int,read().split()))
MOD = 10**9 + 7
dp = [0] * (N+10)
dp[0] = 1
is_broken = [False] * (N+1)
for x in A:
is_broken[x] = True
for n in range(1,N+1):
if is_broken[n]:
continue
x = dp[n-1] + dp[n-2]
if x >= MOD:
x -= MOD
dp[n] = x
answer = dp[N]
print(answer)
|
p03013
|
n,m=list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
mod=10**9+7
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[-1]))
|
n,m=list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
mod=10**9+7
dp=[0]*(n+1)
dp[0]=1
NG=[False]*n
for i in range(m):
NG[a[i]-1]=True
for i in range(1,n+1):
if NG[i-1]==False:
dp[i]=(dp[i-2]+dp[i-1])%mod
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
ans = 0
flag = 0
a = set(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 dp[i-2] == 0 and dp[i-1] == 0:
ans = 0
flag = 1
break
elif i in a:
continue
else:
dp[i] = dp[i-1] + dp[i-2]
if flag == 0:
ans = dp[n]
print((ans%(10**9+7)))
|
n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
ans = 0
flag = 0
a = set(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 dp[i-2] == 0 and dp[i-1] == 0:
ans = 0
flag = 1
break
elif i in a:
continue
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] = dp[i] % (10**9+7)
if flag == 0:
ans = dp[n]
print(ans)
|
p03013
|
def resolve():
(N, M) = list(map(int, input().split(" ")))
As = [int(eval(input())) for i in range(M)]
cnts = [False] * (N+1)
for i in range(N+1):
c = 0
if i in As:
c = 0
elif i == 0:
c = 1
elif i == 1:
c = 1
elif i == 2:
c = 2 if 1 not in As else 1
else:
c = (cnts[i-2] + cnts[i-1])%1000000007
cnts[i] = c
print((cnts[N]))
if '__main__' == __name__:
resolve()
|
def resolve():
(N, M) = list(map(int, input().split(" ")))
As = [int(eval(input())) for i in range(M)]
As.sort()
cnts = [False] * (N+1)
ptr = 0
for i in range(N+1):
c = 0
if ptr < len(As) and i == As[ptr]:
c = 0
ptr = ptr + 1
elif i == 0:
c = 1
elif i == 1:
c = 1
elif i == 2:
c = 2 if 1 not in As else 1
else:
c = (cnts[i-2] + cnts[i-1])%1000000007
cnts[i] = c
print((cnts[N]))
if '__main__' == __name__:
resolve()
|
p03013
|
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
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]) % 1000000007
#print(dp)
print((dp[n]))
|
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
a.append(1000000)
dp = [0]*(n+1)
dp[0] = 1
j = 0
if a[j] == 1:
j += 1
else:
dp[1] = 1
for i in range(2,n+1):
if i == a[j]:
j += 1
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
#print(dp)
print((dp[n]))
|
p03013
|
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1,r,p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k])
return result
def pattcount(num):
if(num < 0): return 0
result = 1
ranmax = num // 2 + 1
for i in range(1, ranmax):
result += cmb(num-i, i)
return result
if __name__ == '__main__':
n,m = list(map(int, input().split()))
pattern = 1
step = 0
for i in range(m):
a = int(eval(input()))
pattern *= pattcount(a - 1 - step)
step = a + 1
pattern *= pattcount(n - step)
print((pattern % 1000000007))
|
if __name__ == '__main__':
n,m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
a.append(0)
ac = 0
step0 = 0
step1 = 1
for i in range(1, n+1):
temp = step0 + step1
step0 = step1
step1 = temp
if(i == a[ac]):
step1 = 0
ac += 1
print((step1 % 1000000007))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
f = []
for i in range(n + 1):
if i == 0:
f.append(1)
continue
if i in a:
f.append(0)
continue
if i == 1:
f.append(1)
continue
f.append(f[i - 1] + f[i - 2])
print((f[n] % 1000000007))
|
n, m = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(m)])
NUM = 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 not i in a:
dp[i] = (dp[i-2] + dp[i-1]) % NUM
else:
dp[i] = 0
print((dp[n]))
|
p03013
|
N,M=list(map(int,input().split()))
mod = 10**9+7
def framod(n, mod, a=1):
for i in range(1,n+1):
a=a * i % mod
return a
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod):
a=framod(n, mod)
b=framod(k, mod)
c=framod(n-k, mod)
return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod
def cnt(n):
s = sum([comb(n-i,i,mod)%mod for i in range(n//2+1)])
s = s%mod
return s
A0 = 0
ans = 1
for i in range(M):
A1 = int(eval(input())) - 1
ans = (ans * cnt(A1-A0))%mod
A0 = A1+2
ans = (ans * cnt(N-A0))%mod
print(ans)
|
N,M=list(map(int,input().split()))
mod = 10**9+7
fram = [1]
for i in range(1,N+1):
fram.append(fram[-1]*i%mod)
#def framod(n, mod, a=1):
# for i in range(1,n+1):
# a = a * i % mod
# return a
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod):
a=fram[n]
b=fram[k]
c=fram[n-k]
return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod
def cnt(n):
s = sum([comb(n-i,i,mod)%mod for i in range(n//2+1)])
s = s%mod
return s
A0 = 0
ans = 1
for i in range(M):
A1 = int(eval(input())) - 1
ans = (ans * cnt(A1-A0))%mod
A0 = A1+2
ans = (ans * cnt(N-A0))%mod
print(ans)
|
p03013
|
N,M=list(map(int,input().split()))
mod = 10**9+7
fram = [1]
for i in range(1,N+1):
fram.append(fram[-1]*i%mod)
#def framod(n, mod, a=1):
# for i in range(1,n+1):
# a = a * i % mod
# return a
def power(n, r, mod):
if r == 0: return 1
if r%2 == 0:
return power(n*n % mod, r//2, mod) % mod
if r%2 == 1:
return n * power(n, r-1, mod) % mod
def comb(n, k, mod):
a=fram[n]
b=fram[k]
c=fram[n-k]
return (a * power(b, mod-2, mod) * power(c, mod-2, mod)) % mod
def cnt(n):
s = sum([comb(n-i,i,mod)%mod for i in range(n//2+1)])
s = s%mod
return s
A0 = 0
ans = 1
for i in range(M):
A1 = int(eval(input())) - 1
ans = (ans * cnt(A1-A0))%mod
A0 = A1+2
ans = (ans * cnt(N-A0))%mod
print(ans)
|
#!/usr/bin python3
# -*- coding: utf-8 -*-
def main():
N, M = list(map(int, input().split()))
a = set([int(eval(input())) for i in range(M)])
mod = 10**9+7
#dp[i] iの位置に到達する最小の値
dp = [0]*(N+1)
dp[0] = 1
for i in range(N):
if (i+1)<=N and (not i+1 in a):
dp[i+1] += dp[i]
dp[i+1] %= mod
if (i+2)<=N and (not i+2 in a):
dp[i+2] += dp[i]
dp[i+2] %= mod
print((dp[N]))
if __name__ == '__main__':
main()
|
p03013
|
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)
# import numpy as np
# import scipy as scp
# 入力の受け取り
n,m = list(map(int,input().split()))
rows = [int(eval(input())) for _ in range(m)]
mod = 1000000007
dp=[0 for _ in range(n+1)]
dp[0]=1
for now in range(n):
for next in range(now+1,min(n,now+2)+1):
if not next in rows:
dp[next] += dp[now]
dp[next] %= mod
print((dp[n]))
# print("{:.10f}".format(ans))
# print(*ans) # unpackして出力。間にスペースが入る
# for row in board:
# print(*row,sep="") #unpackして間にスペース入れずに出力する
|
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter
# from decimal import Decimal, getcontext
# # getcontext().prec = 1000
# # eps = Decimal(10) ** (-100)
# import numpy as np
# import scipy as scp
# 入力の受け取り
n,m = list(map(int,input().split()))
stair = [True for _ in range(n+1)]
for _ in range(m):
broken = int(eval(input()))
stair[broken] = False
mod = 1000000007
dp=[0 for _ in range(n+1)]
dp[0]=1
for now in range(n):
for next in range(now+1,min(n,now+2)+1):
if stair[next]:
dp[next] += dp[now]
dp[next] %= mod
print((dp[n]))
# print("{:.10f}".format(ans))
# print(*ans) # unpackして出力。間にスペースが入る
# for row in board:
# print(*row,sep="") #unpackして間にスペース入れずに出力する
|
p03013
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
mod=1000000007
dp=[1,1]
if 1 in a:
dp[1]=0
for i in range(2,n+1):
if i in a:
dp.append(0)
else:
dp.append((dp[-1]+dp[-2])%mod)
print((dp[-1]%mod))
|
n,m=list(map(int,input().split()))
a=set([int(eval(input())) for i in range(m)])
mod=1000000007
dp=[1,1]
if 1 in a:
dp[1]=0
for i in range(2,n+1):
if i in a:
dp.append(0)
else:
dp.append((dp[-1]+dp[-2])%mod)
print((dp[-1]%mod))
|
p03013
|
# 初期入力
N,M = (int(x) for x in input().split())
A = [int(eval(input())) for i in range(M)]
#
mod_9 = 10**9 +7
dp =[0]*(N +1)
dp[0] = 1
if 1 not in A:
dp[1] =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]
dp[i+2] %= mod_9
kotae =dp[N] # % mod_9
print(kotae )
|
# 初期入力
N,M = (int(x) for x in input().split())
A = set([int(eval(input())) for i in range(M)])
#
mod_9 = 10**9 +7
dp =[0]*(N +1)
dp[0] = 1
if 1 not in A:
dp[1] =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]
dp[i+2] %= mod_9
kotae =dp[N] # % mod_9
print(kotae )
|
p03013
|
import sys
n, m = list(map(int, input().split()))
br = [int(sys.stdin.readline()) for i in range(m)]
dp = [0 for _ in range(n + 1)]
dp[0] = 1
if 1 not in br:
dp[1] = 1
for i in range(2, n + 1):
if i in br:
continue
else:
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] = dp[i] % (10 ** 9 + 7)
print((dp[n]))
|
n, m = list(map(int, input().split()))
p = {int(eval(input())) for _ in range(m)}
s = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1
if 1 in p:
dp[1] = 0
for i in range(2, n+1):
if i in p:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % s
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [0 for i in range(n+1)]
a.sort()
for i in range(1,n+1):
if i in a:
a.pop(0)
dp[i] = 0
continue
if i == 1:
dp[i] = 1
continue
if i == 2:
if dp[i-1] == 0:
dp[i] = 1
else:
dp[i] = 2
continue
if dp[i-1] == 0:
dp[i] = dp[i-2]
continue
if dp[i-2] == 0:
dp[i] = dp[i-1]
continue
dp[i] = (dp[i-1]+dp[i-2])%(10**9+7)
#print (dp[i])
print((dp[-1]%(10**9+7)))
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [10**5 for i in range(n+1)]
for i in a:
dp[i] = 0
a.sort()
for i in range(1,n+1):
if dp[i] == 0:
continue
if i == 1:
dp[i] = 1
continue
if i == 2:
if dp[i-1] == 0:
dp[i] = 1
else:
dp[i] = 2
continue
if dp[i-1] == 0:
dp[i] = dp[i-2]
continue
if dp[i-2] == 0:
dp[i] = dp[i-1]
continue
dp[i] = (dp[i-1]+dp[i-2])%(10**9+7)
#print (dp[i])
print((dp[-1]%(10**9+7)))
|
p03013
|
import sys
big=10**9+7
def modsum(a,b):
return a%big +b%big
n,m = list(map(int, input().split()))
a = [0]*m
for i in range(m):
a[i] = int(eval(input()))
#連続こわれ
for i in range(m-1):
if a[i]+1 == a[i+1]:
print((0))
sys.exit(0)
cho = [0]*(n+1)
if 0 not in a:
cho[0] = 1
if 1 not in a:
cho[1] = 1
for i in range(2,n+1):
if i not in a:
cho[i] = modsum(cho[i-1], cho[i-2])
print((cho[-1]%big))
|
big=10**9+7
n,m = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(m)])
cho = [0]*(n+1)
if 0 not in a:
cho[0] = 1
if 1 not in a:
cho[1] = 1
for i in range(2,n+1):
if i not in a:
cho[i] = (cho[i-1]+cho[i-2])%big
print((cho[-1]))
|
p03013
|
import itertools
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 10 ** 9 + 7
dp = [0 for i in range(n + 1)]
dp[0] = 1
for i in range(1, n + 1):
if i in a:
continue
else:
dp[i] += dp[i - 1]
dp[i] %= mod
if i != 1:
dp[i] += dp[i - 2]
dp[i] %= mod
print((dp[n]))
|
import itertools
n, m = list(map(int, input().split()))
a = set([int(eval(input())) for i in range(m)])
mod = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 0 if 1 in a else 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[n]))
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for i in range(M)]
dp = [0, 1]
for i in range(1, N + 1):
if i in a:
dp.append(0)
continue
dp.append(dp[i - 1] + dp[i])
print((dp[N + 1] % 1000000007))
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for i in range(M)]
a.append(0)
dp = [0, 1]
a_flag = 0
for i in range(1, N + 1):
if i == a[a_flag]:
dp.append(0)
a_flag += 1
continue
dp.append(dp[i - 1] + dp[i])
print((dp[N + 1] % 1000000007))
|
p03013
|
n,m = list(map(int,input().split()))
dp = [0 for i in range(n+1)]
for i in range(m):
j = int(eval(input()))
dp[j] = -1
dp[0] = 1
dp[1] = 1 if dp[1] != -1 else 0
for i in range(2,n+1):
if dp[i] == -1:
dp[i] = 0
continue
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%1000000007))
|
n,m = list(map(int,input().split()))
dp = [0 for i in range(n+1)]
for i in range(m):
j = int(eval(input()))
dp[j] = -1
dp[0] = 1
dp[1] = 1 if dp[1] != -1 else 0
for i in range(2,n+1):
if dp[i] == -1:
dp[i] = 0
continue
dp[i] = (dp[i-1] + dp[i-2])%1000000007
print((dp[n]))
|
p03013
|
n,m=list(map(int,input().split()))
x=[int(eval(input())) for _ in range(m)]
f=[0]*(n+1)
f[0]=1
for i in range(1,n+1):
f[i]=(f[i-1]+f[i-2])%(10**9+7)
if i in x:
f[i]=0
print((f[n]%(10**9+7)))
|
n,m=list(map(int,input().split()))
x=set([int(eval(input())) for _ in range(m)])
f=[0]*(n+1)
f[0]=1
for i in range(1,n+1):
f[i]=f[i-1]+f[i-2]
if i in x:
f[i]=0
print((f[n]%(10**9+7)))
|
p03013
|
n,m=list(map(int,input().split()))
x=set([int(eval(input())) for _ in range(m)])
f=[0]*(n+1)
f[0]=1
for i in range(1,n+1):
f[i]=f[i-1]+f[i-2]
if i in x:
f[i]=0
print((f[n]%(10**9+7)))
|
n,m=list(map(int,input().split()))
x=set([int(eval(input())) for _ in range(m)])
f=[0]*(n+1)
f[0]=1
for i in range(1,n+1):
f[i]=(f[i-1]+f[i-2])%(10**9+7)
if i in x:
f[i]=0
print((f[n]%(10**9+7)))
|
p03013
|
n,m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
dp = [1,1]
temp = 1
if 1 in a: dp[1] = 0
for i in range(2,n+1):
if i in a: dp.append(0)
else: dp.append(dp[i-1] + dp[i-2])
print((dp[n]%1000000007))
|
N, M = list(map(int, input().split()))
A = set([int(eval(input())) for _ in range(M)])
dp = [0, 1]
for i in range(N):
if i+1 in A: dp.append(0)
else: dp.append(dp[i]+dp[i+1])
print((dp[N+1]%1000000007))
|
p03013
|
N,M = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = 1000000007
d = [0] * (N+1)
d[0] = 1
if(1 in a):
d[1] = 0
else:
d[1] = 1
for i in range(2,N+1):
if(i in a):
d[i] = 0
else:
d[i] = d[i-1] + d[i-2]
d[i] %= MOD
print((d[-1]))
|
N,M = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = 1000000007
d = [0] * (N+1)
OK = [True]*(N+1)
d[0] = 1
for i in range(M):
OK[a[i]] = False
#print(OK)
if(OK[1]):
d[1] = 1
else:
d[1] = 0
for i in range(2,N+1):
if(OK[i-1]):
d[i] += d[i-1]
if(OK[i-2]):
d[i] += d[i-2]
d[i] %= MOD
'''
if(i in a):
d[i] = 0
else:
d[i] = d[i-1] + d[i-2]
d[i] %= MOD
'''
print((d[-1]))
|
p03013
|
n,m = list(map(int,input().split()))
a = []
dp = []
mod = 1000000007
for i in range(100100):
a.append(0)
dp.append(0)
for i in range(m):
num = int(eval(input()))
a[num] = 1
dp[0]=1
for i in range(1,n+1):
if a[i] == 1:
continue
dp[i] += dp[i-1]
if i>1:
dp[i] += dp[i-2]
dp[i] = dp[i] % mod
print((dp[n]%mod))
|
n,m = list(map(int,input().split()))
a = [0] * (n+1)
dp = [0] * (n+1)
mod = 1000000007
for i in range(m):
num = int(eval(input()))
a[num] = 1
dp[0]=1
for i in range(1,n+1):
if a[i] == 1:
continue
dp[i] += dp[i-1]
if i>1:
dp[i] += dp[i-2]
dp[i] = dp[i] % mod
print((dp[n]%mod))
|
p03013
|
n,m = list(map(int,input().split()))
a = [0] * (n+1)
dp = [0] * (n+1)
mod = 1000000007
for i in range(m):
num = int(eval(input()))
a[num] = 1
dp[0]=1
for i in range(1,n+1):
if a[i] == 1:
continue
dp[i] += dp[i-1]
if i>1:
dp[i] += dp[i-2]
dp[i] = dp[i] % mod
print((dp[n]%mod))
|
n,m = list(map(int,input().split()))
a = [0] * (n+2)
dp = [0] * (n+2)
mod = 1000000007
for i in range(m):
num = int(eval(input()))
a[num] = 1
dp[0]=1
for i in range(0,n):
if a[i] == 1:
continue
dp[i] = dp[i]%mod
dp[i+1] += dp[i]
dp[i+2] += dp[i]
print((dp[n]%mod))
|
p03013
|
n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
dp = [0 for _ in range(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
else:
dp[i] = dp[i - 2] + dp[i - 1]
print((dp[n] % 1000000007))
|
n, m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
a = set(a)
dp = [0 for _ in range(n+1)]
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(2, n+1):
if not(i in a):
dp[i] = dp[i - 2] + dp[i - 1]
print((dp[n] % 1000000007))
|
p03013
|
n, m = list(map(int, input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
cur = 0
dp = [0 for _ in range(n + 1)]
flags = [0 for _ in range(n + 1)]
for i in range(n + 1):
if i in a:
flags[i] = 1
dp[0], dp[1] = 1, 1
if flags[1]:
dp[1] = 0
for i in range(2, n + 1):
if flags[i]:
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= (10 ** 9 + 7)
print((dp[n]))
|
n, m = list(map(int, input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
a = set(a)
cur = 0
dp = [0 for _ in range(n + 1)]
dp[0], dp[1] = 1, 1
if 1 in a:
dp[1] = 0
for i in range(2, n + 1):
if i in a:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % (10 ** 9 + 7)
print((dp[n]))
|
p03013
|
N, M = list(map(int, input().split()))
A = [0 for i in range(N + 2)]
A[0] = 0
A[1] = 1
brokun = []
for i in range(M):
brokun.append(int(eval(input())) + 1)
for i in range(2, N+2):
if i in brokun:
A[i] = 0
else:
A[i] = A[i-1]+ A[i-2]
A[i] = A[i] % 1000000007
#print(A)
print((A[N + 1]))
|
N, M = list(map(int, input().split()))
A = [0 for i in range(N + 2)]
A[0] = 0
A[1] = 1
for i in range(M):
a = int(eval(input())) + 1
A[a] = -1
for i in range(2, N+2):
if A[i] == -1:
A[i] = 0
else:
A[i] = A[i-1]+ A[i-2]
A[i] = A[i] % 1000000007
#print(A)
print((A[N + 1]))
|
p03013
|
mod = 10**9+7
n, m = list(map(int, input().split()))
l = [int(eval(input())) for _ in range(m)]
t2 = 0
t1 = 1
for i in range(1,n+1):
if l == [] or i != l[0]:
t0 = (t2+t1)%mod
else:
l.pop(0)
t0 = 0
t2 = t1
t1 = t0
print(t0)
|
mod = 10**9+7
n, m = list(map(int, input().split()))
l = [0]*n
for _ in range(m):
l[int(eval(input()))-1] = 1
s = 0
t = 1
for i in range(n):
if l[i] > 0:
t, s = 0, t
else:
t, s = (s+t)%mod, t
print(t)
|
p03013
|
mod = 10**9+7
n, m = list(map(int, input().split()))
l = [0]*n
for _ in range(m):
l[int(eval(input()))-1] = 1
s = 0
t = 1
for i in range(n):
if l[i] > 0:
t, s = 0, t
else:
t, s = (s+t)%mod, t
print(t)
|
import sys
input = sys.stdin.readline
mod = 10**9+7
n, m = list(map(int, input().split()))
l = [0]*n
for _ in range(m):
l[int(eval(input()))-1] = 1
t, s = 1, 0
for i in range(n):
if l[i]:
t, s = 0, t
else:
t, s = (s+t)%mod, t
print(t)
|
p03013
|
M=10**9+7
n,m=list(map(int,input().split()))
l=[int(eval(input()))-1 for _ in range(m)]
s,t=0,1
for i in range(n):
if i in l: s,t=t,0
else: s,t=t,(s+t)%M
print(t)
|
M=10**9+7
f=input
n,m=list(map(int,f().split()))
s,t=0,1
u=0 if m<1 else int(f())
for i in range(n):
if i==u-1:
s,t=t,0
try: u=int(f())
except: pass
else: s,t=t,(s+t)%M
print(t)
|
p03013
|
M=10**9+7
f=input
n,m=list(map(int,f().split()))
s,t=0,1
u=0 if m<1 else int(f())
for i in range(n):
if i==u-1:
s,t=t,0
try: u=int(f())
except: pass
else: s,t=t,(s+t)%M
print(t)
|
M=10**9+7
import sys
f=sys.stdin.readline
n,m=list(map(int,f().split()))
s,t=0,1
u=0 if m<1 else int(f())
for i in range(n):
if i==u-1:
s,t=t,0
try: u=int(f())
except: pass
else: s,t=t,(s+t)%M
print(t)
|
p03013
|
import math
def comb(a, b):
return math.factorial(a) // (math.factorial(b) * math.factorial(a - b))
n, m = list(map(int, input().split()))
ans = 1
p = 0
for _ in range(m):
a = int(eval(input()))
cnt = 0
if a == p:
print((0))
exit()
s = a - 1 - p
for i in range(s // 2 + 1):
cnt += comb(s - i, i)
p = a + 1
ans = (ans * cnt) % (10 ** 9 + 7)
s = n - p
cnt = 0
for i in range(s // 2 + 1):
cnt += comb(s - i, i)
ans = (ans * cnt) % (10 ** 9 + 7)
print(ans)
|
n, m = list(map(int, input().split()))
dp = [0] * (n + 1)
safe = [True] * (n + 1)
mod = 10 ** 9 + 7
for _ in range(m):
a = int(eval(input()))
safe[a] = False
dp[0] = 1
if safe[1] is True:
dp[1] = 1
for i in range(2, n+1):
if safe[i-1] is True:
dp[i] += dp[i-1]
if safe[i-2] is True:
dp[i] += dp[i-2]
dp[i] %= mod
print((dp[n]))
|
p03013
|
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [1]*2 + [0 for _ in range(n-1)]
MOD = 10**9+7
for i in range(n-1):
if i+1 in a:
dp[i+1] = 0
dp[i+2] = dp[i]+dp[i+1]
dp[i+2] %= MOD
print((dp[-1]))
|
import sys
input = sys.stdin.readline
n,m = list(map(int,input().split()))
hole = [0]*(n+1)
for i in range(m):
hole[int(eval(input()))] = 1
dp = [0]*(n+1)
dp[0] = 1
MOD = 10**9+7
for i in range(1,n+1):
if hole[i]==1:
dp[i] = 0
else:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= MOD
print((dp[-1]))
|
p03013
|
N,M = list(map(int, input().split()))
if N==1:
print((1))
exit()
A = []
a_prev = None
for i in range(M):
a_i = int(eval(input()))
if a_prev == a_i:
print((0))
exit()
A.append(a_i)
a_prev = a_i
N_2 = 1
N_1 = 1
ans = 0
for i in range(1, N):
if i in A:
N_1 = 0
ans = (N_1 + N_2)%1000000007
N_2 = N_1
N_1 = ans
print(ans)
|
N,M = list(map(int, input().split()))
if N==1:
print((1))
exit()
A = [0]*N
a_prev = None
for i in range(M):
a_i = int(eval(input()))
if a_prev == a_i:
print((0))
exit()
A[a_i] = 1
a_prev = a_i
N_2 = 1
N_1 = 1
ans = 0
for i in range(1, N):
if A[i]==1:
N_1 = 0
ans = (N_1 + N_2)%1000000007
N_2 = N_1
N_1 = ans
print(ans)
|
p03013
|
#!/usr/bin/env python3
P_NUM = 1000000007
def solv(n, m, a):
comb = [1] * (n+1)
for i in a:
comb[i] = 0
for i in range(2, n+1):
if comb[i] != 0:
comb[i] = comb[i-1] + comb[i-2]
return comb[-1]
if __name__ == '__main__':
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ans = solv(n, m, a)
print((ans % P_NUM))
|
#!/usr/bin/env python3
P_NUM = 1000000007
def solv(n, m, a):
comb = [1] * (n+1)
for i in a:
comb[i] = 0
for i in range(2, n+1):
if comb[i] != 0:
comb[i] = (comb[i-1] + comb[i-2]) % P_NUM
return comb[-1]
if __name__ == '__main__':
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ans = solv(n, m, a)
print(ans)
|
p03013
|
#!/usr/bin/env python3
import array
P_NUM = 1000000007
def solv(n, m, a):
comb = array.array('I', [1] * (n+1))
for i in a:
comb[i] = 0
for i in range(2, n+1):
comb[i] *= (comb[i-1] + comb[i-2]) % P_NUM
return comb[-1]
if __name__ == '__main__':
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ans = solv(n, m, a)
print(ans)
|
#!/usr/bin/env python3
import sys
P_NUM = 1000000007
def solv(n, m, a):
comb = [1] * (n+1)
for i in a:
comb[i] = 0
for i in range(2, n+1):
comb[i] *= (comb[i-1] + comb[i-2]) % P_NUM
return comb[-1]
if __name__ == '__main__':
n, m = list(map(int, input().split()))
if m:
a = list(map(int, sys.stdin))
else:
a = []
ans = solv(n, m, a)
print(ans)
|
p03013
|
#!/usr/bin/env python3
import sys
P_NUM = 1000000007
def solv(n, m, a):
comb = [1] * (n+1)
for i in a:
comb[i] = 0
for i in range(2, n+1):
comb[i] *= (comb[i-1] + comb[i-2]) % P_NUM
return comb[-1]
if __name__ == '__main__':
n, m = list(map(int, input().split()))
if m:
a = list(map(int, sys.stdin))
else:
a = []
ans = solv(n, m, a)
print(ans)
|
#!/usr/bin/env python3
import sys
P_NUM = 1000000007
def solv(n, m, a):
comb_m2 = 1
if 1 in a:
comb_m1 = 0
else:
comb_m1 = 1
comb = 1
for i in range(2, n+1):
if i in a:
comb = 0
else:
comb = (comb_m1 + comb_m2) % P_NUM
comb_m1, comb_m2 = comb, comb_m1
return comb
if __name__ == '__main__':
n, m = list(map(int, input().split()))
if m:
a = set(map(int, sys.stdin))
else:
a = set()
ans = solv(n, m, a)
print(ans)
|
p03013
|
#!/usr/bin/env python3
import sys
P_NUM = 1000000007
def solv(n, m, a):
comb_m2 = 1
if 1 in a:
comb_m1 = 0
else:
comb_m1 = 1
comb = 1
for i in range(2, n+1):
if i in a:
comb = 0
a.remove(i)
else:
comb = (comb_m1 + comb_m2) % P_NUM
comb_m1, comb_m2 = comb, comb_m1
return comb
if __name__ == '__main__':
n, m = list(map(int, input().split()))
if m:
a = set(map(int, sys.stdin))
else:
a = set()
ans = solv(n, m, a)
print(ans)
|
#!/usr/bin/env python3
import sys
P_NUM = 1000000007
def solv(n, m, a):
comb_m2 = 1
if 1 in a:
comb_m1 = 0
else:
comb_m1 = 1
for i in range(2, n+1):
if i in a:
comb_m1, comb_m2 = 0, comb_m1
else:
comb_m1, comb_m2 = (comb_m1 + comb_m2) % P_NUM, comb_m1
return comb_m1
if __name__ == '__main__':
n, m = list(map(int, input().split()))
if m:
a = set(map(int, sys.stdin))
else:
a = set()
ans = solv(n, m, a)
print(ans)
|
p03013
|
N,M=list(map(int,input().split()))
A=[]
B=[True]*(N+1)
DP=[0]*(N+1)
DP[0]=1
for i in range(M):
A.append(int(eval(input())))
for i in range(M):
B[A[i]]=False
#print(B)
for i in range(1,N+1):
if B[i]==False:
DP[i]=0
else:
if i==1:
DP[i]=DP[i-1]
else:
DP[i]=DP[i-1]+DP[i-2]
if DP[N]==0:
print((0))
else:
print((DP[N]%1000000007))
|
N,M=list(map(int,input().split()))
A=[]
B=[True]*(N+1)
DP=[0]*(N+1)
DP[0]=1
for i in range(M):
A.append(int(eval(input())))
for i in range(M):
B[A[i]]=False
#print(B)
for i in range(1,N+1):
if B[i]==False:
DP[i]=0
else:
if i==1:
DP[i]=DP[i-1]
else:
DP[i]=(DP[i-1]+DP[i-2])%1000000007
if DP[N]==0:
print((0))
else:
print((DP[N]))
|
p03013
|
N, M = list(map(int, input().split()))
a = []
flag = True
for i in range(M):
a.append(int(eval(input())))
a = [-1] + a + [N+1] #add beginning and end
# list of steps between broken steps
s1=[]
for i in range(len(a)-1):
if a[i+1]-a[i]-2<0:
flag = False
break
s1.append(a[i+1]-a[i]-2)
if flag==False:
print((0))
else:
# possibile ways for steps
s2 = [1, 1, 2]
while len(s2) < N+1:
s2.append(s2[-2]+s2[-1])
# possible ways for all
s3 = 1
for j in s1:
s3 = s3 * s2[j]
s4 = s3 % 1000000007
print(s4)
|
N, M = list(map(int, input().split()))
a = []
flag = True
for i in range(M):
a.append(int(eval(input())))
a = [-1] + a + [N+1] #add beginning and end
# list of steps between broken steps
s1=[]
for i in range(len(a)-1):
if a[i+1]-a[i]-2<0:
flag = False
break
s1.append(a[i+1]-a[i]-2)
if flag==False:
print((0))
else:
# possibile ways for steps
s2 = [1, 1, 2]
while len(s2) < max(s1)+1:
s2.append(s2[-2]+s2[-1])
# possible ways for all
s3 = 1
for j in s1:
s3 = s3 * s2[j]
s4 = s3 % 1000000007
print(s4)
|
p03013
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
mod = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
if i == 1:
dp[1] = dp[0]
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print((dp[N]))
if __name__ == "__main__":
main()
|
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N, M = list(map(int, input().split()))
A = set([int(eval(input())) for _ in range(M)])
mod = 10**9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i in A:
continue
if i == 1:
dp[1] = dp[0]
continue
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print((dp[N]))
if __name__ == "__main__":
main()
|
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]
dp[i] = dp[i] % 1000000007
print((dp[n]))
|
n,m=list(map(int,input().split()))
a=set()
for i in range(m):
a.add(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]
dp[i] = dp[i] % 1000000007
print((dp[n]))
|
p03013
|
n,m = list(map(int,input().split()))
oks = [True]*(n+1)
for i in range(m):
a = int(eval(input()))
oks[a] = False
dp = [0]*(n+1)
dp[0] = 1
for i in range(n+1):
for j in range(i+1,min(n+1,i+3)):
if oks[j]:
dp[j] += dp[i]
dp[j] %= 1000000007
print((dp[n]))
|
n,m = list(map(int,input().split()))
a = set([int(eval(input())) for i in range(m)])
mod = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
for i in range(n):
if i+1<n+1 and not i+1 in a:
dp[i+1] += dp[i]
dp[i+1] %= mod
if i+2<n+1 and not i+2 in a:
dp[i+2] += dp[i]
dp[i+2] %= mod
print((dp[n]))
|
p03013
|
import sys
sys.setrecursionlimit(10**5+10)
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 1000000007
memo = {}
def Fib(n, A, MOD):
if n in A:
return 0
elif n == 0:
return 1
elif n == 1:
return 1
elif n in memo:
return memo[n]
else:
memo[n] = ( Fib(n-1, A, MOD) + Fib(n-2, A, MOD) ) % MOD
return memo[n]
print((Fib(N, A, MOD)))
|
import sys
sys.setrecursionlimit(10**5+10)
N, M = list(map(int, input().split()))
A = set([int(eval(input())) for _ in range(M)])
MOD = 1000000007
memo = {}
def Fib(n, MOD):
if n in A:
return 0
elif n == 0:
return 1
elif n == 1:
return 1
elif n in memo:
return memo[n]
else:
memo[n] = ( Fib(n-1, MOD) + Fib(n-2, MOD) ) % MOD
return memo[n]
print((Fib(N, 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
for next in range(1,N+1):
if next in A:
dp[next] = 0
else:
dp[next] = (dp[next-1] + dp[next-2])%1000000007
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 next in range(1,N+1):
if next in A:
dp[next] = 0
else:
dp[next] = (dp[next-1] + dp[next-2])%1000000007
print((dp[N]))
|
p03013
|
MOD = 10**9 + 7
n,m = list(map(int,input().split()))
ban = [False] * (n + 1)
for i in range(m):
a = int(eval(input()))
ban[a] = True
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n):
dp[i] %= MOD
if ban[i]:dp[i] = 0
#print(i, dp[i])
if i + 1 <= n:
dp[i + 1] += dp[i]
if i + 2 <= n:
dp[i + 2] += dp[i]
print((dp[n] % MOD))
|
n,m = list(map(int,input().split()))
dp = [0] * (n+1) + [0] * 10
mod = 10**9 + 7
for i in range(m):
dp[int(eval(input()))] = -1 # 壊れているので、-1としておこう?
dp[0] = 0 # 0段目にいるとしよう
# 1段目が行けなかったら...?
dp[1] = 1 if dp[1] != -1 else -1 # 1段目にいく方法は1通り?
dp[2] = -1 if dp[2] == -1 else (1 if dp[2] != -1 and dp[1] == -1 else 2) # 2段目に行く方法は2通り?
for i in range(3,n+1):
if dp[i] != -1 and dp[i-1] != -1:
dp[i] += dp[i-1]
dp[i] %= mod
if i > 1:
if dp[i] != -1 and dp[i-2] != -1:
dp[i] += dp[i-2]
dp[i] %= mod
#print(dp)
print((dp[n]%mod))
|
p03013
|
import sys
sys.setrecursionlimit(100000000)
def dfs(x):
if x == N:
return 1
if x > N or x in a:
return 0
if memo[x]:
return memo[x]
memo[x] = dfs(x+1) + dfs(x+2)
return memo[x]
N, M = [int(x) for x in input().split()]
a = [int(eval(input())) for i in range(M)]
#print(N)
#print(M)
#print(a)
memo = [False]*(N+1)
count = dfs(0)
print((count%1000000007))
|
import sys
sys.setrecursionlimit(100000000)
def dfs(x):
if x == N:
return 1
if x > N:
return 0
if memo[x] >= 0:
return memo[x]
memo[x] = dfs(x+1) + dfs(x+2)
return memo[x]
N, M = [int(x) for x in input().split()]
a = [int(eval(input())) for i in range(M)]
#print(N)
#print(M)
#print(a)
memo = [-1]*(N+1)
for ai in a:
memo[ai] = 0
count = dfs(0)
print((count%1000000007))
|
p03013
|
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re
def int_raw():
return int(eval(input()))
def ss_raw():
return input().split()
def ints_raw():
return tuple(map(int, ss_raw()))
DIV=10**9+7
def mod_invs(n,mod=DIV):
inv=[0]*(n+1)
inv[0]=1
inv[1]=1
for i in range(2,n+1):
inv[i] = (-(mod//i)*inv[mod%i]) % mod
return inv
def main():
N,M = ints_raw()
As = [int_raw() for _ in range(M)]
is_breake = [0]*(N+1)
for a in As:
is_breake[a]=1
memo = [0]*(N+1)
memo[0]=1
memo[1]=1 if is_breake[1]==0 else 0
for n in range(2,N+1):
if is_breake[n]:
continue
else:
memo[n]=(memo[n-2]+memo[n-1])%DIV
return memo[-1]
print((main()))
|
import sys
input=sys.stdin.readline
from collections import deque
from heapq import heappush,heappop
import re
def int_raw():
return int(eval(input()))
def ss_raw():
return input().split()
def ints_raw():
return tuple(map(int, ss_raw()))
DIV = 10**9+7
def main():
N,M = ints_raw()
As = [int_raw() for _ in range(M)]
is_breake = [0]*(N+1)
for a in As:
is_breake[a]=1
memo = [0]*(N+1)
memo[0]=1
memo[1]=1 if is_breake[1]==0 else 0
for n in range(2,N+1):
if is_breake[n]:
memo[n] =0
else:
memo[n]=(memo[n-2]+memo[n-1])%DIV
return memo[-1]
print((main()))
|
p03013
|
#入力取得
from fractions import Fraction
import sys
sys.setrecursionlimit(15000)
def fibMul(fn1, fn2):
a = fn1[0]
b = fn1[1]
c = fn2[0]
d = fn2[1]
return (a*c + 5*b*d, a*d + b*c)
def fibExp(fn, n):
if (n == 0):
return (Fraction(1), Fraction(1));
if (n % 2 == 0):
return fibExp(fibMul(fn, fn), n / 2);
return fibMul(fn, fibExp(fn, n - 1));
def fibMin(fn1, fn2):
a = fn1[0]
b = fn1[1]
c = fn2[0]
d = fn2[1]
return (a - c, b - d)
def fibMain(n):
fibNum1 = (Fraction(1, 2), Fraction( 1, 2))
fibNum2 = (Fraction(1, 2), Fraction(-1, 2))
fibNum3 = fibMin(fibExp(fibNum1, n), fibExp(fibNum2, n))
fibNum4 = (Fraction(0, 1), Fraction(1, 5))
return fibMul(fibNum3, fibNum4)
def fib(n):
return fibMain(n)[0].numerator
N, M = list(map(int, input().split()))
a= []
for i in range(M):
a.append(int(eval(input())))
l = ["1"] * (N + 1)
for a_ele in a:
l[a_ele] = "0"
l = ''.join(l)
# print(l)
if '00' in l:
print((0))
else:
l_arr = l.split('0')
result = 1
for l_ele in l_arr:
result *= fib(len(l_ele))
result = result % 1000000007
print(result)
|
def fib(n):
if n <= 1:
return n
result = [1, 0, 0, 1]
matrix = [1, 1, 1, 0]
while n > 0:
if n % 2:
result = mul(matrix, result)
matrix = mul(matrix, matrix)
n //= 2
return result[2]
def mul(a, b):
return [a[0]*b[0] + a[1]*b[2],
a[0]*b[1] + a[1]*b[3],
a[2]*b[0] + a[3]*b[2],
a[2]*b[1] + a[3]*b[3]]
N, M = list(map(int, input().split()))
a= []
for i in range(M):
a.append(int(eval(input())))
l = ["1"] * (N + 1)
for a_ele in a:
l[a_ele] = "0"
l = ''.join(l)
# print(l)
if '00' in l:
print((0))
else:
l_arr = l.split('0')
result = 1
for l_ele in l_arr:
result *= fib(len(l_ele))
if result > 1000000007:
result = result % 1000000007
result = result % 1000000007
print(result)
|
p03013
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.