input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = list(map(int, input().split(' ')))
P = 1000000007
skip = []
for i in range(M):
skip.append(int(input()))
steps = [0] * (N + 2)
steps[0] = 1
for i in range(0, N):
if i+1 not in skip:
steps[i+1] += steps[i]
steps[i+1] %= P
if i+2 not in skip:
steps[i+2] += ... | N, M = list(map(int, input().split(' ')))
P = 1000000007
skip = []
for i in range(M):
skip.append(int(input()))
nums = set(range(N)) - set(skip)
steps = [0] * (N + 2)
steps[0] = 1
for i in nums:
steps[i+1] = (steps[i+1] + steps[i]) % P
steps[i+2] = (steps[i+2] + steps[i]) % P
print(step... | p03013 |
import math
n, m = [int(i) for i in input().split()]
ans = 1
a_pre = -1
for mi in range(m):
a = int(eval(input()))
if a == a_pre:
break
elif a == a_pre + 1:
ans = 0
break
k = a - a_pre - 2
max_2 = k//2
cnt = 0
for i in range(max_2+1):
cnt +=... | n, m = [int(i) for i in input().split()]
b = [0 for i in range(n+1)]
for mi in range(m):
b[int(eval(input()))] = 1
cnt = 0
s = [0 for i in range(n+1)]
s[0] = 1
if b[1] == 0:
s[1] = 1
else:
s[1] = 0
for ni in range(2,n+1):
if b[ni] == 0:
s[ni] = (s[ni-1] + s[ni-2]) % 1000000007
... | p03013 |
n,m = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(m)]
mod = 1000000007
dp = [0]*(n+1)
dp[0] = 1
for i in range(1,n+1):
dp[i] = (dp[i-1] + dp[i-2])%mod
if i in A:dp[i] = 0
print((dp[n]))
| n,m = list(map(int,input().split()))
A = set([int(eval(input())) for _ in range(m)])
mod = 1000000007
dp = [0]*(n+1)
dp[0] = 1
for i in range(1,n+1):
dp[i] = (dp[i-1] + dp[i-2])%mod
if i in A:dp[i] = 0
print((dp[n]))
| p03013 |
n,m = list(map(int,input().split()))
base = [int(eval(input())) for i in range(m)]
count = 0
now = 0
i= 0
dp = [0]*(n+1)
if 1 in base:
dp[1] = 0
else:
dp[1] = 1
dp[0] = 1
for i in range(2,n+1):
if not(i in base):
dp[i] = dp[i-1] + dp[i-2]
print((int(dp[n]%1000000007))) | n,m = list(map(int,input().split()))
base = [int(eval(input())) for i in range(m)]
i= 0
j = 0
dp = [0]*(n+1)
if m == 0:
base = [n+1]
if 1 == base[j]:
dp[1] = 0
if j < m-1:
j = j + 1
else:
dp[1] = 1
dp[0] = 1
for i in range(2,n+1):
if not (i == base[j]):
dp[i] = dp[i-1] + dp[i-2... | p03013 |
n,m = list(map(int,input().split()))
a = []
a.append(0)
for i in range(m):
b = int(eval(input()))
b -= 1
a.append(b)
a.append(n)
b = []
b.append(1)
b.append(2)
for i in range(n-2):
c =b[i]
d = b[i+1]
e = c + d
b.append(e)
c = []
if a[1] == 0:
c.append(1)
else:
... | n,m = list(map(int,input().split()))
mod = 10**9 + 7
a = [1] * (n+1)
for i in range(m):
b = int(eval(input()))
a[b] = 0
for i in range(2,n+1):
if a[i] != 0:
a[i] = a[i-1] + a[i-2]
#print(a)
print((a[n] % mod))
| p03013 |
N, M = list(map(int, input().split()))
dp = [1, 2]
A = [int(eval(input())) for _ in range(M)]
if M != 0:
if M >= 2 and A[0] == 1 and A[1] == 2:
dp = [0, 0]
elif A[0] == 1:
dp = [0, 1]
elif A[0] == 2:
dp = [1, 0]
else:
A = [0]
MOD = 1000000007
if N == 1:
wh... | N, M = list(map(int, input().split()))
dp = [1, 2]
A = [int(eval(input())) for _ in range(M)]
if M != 0:
if M >= 2 and A[0] == 1 and A[1] == 2:
dp = [0, 0]
elif A[0] == 1:
dp = [0, 1]
elif A[0] == 2:
dp = [1, 0]
else:
A = [0]
MOD = 1000000007
if N == 1:
pr... | p03013 |
import sys
n, m = [int(_) for _ in input().split()]
l = []
for i in range(m):
l.append(int(eval(input())))
d = [0] * (n + 2)
d[0] = 1
if 1 not in l:
d[1] = 1
for i in range(n):
if i in l and i + 1 in l:
print((0))
sys.exit()
elif i in l:
d[i + 2] = d[i + 1]
... | import sys
n, m = [int(_) for _ in input().split()]
l = {}
for i in range(m):
l[int(eval(input()))] = 1
d = [0] * (n + 2)
d[0] = 1
if 1 not in l:
d[1] = 1
for i in range(n):
if i in l and i + 1 in l:
print((0))
sys.exit()
elif i in l:
d[i + 2] = d[i + 1]
... | p03013 |
import sys
N,M = list(map(int, input().strip().split(' ')))
broken = set(int(line.strip()) for line in sys.stdin)
p = [0]*(N+2)
p[0] = 1
for i in range(N):
# 今i段目にいる
if i in broken:
continue
p[i+1] += p[i]
p[i+2] += p[i]
print((p[N]%1000000007))
| import sys
N,M = list(map(int, input().strip().split(' ')))
if M > 0:
broken = set(int(line.strip()) for line in sys.stdin)
else:
broken = set()
p = [0]*(N+2)
p[0] = 1
for i in range(N):
# 今i段目にいる
if i in broken:
continue
p[i+1] += p[i]
p[i+2] += p[i]
print((p[N]%1000000007))
| p03013 |
from operator import mul
from functools import reduce
mod = 10 ** 9 + 7
def combinations_count(n, r):
r = min(r, n - r)
numer = reduce(mul, list(range(n, n - r, -1)), 1)
denom = reduce(mul, list(range(1, r + 1)), 1)
return numer // denom
def pat(n):
cnt = 0
for i in range(n//2 + 1):
... | n, m = list(map(int, input().split()))
MOD = 1000000007
fact=[0,1]
fact_inv=[0]*(n+1)
for i in range(2,n+1):
fact.append(fact[-1]*i % MOD)
fact_inv[n] = pow(fact[n],MOD-2,MOD)
for i in range(n-1,-1,-1):
fact_inv[i] = fact_inv[i+1]*(i+1)%MOD
def comb(n,r):
return fact[n]*fact_inv[r]*fact_inv[n-r]%M... | 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):
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)]
a = set(a)
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])
print((dp[n] % 1000000007)) | p03013 |
import math
from fractions import Fraction
import sys
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 (Fract... | import math
from fractions import Fraction
import sys
class multipliable_2x2matrix(object):
def __init__(self, a, b, c, d):
self.a = a;
self.b = b;
self.c = c;
self.d = d;
def mul(self, b):
return multipliable_2x2matrix(
self.a * b.a + self.b * ... | p03013 |
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = int(1e9) + 7
stair = []
for i in range(N):
if i+1 in a:
stair.append(False)
else:
stair.append(True)
# DP
dp = [0] * N
if stair[0]:
dp[0] = 1
if N >= 2:
if stair[1]:
dp[1] =... | N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = int(1e9) + 7
stair = [True] * N
for i in a:
stair[i-1] = False
# DP
dp = [0] * N
if stair[0]:
dp[0] = 1
if N >= 2:
if stair[1]:
dp[1] = dp[0] + 1
else:
dp[1] = 0
for i in range(2,... | p03013 |
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
dp = [0 for _ in range(N+1)]
MOD = int(1e9) + 7
dp[0] = 1
# DP
if 1 not in a:
dp[1] = 1
for i in range(2, N+1):
if i in a:
continue
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 = int(1e9) + 7
stair = [True] * N
for i in a:
stair[i-1] = False
# DP
dp = [0] * N
if stair[0]:
dp[0] = 1
if N >= 2:
if stair[1]:
dp[1] = dp[0] + 1
else:
dp[1] = 0
for i in range(2,... | p03013 |
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = int(1e9) + 7
stair = [True] * N
for i in a:
stair[i-1] = False
# DP
dp = [0] * N
if stair[0]:
dp[0] = 1
if N >= 2:
if stair[1]:
dp[1] = dp[0] + 1
else:
dp[1] = 0
for i in range(2,... | N, M = list(map(int, input().split()))
st = [1 for _ in range(N+1)]
for _ in range(M):
st[int(eval(input()))] = 0
dp = [0 for _ in range(N+1)]
MOD = int(1e9) + 7
dp[0] = 1
# DP
if st[1]:
dp[1] = 1
for i in range(2, N+1):
if st[i]:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[-1])) | p03013 |
N, M = list(map(int, input().split()))
A = []
for m in range(M):
A.append(int(eval(input())))
dp = [0]*(N+2)
dp[N] = 1
dp[N+1] = 0
for i in range(N-1, -1, -1):
if i in A:
dp[i] = 0
else:
dp[i] = (dp[i+1] + dp[i+2]) % 1000000007
print((dp[0])) | N, M = list(map(int, input().split()))
A = []
for m in range(M):
A.append(int(eval(input())))
broken = [0]*(N+2)
for a in A:
broken[a] = 1
dp = [0]*(N+2)
dp[N] = 1
dp[N+1] = 0
for i in range(N-1, -1, -1):
if broken[i]:
dp[i] = 0
else:
dp[i] = (dp[i+1] + dp[i+2]) %... | p03013 |
n, m = list(map(int, input().split()))
bad = [int(eval(input())) for _ in range(m)]
back2 = 0
back1 = 1
MOD = int(1e9+7)
for i in range(n):
if i + 1 in bad:
back2, back1 = back1%MOD, 0
else:
back2, back1 = back1%MOD, (back2+back1)%MOD
print(back1) | import sys
sys.setrecursionlimit(150000)
n, m = list(map(int, input().split()))
bad = [int(eval(input())) for _ in range(m)]
MOD = int(1e9+7)
memo = {0:1, 1:1}
for i in bad:
memo[i] = 0
def fib(n, mod):
if n not in memo:
memo[n] = (fib(n-1, mod) + fib(n-2, mod)) % mod
return memo[n]... | p03013 |
N, M = list(map(int, input().split()))
MOD = 10**9+7
broken = [int(eval(input())) for _ in range(M)]
l = [0]*(N+1)
for i in range(N+1):
if i in broken:
continue
elif i==0 or i==1:
l[i] = 1
else:
l[i] = l[i-1] + l[i-2]
l[i] %= MOD
print((l[N])) | N, M = list(map(int, input().split()))
MOD = 10**9+7
broken = [int(eval(input())) for _ in range(M)]
l = ["empty"]*(N+1)
l[0], l[1] = 1, 1
for i in broken:
l[i] = 0
for i in range(N+1):
if l[i] == "empty":
l[i] = (l[i-1] + l[i-2]) % MOD
print((l[N])) | p03013 |
#A問題
N,M = list(map(int,input().split()))
A = []
mod = 1000000007
for i in range(M):
A.append(int(eval(input())))
sta = []
for i in range(N+1):
if i == 0:
sta.append(1)
elif i == 1:
sta.append(1)
elif i == 2:
sta.append(2)
else:
sta.append(sta[i-1]+st... | #C問題
mod = 10**9+7
N,M = list(map(int,input().split()))
step = []
for i in range(N+2):
if i <= 1:
step.append(1)
elif i == 2:
step.append(1)
else:
step.append(step[i-1]+step[i-2])
A = []
for j in range(M):
A.append(int(eval(input())))
stairs = []
flag = 0... | p03013 |
# C - Typical Stairs
MOD = (10 ** 9) + 7
INF = float('inf')
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ 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 in A:
dp[i] = 0
else:
dp[i] = (dp[i - 1] + dp[i ... | # C - Typical Stairs
MOD = (10 ** 9) + 7
N, M = list(map(int, input().split()))
A = [False] * (N + 1)
for _ in range(M):
A[int(eval(input()))] = True
dp = [0] * (N + 1)
dp[0] = 1
if A[1] == False:
dp[1] = 1
for i in range(2, N + 1):
if A[i] == True:
dp[i] = 0
else:
dp[i... | p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
mod=10**9+7
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 not in a:
d[i]=(d[i-1]+d[i-2])%mod
print((d[n])) | n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
mod=10**9+7
d=[mod]*(n+1)
d[0]=1;d[1]=1
for i in a:
d[i]=0
for i in range(2,n+1):
d[i]=min(d[i],(d[i-1]+d[i-2])%mod)
print((d[n])) | p03013 |
N,M=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(M)]
dp=[0]*(N)
for i in range(1,N+1):
if i==1 and 1 not in a:
dp[0]=1
elif i==2:
if 2 in a:
dp[1]=0
else:
dp[1]+=dp[0]+1
elif i not in a:
dp[i-1]=dp[i-2]+dp[i-3]
... | N,M=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(M)]
a.append(N+10)
dp=[0]*(N)
j=0
for i in range(1,N+1):
if i==1 and 1!=a[j]:
dp[0]=1
elif i==2:
if 2==a[j]:
dp[1]=0
j+=1
else:
dp[1]=dp[0]+1
elif i!=a[j]:
... | p03013 |
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
broken = []
for i in range(0, M):
broken.append(int(eval(input())))
memo = [0] * (N+1)
memo[0] = 1
cnt = 1
while cnt <= N:
if cnt in broken:
memo[cnt] = 0
elif cnt == 1:
memo[cnt] = 1
else:
memo[cnt] = (memo[cnt-1] + memo[cnt-2... | N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
broken = []
for i in range(0, M):
broken.append(int(eval(input())))
memo = [1]
cnt = 1
while cnt <= N:
if len(broken) > 0 and cnt == broken[0]:
del broken[0]
memo.append(0)
elif cnt == 1:
memo.append(1)
else:
memo.append((m... | p03013 |
n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
p = 10**9 +7
ans = [0]*(n+1)
ans[0] = 1
ans[1] = 1
for i in range(1,n):
if i in a:
ans[i] = 0
ans[i+1] = ans[i-1]%p
else:
ans[i+1] = (ans[i-1] + ans[i])%p
print((ans[-1]))
| n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
p = 10**9 +7
ans = [0]*(n+1)
ans[0] = 1
ans[1] = 1
broken = [0]*(n+1)
for i in a:
broken[i]= -1
for i in range(1,n):
if broken[i] == -1:
ans[i] = 0
ans[i+1] = ans[i-1]%p
else:
ans[i+1]... | p03013 |
def main():
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ansls = [0]*(n+1)
if 0 not in a:
ansls[0] = 1
if 1 not in a:
ansls[1] = 1
for i in range(2, n+1):
if i not in a:
ansls[i] = (ansls[i-2] + ansls[i-1])%... | def main():
n, m = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(m)])
ansls = [0]*(n+1)
big = 10**9 + 7
if 0 not in a:
ansls[0] = 1
if 1 not in a:
ansls[1] = 1
for i in range(2, n+1):
if i not in a:
ansls[i] = ... | p03013 |
def main():
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
ansls = [0]*(n+1)
if 0 not in a:
ansls[0] = 1
if 1 not in a:
ansls[1] = 1
for i in range(2, n+1):
if i not in a:
ansls[i] = (ansls[i-2] + ansls[i-1])%... | def main():
n, m = list(map(int, input().split()))
a = set([int(eval(input())) for _ in range(m)])
ansls = [0]*(n+1)
if 0 not in a:
ansls[0] = 1
if 1 not in a:
ansls[1] = 1
for i in range(2, n+1):
if i not in a:
ansls[i] = (ansls[i-2] + ansls[i... | p03013 |
n,m = list(map(int,input().split()))
a = ([int(eval(input())) for i in range(m)])
inf = 1000000007
dp = [0] * (n+1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2,n+1):
if i in a:
continue
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= inf
print((dp[n])) | n,m = list(map(int,input().split()))
a = set([int(eval(input())) for i in range(m)])
inf = 1000000007
dp = [0] * (n+1)
dp[0] = 1
if 1 not in a:
dp[1] = 1
else:
dp[1] = 0
for i in range(2,n+1):
if i in a:
continue
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= inf
print((dp[n])) | p03013 |
N,M=list(map(int,input().split()))
mod=10**9+7
dp=[0 for i in range(N+1)]
dp[0]=1
a=[int(eval(input())) for i in range(M)]
isbroken=[1 for i in range(N+1)]
for i in range(M):
isbroken[a[i]]=0
for i in range(N):
if i-1>=0:
dp[i+1]=dp[i]*isbroken[i]+dp[i-1]*isbroken[i-1]
else:
dp[i... | N,M=list(map(int,input().split()))
mod=10**9+7
isbroken=[1 for i in range(N+1)]
dp=[0 for i in range(N+1)]
dp[0]=1
for i in range(M):
ai=int(eval(input()))
isbroken[ai]=0
for i in range(N):
dp[i+1]=isbroken[i]*dp[i]+isbroken[i-1]*dp[i-1]
dp[i+1]%=mod
print((dp[N])) | p03013 |
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
broken = [False] * (N + 1)
for aa in a:
broken[aa] = True
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if broken[i]:
continue
if i >= 2:
dp[i] = dp[i - 1] + dp[i - ... | mod = 10 ** 9 + 7
n, m = list(map(int, input().split()))
a = tuple(int(eval(input())) for _ in range(m))
b = [False] * (n + 1)
for aa in a:
b[aa] = True
dp = [0] * (n + 5)
dp[0] = 1
for i in range(n):
if not b[i]:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
dp[i + 2] += dp[i]
... | p03013 |
N, M = list(map(int, input().split()))
a = []
for _ in range(M):
a.append(int(eval(input())))
val = [0,1]
for i in range(1, N + 1):
ans = val[0] + val[1]
val[0] = val[1]
val[1] = ans
if len(a) > 0:
if i == a[0]:
val[1] = 0
a.pop(0)
print((ans % (10*... | N, M = list(map(int, input().split()))
a = []
for _ in range(M):
a.append(int(eval(input())))
val = [0,1]
for i in range(1, N + 1):
ans = (val[0] + val[1]) % (10**9 +7)
val[0] = val[1]
val[1] = ans
if len(a) > 0:
if i == a[0]:
val[1] = 0
a.pop(0)
pr... | p03013 |
N, M = list(map(int, input().split()))
mod_num = 10 ** 9 + 7
a = [0] * N
for i in range(M):
a[i] = int(eval(input()))
val = [0,1]
for i in range(1, N + 1):
ans = (val[0] + val[1]) % mod_num
val[0] = val[1]
val[1] = ans
if len(a) > 0:
if i == a[0]:
val[1] = 0
... | N, M = list(map(int, input().split()))
mod_num = 10 ** 9 + 7
a = [0] * N
for i in range(M):
a[i] = int(eval(input()))
val = [0,1]
j = 0
for i in range(1, N + 1):
ans = (val[0] + val[1]) % mod_num
val[0] = val[1]
val[1] = ans
if len(a) > 0:
if i == a[j]:
val[1] ... | p03013 |
N, M = list(map(int, input().split()))
mod_num = 10 ** 9 + 7
a = [0] * M
for i in range(M):
a[i] = int(eval(input()))
val = [0,1]
j = 0
for i in range(1, N + 1):
ans = (val[0] + val[1]) % mod_num
val[0] = val[1]
val[1] = ans
if i in a:
val[1] = 0
print(ans) | N, M = list(map(int, input().split()))
mod_num = 10 ** 9 + 7
a = [0] * M
for i in range(M):
a[i] = int(eval(input()))
a = set(a)
val = [0,1]
j = 0
for i in range(1, N + 1):
ans = (val[0] + val[1]) % mod_num
val[0] = val[1]
val[1] = ans
if i in a:
val[1] = 0
print(ans... | p03013 |
#https://atcoder.jp/contests/abc129/tasks/abc129_c
def dp1(n,a):
dp=[0]*(n+1)
dp[0]=1
if 1 not in a:
dp[1]=1
if n==1:
return dp[1]
else:
for i in range(2,n+1):
if i not in a:
dp[i]=dp[i-1]+dp[i-2]
return dp[n]
def main():
... | def dp1(n,a):
dp=[0]*(n+1)
dp[0]=1
ok=[True]*(n+1)
for x in a:
ok[x]=False
if 1 not in a:
dp[1]=1
if n==1:
return dp[1]
else:
for i in range(2,n+1):
if ok[i]:
dp[i]=(dp[i-1]+dp[i-2])%1000000007
return dp[n]
def... | p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
dp=[0]*(n+2)
dp[0]=1
for i in range(n):
if i in a:
continue
dp[i+1]+=dp[i]
dp[i+2]+=dp[i]
print((dp[n]%1000000007)) | n,m=list(map(int,input().split()))
a=set(int(eval(input())) for _ in range(m))
dp=[0]*(n+2)
dp[0]=1
for i in range(n):
if i in a:
continue
dp[i+1]+=dp[i]
dp[i+2]+=dp[i]
print((dp[n]%1000000007)) | 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
if 1 not in a:
dp[1]=1
for i in range(2,n+1):
if i in a :
continue
else:
dp[i]= dp[i-1] + dp[i-2]
dp[i]%= mod
print((dp[n])) | 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 in a :
continue
else:
dp[i]= dp[i-1] + dp[i-2]
dp[i]%= mod
print((dp[n])) | p03013 |
n,m=list(map(int,input().split()))
L=[int(eval(input())) for i in range(m)]
NL=[0]*(n+1)
NL[0],NL[1]=1,1
if 1 in L:
NL[1]=0
for i in range(2,n+1):
if i in L:
NL[i]=0
else:
NL[i]=NL[i-2]+NL[i-1]
if NL[-1]>=1000000007:
print((NL[-1]%1000000... | n, m = list(map(int, (input().split())))
a = {int(eval(input())) for i in range(m)}
mod = 10 ** 9 + 7
x = 1 if 1 not in a else 0
dp = [1, x] + [0] * (n - 1)
for i in range(2, n + 1):
if i in a:
continue
dp[i] = (dp[i - 1] + dp[i - 2])
print((dp[-1] % mod)) | 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
if 1 not in A:
dp[1]=1
for i in range(2,n+1):
if i not in A:
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]%mod)) | 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 not in A:
dp[1]=1
for i in range(2,n+1):
if i not in A:
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]%mod)) | p03013 |
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],
... | N, M = list(map(int, input().split()))
if N == 1:
print((1))
quit()
S = [-1] * (N + 1)
S[0] = 1
for i in range(M):
S[int(eval(input()))] = 0
if S[1] != 0:
S[1] = 1
for i in range(2, N + 1):
if S[i] == 0:
continue
else:
S[i] = (S[i - 1] + S[i - 2]) % 1000000007
... | p03013 |
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a.append(int(eval(input())))
dp=[0]*n
if 1 not in a:
dp[0]=1
else:
dp[0]=0
for i in range(1,n):
if i+1 in a:
continue
if i==1:
dp[i]=dp[i-1]+1
continue
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]%((10**9)+... | n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a.append(int(eval(input())))
dp=[0]*n
if 1 not in a:
dp[0]=1
else:
dp[0]=0
a=set(a)
for i in range(1,n):
if i+1 in a:
continue
if i==1:
dp[i]=dp[i-1]+1
continue
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]... | p03013 |
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a.append(int(eval(input())))
dp=[0]*n
if 1 not in a:
dp[0]=1
else:
dp[0]=0
a=set(a)
for i in range(1,n):
if i+1 in a:
continue
if i==1:
dp[i]=dp[i-1]+1
continue
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]... | 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
a=set(a)
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=[]
MOD=1000000007
for _ in range(M):
a = int(eval(input()))
A.append(a)
C = [0]*(N+1)
C[0]=1
#print(C)
for i in range(N):
if i+1 not in A:
C[i+1]+=C[i]%MOD
if i+2 not in A and i<N-1:
C[i+2]+=C[i]%MOD
#print(C)
print((C[N]%MOD)... | N, M = list(map(int, input().split()))
D=[1]*(N+1)
MOD=1000000007
for _ in range(M):
i = int(eval(input()))
D[i]=0
C = [0]*(N+1)
C[0]=1
for i in range(N-1):
C[i+1]+=(C[i]*D[i])%MOD
C[i+2]+=(C[i]*D[i])%MOD
C[N]+=(C[N-1]*D[N-1])%MOD
#print(C)
print((C[N]%MOD))
| p03013 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
a = set([I() for _ in range(M)])
if N==1:
print((1))
exit()
dp = [0]*(N+1) #1_indexed
dp[1] = 0 if 1 in a else 1
dp[2] = 0 if 2 in a else (1+dp[1])
for i in r... | import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
a = set([I() for _ in range(M)])
dp = [0]*(N+1) #1_indexed
dp[0] = 1
dp[1] = 0 if 1 in a else 1
for i in range(1,N+1):
if i in a:
dp[i] = 0
... | p03013 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
a = [I() for _ in range(M)]
dp = [0]*(N+1) #1_indexed
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
continue
... | import itertools,sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N,M = LI()
a = set([I() for _ in range(M)])
dp = [0]*(N+1) #1_indexed
dp[0] = 1
dp[1] = 0 if 1 in a else 1
for i,j in itertools.product(list(range(2,N+1)),[1,2]):
if... | p03013 |
n,m = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(m)]
mod = 1000000007
dp = [0]*(n+1)
dp[0],dp[1] = 1,1
for i in range(2,n+1):
if i in A:
continue
elif i-1 in A and i-2 in A:
dp[n] = 0
break
elif i-1 in A:
dp[i] = dp[i-2]
elif i-2 in... | n,m=list(map(int,input().split()))
a=set([int(eval(input())) for i in range(m)])
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in a:dp[i]=0
print((dp[n])) | p03013 |
n,m=list(map(int,input().split()))
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])) | n,m = list(map(int,input().split()))
A = set([int(eval(input())) for _ in range(m)])
mod = 1000000007
dp = [0]*(n+1)
dp[0] = 1
for i in range(1,n+1):
dp[i] = (dp[i-1] + dp[i-2])%mod
if i in A:dp[i] = 0
print((dp[n])) | 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)]
dp[0] = 1
dp[1] = 1
for i in range(2,N+1):
if (i-2 in a) and (i-1 in a):
dp[-1] = 0
break
elif i-2 in a:
dp[i] = dp[i-1]
elif i-1 in a:
dp[i] = dp[i-2]
else:
dp[i] = dp... | N, M = list(map(int,input().split()))
a = set([int(eval(input())) for i in range(M)])
dp = [0 for i in range(N+1)]
dp[0] = 1
dp[1] = 1
for i in range(2,N+1):
if (i-2 in a) and (i-1 in a):
dp[-1] = 0
break
elif i-2 in a:
dp[i] = dp[i-1]
elif i-1 in a:
dp[i] = dp[i-2]
else:
dp[i]... | p03013 |
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(M)]
ans_list = [1] + [0] * N
for i in range(1, N+1):
if i == 1:
if 1 not in a_list:
ans_list[1] += ans_list[i-1]
else:
if i not in a_list:
ans_list[i] += ans_list[i-2]
... | import sys
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(M)]
if N == 1:
print((1))
else:
a = 1
ans = 1
if M == 0:
b = 1
for i in range(2, N+1):
ans = (a+b)%1000000007
a, b = b, ans
elif M == 1:
... | p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
d=[0]*(n+1)
d[0]=1
d[1]=1
if 1 in a:
d[1]=0
for i in range(2,n+1):
if i in a:
d[i]=0
else:
d[i]=d[i-1]+d[i-2]
print((d[n]%(10**9+7))) | n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
d=[1]*(n+1)
for i in range(m):
d[a[i]]=0
for i in range(2,n+1):
if d[i]!=0:
d[i]=d[i-1]+d[i-2]
print((d[n]%(10**9+7))) | p03013 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03013 |
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | #!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, ... | p03013 |
# -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): r... | # -*- coding: utf-8 -*-
import sys
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(eval(input()))
def MAP(): r... | p03013 |
def readinput():
n,m=list(map(int,input().split()))
a=[]
for _ in range(m):
a.append(int(eval(input())))
return n,a
def main(n,a):
MOD=10**9+7
nroute=[0]*(n+2)
nroute[0]=0
nroute[1]=1
nroute[2]=1
for i in range(3,n+2):
nroute[i]=(nroute[i-1]+nrout... | import sys
INFTY=sys.maxsize
def readinput():
n,m=list(map(int,input().split()))
a=[]
for _ in range(m):
a.append(int(eval(input())))
return n,m,a
def main(n,m,a):
MOD=10**9+7
dp=[0]*(n+3)
dp[0]=1
ia=0
for i in range(n+1):
if ia<m and i==a[ia]:
... | p03013 |
n,m=list(map(int,input().split()))
A=[int(eval(input())) for i in [0]*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 |
import sys
MOD = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(x) for x in sys.stdin.readlines()]
ans = [0 for i in range(n)]
if 1 not in a:
ans[0] = 1
if 2 not in a and n >=2:
ans[1] = ans[0] + 1
for i in range(2, n):
if i+1 not in a:
ans[i] = (ans[i-1] + ans[i-2])%MOD
p... | import sys
MOD = 10**9 + 7
n, m = list(map(int, input().split()))
a = [int(x) for x in sys.stdin.readlines()]
ans = [1 for i in range(n)]
for x in a:
ans[x-1] = 0
for i in range(n):
if i == 0 and ans[i] == 0:
ans[0] = 0
elif i == 1:
if ans[i] == 1:
ans[1] += ans[0]
... | p03013 |
n,m=list(map(int,input().split()))
mod=10**9+7
dp=[0]*(n+1)
dp[0]=1
a=[int(eval(input())) for i 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
print((dp[-1]))
| n,m=list(map(int,input().split()))
mod=10**9+7
dp=[0]*(n+1)
dp[0]=1
a=set(int(eval(input())) for i 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
print((dp[-1]))
| p03013 |
n,m=list(map(int,input().split()))
mod=10**9+7
dp=[0]*(n+1)
dp[0]=1
a=set(int(eval(input())) for i 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
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(1,n+1):
if i in a:
continue
if 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(' ')))
l = [int(eval(input())) for i in range(M)]
mod = 10**9+7
dp = {}
for i in range(N+1):
dp[i] = 1
dp[1] = 0 if 1 in l else 1
for i in range(2,N+1):
if i in l:
dp[i] = 0
continue
else:
dp[i] = dp[i-1]%mod + dp[i-2]%mod
dp[... | N,M = list(map(int,input().split(' ')))
l = set([int(eval(input())) for i in range(M)])
mod = 10**9+7
dp = {}
for i in range(N+1):
dp[i] = 1
dp[1] = 0 if 1 in l else 1
for i in range(2,N+1):
if i in l:
dp[i] = 0
continue
else:
dp[i] = dp[i-1]%mod + dp[i-2]%mod
... | 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 not in A:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[N])) | import sys
sys.setrecursionlimit(10 ** 7)
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 not in A:
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 _ in range(m)]
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 in a:
pass
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%(10**9+7))) | n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
dp = [-1]*(n+1)
dp[0] = 1
dp[1] = 1
for i in a:
dp[i] = 0
for i in range(2, n+1):
if dp[i] == 0:
pass
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%(10**9+7))) | p03013 |
n,m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
mod = 1000000007
result = [0]*(n+1)
result[0] = 1
for i in range(1,n+1):
if i in a:
result[i] = 0
else:
result[i] = (result[i-1] + result[i-2])%mod
print((result[n])) | n,m = list(map(int,input().split()))
a = set([int(eval(input())) for i in range(m)])
mod = 1000000007
result = [0]*(n+1)
result[0] = 1
for i in range(1,n+1):
if i in a:
result[i] = 0
else:
result[i] = (result[i-1] + result[i-2])%mod
print((result[n])) | p03013 |
import sys, math, collections, heapq, itertools
def gcd(a, b):
a, b = max(a, b), min(a, b)
while a % b > 0: a, b = b, a % b
return b
def solve():
file = sys.stdin.readline #single: int(file()), line: map(int, file().split())
INF = 10 ** 25
mod = 7 + 10 ** 9
N, M = list(map(int, ... | import sys
def solve():
input = sys.stdin.readline
N, M= list(map(int, input().split()))
mod = 7 + 10 ** 9
A = [True] * (N + 1)
for _ in range(M):
A[int(eval(input()))] = False
DP = [0] * (N + 1)
DP[0] = 1
for i in range(N):
if i < N - 1:
if A[i ... | p03013 |
n,m=list(map(int,input().split()))
a=[0]*m
for i in range(m):
a[i]=int(eval(input()))
p0=1
if 1 in a:
p1=0
else:
p1=1
for i in range(2,n+1):
if i in a:
p2=0
else:
p2=p1+p0
p0,p1=p1,p2
print((p1%1000000007))
|
n,m=list(map(int,input().split()))
a=[1]*(n+1)
for i in range(m):
a[int(eval(input()))]=0
p0=a[0]
p1=a[1]
for i in range(2,n+1):
if a[i]==1:
p2=p0+p1
else:
p2=0
p0,p1=p1,p2
print((p1%1000000007))
| p03013 |
def main():
import sys
input = sys.stdin.readline
N,M = list(map(int,input().split()))
a = []
A = [0] * (1 + 10 ** 5)
for _ in range(M):
A[int(eval(input()))] = 1
dp = [0] * (N + 1)
dp[0] = 1
if A[1]:
dp[1] = 0
else:
dp[1] = 1
for i in ra... | import sys
input = lambda : sys.stdin.readline().rstrip()
mod = 10**9 + 7
n, m = list(map(int, input().split()))
a = []
for _ in range(m):
a.append(int(eval(input())))
a = set(a)
dp = [0]*(n + 1)
dp[0] = 1
for i in range(n):
if i + 2 not in a and i + 2 <= n:
dp[i + 2] += dp[i]
dp[... | p03013 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
def solve():
n, m = list(map(int, input().split()))
am = set(int(eval(input())) for i in range(m))
ans = [0] * (n + 10)
ans[0] = 1
md = 10 ** 9 + 7
for i in range(n):
if (i + 1) not in am:
ans[i + 1] += ans[i]
... | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def solve():
n, m = list(map(int, input().split()))
am = set([int(eval(input())) for i in range(m)])
ans = [0] * (n + 1000)
ans[0] = 1
md = (10 ** 9) + 7
for i in range(n):
if (i + 1) not in am:
ans[i + 1] = (ans[i] + ... | 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
if not 1 in a:
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]) % MOD
print((dp[n]))
| n, m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
MOD = 10**9+7
dp = [0]*(n+1)
ng = [False]*(n+1)
for i in a:
ng[i] = True
dp[0] = 1
if not ng[1]:
dp[1] = 1
for i in range(2, n+1):
if ng[i]:
continue
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)]
MOD = 10 ** 9 + 7
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in A:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
#print(dp)
print((dp[N]))
| N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 10 ** 9 + 7
am = {}
for a in A:
am[a] = True
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in am:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
#print(dp)
print((dp[N]))
| p03013 |
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
MOD = 10 ** 9 + 7
am = set()
for a in A:
am |= {a}
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in am:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
#print(dp)
print((dp[N]))
| N, M = list(map(int, input().split()))
A = {int(eval(input())) for _ in range(M)}
MOD = 10 ** 9 + 7
dp = [1] + [0] * (N + 10)
for n in range(1, N + 1):
if n in A:
continue
dp[n] = (dp[n - 1] + (dp[n - 2] if 2 <= n else 0)) % MOD
print((dp[N]))
| p03013 |
n,m = (int(i) for i in input().split())
a = [int(eval(input())) for i in range(m)]
oks = [True if not i in a else False for i in range(n+1)]
mod = 1000000007
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1 if not 1 in a else 0
for i in range(2,n+1):
if oks[i] is True:
dp[i] = (dp[i-1]+dp[i-2])%mod... | n,m = (int(i) for i in input().split())
a = [int(eval(input())) for i in range(m)]
mod = 1000000007
oks = [True for _ in range(n+1)]
for i in a:
oks[i] = False
dp = [1,0]
dp[1] = 1 if oks[1] is True else 0
for i in range(2,n+1):
if oks[i] is True:
dp.append((dp[i-1]+dp[i-2])%mod)
else:
... | p03013 |
import sys
N, M = list(map(int, sys.stdin.readline().split()))
a = [int(sys.stdin.readline()) for _ in range(M)]
MOD = 10 ** 9 + 7
list = [0] * N
for i in range(N):
if i == 0:
if (i + 1) in a:
list[i] = 0
else:
list[i] = 1
elif i == 1:
if (i + 1)... | import sys
N, M = list(map(int, sys.stdin.readline().split()))
a = [int(sys.stdin.readline()) for _ in range(M)]
MOD = 10 ** 9 + 7
list = [0] * N
if M > 0:
j = 0
for i in range(N):
if i == 0:
if a[j] == 1:
list[i] = 0
else:
list[i... | p03013 |
N,M = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(M)]
if 1 in a:
fibs = [1,0]
else:
fibs = [1,1]
for i in range(2,N+1):
if i in a:
fibs[0] = fibs[1]
fibs[1] = 0
else:
next = fibs[1] + fibs[0]
if next > 1000000007:
next -= 1000000007
fibs[0] =... | N,M = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(M)]
a.sort(reverse=True)
if 1 in a:
a.pop()
fibs = [1,0]
else:
fibs = [1,1]
for i in range(2,N+1):
if len(a) > 0 and i == a[-1]:
a.pop()
fibs[0] = fibs[1]
fibs[1] = 0
else:
next = fibs[1] + fibs[0]
... | p03013 |
MOD=10**9+7
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
dp=[0]*(n+1)
if n==1:
print((1))
exit()
if 1 in a and 2 in a:
print((0))
exit()
elif 1 in a:
dp[1]=0
dp[2]=1
elif 2 in a:
dp[1]=1
dp[2]=0
else:
dp[1]=1
dp[2]=2
for i in range(3,n+1):
if ... | MOD=10**9+7
n,m=list(map(int,input().split()))
a=set([int(eval(input())) for _ in range(m)])
dp=[0]*(n+1)
if n==1:
print((1))
exit()
if 1 in a and 2 in a:
print((0))
exit()
elif 1 in a:
dp[1]=0
dp[2]=1
elif 2 in a:
dp[1]=1
dp[2]=0
else:
dp[1]=1
dp[2]=2
for i in range(3,n+1):
... | p03013 |
import sys
from functools import lru_cache
sys.setrecursionlimit(10**9)
MOD=10**9+7
n,m=list(map(int,input().split()))
a=set([int(eval(input())) for _ in range(m)])
if n==1:
print((1))
exit()
if 1 in a and 2 in a:
print((0))
exit()
elif 1 in a:
ans=[0,0,1]
elif 2 in a:
ans=[0,1,0]
else:
a... | MOD=10**9+7
n,m=list(map(int,input().split()))
a=set([int(eval(input())) for _ in range(m)])
if n==1:
print((1))
exit()
if 1 in a and 2 in a:
print((0))
exit()
elif 1 in a:
ans=[0,1]
elif 2 in a:
ans=[1,0]
else:
ans=[1,2]
for i in range(2,n):
if i+1 in a:
ans.append(0)
else:
... | p03013 |
import sys
sys.setrecursionlimit(100000)
def intinput(): return list(map(int,sys.stdin.readline().split()))
fib={0:0,1:1,2:1}
for i in range(3,100003):
fib[i]=fib[i-1]+fib[i-2]
# fib.append(fib[i-1]+fib[i-2])
n,m=intinput()
mod=10**9+7
a=[int(sys.stdin.readline()) for _ in range(m)]
if m!=0:
... | import sys
sys.setrecursionlimit(100000)
def intinput(): return list(map(int,sys.stdin.readline().split()))
n, m = intinput()
a = {int(sys.stdin.readline()) for _ in range(m)}
memo = [0 for x in range(n + 4)]
memo[0] = 1
mod = 10 ** 9 + 7
for i in range(n):
if i + 1 not in a:
memo[i + 1] = (... | p03013 |
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)]
dp = [0] * (N+2)
dp[1] = 1
for i in range(N):
step = i+2
if i+1 in A:
dp[step] = 0
else:
... | 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+1)
for a in A:
is_safe[a] = False
dp = [0] * (N+2)
dp[1] = 1
for i in range(N):
st... | p03013 |
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+1)
for a in A:
is_safe[a] = False
dp = [0] * (N+2)
dp[1] = 1
for i in range(N):
st... | 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 |
N, M = tuple(map(int, input().split()))
mod = 10**9+7
broken = []
dp = [0]* (N+1)
for i in range(M):
broken.append(int(eval(input())))
dp[0] = 1
for i in range(1, N+1):
if (i in broken):
continue
if (i == 1):
dp[i] = 1
continue
dp[i] = (dp[i-1] + dp[i-2]) % mod... | 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[i] = 1
continue
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
print((dp[N] % mod))... | p03013 |
mod=10**9+7
n, m = list(map(int, input().split()))
ai=[]
for i in range(m):
ai.append(int(eval(input())))
#print(ai)
dp=[]
for i in range(n+1):
dp.append(0)
dp[0]=1
if 1 in ai:
dp[1]=0
else:
dp[1]=1
for i in range(2,n+1):
if i in ai:
continue
dp[i]=(dp[i-1]+dp[... |
mod=10**9+7
n, m = list(map(int, input().split()))
ai={}
for i in range(m):
ai.setdefault(int(eval(input())), 0)
#print(ai)
dp={}
for i in range(n+1):
dp.setdefault(i, 0)
dp[0]=1
if 1 in ai:
dp[1]=0
else:
dp[1]=1
for i in range(2,n+1):
if i in ai:
continue
dp[i... | p03013 |
import sys
input = sys.stdin.readline
n,m=(int(i) for i in input().split())
a = [int(eval(input())) for i in range(m)]
#print(n,m,a)
d=[0 for i in range(100000+10)]
p=1000000007
#n=100
#a=[1, 23, 45, 67, 89]
aa=[0 for i in range(100000+10)]
for i in range(10**5+10):
if i in a:
aa[i]=1
#prin... | import sys
input = sys.stdin.readline
n,m=(int(i) for i in input().split())
a = [int(eval(input())) for i in range(m)]
#print(n,m,a)
d=[0 for i in range(100000+10)]
p=1000000007
#n=100
#a=[1, 23, 45, 67, 89]
aa=[0 for i in range(100000+10)]
for i in a:
aa[i]=1
#print(aa)
d[0]=1
if aa[1] == 0:
... | 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)])#setにしないとTLEになる
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]))
# 入力
# 6 1
# 3 | p03013 |
N,M=list(map(int, input().split()))
NG=[ 0 for i in range(N+1) ]
for i in range(M):
a=eval(input())
NG[a]=1
dp=[ 0 for i in range(N+1) ]
dp[0]=1
mod=10**9+7
for i in range(N):
if i+1<=N and NG[i+1]==0:
dp[i+1]+=dp[i]
dp[i+1]%=mod
if i+2<=N and NG[i+2]==0:
dp[i+2]+=dp[i]
dp[i+2]%=mod
... | import sys
N,M=list(map(int, input().split()))
NG=[ 0 for i in range(N+1) ]
for i in range(M):
a=int( sys.stdin.readline().strip() )
NG[a]=1
dp=[ 0 for i in range(N+1) ]
dp[0]=1
mod=10**9+7
for i in range(N):
if i+1<=N and NG[i+1]==0:
dp[i+1]+=dp[i]
dp[i+1]%=mod
if i+2<=N and NG[i+2]==0:
... | p03013 |
n, m = list(map(int, input().split()))
dp = [-1] * (n + 1)
a = []
for i in range(m):
aa = int(eval(input()))
dp[aa] = 0
a.append(aa)
mod = 10 ** 9 + 7
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(1, n):
if dp[i + 1] == 0:
continue
else:
dp[... | n, m = list(map(int, input().split()))
dp = [-1] * (n + 1)
a = []
for i in range(m):
aa = int(eval(input()))
dp[aa] = 0
a.append(aa)
mod = 10 ** 9 + 7
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(1, n):
if dp[i + 1] == 0:
continue
dp[i + 1] = (dp[i]... | p03013 |
n,m=list(map(int,input().split()))
a=[]
dp=[0]*(n+1)
mo=10**9+7
for i in range(m):
a.append(int(eval(input())))
for i in range(n+1):
if i==0:
dp[i]=1
elif i==1:
if 1 not in a:
dp[i]=1
elif i not in a:
dp[i]=dp[i-1]+dp[i-2]
dp[i]%=mo
... | n,m=list(map(int,input().split()))
a=set()
dp=[0]*(n+1)
mo=10**9+7
for i in range(m):
a.add(int(eval(input())))
for i in range(n+1):
if i==0:
dp[i]=1
elif i==1:
if 1 not in a:
dp[i]=1
elif i not in a:
dp[i]=dp[i-1]+dp[i-2]
dp[i]%=mo
... | p03013 |
import sys
input = sys.stdin.readline
MOD = 1000000007
def main():
n, m = [int(i) for i in input().split()]
a = [int(eval(input())) for _ in range(m)]
steps = [0] * (n + 1)
steps[0] = 1
for now in range(n):
for next_ in range(now + 1, min(now + 2, n) + 1):
if ne... | import sys
input = sys.stdin.readline
MOD = 1000000007
def main():
n, m = [int(i) for i in input().split()]
a = {int(eval(input())) for _ in range(m)}
steps = [0] * (n + 1)
steps[0] = 1
for now in range(n):
for next_ in range(now + 1, min(now + 2, n) + 1):
if ne... | p03013 |
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
fibo=[0]*(n+1)
fibo[0]=1
fibo[1]=1 if 1 not in a else 0
mod=10**9+7
for i in range(2,n+1):
if i in a:
continue
fibo[i]=(fibo[i-2]+fibo[i-1])%mod
print((fibo[-1])) | import sys
mod = 10**9+7
def main():
n, m = list(map(int, input().split(' ')))
if m > 0:
aaa = set(map(int, sys.stdin))
else:
aaa = set()
dp = [0] * (n+1)
dp[0] = 1
dp[1] = 1 if 1 not in aaa else 0
for i in range(2, n+1):
if i in aaa:
... | p03013 |
from collections import Counter
n, m = list(map(int, input().split()))
l = []
a0 = 0
for i in range(m):
a = int(eval(input()))
if a - a0 == 0:
print((0))
exit()
l.append(a - a0 - 1)
a0 = a + 1
l.append(n - a0)
d = Counter(l)
key = list(d.keys())
def cmb(n, r):
if r >... | from collections import Counter
n, m = list(map(int, input().split()))
l = []
a0 = 0
for i in range(m):
a = int(eval(input()))
if a - a0 == 0:
print((0))
exit()
l.append(a - a0 - 1)
a0 = a + 1
l.append(n - a0)
d = Counter(l)
key = list(d.keys())
ma = max(key)
fib = [1]*(... | p03013 |
n, m = list(map(int, input().split()))
a = [0] + [int(eval(input())) for _ in range(m)]
dp = [0] * (n + 1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
MOD = 10 ** 9 + 7
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, m = list(map(int, input().split()))
a = [0] + [int(eval(input())) for _ in range(m)]
ok = [True] * (n + 1)
for v in a:
ok[v] = False
dp = [0] * (n + 1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if ok[i]:
dp[i] = dp[i - 1] + ... | p03013 |
# -*- coding: utf-8 -*-
"""
Created on Sun Sep 13 12:06:59 2020
@author: liang
"""
key = 10**9 + 7
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
A.sort()
A += [-1]
def solve():
steps = list()
count = 0
index = 0
#段差数え
for i in range(N+1):
... | # -*- coding: utf-8 -*-
"""
Created on Sun Sep 13 12:37:37 2020
@author: liang
"""
"""
フィボナッチ数列生成
【DP(?)】 : 配列を使用することで計算量が爆発するのを防ぐ
【小さいものから計算する】の原則
【方針】
通常の配列を用いたフィボナッチ数列の生成方法の応用版
壊れた階段のフィボナッチ数列の値を 0 にすることで、実質遷移を止めることが出来る。
"""
key = 10**9 + 7
N, M = list(map(int, input().split()))
A = [int(eval(i... | p03013 |
n,m=list(map(int,input().split()))
alis=[]
for i in range(m):
a=int(eval(input()))
alis.append(a)
if 1 in alis:
dp=[1,0]
else:
dp=[1,1]
for i in range(2,n+1):
if i in alis:
d=0
dp.append(d)
else:
d=dp[i-2]+dp[i-1]
dp.append(d)
print((dp[n]%(10**9+7)))
| n,m=list(map(int,input().split()))
alis=set([])
for i in range(m):
a=int(eval(input()))
alis.add(a)
if 1 in alis:
dp=[1,0]
else:
dp=[1,1]
for i in range(2,n+1):
if i in alis:
d=0
dp.append(d)
else:
d=dp[i-2]+dp[i-1]
dp.append(d)
print((dp[n]%(10**9+7)))
| p03013 |
### 解説読んでから書いたコード
n, m = list(map(int, input().split()))
MOD = 1000000007
if m > 0:
a = [int(eval(input())) for i in range(m)]
else:
a = []
a.append(-1)
a_i = 0
step = [0] * (n+2)
step[-1] = -1
step[0] = 1
for i in range(1, n+1):
if a[a_i] == i:
step[i] = -1
a_i += 1
... | ### 解説読んでから書いたコード ###
n, m = list(map(int, input().split()))
MOD = 1000000007
if m > 0:
a = [int(eval(input())) for i in range(m)]
else:
a = []
a.append(-1) # 末尾に-1を追加(壊れている床がもう無い事を示す)
a_i = 0
## n段目への移動方法は、step[n]通り存在する
## step[n] = step[n-2] + step[n-1]
step = [0] * (n+2)
step[-1] = -1 # 存... | p03013 |
import sys
import os
MOD = 10 ** 9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = [int(sys.stdin.buffer.readline().rstrip()) for _ in range(M)]
ret = [0, 1]
for i in range(1, N + 1):
... | import sys
import os
MOD = 10 ** 9 + 7
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = list(map(int, sys.stdin.buffer.readline().split()))
A = set([int(sys.stdin.buffer.readline().rstrip()) for _ in range(M)])
ret = [0, 1]
for i in range(1, N +... | p03013 |
import sys
sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
# import fractions
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda... | import sys
sys.setrecursionlimit(10000000)
import os
import math
import bisect
import collections
import itertools
import heapq
import re
import queue
# import fractions
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda... | p03013 |
N, M = list(map(int, input().split()))
List = [int(eval(input())) for _ in range(M)]
P = 10**9+7
dp = [1]*(N+1)
for i in List:
dp[i]=0
for j in range(1, N):
if dp[j+1]!=0:
dp[j+1] = dp[j]+dp[j-1]
print((dp[N]%P)) | N, M = list(map(int, input().split()))
List = [int(eval(input())) for _ in range(M)]
P = 10**9+7
dp = [1]*(N+1)
for i in List:
dp[i]=0
for j in range(1, N):
if dp[j+1]!=0:
dp[j+1] = (dp[j]+dp[j-1])%P
print((dp[N])) | p03013 |
from collections import defaultdict as dd
n,m=[int(i) for i in input().split()]
brkn = dd(int)
mod = 10**9+7
for i in range(m):
num = int(eval(input()))
brkn[num]+=1
dp = [0]*(n+1)
dp[0]=1
if(1 in brkn):
dp[1]=0
else:
dp[1]=1
for i in range(2,n+1):
if(i in brkn):
dp[i]=0
... | import sys
sys.setrecursionlimit(10**6)
from collections import defaultdict as dd
n,m=[int(i) for i in input().split()]
brkn = dd(int)
mod = 10**9+7
for i in range(m):
num = int(eval(input()))
brkn[num]+=1
dp = [-1]*(n+1)
def func(curr):
if(curr==0):
dp[0]=1
return dp[0]
... | p03013 |
import sys
input = sys.stdin.readline
import math
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
n,m = list(map(int,input().split()))
if m==0:
cnt = 0
steps = n
for j in range(steps//2+1):
if j == 0:
cnt += 1
... | import sys
input = sys.stdin.readline
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):
for j in range(i+1,min(n,i+2)+1):
if oks[j]:
dp[j] += dp[i]
dp[j... | p03013 |
N,M=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(M)]
mod=10**9+7
#Dynamic Programming
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])%mod
print((dp[N])) | N,M=list(map(int,input().split()))
dp=[0]*(N+1)
dp[0]=1
mod=10**9+7
a=[False for _ in range(N+1)]
for _ in range(M):
a[int(eval(input()))]=True
for i in range(1,N+1):
if a[i]:
continue
dp[i]=(dp[i-1]+dp[i-2])%mod
print((dp[N])) | p03013 |
import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
def main():
N, M = list(map(int, input().split()))
memo = [0] * max((N + 1), 10)
a = [0] * M
memo[0] = 1
memo[1] = 1
memo[2] = 2
for i in range(3, max(N+1, 10)):
memo[i] = memo[i-1] + memo[i-2]
# print(... | import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
MIN = 100
def main():
N, M = list(map(int, input().split()))
memo = [0] * max((N + 1), MIN)
a = [0] * M
memo[0] = 1
memo[1] = 1
memo[2] = 2
for i in range(3, max(N+1, MIN)):
memo[i] = memo[i-1] + memo[i-2]
... | p03013 |
import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
MIN = 100
def main():
N, M = list(map(int, input().split()))
memo = [0] * max((N + 1), MIN)
a = [0] * M
memo[0] = 1
memo[1] = 1
memo[2] = 2
for i in range(3, max(N+1, MIN)):
memo[i] = memo[i-1] + memo[i-2]
... | import sys
input = sys.stdin.readline
MOD = 10 ** 9 + 7
MIN = 100
def org(N, M, dp):
a = [0] * M
dp[0] = 1
dp[1] = 1
dp[2] = 2
for i in range(3, max(N+1, MIN)):
dp[i] = dp[i-1] + dp[i-2]
ans = 1
for i in range(M):
a[i] = int(eval(input()))
... | p03013 |
import sys,math
N,M = list(map(int,input().split()))
a = [int(eval(input())) for i in range(M)]
dp = [0] * (N+1)
mod = 10**9+7
for i in range(N,-1,-1):
if i in a:
continue
elif i == N or i == N-1:
dp[i] = 1
else:
dp[i] = (dp[i+1] + dp[i+2])%mod
print((dp[0]))
| import sys,math
N,M = list(map(int,input().split()))
a = [int(eval(input())) for i in range(M)]
b = set(a)
dp = [0] * (N+1)
mod = 10**9+7
for i in range(N,-1,-1):
if i in b:
continue
elif i == N or i == N-1:
dp[i] = 1
else:
dp[i] = (dp[i+1] + dp[i+2])%mod
print((dp[0]))
| p03013 |
def main():
import sys
input = sys.stdin.readline
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in [0]*m]
mod=pow(10,9)+7
ans=[0]*n
ans[0]=1
for i in range(n):
if a.count(i+1)==1:
ans[i]=0
else:
if i==1:
ans[i]=ans[0]+1
elif i>1:
... | def main():
import sys
input = sys.stdin.readline
n,m=list(map(int,input().split()))
mod=pow(10,9)+7
ans=[1]*(n+1)
for _ in [0]*m:
ans[int(eval(input()))]=0
for i in range(n+1):
ans[i]=ans[i] if ans[i]==0 or i<2 else (ans[i-1]+ans[i-2])%mod
print((ans[-1]))
if __name__ == '__main__':
... | p03013 |
maxNum, brokenCount= list(map(int, input().split()))
brokenIndexSet= set([int(eval(input())) for i in range(brokenCount)])
ans = [0]*(maxNum + 1)
ans[0] = 1
#print(ans[-1])
for i in range(1, maxNum + 1):
if i in brokenIndexSet:
ans[i] = 0
else:
ans[i] = (ans[i - 1] + ans[i - 2])... | maxNum, brokenCount= list(map(int, input().split()))
brokenIndexSet= set([int(eval(input())) for i in range(brokenCount)])
ans = [0]*(maxNum+2)
ans[maxNum] = 1
for i in reversed(list(range(maxNum))):
if i in brokenIndexSet:
ans[i] = 0
else:
ans[i] = (ans[i+1] + ans[i+2]) % 10000000... | p03013 |
N,M=list(map(int,input().split()))
list1=[int(eval(input())) for i in range(M)]
list2=[1]
if 1 in list1:
list2.append(0)
else:
list2.append(1)
for i in range(N-1):
if i+2 in list1:
list2.append(0)
else:
list2.append((list2[i]+list2[i+1])%1000000007)
print((list2[N])) | N,M=list(map(int,input().split()))
list1=set([int(eval(input())) for i in range(M)])
list2=[1]+[0]*N
if not 1 in list1:
list2[1]=1
for i in range(N-1):
if not i+2 in list1:
list2[i+2]=(list2[i]+list2[i+1])%1000000007
print((list2[N])) | p03013 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.