input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
n,m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = (10**9)+7
dp = [1] + [0]*(n)
for i in range(1,n+1):
if i in a:
dp[i] == 0
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
print((dp[-1])) | import sys
input = sys.stdin.readline
n,m = list(map(int, input().split()))
A = set()
for i in range(m):
a = int(eval(input()))
A.add(a)
mod = (10**9)+7
dp = [1] + [0]*(n)
for i in range(1,n+1):
if i in A:
#リストに対するinは激遅なのでset
dp[i] == 0
else:
dp[i] = dp[i-1] + dp[i-2]
... | 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()))
fib=[0]*(n+2)
fib[0]=0
fib[1]=1
for i in range(n):
fib[i+2]=fib[i]+fib[i+1]
ans=1
k=0
for i in range(m):
a=int(eval(input()))
ans*=fib[a-k]
k=a+1
ans*=fib[n-k+1]
print((ans%1000000007)) | p03013 |
mod = 1000000007
def add(a, b):
return (a + b) % mod
def sub(a, b):
return (a + mod - b) % mod
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
a = []
N, M = list(map(int, input().split()))
for i in range(M):
a.append(int(eval(input())))
results = []
flag = True
for m i... | mod = 1000000007
def add(a, b):
return (a + b) % mod
def sub(a, b):
return (a + mod - b) % mod
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
a = []
N, M = list(map(int, input().split()))
for i in range(M):
a.append(int(eval(input())))
def main():
results = []
flag ... | p03013 |
n, m = list(map(int,input().split()))
stairs = list([int(eval(input())) for i in range(m)])
dp = [0] * (n+1)
dp[0] = 1
for i in range(1, n+1):
if i in stairs:
dp[i] = 0
continue
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7)
print((dp[n])) | n, m = list(map(int,input().split()))
stairs = set([int(eval(input())) for i in range(m)])
dp = [0] * (n+1)
dp[0] = 1
for i in range(1, n+1):
if i in stairs:
dp[i] = 0
continue
dp[i] = (dp[i-1] + dp[i-2]) % (10**9+7)
print((dp[n])) | p03013 |
N, M = list(map(int, input().split()))
a = [-1]
for i in range(M):
a.append(int(eval(input())))
# a = [int(input()) for i in range(M)]
a.append(N+1)
# print(N,M)
# print(a)
diff = []
diffmax = 0
for i, v in enumerate(a):
if i != len(a)-1:
steps = a[i+1] - a[i]
diff.append(steps)
if dif... | 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
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]) % MOD
print((dp[-1])) | p03013 |
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
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]) % 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 = [0] * (n + 1)
dp[0] = 1
for i in range(n + 1):
if i > 1:
if i not in A:
dp[i] += dp[i - 2]
if i > 0:
if i not in A:
dp[i] += dp[i - 1]
dp[i] %= MOD
print((dp[-1])) | p03013 |
def func(n):
if n==1:return 1
if n==0:return 1
if dp[n]!=-1:return dp[n]
f1=func(n-1) if n-1 not in a else 0
f2=func(n-2) if n-2 not in a else 0
tmp=(f1+f2)%1000000007
dp[n]=tmp
return tmp
import sys
sys.setrecursionlimit(1000000)
n,m=list(map(int,input().split()))
a=[int(eval(input())) for ... | def func(n):
if n==1:return 1
if n==0:return 1
if dp[n]!=-1:return dp[n]
f1=func(n-1) if n-1 not in a else 0
f2=func(n-2) if n-2 not in a else 0
tmp=(f1+f2)%1000000007
dp[n]=tmp
return tmp
import sys
sys.setrecursionlimit(1000000)
n,m=list(map(int,input().split()))
a={int(eval(input())) for ... | p03013 |
mod = 10**9+7
n, m = list(map(int, input().split()))
dp = [0]*(n+1)
dp[0] = 1
s = set()
for i in range(m):
a = int(eval(input()))
s.add(a)
for i in range(n):
if i in s:
continue
for j in range(1,3):
if i+j <= n:
dp[i+j] = (dp[i+j] + dp[i])%mod
print((dp[-1])... | mod = 10**9+7
n, m = list(map(int, input().split()))
dp = [0]*(n+1)
dp[0] = 1
ok = [1]*(n+1)
for i in range(m):
a = int(eval(input()))
ok[a] = 0
for i in range(n):
if not ok[i]:
continue
for j in range(1,3):
if i+j <= n:
dp[i+j] = (dp[i+j] + dp[i])%mod
print... | p03013 |
N, M = list(map(int, input().split()))
A = list(int(eval(input())) for _ in range(M))
P = 10**9 + 7
dp = [0] * (N+1)
dp[0] = 1
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]) % P
else:
dp[i] = 0
print((dp[N])) | N, M = list(map(int, input().split()))
if N == 1:
print((1))
quit()
if M > N//2:
print((0))
quit()
A = list(int(eval(input())) for _ in range(M))
idx = 0
P = 10**9 + 7
dp = [0] * (N+1)
dp[0] = 1
dp[1] = 1
a = -1
if len(A):
if 1 == A[idx]:
dp[1] = 0
if idx < M-1:
... | p03013 |
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
broken_steps = [False for _ in range(n)]
for _ in range(m):
a = int(eval(input()))
broken_steps[a - 1] = True
steps = [0 for _ in range(n + 1)]
steps[0] = 1
for i in range(n):
if not broken_st... | import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
mod = 10 ** 9 + 7
broken_steps = [False for _ in range(n + 1)]
for _ in range(m):
broken_steps[int(eval(input()))] = True
steps = [0 for _ in range(n + 1)]
steps[0] = 1
for now in range(n):
next = now + 1
if no... | p03013 |
import math
n, m = [int(i) for i in input().split()]
p = [int(eval(input())) for i in range(m)]
a = []
a.append(1)
if 1 in p:
a.append(0)
else:
a.append(1)
for i in range(2, n + 1):
if i in p:
a.append(0)
else:
a.append((a[i - 2] + a[i - 1]) % 1000000007)
print((a[... | import math
n, m = [int(i) for i in input().split()]
p = [0 for i in range(n + 1)]
for _ in range(m):
p[int(eval(input()))] = 1
a = []
a.append(1)
if p[1] == 1:
a.append(0)
else:
a.append(1)
for i in range(2, n + 1):
if p[i] == 1:
a.append(0)
else:
a.append((a[i ... | p03013 |
n,m = list(map(int, input().split()))
l = [int(eval(input())) for i in range(m)]
ll = [0]*(n+2)
ll[1] = 1
for i in range(2,n+2):
if not i-1 in l:
ll[i] = ll[i-1] + ll[i - 2]
print((ll[-1] % 1000000007))
| n,m = list(map(int, input().split()))
u = [0]*(n+1)
for i in range(m):
u[int(eval(input()))] = 1
ll = [0]*(n+2)
ll[1] = 1
for i in range(2,n+2):
if not u[i-1]:
ll[i] = ll[i-1] + ll[i - 2]
print((ll[-1] % 1000000007))
| p03013 |
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
mod = 1000000007
ret = [0] * (N+1)
ret[0] = 1
for i in range(1,N+1):
if i in a:
continue
elif i == 1:
ret[1] = 1
else:
ret[i] = ret[i-2] + ret[i-1]
print((ret[len(ret)-1]%mod))
| N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
mod = 1000000007
ret = [-1] * (N+1)
ret[0] = 1
for i in a:
ret[i] = 0
for i in range(1,N+1):
if ret[i] == 0:
continue
elif i == 1:
ret[1] = 1
else:
ret[i] = ret[i-2] + ret[i-1]
pr... | p03013 |
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
mod = 1000000007
ret = [-1] * (N+1)
ret[0] = 1
for i in a:
ret[i] = 0
for i in range(1,N+1):
if ret[i] == 0:
continue
elif i == 1:
ret[1] = 1
else:
ret[i] = ret[i-2] + ret[i-1]
pr... | N, M = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(M)])
mod = 1000000007
ret = [0] * (N+1)
ret[0] = 1
for i in range(1,N+1):
if i in a:
continue
elif i == 1:
ret[1] = 1
else:
ret[i] = ret[i-2] + ret[i-1]
print((ret[len(ret)-1]%mod))
| p03013 |
I=lambda:list(map(int,input().split()))
n,m=I()
b=[int(eval(input())) for i in range(m)]
b=list(set(b))
f={}
for i in b:
f[i]=1
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
if not f.get(i,0):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
print((dp[n]))
| def fib(n, broken):
a = 1
b = 1
for i in range(n-2):
# if i in broken:
a, b = b, a + b
print(b)
# t = int(input())
t = 1
for _ in range(t):
n, m = [int(x) for x in input().split()]
broken = set()
for _ in range(m):
broken.add(int(input()))
... | 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 in a: dp[i]=0
else: dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
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):
if i in a: dp[i]=0
else: dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
print((dp[n])) | p03013 |
N,M=list(map(int,input().split()))
A=[]
MOD=10**9+7
for _ in range(M):
A.append(int(eval(input())))
a,b,n=0,1,1
while n<=N:
if n in A:
a,b=b,0
else:
a,b=b,a+b
n+=1
print((b%MOD)) | N,M=list(map(int,input().split()))
MOD=10**9+7
p,q,n=0,1,1
for _ in range(M):
a=int(eval(input()))
while n<=a:
p,q=q,p+q
n+=1
q=0
while n<=N:
p,q=q,p+q
n+=1
print((q%MOD)) | p03013 |
n, m = list(map(int, input().split()))
a = list(int(eval(input())) for i in range(m))
p = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
for i in range(1, n+1):
dp[i] = (dp[i-1] + dp[i-2])%p
if i in a:
dp[i] = 0
print((dp[n]))
| n, m = list(map(int, input().split()))
a = set(list(int(eval(input())) for i in range(m)))
p = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
for i in range(1, n+1):
dp[i] = (dp[i-1] + dp[i-2])%p
if i in a:
dp[i] = 0
print((dp[n]))
| p03013 |
import math
# input
stairs, broken = list(map(int, input().split()))
broken_list = []
for i in range(broken):
broken_list.append(int(eval(input())))
# main
goalable = True
for i in range(1, broken):
if broken_list[i-1] == broken_list[i]-1:
goalable = False
break
if goalable:
broken_list... | # input
stairs, broken = list(map(int, input().split()))
conditions = [1] * (stairs + 1)
for i in range(broken):
tmp = int(eval(input()))
conditions[tmp] = 0
# main
for i in range(2, stairs+1):
conditions[i] *= (conditions[i-1] + conditions[i-2]) % (10**9+7)
print((conditions[stairs])) | p03013 |
N,M=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(M)]
dp=[1]*(N+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-1]+dp[i-2]
dp[i]%=1000000007
print((dp[N]))
| N,M=list(map(int,input().split()))
dp=[1]*(N+1)
for _ in range(M):
i=int(eval(input()))
dp[i]=0
for i in range(2,N+1):
if dp[i]!=0:
dp[i]=dp[i-1]+dp[i-2]
dp[i]%=1000000007
print((dp[N]))
| p03013 |
MOD = 10**9 + 7
N,M = list(map(int,input().split(' ')))
broken_list = [int(eval(input())) for i in range(M)]
ans = [0,1]
for n in range(1,N+1):
if n in broken_list:
ans.append(0)
else:
ans.append((ans[-2]+ans[-1]) % MOD)
print((ans[-1] % MOD)) | MOD = 10**9 + 7
N,M = list(map(int,input().split(' ')))
broken_list = set([int(eval(input())) for i in range(M)])
ans = [0,1]
for n in range(1,N+1):
if n in broken_list:
ans.append(0)
else:
ans.append((ans[-2]+ans[-1]) % MOD)
print((ans[-1] % MOD)) | p03013 |
import sys
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))
n, m = lmi()
a = [int(eval(input())) for i in range(m)]
l = [0] * (n+1)
l[0] = 1
h = list(range(n+1))
for i in a:
h.remove(i)
for i in h:
if i == 1:
l[i] = 1
elif i >= 2:
l[i] = l[i-... | import sys
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))
n, m = lmi()
l = [0] * (n+1)
l[0] = 1
a = 0
if m != 0:
a = int(eval(input()))
k = 1
for i in range(n+1):
if i != a:
if i == 1:
l[i] = 1
elif i >= 2:
l[i] = l[i... | p03013 |
import sys
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))
n, m = lmi()
l = [0] * (n+1)
l[0] = 1
a = 0
if m != 0:
a = int(eval(input()))
k = 1
for i in range(n+1):
if i != a:
if i == 1:
l[i] = 1
elif i >= 2:
l[i] = l[i... | import sys
sys.setrecursionlimit(10**7)
def lmi(): return list(map(int, input().split()))
n, m = lmi()
a = [1] * (n+1)
for i in range(m):
a[int(eval(input()))] = 0
k = [0] * (n+1)
k[0] = 1
for i in range(1,n+1):
if i == 1 and a[1]:
k[1] = 1
elif i >= 2 and a[i]:
k[i] = k[i-1] ... | p03013 |
import math
def cmb(n, r):
return math.factorial(n)// ( math.factorial(n-r) * math.factorial(r) )
N,M = input().split()
N = int(N)
M = int(M)
a = []
ans = 1
for i in range(M):
newa = int(eval(input()))
a.append(newa)
if (M != 0):
for k in range(M-1):
if (a[k+1] - a[k] ... |
N, M = input().split()
N = int(N)
M = int(M)
a = []
c = []
for i in range(M):
anew = int(eval(input()))
a.append(anew)
now_a = 0
a.append(-1)
ans = 0
for i in range( N + 1 ):
if (i == 0):
c.append(1)
elif (i == 1):
if (a[now_a] == i):
... | p03013 |
N,M=list(map(int,input().split()))
A=[int(eval(input())) for i in range(M)]
m=10**9+7
b=0
ans=[0,1]
for i in range(1,N+1):
if (i in A) and (i+1 in A):
print((0))
exit()
if i in A:
ans.append(0)
else:
ans.append(ans[-1]+ans[-2])
print((ans[-1] % m)) | N,M=list(map(int,input().split()))
N=list(range(1,N+1))
for i in range(M):
N[int(eval(input()))-1]=0
m=10**9+7
ans=[0,1]
for i in N:
if i==0 and i+1==0:
print((0))
exit()
if i==0:
ans.append(0)
else:
ans.append(ans[-1]+ans[-2])
print((ans[-1] % m)) | p03013 |
n,m = list(map(int, input().split()))
a = [-1] + [int(eval(input())) for _ in range(m)] + [n + 1]
MOD = 10 ** 9 + 7
fib = [0, 1]
for i in range(100100):
fib.append((fib[i] + fib[i + 1] % MOD))
res = 1
for i in range(m + 1):
p, q = a[i], a[i + 1]
res = (res * fib[q - p - 1]) % MOD
print(res) | n,m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10 ** 9 + 7
# broken[i] : i段目が壊れていたらTrue
broken = [False] * 100100
for i in a:
broken[i] = True
# dp[i] : i段目に行く通り数
dp = [0] * 100100
# 0段目に行く方法は1通り
dp[0] = 1
# 1段目からn段目について調べる
for i in range(1, n + 1):
# 壊れてるな... | p03013 |
N, M = list(map(int, input().split()))
A = [True for i in range(N + 1)]
dp = [0 for i in range(N + 2)]
for i in range(M):
a = int(eval(input()))
A[a] = False
dp[0] = 1
for i in range(N):
if A[i] == 0:
continue
dp[i + 1] += dp[i]
dp[i + 1] %= 1000000007
dp[i + 2] += dp... | N, M = list(map(int, input().split()))
A = [True for i in range(N + 2)]
dp = [0 for i in range(N + 3)]
for i in range(M):
a = int(eval(input()))
A[a] = False
dp[0] = 1
for i in range(N):
if A[i] == False:
continue
dp[i + 1] += dp[i]
dp[i + 1] %= 1000000007
dp[i + 2] +... | p03013 |
import sys
N, M = list(map(int, input().split()))
a = [int(line) for line in sys.stdin]
ans = [-1] * (N + 1) # not evaluated yet
for broken in a:
ans[broken] = 0 # unreachable
ans[0] = 1 # reachable
if ans[1]:
ans[1] = 1
for i in range(2, N + 1):
if ans[i]:
ans[i] = ans[i -... | import sys
N, M = list(map(int, input().split()))
ans = [-1] * (N + 1) # not evaluated yet
for line in sys.stdin:
ans[int(line)] = 0 # unreachable
ans[0] = 1 # reachable
if ans[1]:
ans[1] = 1
for i in range(2, N + 1):
if ans[i]:
ans[i] = ans[i - 1] + ans[i - 2]
print((ans[N... | p03013 |
n,m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
memo = [0]*(n+1)
memo[0] = 1
if 1 in a:
memo[1] = 0
else:
memo[1] = 1
for i in range(2,n+1):
if i in a:
continue
memo[i] = (memo[i-1] + memo[i-2])%1000000007
print((memo[n])) | n,m = list(map(int, input().split()))
a = set([int(eval(input())) for i in range(m)])
memo = [0]*(n+1)
memo[0] = 1
if 1 in a:
memo[1] = 0
else:
memo[1] = 1
for i in range(2,n+1):
if i in a:
continue
memo[i] = (memo[i-1] + memo[i-2])%1000000007
print((memo[n])) | p03013 |
n, m = list(map(int, input().split()))
an = [0]*m
for i in range(m):
# s = input()
an[i] = int( eval(input()) )
#an[-1] = n
#an.sort()
disjoint = False
for i in range(len(an)-1):
if an[i] + 1 == an[i+1]:
disjoint = True
if disjoint:
print((0))
else:
mod = 10**9+7
... | n, m = list(map(int, input().split()))
an = [0]*m
for i in range(m):
# s = input()
an[i] = int( eval(input()) )
#an[-1] = n
#an.sort()
disjoint = False
for i in range(len(an)-1):
if an[i] + 1 == an[i+1]:
disjoint = True
if disjoint:
print((0))
else:
mod = 10**9+7
... | p03013 |
#import sys
#sys.setrecursionlimit(10 ** 7)
'''
#import numpy as np
import math, string, itertools, fractions, heapq, collections, re, array, bisect, copy, functools, random
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
from itertools import permutations, combinations,... | def main():
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
b = set(a)
dp = [1] * N
if 1 in a:
dp[0] = 0
for i in range(1, N):
if i+1 in b:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
... | p03013 |
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
P = 1
Q = 0 if 1 in A else 1
for i in range(N-1):
p = 0 if i+2 in A else P+Q
P, Q = Q%(10**9+7), p%(10**9+7)
print(Q) | N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
L = [0]*(N+1)
for a in A:
L[a]=-1
L[0] = 1
L[1] += 1
for i in range(2, N+1):
if L[i]==-1:
L[i]=0
else:
L[i] = L[i-1]+ L[i-2]
print((L[-1]%(10**9+7))) | p03013 |
n, m = list(map(int, input().split()))
breaks = []
for _ in range(m):
breaks.append(int(eval(input()))-1)
stairs = [0 for _ in range(n)]
if n == 1:
print((1))
else:
if 0 not in breaks:
stairs[0]=1
if 1 not in breaks:
stairs[1]=1
for i in range(n):
if i+1 not in breaks:
... | n, m = list(map(int, input().split()))
stairs = [1]*(n+1)
for _ in range(m):
stairs[int(eval(input()))] = -1
flg = False
for i in range(2,n+1):
if stairs[i]==-1:
pass
elif stairs[i-1]==-1 and stairs[i-2]==-1:
flg=True
break
elif stairs[i-1]==-1:
stairs[i] = stairs[i-2]
elif stai... | p03013 |
n, m = list(map(int, input().split()))
arr = [int(eval(input())) for _ in range(m)]
mod = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
j = 0
for i in range(1, n + 1):
if j < m and i == arr[j]:
dp[i] = 0
j += 1
continue
if i == 1:
dp[1] = dp[0]
continue
... | n, m = list(map(int, input().split()))
arr = [int(eval(input())) for _ in range(m)]
broken = set(arr)
mod = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n + 1):
if i in broken:
continue
if i == 1:
dp[1] = dp[0]
continue
dp[i] = dp[i - 1] + dp[i -... | p03013 |
n,m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
dp = []
for dpi in range(n):
dp.append(0)
for j in range(n):
if j == 0 and j+1 not in a:
dp[j] = 1
elif j == 1 and j+1 not in a:
dp[j] = dp[j-1] + 1
elif j > 1 and j+1 not i... | n,m = list(map(int, input().split()))
a = []
for i in range(m):
a.append(int(eval(input())))
dp = []
for dpi in range(n):
dp.append(0)
k = 0
a.append(0)
for j in range(n):
if j+1 == a[k]:
k += 1
continue
if j == 0:
dp[j] = 1
elif j == 1:
dp[j] = ... | p03013 |
import sys
N,M = list(map(int, input().split()))
A = [0]*M
for i in range(M):
A[i] = int(eval(input()))
dp = [0]*(N+1)
if N == 1:
if 1 in A:
print('0')
sys.exit()
else:
print('1')
sys.exit()
if 1 in A:
dp[1] = 0
else:
dp[1] = 1
dp[0] = 1
for i ... | import sys
N,M = list(map(int, input().split()))
dp = [-1]*(N+1)
dp[0] = 1
dp[1] = 1
for i in range(M):
num = int(eval(input()))
dp[num] = 0
for i in range(2, N+1):
if dp[i] == 0:
continue
dp[i] = dp[i-1]%1000000007 + dp[i-2]%1000000007
print((dp[N]%1000000007)) | p03013 |
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 10**9+7
dp = [0]*(n+1)
dp[0], dp[1] = 1, 1
if 1 in a:
dp[1] = 0
for i in range(2, n+1):
if i not in a:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
print((dp[n])) | n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 10**9+7
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]
dp[i] %= mod
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 culcC(num):
if num < 2:
return 1
ret = 1
minus2... | def fib(num):
a, b = 0, 1
for _ in range(num - 1):
# print(a)
a, b = a + b, a
return a + b
def culcC(num):
if num < 2:
return 1
return fib(num) + fib(num-1)
n,m = list(map(int,input().split()))
aa = [int(eval(input())) for i in range(m)]
if n ... | p03013 |
N,M = list(map(int,input().split()))
num = 1000000007
hole = [False]*(N+1)
a = [int(eval(input())) for _ in range(M)]
for i in a:
hole[i] = True
dp = [0]*(N+1)
dp[0] = 1
for i in range(1,N+1):
if i == 1:
if hole[i] == True:
dp[i] = 0
else:
dp[i] = dp[0]
else:
if ho... | 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 |
def xgcd(a, b):
if b == 0:
g = a
x = 1
y = 0
return g, x, y
else:
g, s, t = xgcd(b, a%b)
x = t
y = s - a//b*x
return g, x, y
def invmod(a, p):
_, x, _ = xgcd(a, p)
if x < 0:
x = x + p
return x
def count_route... | def xgcd(a, b):
if b == 0:
g = a
x = 1
y = 0
return g, x, y
else:
g, s, t = xgcd(b, a%b)
x = t
y = s - a//b*x
return g, x, y
def invmod(a, p):
_, x, _ = xgcd(a, p)
if x < 0:
x = x + p
return x
def count_route... | p03013 |
def xgcd(a, b):
if b == 0:
g = a
x = 1
y = 0
return g, x, y
else:
g, s, t = xgcd(b, a%b)
x = t
y = s - a//b*x
return g, x, y
def invmod(a, p):
_, x, _ = xgcd(a, p)
if x < 0:
x = x + p
return x
def count_route... | n , m = list(map(int, input().split()))
const = 1000000007
r = [1 for i in range(n+1)]
for i in range(m):
r[int(eval(input()))] = 0
for i in range(2, n+1):
if r[i] > 0:
r[i] = (r[i-1] + r[i-2])%const
print((r[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
for now in range(0, n + 1):
for next_step in range(now + 1, min(n + 1, now + 3)):
if not next_step in a:
dp[next_step] += dp[now]
dp[next_step]... | 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
for now in range(0, n + 1):
for next_step in range(now + 1, min(n + 1, now + 3)):
if not next_step in a:
dp[next_step] += dp[now]
d... | p03013 |
#!/usr/bin/env python3
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ng = [False] * (10**5 + 1)
for x in a:
ng[x] = True
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n + 1):
if i > 0 and not ng[i - 1]: dp[i] += dp[i - 1]
if i > 1 and not ng[i - 2... | #!/usr/bin/env python3
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ok = [True] * (n + 1)
for x in a:
ok[x] = False
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n + 1):
if i > 0 and ok[i - 1]:
dp[i] = (dp[i] + dp[i - 1]) % mod
if i > 1 ... | p03013 |
#!/usr/bin/env python3
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ok = [True] * (n + 1)
for x in a:
ok[x] = False
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n + 1):
if i > 0 and ok[i - 1]:
dp[i] = (dp[i] + dp[i - 1]) % mod
if i > 1 ... | #!/usr/bin/env python3
mod = 10**9 + 7
n, m = list(map(int, input().split()))
ok = [True] * (n + 1)
if m > 0:
a = [int(eval(input())) for _ in range(m)]
for x in a:
ok[x] = False
dp = [0] * (n + 1)
dp[0] = 1
for i in range(n + 1):
if i > 0 and ok[i - 1]:
dp[i] = (dp[i] + dp[i - 1... | p03013 |
Mod = 10**9+7
N,M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
b = [1]
b_append = b.append
for i in range(1,N+1):
if i in a:
b.append(0)
continue
if i == 1:
b.append(1)
continue
b.append(b[i-1]+b[i-2])
if b[i] >= Mod:
... | Mod = 10**9+7
N,M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
b = [1]*(N+1)
for j in a:
b[j] = 0
for i in range(1,N+1):
if b[i] == 0:
continue
if i == 1:
b[1] = 1
continue
b[i] = b[i-1]+b[i-2]
if b[i] >= Mod:
b[i] %= Mod
... | p03013 |
N,M=list(map(int,input().split()))
mod=10**9+7
dp=[0 for i in range(N+1)]
dp[0]=1
dp[-1]=0
A=[]
for i in range(M):
A.append(int(eval(input())))
#print(A)
for i in range(1,N+1):
if dp[i-1]==0 and dp[i-2]==0:
break
elif i in A:
continue
else:
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[N]%mo... | N,M=list(map(int,input().split()))
mod=10**9+7
dp=[0]*(N+1)
dp[0]=1
dp[-1]=0
A=[]
for i in range(M):
A.append(int(eval(input())))
A=set(A)
#print(A)
for i in range(1,N+1):
if dp[i-1]==0 and dp[i-2]==0:
break
elif i in A:
continue
else:
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[N]%mod))
... | p03013 |
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
mod = 1000000007
dp = [0 for _ in range(N + 1)]
dp[0] = 1
if 1 not in A:
dp[1] = 1
for n in range(2, N + 1):
if n in A:
dp[n] = 0
else:
dp[n] = dp[n - 1] + dp[n - 2]
if dp[n] >= mod:
... | N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
mod = 1000000007
dp = [1 for _ in range(N + 1)]
for a in A:
dp[a] = 0
for n in range(2, N + 1):
dp[n] *= dp[n - 1] + dp[n - 2]
if dp[n] >= mod:
dp[n] -= mod
print((dp[N]))
| p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dp=[1]*(n+1)
k=10**9+7
for i in range(1,n+1):
if i in a:
dp[i]=0
else:
if i!=1:
dp[i]=(dp[i-1]+dp[i-2])%k
print((dp[-1])) | n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dp=[1]*(n+1)
for i in a:
dp[i]=0
k=10**9+7
for i in range(2,n+1):
if dp[i]!=0:
dp[i]=(dp[i-1]+dp[i-2])%k
print((dp[-1]))
| p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dp=[0]*(n+2)
num=10**9+7
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)) | n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dp=[1]*(n+1)
for i in a:
dp[i]=0
k=10**9+7
for i in range(2,n+1):
if dp[i]!=0:
dp[i]=(dp[i-1]+dp[i-2])%k
print((dp[-1]))
| p03013 |
n,m = list(map(int,input().split()))
displace = []
for _ in range(m):
displace.append(int(eval(input())))
dp = [1]
if 1 in displace:
dp.append(0)
else:
dp.append(1)
for i in range(2,n+1):
next_case = 0
if i not in displace:
next_case += dp[i-1]+dp[i-2]
dp.append(next_cas... | n,m = list(map(int,input().split()))
displace = {}
for _ in range(m):
displace[int(eval(input()))] = 1
dp = {0:1}
if 1 in displace:
dp[1] = 0
else:
dp[1] = 1
for i in range(2,n+1):
next_case = 0
if i not in displace:
next_case += dp[i-1]+dp[i-2]
dp[i] = next_case%100000000... | p03013 |
import sys
sys.setrecursionlimit(500000)
from bisect import bisect_left
N, M = list(map(int, input().split()))
A = [int(eval(input())) for i in range(M)]
from functools import lru_cache
@lru_cache(maxsize=None)
def fibo(n):
ind = bisect_left(A, n)
if ind < M and n == A[ind]:
return 0
el... | N, M = list(map(int, input().split()))
A = set([int(eval(input())) for i in range(M)])
t = 10**9+7
import sys
sys.setrecursionlimit(500000)
from functools import lru_cache
@lru_cache(maxsize=None)
def fibo(n):
if n in A:
return 0
elif n == 0 or n == 1:
return 1
return (fibo(n-2) ... | p03013 |
n,m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 10**9+7
# i番目にたどり着く総数
dp = [0 for i in range(n+1)]
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(n-1):
if i+2 in a:
dp[i+2] = 0
else:
dp[i+2] = (dp[i] + dp[i+1])%mod
prin... | n,m = list(map(int, input().split()))
break_stair = [False for i in range(n)]
for i in range(m):
break_stair[int(eval(input()))-1] = True
mod = 10**9+7
# i番目にたどり着く総数
dp = [0 for i in range(n+1)]
dp[0] = 1
if break_stair[0]:
dp[1] = 0
else:
dp[1] = 1
for i in range(n-1):
if break_stair[i+1]:... | p03013 |
N, M = list(map(int,input().split()))
A_list = [int(eval(input())) for _ in range(M)]
Dp_list = [0] * (N+1)
Dp_list[0] = 1
inf = 1000000007
if 1 in A_list:
Dp_list[1] = 0
else:
Dp_list[1] = 1
if N != 1:
for i in range(2, N + 1):
if i in A_list:
continue
Dp_list... | N, M = list(map(int,input().split()))
A_list = set([int(eval(input())) for _ in range(M)])
Dp_list = [0] * (N+1)
Dp_list[0] = 1
if 1 in A_list:
Dp_list[1] = 0
else:
Dp_list[1] = 1
if N != 1:
for i in range(2, N + 1):
if i in A_list:
continue
Dp_list[i] = Dp_list... | p03013 |
N, M = [int(nm) for nm in input().split()]
A = []
for m in range(M):
A.append(int(eval(input())))
C = [1, 0] # [-2段目, -1段目]
C += [0]*(N+10) # C = [-2段目, -1段目, 0段目, 1段目, 2段目, ...]
for n in range(0, N+1):
if n not in A:
C[n+2] = (C[n] + C[n+1]) % 1000000007
else: # n in A:
C[n+2] = 0
ans = C[... | N, M = [int(nm) for nm in input().split()]
if M != 0:
a = int(eval(input()))
C = [1, 0] # [-2段目, -1段目]
C += [0]*(N+10) # C = [-2段目, -1段目, 0段目, 1段目, 2段目, ...]
for n in range(0, N+1):
if M == 0:
C[n+2] = (C[n] + C[n+1]) % 1000000007
else: # M > 0:
if n != a:
C[n+2] = (C[n] + C[n+1]) % 1000... | p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
mod=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]%=mod
print((dp[n]))
| N,M = list(map(int,input().split()))
a = set(int(eval(input())) for x in range(M))
A = [0]*(N+1)
mod = 1000000007
A[0] = 1
if not(1 in a):
A[1] = 1
for i in range(2,N+1):
if i in a:
A[i] = 0
else:
A[i] = (A[i-2] + A[i-1]) % mod
print((A[N]))
| p03013 |
import sys
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
A = []
for m in range(M):
a = ir()
A.append(a)
C = [0 for _ in range(N+1)]
C[0] = 1
for i in range(len(C)):
if i in A:
con... | import sys
sys.setrecursionlimit(10 ** 9)
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N, M = lr()
A = {i: False for i in range(N+1)}
for m in range(M):
a = ir()
A[a] = True
C = [0 for _ in range(N+1)]
C[0] = 1
for i in range(len(C)):
... | p03013 |
import sys
from collections import deque
from collections import defaultdict
import math
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
a = set(a)
mod = 10**9+7
dp = [0]*(n+5)
dp[0] = 1
for i in range(1,n+1):
... | import sys
from collections import deque
from collections import defaultdict
import math
sys.setrecursionlimit(20000000)
input = sys.stdin.readline
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
a = set(a)
mod = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
for i in range(1,n+1):
... | p03013 |
import sys
input = sys.stdin.readline #for input speed
sys.setrecursionlimit(10**6)
N, M = list(map(int, input().split()))
a_list = []
dp = [0]*(N+1)
for _ in range(M):
a = int(eval(input()))
a_list.append(a)
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_list:
... | N, M = list(map(int, input().split()))
a_list = 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_list:
dp[i] = 0
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 = 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 not in A:
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 = [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])) | p03013 |
MOD = (10**9 + 7)
broken_step = []
line = [int(s) for s in input().split()]
N, M = line[0], line[1]
for i in range(M):
step_num = int(input().split()[0])
broken_step.append(step_num)
dp = [0]*(N+1)
dp[0] = 1
if 1 in broken_step:
dp[1] = 0
else:
dp[1] ... | MOD = (10**9 + 7)
line = [int(s) for s in input().split()]
N, M = line[0], line[1]
b = [0]*(N+1)
for i in range(M):
step_num = int(input().split()[0])
b[step_num] = 1
dp = [0]*(N+1)
dp[0] = 1
if b[1] == 1:
dp[1] = 0
else:
dp[1] = 1
for i in ... | p03013 |
import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n,m = MAP()
a = [INT() for _... | import math
import collections
import itertools
import sys
import bisect
from heapq import heappop,heappush
sys.setrecursionlimit(10**6)
def MAP(): return list(map(int,input().split()))
def INT(): return int(eval(input()))
def FLOAT(): return float(eval(input()))
MOD = 10**9+7
n,m = MAP()
a = [INT() for _... | p03013 |
N,M = list(map(int,input().split()))
A = list(map(int,[eval(input()) for i in range(M)]))
dp = {i:0 for i in A}
dp[0]=1 # 0段目
if 1 in A: # 1段目
dp[1]=0
else :
dp[1]=1
for i in range(2,N+1):
if i in A:
continue
else :
dp[i]=dp[i-1]+dp[i-2]
print((dp[N]%1000000007)) | n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
dp=[0]*(n+1)
dp[0]=1
af = [0]*(n+1)
for ai in a:
af[ai]+=1
if 1 in a:
dp[1]=0
else:
dp[1]=1
for i in range(2,n+1):
dp[i]=dp[i-2]+dp[i-1]
if af[i]==1:
dp[i]=0
print((dp[-1]%1000000007)) | p03013 |
n, m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
r = [0]*(n+1)
r[0] = 1
if 1 in a:
r[1] = 0
else:
r[1] = 1
for i in range(2, n+1):
if i in a:
continue
r[i] = (r[i-1] + r[i-2])%1000000007
print((r[n])) | n, m = list(map(int, input().split()))
a = set([int(eval(input())) for i in range(m)])
r = [0]*(n+1)
r[0] = 1
if 1 in a:
r[1] = 0
else:
r[1] = 1
for i in range(2, n+1):
if i in a:
continue
r[i] = (r[i-1] + r[i-2])%1000000007
print((r[n])) | p03013 |
n,m=list(map(int,input().split()))
D=[1]*(n+1)
for _ in range(m): D[int(eval(input()))]=0
for i in range(n+1):
if i>1: D[i]=(D[i-1]+D[i-2])%(10**9+7)*D[i]
print((D[i])) | n,m=list(map(int,input().split()))
D=[1]*(n+1)
for _ in range(m): D[int(eval(input()))]=0
for i in range(n+1):
if i>1: D[i]=(D[i-1]+D[i-2])%(10**9+7)*D[i]
print((D[n])) | p03013 |
N,M = list(map(int, input().split()))
lst1 = [int(eval(input())) for i in range(M)]
from functools import lru_cache
@lru_cache(maxsize=None)
def fib(n):
a, b = 1, 2
for i in range(1,n+1):
if (i == 1):
if (i in lst1):
a, b = 0, 1
else:
if (i in lst1):
a, b = 0,... | n,m=list(map(int,input().split()))
D=[1] * (n + 1)
for _ in range(m):
D[int(eval(input()))] = 0
for i in range(n+1):
if i > 1:
D[i] = (D[i-1] + D[i-2]) % 1000000007 * D[i]
print((D[i])) | p03013 |
n, m = list(map(int,input().split()))
dp = [1]*(n+1)
a = []
for i in range(m):
ai = int(eval(input()))
a.append(ai)
if 1 in a:
dp[1] = 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[n])) | n, m = list(map(int,input().split()))
dp = [1]*(n+1)
a = []
for i in range(m):
ai = int(eval(input()))
a.append(ai)
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]) % (10**9+7)
print((dp[n])) | p03013 |
import sys
input = sys.stdin.readline
def typical_stairs():
n, m = list(map(int, input().split()))
dangerous = set(int(eval(input())) for _ in range(m))
mod = 1000000007
dp = [0] * (n + 1)
dp[0] = 1
if 1 not in dangerous:
dp[1] = 1
for i in range(2, n + 1):
if ... | def typical_stairs():
n, m, *dangerous = list(map(int, open(0).read().split()))
dangerous = set(dangerous)
mod = 1000000007
dp = [0] * (n + 1)
dp[0] = 1
if 1 not in dangerous:
dp[1] = 1
for i in range(2, n + 1):
if i not in dangerous:
dp[i] = (dp[i - 2] ... | 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 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-1] + DP[i-2]
print((DP[N]%(1000000007))) | [N,M] = list(map(int,input().split()))
a = [int(eval(input())) for i in range(M)]
DP = [-1]*(N+1)
DP[0] = 1
if 1 in a:
DP[1] = 0
else:
DP[1] = 1
for i in range(len(a)):
DP[a[i]] = 0
for i in range(2,N+1):
if DP[i] == -1:
DP[i] = (DP[i-1] + DP[i-2])%1000000007
print((DP[N]%(100000000... | p03013 |
import sys
sys.setrecursionlimit(1000000)
MAX_N = 100010
memo = [-1] * MAX_N
def f(n, a_list):
if n == 0:
return 0
elif n == 1:
return 1
elif n == 2:
for a in a_list:
if N - a == 1:
return 1
return 2
# すでに探索済みならメモを参照する
... | if __name__ == '__main__':
n, m = list(map(int,input().split()))
a = set([int(eval(input())) for i in range(m)])
MOD = 1000000007
dp = [0 for i 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-1 in a) and (i-2 in a):
... | 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)
for i in range(N+1):
if i == 0:
dp[i] = 1
elif i == 1:
if i in a:
dp[i] = 0
a.remove(i)
elif i not in a:
dp[i] = 1
... | N, M = list(map(int, input().split()))
a = [0] * M
for i in range(M):
a[i] = int(eval(input()))
dp = [0] * (N+1)
for i in range(N+1):
if i == 0:
dp[i] = 1
elif i == 1:
if len(a) !=0:
if i == a[0]:
dp[i] = 0
a.pop(0)
... | p03013 |
mod = 10**9+7
import sys
sys.setrecursionlimit(1000000)
N,M = [int(x) for x in input().split()]
a = [int(eval(input())) for _ in range(M)]
di = {}
for i in a:
di[i] = 1
dp = [0 for _ in range(N+1)]
dp[0] = 1
def dfs(num):
if(num<0):
return 0
if(num==0):
return 1
if(num... | mod = 10**9+7
import sys
sys.setrecursionlimit(10000000)
N,M = [int(x) for x in input().split()]
a = [int(eval(input())) for _ in range(M)]
di = {}
for i in a:
di[i]=1
dp = [0 for _ in range(N+1)]
dp[0] = 1
for i in range(N+1):
if(i in di):
continue
if(i<N-1):
if(i+2 not in d... | p03013 |
import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
if m>0:
a=[int(eval(input())) for i in range(m)]
dp=[0]*(n+1)
dp[0]=1
if m>0:
if a[0]==1:
dp[1]=0
else:
dp[1]=1
else:
dp[1]=1
for i in range(2,n+1):
if m>0:
if i in a:
dp[i... | import sys
input=sys.stdin.readline
n,m=list(map(int,input().split()))
if m>0:
a=[int(eval(input())) for i in range(m)]
dp=[None]*(n+1)
dp[0]=1
for i in range(m):
dp[a[i]]=0
if dp[1]==None:
dp[1]=1
for i in range(2,n+1):
if dp[i]==None:
dp[i]=(dp[i-2]+dp[i-1])%1000000007
prin... | p03013 |
N, M = list(map(int, input().split()))
oks = [True] * (N+1)
for _ in range(M):
a = int(eval(input()))
oks[a] = False
dp = [1] + [0] * N
for now in range(N):
for nxt in range(now+1, min(N, now+2)+1):
if oks[nxt]:
dp[nxt] += dp[now]
dp[nxt] %= 1e9 + 7
print((in... | MOD = 10**9 + 7
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)] + [N + 1]
dp = [0] * (N + 1)
dp[0] = 1
s = -1
for broken in a:
for j in range(s + 1, broken):
if j > s + 1:
dp[j] += dp[j - 1] % MOD
if j > 1:
dp[j] += dp[j - 2] % M... | p03013 |
n,m=list(map(int,input().split()))
a=[1 for i in range(n+2)]
for i in range(m):
a[int(eval(input()))]=0
dp=[0 for i in range(n+1)]
dp[0]=1
for i in range(n):
if ((i+1)<(n+1)) and a[i+1]:
dp[i+1]+=dp[i]
if ((i+2)<(n+1)) and a[i+2]:
dp[i+2]+=dp[i]
print((dp[n]%1000000007))
| n,m=list(map(int,input().split()))
a=[1 for i in range(n+2)]
for i in range(m):
a[int(eval(input()))]=0
dp=[0 for i in range(n+1)]
dp[0]=1
for i in range(n):
if ((i+1)<(n+1)) and a[i+1]:
dp[i+1]=(dp[i+1]+dp[i])%1000000007
if ((i+2)<(n+1)) and a[i+2]:
dp[i+2]+=(dp[i+2]+dp[i])%100000... | p03013 |
N, M = list(map(int, input().split()))
broken = []
for i in range(M):
broken.append(int(eval(input())))
a1, a2, a3 = 1, 0, 0
for i in range(1, N+1):
a3 = a2
a2 = a1
if i in broken:
a1 = 0
else:
a1 = (a2 + a3) % 1000000007
print(a1) | N, M = list(map(int, input().split()))
m = 0
if M > 0:
broken = int(eval(input()))
else:
broken = 0
a1, a2, a3 = 1, 0, 0
for i in range(1, N+1):
a3, a2 = a2, a1
if i == broken:
a1 = 0
m += 1
if m < M:
broken = int(eval(input()))
else:
a1 = (a2 + a3) % 1000000007
print(a1) | p03013 |
n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
step = [0] * (n+1)
step[0] = 1
if 1 not in a:
step[1] = 1
else:
step[1] = 0
for i in range(2,n+1):
if i in a:
continue
step[i] = step[i-1] + step[i-2]
step[-1] %= 1000000007
print((step[-1])) | n,m = list(map(int,input().split()))
a = set([int(eval(input())) for _ in range(m)])
step = [0] * (n+1)
step[0] = 1
if 1 not in a:
step[1] = 1
else:
step[1] = 0
for i in range(2,n+1):
if i in a:
continue
step[i] = (step[i-1] + step[i-2]) % 1000000007
print((step[-1])) | p03013 |
n, m = list(map(int, input().split()))
a = [-1] + [int(eval(input())) for i in range(m)] + [n+1]
res = 1
for i in range(1, len(a)):
if a[i] == 1:
continue
tmp = a[i] - a[i-1] - 2
if tmp < 0:
tmp2 = 0
elif tmp <= 1:
tmp2 = 1
elif tmp <= 2:
tmp2 = 2
e... | n, m = list(map(int, input().split()))
a = [-1] + [int(eval(input())) for i in range(m)] + [n+1]
res = 1
for i in range(1, len(a)):
steps = a[i] - a[i-1] - 2
if steps < 0:
patern_nmu = 0
elif steps <= 1:
patern_nmu = 1
elif steps <= 2:
patern_nmu = 2
else:
... | p03013 |
N, M = list(map(int, input().split()))
if M == 0:
alist = set()
else:
alist = set(int(eval(input())) for _ in range(M))
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1 if 1 not in alist else 0
MOD = 10**9 + 7
for i in range(2, N + 1):
if i in alist:
continue
dp[i] = (dp[i - 1] + dp[i - ... | import sys
N, M = list(map(int, input().split()))
if M == 0:
alist = set()
else:
# Input below rows
alist = set(map(int, sys.stdin))
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1 if 1 not in alist else 0
MOD = 10**9 + 7
for i in range(2, N + 1):
if i in alist:
continue
dp[i] =... | p03013 |
n, m = list(map(int, input().split()))
broken = [False] * (n + 1)
for _ in range(m):
broken[int(eval(input()))] = True
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if not broken[i - 1]:
dp[i] += (dp[i - 1])
if not broken[i ... | n, m = list(map(int, input().split()))
broken = [False] * (n + 1)
for _ in range(m):
broken[int(eval(input()))] = True
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if broken[i]:
continue
dp[i] = (dp[i - 1] + dp[i - 2]) % MO... | p03013 |
# input here
_INPUT = """\
10 2
4
5
"""
"""
K = int(input())
H, W, K = map(int, input().split())
a = list(map(int, input().split()))
xy = [list(map(int, input().split())) for i in range(N)]
p = tuple(map(int,input().split()))
"""
def main():
N, M = list(map(int, input().split()))
a = [int(eval(in... | 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 |
MOD = 10**9 + 7
N, M = [int(i) for i in input().strip().split()]
dirty_step_idxs = [0] * M
for i in range(M):
dirty_step_idx = int(eval(input()))
dirty_step_idxs[i] = dirty_step_idx
def fibonacci(n):
# 0, 1, 1, 2, 3, 5, 8, ...
a, b = 0, 1
for i in range(n-1):
a, b = b, a + b
return a
... | import sys
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
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))
exit()
broken =... | p03013 |
n,m,*a=list(map(int,open(0).read().split()))
a=set(a)
dp=[0]*(n+2)
dp[0]=1
div=1000000007
for i in range(n):
dp[i]%=div
if i+1 in a:
dp[i+1]=0
else:
dp[i+1]+=dp[i]
if i+2 in a:
dp[i+2]=0
else:
dp[i+2]+=dp[i]
print((dp[n]%div)) | import sys
readline = sys.stdin.readline
N,M = list(map(int,readline().split()))
broken = set([int(readline()) for i in range(M)])
dp = [0] * (N + 1)
dp[0] = 1
if 1 not in broken:
dp[1] = 1
DIV = 10 ** 9 + 7
for i in range(2, N + 1):
if i in broken:
continue
dp[i] = dp[i - 2] + dp[i - ... | p03013 |
n, m = list(map(int, input().split(' ')))
aaa = []
for i in range(m):
aaa.append(int(eval(input())))
dp = [1] * (n + 3)
for i in range(1, n+1):
dp[i] = dp[i-1] if i not in aaa else 0
dp[i] += dp[i-2] if i >= 2 and i not in aaa else 0
dp[i] = dp[i] % int(1e9 + 7)
print((dp[n])) | n, m = list(map(int, input().split(' ')))
aaa = [0] * (n + 3)
for i in range(m):
aaa[int(eval(input()))] = True
dp = [1] * (n + 3)
for i in range(1, n+1): # 1e5
if not aaa[i]:
dp[i] = dp[i-1]
if i >= 2:
dp[i] += dp[i-2]
dp[i] = dp[i] % int(1e9 + 7)
else:
... | p03013 |
n,m,*a=list(map(int,open(0).read().split()))
dp=[-1]*(n+1)
for i in a:
dp[i]=0
dp[0]=1
for i in range(1,n+1):
if dp[i]!=0:
dp[i]=dp[i-1]+dp[i-2]*(i>1)
print((dp[-1]%(10**9+7))) | n,m,*a=list(map(int,open(0).read().split()))
d=[1]*(n+1)
for i in a:
d[i]=0
for i in range(2,n+1):
if d[i]!=0:
d[i]=d[i-1]+d[i-2]
print((d[-1]%(10**9+7))) | p03013 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | p03013 |
N, M = [int(_) for _ in input().split()]
A = [int(eval(input())) for _ in range(M)]
dp = [0 for _ in range(N+1)]
P = 10**9 + 7
dp[0] = 1
for i in range(1, N+1):
if i in A:
dp[i] = 0
elif i == 1:
dp[i] = dp[i-1] % P
else:
dp[i] = (dp[i-1] + dp[i-2]) % P
print((dp[-1]))... | N, M = [int(_) for _ in input().split()]
A = set([int(eval(input())) for _ in range(M)])
dp = [0 for _ in range(N+1)]
P = 10**9 + 7
dp[0] = 1
for i in range(1, N+1):
if i in A:
dp[i] = 0
elif i == 1:
dp[i] = dp[i-1] % P
else:
dp[i] = (dp[i-1] + dp[i-2]) % P
print((dp[... | p03013 |
import math
import sys
n, m = list(map(int, input().split()))
a_list = [None] * (m + 2)
a_list[0] = -1
for i in range(m):
a_list[i+1] = int(eval(input()))
a_list[-1] = n + 1
fact_memo = dict()
def fact(n):
if n in list(fact_memo.keys()):
return fact_memo[n]
f = math.factorial(n)
... | import sys
sys.setrecursionlimit(10 ** 6)
readline = sys.stdin.readline
N, M = list(map(int, readline().split()))
ans = [0] * (N + 2)
ans[0] = 1
for _ in range(M):
a = int(readline())
ans[a] = -1
for i in range(1, N + 1):
if ans[i] == -1:
continue
a1 = max(ans[i - 2], 0)
a2 ... | p03013 |
def resolve():
# 整数 1 つ
#n, m = int(input())
# 整数複数個
n, m = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
A = [int(eval(input())) for i in range(m)]
# 整数 N 個 (スペース区切り)
#A = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
# A = [list(map(int, input().split())) for ... | import sys
def main():
input = sys.stdin.readline
MOD = 10**9 + 7
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
is_safe = [True] * (N+2)
for a in A:
is_safe[a+1] = False
dp = [0] * (N+2)
dp[1] = 1
for i in range(2, N+2):
... | p03013 |
def resolve():
import sys
input = sys.stdin.readline
# 整数 1 つ
#n, m = int(input())
# 整数複数個
n, m = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
A = [int(eval(input())) for i in range(m)]
# 整数 N 個 (スペース区切り)
#A = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
... | def resolve():
import sys
input = sys.stdin.readline
# 整数 1 つ
#n, m = int(input())
# 整数複数個
n, m = list(map(int, input().split()))
# 整数 N 個 (改行区切り)
A = [int(eval(input())) for i in range(m)]
# 整数 N 個 (スペース区切り)
#A = list(map(int, input().split()))
# 整数 (縦 H 横 W の行列)
... | p03013 |
n,m=list(map(int,input().split()))
dp=[0]*(n+1)
f=[]
dp[0]=1
for i in range(m):
t=int(eval(input()))
f.append(t)
for i in range(1,n+1):
if i in f:
continue
else:
if dp[i-1] != 0:
dp[i] += dp[i-1]
if i > 1:
if dp[i-2] != 0:
... | n,m=list(map(int,input().split()))
dp=[0]*(n+1)
f=[]
dp[0]=1
f=[True]*(n+1)
for _ in range(m):
f[int(eval(input()))]=False
for i in range(1,n+1):
if f[i]==False:
continue
else:
if dp[i-1] != 0:
dp[i] += dp[i-1]
if i > 1:
if dp[i-2] != 0:
... | p03013 |
N,M=list(map(int,input().split()))
mod=10**9+7
a=[]
for i in range(M):
a.append(int(eval(input())))
DP=[1]*(N+1)
if 1 in a:
DP[1]=0
for i in range(2,N+1):
if i in a:
DP[i]=0
if DP[i-1]==0:
print((0))
exit()
else:
DP[i]=DP[i-1]+DP[i-2... | N,M=list(map(int,input().split()))
mod=10**9+7
a=[]
for i in range(M):
a.append(int(eval(input())))
a.sort(reverse=True)
DP=[1]*(N+1)
if len(a)>0 and 1==a[-1]:
DP[1]=0
a.pop()
for i in range(2,N+1):
if len(a)>0 and i==a[-1]:
DP[i]=0
a.pop()
if DP[i-1]==0:
... | p03013 |
n,m=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(m)]
dp=[1]+[0]*(n+1)
for i in range(n):
if i in A:
continue
dp[i+1] += dp[i]
dp[i+2] += dp[i]
print((dp[n]%(10**9 + 7))) | n,m=list(map(int,input().split()))
A={int(eval(input())) for _ in range(m)}
dp=[1]+[0]*(n+1)
for i in range(n):
if i in A:
continue
dp[i+1] += dp[i]
dp[i+2] += dp[i]
print((dp[n]%(10**9 + 7))) | p03013 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
f... | p03013 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
p = 10**9 + 7
n, m = list(map(int, input().split()))
A = list(int(eval(input())) for i in range(m))
isHole = [False]*(n+1)
dp = [1]*(n+1)
for a in A:
isHole[a] = True
dp[a] = 0
for i in range(2,n+1):
if isHole[i] ==... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
p=10**9+7
n, m = list(map(int, input().split()))
a = list(int(eval(input())) for i in range(m))
safe = [1]*(n+1)
for aa in a:
safe[aa]=0
dp = [0]*(n+1)
dp[0] = 1
if safe[1]:dp[1]=1
for i in range(2,n+1):
if not safe[i]:
... | p03013 |
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
D = 1000000007
dp = [1]*(N+1)
for i in a:
dp[i] = 0
for i in range(2, len(dp)):
if i in a:
continue
dp[i] = dp[i-1] + dp[i-2]
print((dp[-1]%D)) | N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
D = 1000000007
dp = [1]*(N+1)
for i in a:
dp[i] = 0
for i in range(2, len(dp)):
if dp[i]==0:
continue
dp[i] = dp[i-1] + dp[i-2]
print((dp[-1]%D)) | p03013 |
N,M = (int(x) for x in input().split())
Broken = [True]*(N+1)
for TM in range(0,M):
Broken[int(eval(input()))] = False
DP = [1]+[0]*N
for Now in range(0,N):
for Next in range(Now+1,min(N+1,Now+3)):
if Broken[Next]==True: DP[Next] += DP[Now]
print((DP[N]%1000000007)) | N,M = (int(x) for x in input().split())
Broken = [True]*(N+1)
for TM in range(0,M):
Broken[int(eval(input()))] = False
DP = [1]+[0]*N
for Now in range(0,N):
for Next in range(Now+1,min(N+1,Now+3)):
if Broken[Next]==True:
DP[Next] = (DP[Next]+DP[Now])%1000000007
print((DP[N])) | p03013 |
import math
def routeCombCount(distance):
comb_count = 1
max_skippable_count = distance // 2
if max_skippable_count == 0:
return 1
for skippable_count in range(1, max_skippable_count + 1):
step_count = distance - skippable_count
comb_count += combinations_count(step_count, skippable_co... | N, M = list(map(int, input().split()))
halls = {}
for i in range(M):
index = int(eval(input()))
halls[index] = True
dp = [1] * (N + 1)
for i in range(1, N + 1):
if i in halls:
dp[i] = 0
continue
if i == 1:
continue
dp[i] = dp[max(0, i - 1)] + dp[max(0, i - 2... | p03013 |
n, m = [int(i) for i in input().split()]
a = []
for i in range(m):
a.append(int(eval(input())))
if 1 in a:
step = [1,0]
else:
step = [1,1]
for i in range(2, n + 1):
if i in a:
step.append(0)
else:
step.append((step[-1] + step[-2])%1000000007)
print((step[-1])) | n, m = [int(i) for i in input().split()]
a = [int(eval(input())) for i in range(m)]
a.append(n + 1)
a.insert(0, -1)
b = [i-j-1 for i,j in zip(a[1:], a[:-1])]
mm = max(b) - 1
step = [0,1]
for i in range(mm):
step.append(step[-1] + step[-2])
mul = 1
for i in b:
mul *= step[i]
print((mul%10000... | p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
p,q=0,1
for i in range(n):
if i+1 in a:p,q=q,0
else:p,q=q,(p+q)%1000000007
print(q) | n,m=list(map(int,input().split()))
a=[1]*(n+1)
for _ in range(m):a[int(eval(input()))]=0
p,q=0,1
for i in range(1,n+1):
p,q=q,a[i]*(p+q)%(10**9+7)
print(q) | p03013 |
import sys
#from scipy.special import comb
#from scipy.misc import comb
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
... | import sys
sys.setrecursionlimit(100000000)
N,M = list(map(int, input().split()))
if M == 0:
A = []
else:
A = [0]*M
for i in range(M):
A[i] = int(eval(input()))
A.append(N+1)
# DP version
DP = [0]*(N+1)
DP[0] = 1
# １段の階段を登るやり方の数
DP[1] = 1
# 2段の階段を登るやり方の数
#DP[2] = 2
for i i... | p03013 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.