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]
dp[i] %= mod
print((dp[-1]))
|
p03013
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
dp=[0]*(n+1)
dp[0]=1
for i in range(1,n+1):
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
if i in a:
dp[i]=0
print((dp[n]))
|
n,m=list(map(int,input().split()))
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 in range(1, M):
if a[m] - a[m - 1] == 1:
flag = False
break
flag_end = True
if M == 0:
flag_end = False
def Fib(n):
a, b = 0, 1
if n == 1:
return a
elif n == 2:
return b
else:
for i in range(n-2):
a, b = b, a + b
return b
if flag and flag_end:
for m in range(M):
if m == 0:
results.append(Fib(a[m] + 1))
else:
results.append(Fib(a[m] - a[m - 1]))
results.append(Fib(N - a[m] + 1))
result = 1
for i in range(len(results)):
result = mul(result, results[i])
print((result % mod))
elif not flag:
print((0))
else:
print((Fib(N + 2) % mod))
|
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 = True
for m in range(1, M):
if a[m] - a[m - 1] == 1:
flag = False
break
flag_end = True
if M == 0:
flag_end = False
def Fib(n):
a, b = 0, 1
if n == 1:
return a
elif n == 2:
return b
else:
for i in range(n-2):
a, b = b, a + b
return b
if flag and flag_end:
for m in range(M):
if m == 0:
results.append(Fib(a[m] + 1))
else:
results.append(Fib(a[m] - a[m - 1]))
results.append(Fib(N - a[m] + 1))
result = 1
for i in range(len(results)):
result = mul(result, results[i])
print((result % mod))
elif not flag:
print((0))
else:
print((Fib(N + 2) % mod))
if __name__ == "__main__":
main()
|
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 diffmax < steps:
diffmax = steps
#print(diff)
actptn = [0,1]
for i in range(2,diffmax):
actptn.append(actptn[i-1] + actptn[i-2])
#print(len(actptn))
ans = 1
for i in diff:
ans = (ans* actptn[i-1]) % 1000000007
print(ans)
|
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 i in range(m)]
dp=[-1]*(n+1)
print((func(n)%1000000007))
|
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 i in range(m)}
dp=[-1]*(n+1)
print((func(n)%1000000007))
|
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((dp[-1]))
|
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:
idx += 1
if len(A):
for i in range(2, N+1):
if i != A[idx]:
dp[i] = (dp[i-1] + dp[i-2]) % P
else:
dp[i] = 0
if idx < M-1:
idx += 1
else:
for i in range(2, N+1):
dp[i] = (dp[i-1] + dp[i-2]) % P
print((dp[N]))
|
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_steps[i]:
steps[i + 1] = (steps[i] + steps[i - 1]) % mod
print((steps[n]))
|
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 not broken_steps[next]:
steps[next] = (steps[now] + steps[now - 1]) % mod
print((steps[n]))
|
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[n]))
|
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 - 2] + a[i - 1]) % 1000000007)
print((a[n]))
|
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]
print((ret[len(ret)-1]%mod))
|
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]
print((ret[len(ret)-1]%mod))
|
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()))
x = 0
y = 1
i = 1
impossible = False
c = 0
while i <= n:
# print(f'degrau: {i}')
# print(f'main loop: i: {i}')
if i in broken:
# print('broken')
x = y
if i + 1 in broken:
impossible = True
break
while not ((i + 1) not in broken and (i + 2) not in broken and (i + 3) not in broken):
if i + 1 in broken and i + 2 in broken:
impossible = True
if i + 2 in broken and i + 3 in broken:
impossible = True
i += 1
i += 2
# while True:
# print('entrei')
# if not ((i + 1) not in broken and (i + 2) not in broken and (i + 3) not in broken):
# print('aqui')
# i += 1
# print(f'i: {i}')
# break
# i += 3
# break
# c = 0
# for x in range(i + 1, i + 4):
# if x in broken:
# c += 1
# if c >= 2:
# impossible = True
# print(f'i: {i}')
# if i + 1 not in broken and i + 2 not in broken and i + 3 not in broken:
# i += 1
# print('broken')
# x = y
# # y = x
# print(f'x: {x}, y: {y}')
# previous_broken = False
# while i not in broken and (i + 1) not in broken and (i + 2) not in broken:
# i += 1
# while c < 2:
# i += 1
# if i in broken:
# if previous_broken:
# impossible = True
# previous_broken = True
# continue
# else:
# previous_broken = False
# c += 1
# i += 2
# c = 0
else:
y, x = (x + y) % 1000000007, y % 1000000007
# print(f'x: {x}, y: {y}')
c = 0
i += 1
# print(y)
print(0) if impossible else print(y % 1000000007)
|
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.append(stairs+1)
now = 0
ans_list = []
for b in broken_list:
cp = b - 1
stg = cp - now
tmp = 0
if stg != 0:
for x in range(stg+1):
if (stg - x) % 2 == 0:
y = (stg - x) // 2
tmp += math.factorial(x+y) // (math.factorial(x) * math.factorial(y))
ans_list.append(tmp)
else:
ans_list.append(1)
now = b + 1
ans = 1
for i in ans_list:
ans = (i * ans) % 1000000007
print(ans)
else:
print((0))
|
# 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-1] + l[i-2]
l[i] %= 1000000007
#print(l)
print((l[n] % 1000000007))
|
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-1] + l[i-2]
l[i] %= 1000000007
else:
k += 1
if k <= m:
a = int(eval(input()))
#print(l)
print((l[n] % 1000000007))
|
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-1] + l[i-2]
l[i] %= 1000000007
else:
k += 1
if k <= m:
a = int(eval(input()))
#print(l)
print((l[n] % 1000000007))
|
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] + k[i-2]
k[i] %= 10 ** 9 + 7
print((k[n]))
|
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] == 1):
ans = 0
for i in range(M + 1):
if (i == 0):
dan = a[i] - 1
elif (i == M):
dan = N - a[i - 1] - 1
else:
dan = a[i] - a[i - 1] - 2
abletwo = (dan - (dan % 2)) // 2
now = 0
if (dan != 0):
for j in range(abletwo + 1):
now += cmb (dan - j , j )
else:
now = 1
ans *= now
else:
ans = 0
abletwo = (N - (N % 2)) // 2
for j in range(abletwo + 1):
ans += cmb (N - j , j )
ans = ans % 1000000007
print (ans)
|
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):
c.append(0)
now_a += 1
else:
c.append(1)
else:
if (a[now_a] == i):
c.append(0)
now_a += 1
else:
c.append( c[i - 1] + c[i - 2])
ans = c[N] % 1000000007
print (ans)
|
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):
# 壊れてるなら
if broken[i]:
# その段には進めないので0通り
dp[i] = 0
# 壊れてないなら
else:
# i - 1段目から移動可能 (i - 1段目は, i == 0 のときにはないので分岐)
if i > 0:
dp[i] += dp[i - 1]
# i - 2段目から移動可能 (i - 2段目は, i == 0, 1 のときにはないので分岐)
if i > 1:
dp[i] += dp[i - 2]
dp[i] %= MOD
print((dp[n]))
|
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[i]
dp[i + 2] %= 1000000007
print((dp[N]))
|
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] += dp[i]
dp[i + 2] %= 1000000007
print((dp[N]))
|
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 - 1] + ans[i - 2]
print((ans[N] % 1000000007))
|
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] % 1000000007))
|
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
tab = [0]*(10**5+10)
tab[0] = 0
tab[1] = tab[2]= 1
for i in range(3, len(tab)):
tab[i] = tab[i-1]+tab[i-2]
# if i<100:
# print(tab[i])
an.append(n)
prev = 0
ans = 1
for a in an:
index = a-prev + (1 if a == n else 0)
# print(a,prev,index,tab[index])
ans *= tab[index]
ans %= mod
prev = a+1
#ans *= tab[n - prev]
#ans %= 1000000007
print(ans)
|
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
tab = [0]*(10**5+2)
tab[0] = 0
tab[1] = tab[2]= 1
for i in range(3, len(tab)):
tab[i] = tab[i-1]+tab[i-2]
# if i<100:
# print(tab[i])
an.append(n)
prev = 0
ans = 1
for a in an:
index = a-prev + (1 if a == n else 0)
# print(a,prev,index,tab[index])
ans *= tab[index]
ans %= mod
prev = a+1
#ans *= tab[n - prev]
#ans %= 1000000007
print(ans)
|
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, product, accumulate, groupby
from bisect import bisect_left, bisect_right, insort_left, insort_right
from operator import itemgetter as ig
#sys.setrecursionlimit(10 ** 7)
'''
#inf = 10 ** 20
'''
INF = float("INF")
mod = 10 ** 9 + 7
"""dd = [(-1, 0), (0, 1), (1, 0), (0, -1)];
ddn = dd + [(-1, 1), (1, 1), (1, -1), (-1, -1)];
ddn9 = ddn + [(0, 0)]
for dx, dy in dd:
nx = j + dx; ny = i + dy
if 0 <= nx < w and 0 <= ny < h:"""
def wi(): return list(map(int, sys.stdin.readline().split()))
def wip(): return [int(x) - 1 for x in sys.stdin.readline().split()] # WideIntPoint
def ws(): return sys.stdin.readline().split()
def si(): return int(sys.stdin.readline()) # SingleInt
def ss(): return input()
def hi(n): return [si() for _ in range(n)]
def hs(n): return [ss() for _ in range(n)] # HeightString
def s_list(): return list(input())
def mi(n): return [wi() for _ in range(n)] # MatrixInt
def mip(n): return [wip() for _ in range(n)]
def ms(n): return [ws() for _ in range(n)]
def num_grid(n): return [[int(i) for i in sys.stdin.readline().split()[0]] for _ in range(n)] # NumberGrid
def grid(n): return [s_list() for _ in range(n)]
'''
def main():
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
dp = [1] * N
if 1 in a:
dp[0] = 0
for i in range(1,N):
if i+1 in a:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[N-1] % (10**9+7)))
else:
for i in range(1,N):
if i+1 in a:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[N-1] % (10**9+7)))
if __name__ == '__main__':
main()
|
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]
print((dp[N-1] % (10**9+7)))
else:
for i in range(1, N):
if i+1 in b:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[N-1] % (10**9+7)))
if __name__ == '__main__':
main()
|
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:
if i+1>=n:
pass
else:
stairs[i+1]=stairs[i]+stairs[i+1]
if i+2 not in breaks:
if i+2>=n:
pass
else:
stairs[i+2]=stairs[i]+stairs[i+2]
if i>3:
if sum(stairs[i-3:]) == 0:
break
print((stairs[-1]%1000000007))
|
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 stairs[i-2]==-1:
stairs[i] = stairs[i-1]
else:
stairs[i] = stairs[i-1] + stairs[i-2]
if flg:
print((0))
else:
print((stairs[-1]%1000000007))
|
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
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= mod
print((dp[n]))
|
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 - 2]
dp[i] %= mod
print((dp[n]))
|
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 in a:
dp[j] = dp[j-1] + dp[j-2]
print((dp[n-1] % 1000000007))
|
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] = dp[j-1] + 1
elif j > 1:
dp[j] = dp[j-1] + dp[j-2]
print((dp[n-1] % 1000000007))
|
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 in range(2, N+1):
if i in A:
dp[i] = 0
else:
dp[i] = dp[i-1]%1000000007 + dp[i-2]%1000000007
print((dp[N]%1000000007))
|
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 = 1
while(True):
ret += cmb(num - minus2,minus2 if minus2 >0 else 1)
minus2 += 1
if num - 2 * minus2 < 0:
break
return ret
n,m = list(map(int,input().split()))
aa = [int(eval(input())) for i in range(m)]
if n == 1:
print((1))
elif m == 0:
print((culcC(n) % 1000000007))
else:
ans = 1
stand = 0
for i,a in enumerate(aa):
# 連続穴
if stand == a:
ans = 0
break
step_num = a - stand - 1
ans *= culcC(step_num)
stand = a + 1
# 最後のaからnまでで計算
ans *= culcC(n - aa[-1] - 1)
print((ans % 1000000007))
|
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 == 1:
print((1))
elif m == 0:
print((culcC(n) % 1000000007))
else:
ans = 1
stand = 0
for i,a in enumerate(aa):
# 連続穴
if stand == a:
ans = 0
break
step_num = a - stand - 1
c = culcC(step_num)
ans *= c if c > 0 else 1
stand = a + 1
# 最後のaからnまでで計算
ans *= culcC(n - aa[-1] - 1)
print((ans % 1000000007))
|
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 hole[i] == True:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[-1]%num))
|
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(n):
if n < 0:
return 0
res = 0
for i in range(n//2+1):
res += f[n - i] * inv[i] * inv[n - 2* i]
return res%const
n, m = list(map(int, input().split()))
const = 1000000007
#nまでの階乗をハッシュテーブルに格納する
f = [1 for i in range(n + 1)]
inv = [1 for i in range(n + 1)]
for i in range(1, n+1):
f[i] = f[i - 1] * i
inv[i] = invmod(f[i], const)
prev = 0
ans = 1
for i in range(m):
m = int(eval(input()))
ans = (ans * count_route(m - 1 - prev))%const
prev = m + 1
if ans == 0:
break
ans = (ans * count_route(n - prev))%const
print(ans)
|
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):
if n < 0:
return 0
res = 0
for i in range(n//2+1):
res += f[n - i] * inv[i] * inv[n - 2* i]
return res%const
n, m = list(map(int, input().split()))
const = 1000000007
#nまでの階乗をハッシュテーブルに格納する
f = [1 for i in range(n + 1)]
inv = [1 for i in range(n + 1)]
for i in range(1, n+1):
f[i] = (f[i - 1] * i)%const
inv[i] = invmod(f[i], const)
prev = 0
ans = 1
for i in range(m):
m = int(eval(input()))
ans = (ans * count_route(m - 1 - prev))%const
prev = m + 1
if ans == 0:
break
ans = (ans * count_route(n - prev))%const
print(ans)
|
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):
if n < 0:
return 0
res = 0
for i in range(n//2+1):
res += f[n - i] * inv[i] * inv[n - 2* i]
return res%const
n, m = list(map(int, input().split()))
const = 1000000007
#nまでの階乗をハッシュテーブルに格納する
f = [1 for i in range(n + 1)]
inv = [1 for i in range(n + 1)]
for i in range(1, n+1):
f[i] = (f[i - 1] * i)%const
inv[i] = invmod(f[i], const)
prev = 0
ans = 1
for i in range(m):
m = int(eval(input()))
ans = (ans * count_route(m - 1 - prev))%const
prev = m + 1
if ans == 0:
break
ans = (ans * count_route(n - prev))%const
print(ans)
|
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] %= 1000000007
print((dp[n]))
|
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]
dp[next_step] %= 1000000007
print((dp[n]))
|
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]: dp[i] += dp[i - 2]
dp[i] %= mod
print((dp[n]))
|
#!/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 and ok[i - 2]:
dp[i] = (dp[i] + dp[i - 2]) % mod
print((dp[n]))
|
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 and ok[i - 2]:
dp[i] = (dp[i] + dp[i - 2]) % mod
print((dp[n]))
|
#!/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]) % mod
if i > 1 and ok[i - 2]:
dp[i] = (dp[i] + dp[i - 2]) % mod
print((dp[n]))
|
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:
b[i] %= Mod
print((b[N]))
|
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
print((b[N]))
|
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]%mod))
|
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:
dp[n] -= mod
print((dp[N]))
|
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_case%1000000007)
print((dp[-1]))
|
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%1000000007
print((dp[n]))
|
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
elif n == 0 or n == 1:
return 1
return fibo(n-2) + fibo(n-1)
print((fibo(N) % 1000000007))
|
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) + fibo(n-1)) % t
print((fibo(N) % t))
|
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
print((dp[n]))
|
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]:
dp[i+2] = 0
else:
dp[i+2] = (dp[i] + dp[i+1])%mod
print((dp[n]))
|
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[i] = Dp_list[i-2] + Dp_list[i-1]
Dp_list[i] %= inf
print((Dp_list[N]))
else:
print((1))
|
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[i-2] + Dp_list[i-1]
Dp_list[i] %= 1000000007
print((Dp_list[N]))
else:
print((1))
|
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+2] % 1000000007
print(ans)
|
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]) % 1000000007
else: # n == a:
C[n+2] = 0
M -= 1
if M > 0:
a = int(eval(input()))
ans = C[N+2] % 1000000007
print(ans)
|
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:
continue
if i >= 2:
C[i] += C[i-2]
C[i] += C[i-1]
C[i] %= 1000000007
elif i >= 1:
C[i] += C[i-1]
C[i] %= 1000000007
print((C[N] % 1000000007))
|
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)):
if A[i]:
continue
if i >= 2:
C[i] += C[i-2]
C[i] += C[i-1]
C[i] %= 1000000007
elif i >= 1:
C[i] += C[i-1]
C[i] %= 1000000007
print((C[N] % 1000000007))
|
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):
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))
|
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):
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
|
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:
dp[i] = 0
print((dp[N]))
|
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] = 1
for i in range(2, N+1):
dp[i] = (dp[i-1]+dp[i-2])%MOD if i not in broken_step else 0
print((dp[N]))
|
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 range(2, N+1):
if b[i] == 1:
dp[i] = 0
else:
dp[i] = (dp[i-1]+dp[i-2])%MOD
print((dp[N]))
|
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 _ in range(m)]
def fib(n):
if (n==1) or (n==2):
return 1
else:
return fib(n-1)+fib(n-2)
start = 0
ans = 1
for k in a:
tmp = k-start
if tmp==0:
print((0))
exit(0)
ans *= fib(tmp)
ans%=MOD
start = k+1
ans*=fib(n-start+1)
ans%=MOD
print(ans)
|
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 _ in range(m)]
# 高速版
def fib(n):
if n <= 1:
return n
result = [1, 0, 0, 1]
matrix = [1, 1, 1, 0]
while n > 0:
if n % 2:
result = mul(matrix, result)
matrix = mul(matrix, matrix)
n //= 2
return result[2]
def mul(a, b):
return [a[0]*b[0] + a[1]*b[2],
a[0]*b[1] + a[1]*b[3],
a[2]*b[0] + a[3]*b[2],
a[2]*b[1] + a[3]*b[3]]
start = 0
ans = 1
for k in a:
tmp = k-start
if tmp==0:
print((0))
exit(0)
ans *= fib(tmp)
ans%=MOD
start = k+1
ans*=fib(n-start+1)
ans%=MOD
print(ans)
|
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, a
else:
a, b = b, b+a
return a
print((fib(N) % 1000000007))
|
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 i not in dangerous:
dp[i] = (dp[i - 2] + dp[i - 1]) % mod
print((dp[-1]))
if __name__ == '__main__':
typical_stairs()
|
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] + dp[i - 1]) % mod
print((dp[-1]))
if __name__ == '__main__':
typical_stairs()
|
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]%(1000000007)))
|
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
# すでに探索済みならメモを参照する
elif memo[n] != -1:
return memo[n]
else:
is_next_damaged = False
is_2next_damaged = False
for a in a_list:
if N - a == n-1:
is_next_damaged = True
if N - a == n-2:
is_2next_damaged = True
if is_next_damaged == True and is_2next_damaged == False:
res = f(n-2, a_list)
if is_next_damaged == False and is_2next_damaged == True:
res = f(n-1, a_list)
if is_next_damaged == False and is_2next_damaged == False:
res = f(n-1, a_list) + f(n-2, a_list)
# メモ
memo[n] = res
return res
if __name__ == '__main__':
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for i in range(M)]
divided_by = 1000000007
answer = -1
# まず移動方法がない場合を考える。
min_diff = sys.maxsize
for i in range(1, len(a_list)):
min_diff = min(min_diff, a_list[i] - a_list[i - 1])
if min_diff == 1:
answer = 0
else:
# 何らかなの移動方法が必ず存在する場合
answer = f(N, a_list)%divided_by
print(answer)
|
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):
dp[i] = 0
elif i-1 in a:
dp[i] = dp[i-2] % MOD
elif i-2 in a:
dp[i] = dp[i-1] % MOD
else:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[n]))
|
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
else:
if i in a:
dp[i] = 0
a.remove(i)
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] = dp[i] % 1000000007
ans = dp[N]
print(ans)
|
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)
else:
dp[i] = 1
else:
dp[i] = 1
else:
if len(a) !=0:
if i == a[0]:
dp[i] = 0
a.pop(0)
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] = dp[i] % 1000000007
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] = dp[i] % 1000000007
ans = dp[N]
print(ans)
|
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 in di):
return 0
if(dp[num]==0):
dp[num] = (dfs(num-1)+dfs(num-2))%mod
return dp[num]
print((dfs(N)))
|
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 di):
dp[i+2]+=dp[i]
dp[i+2]%=mod
if(i<N):
if(i+1 not in di):
dp[i+1]+=dp[i]
dp[i+1]%=mod
print((dp[N]))
|
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]=0
else:
dp[i]=(dp[i-2]+dp[i-1])%1000000007
else:
dp[i]=(dp[i-2]+dp[i-1])%1000000007
print((dp[-1]))
|
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
print((dp[-1]))
|
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((int(dp[N])))
|
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] % MOD
dp[j] %= MOD
s = broken
print((dp[-1]))
|
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])%1000000007
print((dp[n]))
|
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
else:
p, q = 2, 1
for j in range(1, tmp-1):
p, q = p+q, p
tmp2 = p
res *= tmp2
res %= 1000000007
print(res)
|
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:
p, q = 2, 1
for j in range(1, steps-1):
p, q = p+q, p
patern_nmu = p
res *= patern_nmu
res %= 1000000007
print(res)
|
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 - 2]) % MOD
print((dp[N]))
|
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] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[N]))
|
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 - 2]:
dp[i] += (dp[i - 2])
dp[i] %= MOD
print((dp[n]))
|
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]) % MOD
print((dp[n]))
|
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(input())) for i in range(M)]
#動的計画法問題
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] %= (10**9+7)
print((dp[N]))
if __name__ == '__main__':
import io
import sys
import math
import itertools
from collections import deque
# sys.stdin = io.StringIO(_INPUT)
main()
|
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
if M == 0:
res = fibonacci(N + 2)
else:
res = 1
now_step_idx = 0
for i in range(M):
n_step = dirty_step_idxs[i] - now_step_idx - 1
if n_step == -1:
res = 0
break
res *= fibonacci(n_step + 2)
now_step_idx = dirty_step_idxs[i] + 1
rest_steps = N - now_step_idx
res *= fibonacci(rest_steps + 2)
print((res % MOD))
|
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 = [False] * (N + 1)
for a in A:
broken[a] = True
dp = [0] * (N + 1)
dp[0] = 1
dp[1] = 1 if not broken[1] else 0
for i in range(2, N + 1):
if broken[i]:
dp[i] = 0
else:
dp[i] = (dp[i - 1] + dp[i - 2]) % P
ans = dp[N]
print(ans)
if __name__ == "__main__":
main()
|
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 - 1]
dp[i] %= DIV
print((dp[N]))
|
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:
dp[i] = 0
print((dp[n]))
|
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()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,m=LI()
l=[I() for _ in range(m)]
dp=[0 for _ in range(n+1)]
dp[0]=1
for i in range(n):
for j in range(1,3):
if i+j<=n and i not in l:
dp[i+j]+=dp[i]
# print(dp)
return dp[n]%mod
# main()
print((main()))
|
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()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return eval(input())
def main():
n,m=LI()
l=[True for _ in range(n+1)]
for _ in range(m):
l[I()]=False
dp=[0 for _ in range(n+1)]
dp[0]=1
for i in range(n):
for j in range(1,3):
if i+j<=n and l[i]:
dp[i+j]+=dp[i]
# print(dp)
return dp[n]%mod
# main()
print((main()))
|
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[-1]))
|
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)
fact_memo[n] = f
return f
memo = dict()
ans = 1
cur = a_list[0]
for a in a_list[1:]:
sub = a - cur - 2
cur = a
if sub <= 1:
if sub == -1:
print((0))
sys.exit()
continue
if sub in list(memo.keys()):
ans *= memo[sub]
continue
count = sum(fact(sub - j) // fact(j) // fact(sub - j*2) for j in range(sub // 2 + 1))
memo[sub] = count
ans *= count
print((ans % 1000000007))
|
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 = max(ans[i - 1], 0)
ans[i] = a1 + a2
print((ans[N] % (10 ** 9 + 7)))
|
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 i in range(H)]
Route = [0] * (n+1)
Route[0] = 1
for i in range(n):
if i+1 not in A:
Route[i+1] = (Route[i] + Route[i+1]) % (10**9 + 7)
#Route[i+1] %= 10**9 + 7
if i+2 not in A and i+2 <= n:
Route[i+2] = (Route[i] + Route[i+2]) % (10**9 + 7)
#Route[i+2] %= 10**9 + 7
print((Route[n]))
resolve()
|
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):
if is_safe[i]:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= MOD
else:
dp[i] = 0
return dp[N+1]
if __name__ == '__main__':
print((main()))
|
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 の行列)
# A = [list(map(int, input().split())) for i in range(H)]
Route = [0] * (n+1)
Route[0] = 1
if 1 not in A:
Route[1] = 1
MOD = 10**9 + 7
for i in range(2, n+1):
if i not in A:
Route[i] = (Route[i-1] + Route[i-2]) % MOD
# Route[i] %= MOD
print((Route[n]))
# print(Route)
resolve()
|
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 の行列)
# A = [list(map(int, input().split())) for i in range(H)]
Route = [0] * (n+1)
Route[0] = 1
MOD = 10**9 + 7
is_safe = [True] * (n+1)
for a in A:
is_safe[a] = False
if is_safe[1] == True:
Route[1] = 1
for i in range(2, n+1):
if is_safe[i] == True:
Route[i] = (Route[i-1] + Route[i-2]) % MOD
# Route[i] %= MOD
print((Route[n]))
# print(Route)
resolve()
|
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:
dp[i] += dp[i-2]
print((dp[-1]%1000000007))
|
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:
dp[i] += dp[i-2]
print((dp[-1]%1000000007))
|
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]
DP[i]=DP[i]%mod
print((DP[N]))
|
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:
print((0))
exit()
else:
DP[i]=DP[i-1]+DP[i-2]
DP[i]=DP[i]%mod
print((DP[N]))
|
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
from heapq import heappop, heappush
from decimal import *
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
##### 累乗 #####
# pow(x, y, z) -> x**y % z
##### 割り算の切り上げ #####
# tmp = -(-4 // 3)
##### dict の for文 #####
# for k, v in d.items():
# print(k, v)
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N,M = inputMap()
ans = [0 for i in range(N+1)]
ans[0] = 1
a = []
for i in range(M):
tmp = inputInt()
a.append(tmp)
for i in range(N+1):
if i+1 <= N:
if i+1 in a:
pass
else:
ans[i+1] = (ans[i+1] + ans[i]) % mod
if i+2 <= N:
if i+2 in a:
pass
else:
ans[i+2] = (ans[i+2] + ans[i]) % mod
print((ans[N]))
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
# comb = Combination(n+r-1, mod)
# return comb(n+r-1, r)
return combination(n+r-1, r, mod)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n+1):
fac.append(fac[i-1] * i % self.mod)
facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
return modinv
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
stk = []
stk.append(edge)
while len(stk) > 0:
p = stk.pop()
for e in graph[p]:
if parent[p] == e:
continue
else:
parent[e] = p
counter[e] += counter[p]
stk.append(e)
if __name__ == "__main__":
main()
|
# -*- 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
from heapq import heappop, heappush
from decimal import *
##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)
##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力
# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと
##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順
# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順
##### 累乗 #####
# pow(x, y, z) -> x**y % z
##### 割り算の切り上げ #####
# tmp = -(-4 // 3)
##### dict の for文 #####
# for k, v in d.items():
# print(k, v)
def inputInt(): return int(eval(input()))
def inputMap(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N,M = inputMap()
ans = [0 for i in range(N+1)]
ans[0] = 1
a = []
for i in range(M):
tmp = inputInt()
a.append(tmp)
a.sort()
for i,val in enumerate(a):
if i == 0:
continue
if val == a[i-1] + 1:
print((0))
sys.exit()
for i in range(N+1):
tmp = bisect_left(a, i)
if tmp < len(a):
tmp = a[bisect_left(a, i)]
else:
tmp = -1
#print(a[tmp])
if i+1 <= N:
if i+1 == tmp:
pass
else:
ans[i+1] = (ans[i+1] + ans[i]) % mod
if i+2 <= N:
if i+2 == tmp:
pass
else:
ans[i+2] = (ans[i+2] + ans[i]) % mod
print((ans[N]))
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
r = min(r, n-r)
res = 1
for i in range(r):
res = res * (n - i) * modinv(i+1, mod) % mod
return res
# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
return pow(a, mod-2, mod)
def egcd(a, b):
if a == 0:
return b, 0, 1
else:
g, y, x = egcd(b % a, a)
return g, x - (b // a) * y, y
# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
# comb = Combination(n+r-1, mod)
# return comb(n+r-1, r)
return combination(n+r-1, r, mod)
class Combination:
"""
O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
使用例：
comb = Combination(1000000)
print(comb(5, 3)) # 10
"""
def __init__(self, n_max, mod=10**9+7):
self.mod = mod
self.modinv = self.make_modinv_list(n_max)
self.fac, self.facinv = self.make_factorial_list(n_max)
def __call__(self, n, r):
return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod
def make_factorial_list(self, n):
# 階乗のリストと階乗のmod逆元のリストを返す O(n)
# self.make_modinv_list()が先に実行されている必要がある
fac = [1]
facinv = [1]
for i in range(1, n+1):
fac.append(fac[i-1] * i % self.mod)
facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
return fac, facinv
def make_modinv_list(self, n):
# 0からnまでのmod逆元のリストを返す O(n)
modinv = [0] * (n+1)
modinv[1] = 1
for i in range(2, n+1):
modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
return modinv
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# dfs のサンプル
def dfs(graph,parent,counter,edge):
stk = []
stk.append(edge)
while len(stk) > 0:
p = stk.pop()
for e in graph[p]:
if parent[p] == e:
continue
else:
parent[e] = p
counter[e] += counter[p]
stk.append(e)
if __name__ == "__main__":
main()
|
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] == False:
dp[i] = dp[i-2]%p + dp[i-1]%p
print((dp[-1]%p))
|
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]:
continue
dp[i] = dp[i-1]%p+dp[i-2]%p
print((dp[-1]%p))
|
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_count)
return comb_count
def combinations_count(n, r):
return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
(N, M) = list(map(int, input().split(' ')))
count = 1
aim_stage = N
now_stage = 0
before_broken = -1
for i in range(M):
broken = int(eval(input()))
if broken == before_broken + 1:
count = 0
break
aim_stage = broken - 1
distance = aim_stage - now_stage
count *= routeCombCount(distance)
before_broken = broken
now_stage = broken + 1
distance = N - now_stage
count *= routeCombCount(distance)
print((count % 1000000007))
|
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)]
print((dp[N] % 1000000007))
|
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%1000000007))
|
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
sys.setrecursionlimit(100000)
nCr = {}
def cmb(n, r):
if r == 0 or r == n: return 1
if r == 1: return n
if (n,r) in nCr: return nCr[(n,r)]
nCr[(n,r)] = cmb(n-1,r) + cmb(n-1,r-1)
return nCr[(n,r)]
def cmb(n, r):
if n - r < r: r = n - r
if r == 0: return 1
if r == 1: return n
numerator = [n - r + k + 1 for k in range(r)]
denominator = [k + 1 for k in range(r)]
for p in range(2,r+1):
pivot = denominator[p - 1]
if pivot > 1:
offset = (n - r) % p
for k in range(p-1,r,p):
numerator[k - offset] /= pivot
denominator[k] /= pivot
result = 1
for k in range(r):
if numerator[k] > 1:
result *= int(numerator[k])
return result
N,M = list(map(int, input().split()))
A = [0]*M
for i in range(M):
A[i] = int(eval(input()))
A.append(N+1)
def step_comb(L):
c = 0
if L==1 or L == 0:
c = 1
else:
for i in range(L//2 +1):
j = L - 2*i
#c += comb(j+i, i, exact=True)
c += cmb(j+i, i)
return c
total_comb = 1
NOW = 0
for a in A:
if NOW == a:
print((0))
sys.exit()
L = a-1-NOW
total_comb *= step_comb(L)
NOW = a + 1
print((total_comb % 1000000007 ))
|
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 in range(2,N+1):
DP[i] = DP[i-1] + DP[i-2]
def step_comb(L):
if DP[L]>0:
return DP[L]
DP[L] = step_comb(L-1) + step_comb(L-2)
return DP[L]
total_comb = 1
NOW = 0
for a in A:
if NOW == a:
print((0))
sys.exit()
L = a-1-NOW
total_comb *= step_comb(L)
NOW = a + 1
if NOW == N:
break
print((total_comb % 1000000007 ))
|
p03013
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.