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] += steps[i]
steps[i+2] %= P
print(steps[N])
|
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(steps[N])
|
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 += math.factorial(k-i) // (math.factorial(k-2*i) * math.factorial(i)) % 1000000007
ans = ans * cnt % 1000000007
if ans == 0:
break
a_pre = a
a = n + 1
if a == a_pre:
pass
elif a == a_pre + 1:
ans = 0
else:
k = a - a_pre - 2
max_2 = k//2
cnt = 0
for i in range(max_2+1):
cnt += math.factorial(k-i) // (math.factorial(k-2*i) * math.factorial(i)) % 1000000007
ans = ans * cnt % 1000000007
print(ans)
|
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
else:
s[ni] = 0
print((s[n]))
|
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]
elif i == base[j]:
if j < m-1:
j = j + 1
print((int(dp[n]%1000000007)))
|
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:
c.append(b[a[1] - a[0] - 1])
i = 1
while i <= m:
if a[i + 1] - a[i] - 3 >= 0:
c.append(b[a[i + 1] - a[i] - 3])
i += 1
elif a[i + 1] - a[i] - 2 == 0:
c.append(1)
else:
c.append(0)
break
#print(c)
d = c[0]
i = 1
#print(d)
while i < len(c):
d = d * c[i]
i += 1
e = 1000000007
print((d % e))
#print(b[0])
|
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:
while True:
pass
print((0))
if N == 2:
print((dp[-1]))
else:
cnt = 0
for n in range(2, N):
while(cnt < M - 1 and A[cnt] < n + 1):
cnt += 1
if A[cnt] == n + 1:
dp[0] = dp[1]
dp[1] = 0
else:
new_val = (max(dp[0], 0) + max(dp[1], 0)) % MOD
dp[0] = dp[1]
dp[1] = new_val
print((dp[-1]))
|
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:
print((1))
elif N == 2:
print((dp[-1]))
else:
cnt = 0
for n in range(2, N):
while(cnt < M - 1 and A[cnt] < n + 1):
cnt += 1
if A[cnt] == n + 1:
dp[0] = dp[1]
dp[1] = 0
else:
new_val = (max(dp[0], 0) + max(dp[1], 0)) % MOD
dp[0] = dp[1]
dp[1] = new_val
print((dp[-1]))
|
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]
elif i + 1 in l:
d[i + 2] = d[i]
else:
d[i + 2] = d[i] + d[i + 1]
d[i + 2] = d[i + 2] % (10 ** 9 + 7)
print((d[-2]))
|
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]
elif i + 1 in l:
d[i + 2] = d[i]
else:
d[i + 2] = d[i] + d[i + 1]
d[i + 2] = d[i + 2] % (10 ** 9 + 7)
print((d[-2]))
|
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):
cnt += int(combinations_count(n - i, i))
return cnt
n, m = list(map(int, input().split()))
a = []
start = 0
cnt = 1
for i in range(m):
ko = int(eval(input()))
end = ko - 1
cnt = cnt * pat(end - start)
start = ko + 1
cnt = cnt * pat(n - start)
print((cnt % mod))
|
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]%MOD
def sigmaComb(dis):
ans=0
if dis == 1 or dis == 0:
return 1
end=dis//2+1
for i in range(end):
t=comb(dis-i,i)
#print(dis-i,i,t)
ans+=t
return ans
hole=[0]
ans=1
for i in range(m):
t = int(eval(input()))
availLeft=hole[-1]
availRight=t-1
dis=availRight-availLeft
if dis <0:
ans=0
break
ans=ans*sigmaComb(dis)%MOD
#print("dis=",dis,t,ans)
hole.append(t+1)
else:
availLeft=hole[-1]
availRight=n
dis=availRight-availLeft
#print("dis=",dis,hole[-1],ans)
ans=ans*sigmaComb(dis)%MOD
print((ans%MOD))
|
p03013
|
n, m = list(map(int,input().split()))
a = [int(eval(input())) for i in range(m)]
dp = [0] * (n+1)
dp[0] = 1
for 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 (Fraction(1), Fraction(1));
if (n % 2 == 0):
return fibExp(fibMul(fn, fn), n / 2);
return fibMul(fn, fibExp(fn, n - 1));
def fibMin(fn1, fn2):
a = fn1[0]
b = fn1[1]
c = fn2[0]
d = fn2[1]
return (a - c, b - d)
def fibMain(n):
fibNum1 = (Fraction(1, 2), Fraction( 1, 2))
fibNum2 = (Fraction(1, 2), Fraction(-1, 2))
fibNum3 = fibMin(fibExp(fibNum1, n), fibExp(fibNum2, n))
fibNum4 = (Fraction(0, 1), Fraction(1, 5))
return fibMul(fibNum3, fibNum4)
def fib(n):
return fibMain(n)[0].numerator
n, m =list(map(int, input().split())) #複数数値入力
a = [-1]
for i in range(m):
ai = int(eval(input()))
a.append(ai)
a.append(n+1)
count = 1
root5 = math.sqrt(5)
for i in range(m+1):
x = a[i+1] - a[i] -1
if x == 0:
count = 0
break
else:
# y = 1/root5 *(((1+root5)/2)**x - ((1-root5)/2)**x)
count *= fib(x)
print((int(count)%1000000007))
|
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 * b.c,
self.a * b.b + self.b * b.d,
self.c * b.a + self.d * b.c,
self.c * b.b + self.d * b.d)
def fib(n):
if n == 0: return 0
m = multipliable_2x2matrix(1, 1, 1, 0)
f = multipliable_2x2matrix(1, 0, 0, 1)
n = n - 1
while n > 0:
if n & 1 == 1:
f = f.mul(m)
n = n >> 1
m = m.mul(m)
return f.a
n, m =list(map(int, input().split())) #複数数値入力
a = [-1]
for i in range(m):
ai = int(eval(input()))
a.append(ai)
a.append(n+1)
count = 1
root5 = math.sqrt(5)
for i in range(m+1):
x = a[i+1] - a[i] -1
if x == 0:
count = 0
break
else:
# y = 1/root5 *(((1+root5)/2)**x - ((1-root5)/2)**x)
count *= fib(x)
print((int(count)%1000000007))
|
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] = dp[0] + 1
else:
dp[1] = 0
for i in range(2, N):
if not stair[i]:
dp[i] = 0
continue
if stair[i-1] and stair[i-2]:
dp[i] = (dp[i-1] + dp[i-2])%MOD
elif stair[i-1]:
dp[i] = dp[i-1]
elif stair[i-2]:
dp[i] = dp[i-2]
print((dp[N-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, N):
if not stair[i]:
dp[i] = 0
continue
if stair[i-1] and stair[i-2]:
dp[i] = (dp[i-1] + dp[i-2])%MOD
elif stair[i-1]:
dp[i] = dp[i-1]
elif stair[i-2]:
dp[i] = dp[i-2]
print((dp[N-1]))
|
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, N):
if not stair[i]:
dp[i] = 0
continue
if stair[i-1] and stair[i-2]:
dp[i] = (dp[i-1] + dp[i-2])%MOD
elif stair[i-1]:
dp[i] = dp[i-1]
elif stair[i-2]:
dp[i] = dp[i-2]
print((dp[N-1]))
|
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):
if not stair[i]:
dp[i] = 0
continue
if stair[i-1] and stair[i-2]:
dp[i] = (dp[i-1] + dp[i-2])%MOD
elif stair[i-1]:
dp[i] = dp[i-1]
elif stair[i-2]:
dp[i] = dp[i-2]
print((dp[N-1]))
|
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]) % 1000000007
print((dp[0]))
|
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]
print((fib(n, MOD)))
|
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]+sta[i-2])
row = []
now = 1
flag = 0
for i in range(N):
I = i+1
if i == 0:
if I in A:
now = 0
flag = 1
else:
now+=1
else:
if I in A:
if flag == 1:
flag = 2
break
else:
row.append(now)
now = 0
flag = 1
else:
flag = 0
now+=1
if flag == 2:
print((0))
else:
row.append(now)
ans = 1
for r in row:
ans = (ans*sta[r-1])%mod
print(ans)
|
#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
old = -1
for a in A:
if a-old == 1:
flag = 1
break
else:
stairs.append(a-old-1)
old = a
stairs.append(N-old)
if flag == 1:
print((0))
else:
#print(stairs)
ans = 1
for s in stairs:
ans*=step[s]
print((ans%mod))
|
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 - 2]) % MOD
print((dp[N]))
|
# 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] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[N]))
|
p03013
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i in range(m)]
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]
print((dp[N-1]%1000000007))
|
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]:
dp[i-1]=dp[i-2]+dp[i-3]
else:
j+=1
print((dp[N-1]%1000000007))
|
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])%MOD
cnt += 1
print((memo[N]))
|
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((memo[-1] + memo[-2])%MOD)
cnt += 1
print((memo[-1]))
|
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] = (ans[i-1] + ans[i])%p
print((ans[-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])%(10**9 + 7)
print((ansls[-1]))
if __name__ == "__main__":
main()
|
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] = (ansls[i-2] + ansls[i-1])%big
print((ansls[-1]))
if __name__ == "__main__":
main()
|
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])%(10**9 + 7)
print((ansls[-1]))
if __name__ == "__main__":
main()
|
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-1])%(10**9 + 7)
print((ansls[-1]))
if __name__ == "__main__":
main()
|
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+1]=dp[i]*isbroken[i]
dp[i+1]%=mod
print((dp[N]))
|
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 - 2]
else:
dp[i] = dp[i - 1]
dp[i] %= MOD
print((dp[N]))
|
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]
dp[i + 2] %= mod
print((dp[n]))
|
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**9 +7)))
|
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)
print(ans)
|
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
a.pop(0)
print(ans)
|
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] = 0
if len(a) - 1 != j:
j += 1
print(ans)
|
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():
n, m= list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
print((dp1(n,a)%1000000007))
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 main():
n, m= list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
print((dp1(n,a)))
main()
|
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]%1000000007))
else:
print((NL[-1]))
|
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],
a[0]*b[1] + a[1]*b[3],
a[2]*b[0] + a[3]*b[2],
a[2]*b[1] + a[3]*b[3]]
N, M = list(map(int, input().split()))
if N == 1:
print((1))
quit()
S = [-1]
for i in range(M):
S.append(int(eval(input())))
S.append(N + 1)
S = [S[i + 1] - S[i] for i in range(M + 1)]
if any([x == 1 for x in S]):
print((0))
exit()
num = 1
for x in S:
num *= fib(x - 1)
num = num % 1000000007
print(num)
|
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
if S[i] == 0:
print((0))
quit()
print((S[N]))
|
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)+7)))
|
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]%((10**9)+7)))
|
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]%((10**9)+7)))
|
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 range(3,N+1):
if i in a:
dp[i] = 0
continue
dp[i] = (dp[i-2]+dp[i-1])%1000000007
print((dp[-1]))
|
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
continue
if i-2>=0:
dp[i] = (dp[i-1]+dp[i-2])%(10**9+7)
print((dp[-1]))
|
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
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= 10**9+7
print((dp[-1]))
|
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 i in a:
dp[i] = 0
continue
dp[i] += dp[i-j]
dp[i] %= 10**9+7
print((dp[-1]))
|
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 A:
dp[i] = dp[i-1]
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%mod))
|
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[i-1] + dp[i-2]
print((dp[-1]%(7+10**9)))
|
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] = dp[i-1] + dp[i-2]
print((dp[-1]%(7+10**9)))
|
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]
ans_list[i] += ans_list[i-1]
print((int(ans_list[-1]%1000000007)))
|
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:
if a_list[0] == 1:
b = 0
m = 1
else:
b = 1
m = 0
for i in range(2, N+1):
if a_list[0] == i:
a, b = b, 0
else:
ans = (a+b)%1000000007
a, b = b, ans
else:
if a_list[0] == 1:
b = 0
m = 1
else:
b = 1
m = 0
for i in range(2, N+1):
if m < M-1:
if a_list[m+1] - a_list[m] == 1:
print((0))
sys.exit()
if a_list[m] == i:
a, b = b, 0
m += 1
else:
ans = (a+b)%1000000007
a, b = b, ans
else:
if a_list[m] == i:
a, b = b, 0
else:
ans = (a+b)%1000000007
a, b = b, ans
print(ans)
|
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, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
p,q,r = LI()
print((p+q+r-max(p,q,r)))
return
#B
def B():
n = I()
w = LI()
ans = float("inf")
for i in range(n):
m = sum(w[:i])
l = sum(w[i:])
ans = min(ans,abs(m-l))
print(ans)
return
#C
def C():
n,m = LI()
f = defaultdict(lambda : 1)
for i in range(m):
a = I()
f[a] = 0
dp = defaultdict(int)
dp[0] = 1
for i in range(1,n+1):
if f[i]:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= mod
print((dp[n]))
return
#D
def D():
h,w = LI()
s = SR(h)
return
#E
def E():
n = I()
return
#F
def F():
n = I()
return
#Solve
if __name__ == "__main__":
C()
|
#!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, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
p,q,r = LI()
print((p+q+r-max(p,q,r)))
return
#B
def B():
n = I()
w = LI()
ans = float("inf")
for i in range(n):
m = sum(w[:i])
l = sum(w[i:])
ans = min(ans,abs(m-l))
print(ans)
return
#C
def C():
n,m = LI()
f = defaultdict(lambda : 1)
for i in range(m):
a = I()
f[a] = 0
dp = defaultdict(lambda : 0)
dp[0] = 1
for i in range(1,n+1):
if f[i]:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= mod
print((dp[n]))
return
#D
def D():
h,w = LI()
s = SR(h)
return
#E
def E():
n = I()
return
#F
def F():
n = I()
return
#Solve
if __name__ == "__main__":
C()
|
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, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
p,q,r = LI()
print((p+q+r-max(p,q,r)))
return
#B
def B():
n = I()
w = LI()
ans = float("inf")
for i in range(n):
m = sum(w[:i])
l = sum(w[i:])
ans = min(ans,abs(m-l))
print(ans)
return
#C
def C():
n,m = LI()
f = defaultdict(lambda : 1)
for i in range(m):
a = I()
f[a] = 0
dp = defaultdict(lambda : 0)
dp[0] = 1
for i in range(1,n+1):
if f[i]:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= mod
else:
dp[i] = 0
print((dp[n]))
return
#D
def D():
h,w = LI()
s = SR(h)
return
#E
def E():
n = I()
return
#F
def F():
n = I()
return
#Solve
if __name__ == "__main__":
C()
|
#!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, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = I()
return l
def LIR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LI()
return l
def SR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = S()
return l
def LSR(n):
l = [None for i in range(n)]
for i in range(n):l[i] = LS()
return l
sys.setrecursionlimit(1000000)
mod = 1000000007
#A
def A():
p,q,r = LI()
print((p+q+r-max(p,q,r)))
return
#B
def B():
n = I()
w = LI()
ans = float("inf")
for i in range(n):
m = sum(w[:i])
l = sum(w[i:])
ans = min(ans,abs(m-l))
print(ans)
return
#C
def C():
n,m = LI()
f = [1 for i in range(n+1)]
for i in range(m):
a = I()
f[a] = 0
dp = [0 for i in range(n+1)]
dp[0] = 1
for i in range(1,n+1):
if f[i]:
dp[i] = dp[i-1]+dp[i-2]
dp[i] %= mod
print((dp[n]))
return
#D
def D():
h,w = LI()
s = SR(h)
return
#E
def E():
n = I()
return
#F
def F():
n = I()
return
#Solve
if __name__ == "__main__":
C()
|
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(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N,M=MAP()
broken=[False]*(N+1)
for i in range(M):
a=INT()
broken[a]=True
dp=[0]*(N+7)
dp[0]=1
for i in range(N):
if not broken[i+1]:
dp[i+1]+=dp[i]
dp[i+1]%=MOD
if i!=N-1 and not broken[i+2]:
dp[i+2]+=dp[i]
dp[i+2]%=MOD
print((dp[N]))
|
# -*- 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(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
N,M=MAP()
broken=[False]*(N+1)
for i in range(M):
a=INT()
broken[a]=True
dp=[0]*(N+1)
dp[0]=1
for i in range(N):
if not broken[i+1]:
dp[i+1]+=dp[i]
dp[i+1]%=MOD
if i!=N-1:
if not broken[i+2]:
dp[i+2]+=dp[i]
dp[i+2]%=MOD
print((dp[N]))
|
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]+nroute[i-2])%MOD
#print(nroute)
subn=[]
i=0
for j in a:
subn.append((i,j-1))
i=j+1
subn.append((i,n))
#print(subn)
nways=1
for i,j in subn:
l=j-i+1
nways=nways*nroute[l]%MOD
return nways
if __name__=='__main__':
n,a=readinput()
ans=main(n,a)
print(ans)
|
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]:
ia+=1
#print(ia)
continue
dp[i+1]=(dp[i+1]+dp[i])%MOD
dp[i+2]=(dp[i+2]+dp[i])%MOD
#print(dp)
return dp[n]
if __name__=='__main__':
n,m,a=readinput()
ans=main(n,m,a)
print(ans)
|
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
print((ans[-1]))
|
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]
elif ans[i] == 0:
ans[1] = 0
elif i >= 2 and ans[i] == 1:
ans[i] = (ans[i-1] + ans[i-2])%MOD
print((ans[-1]))
|
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[i] = dp[i]%mod
print((dp[N]%mod))
|
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
dp[i] = dp[i]%mod
print((dp[N]%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, file().split()))
broken = set()
for i in range(M): broken |= {int(file())}
DP = [0] * (N + 1)
DP[0] = 1
for i in range(N):
if i + 1 not in broken:
DP[i+1] += DP[i]
DP[i+1] %= mod
if i + 2 <= N:
if i + 2 not in broken:
DP[i+2] += DP[i]
DP[i+2] %= mod
print((DP[N]))
return 0
if __name__ == "__main__":
solve()
|
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 + 2]:
DP[i + 2] += DP[i]
DP[i + 2] %= mod
if A[i + 1]:
DP[i + 1] += DP[i]
DP[i + 1] %= mod
print((DP[N]))
return 0
if __name__ == "__main__":
solve()
|
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 range(2,N + 1):
if A[i]:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= 1000000007
print((dp[N]))
if __name__ == '__main__':
main()
|
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[i + 2] %= mod
if i + 1 not in a:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
print((dp[-1]))
|
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]
ans[i + 1] %= md
if (i + 2) not in am:
ans[i + 2] += ans[i]
ans[i + 2] %= md
print((ans[n]))
if __name__=="__main__":
solve()
|
#!/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] + ans[i + 1]) % md
if (i + 2) not in am:
ans[i + 2] = (ans[i] + ans[i + 2]) % md
print((ans[n]))
if __name__ == "__main__":
solve()
|
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]) % MOD
print((dp[n]))
|
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
print((dp[n]))
|
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:
dp.append(0)
print((dp[n]))
|
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) in a:
list[i] = 0
elif i in a:
list[i] = 1
else:
list[i] = 2
else:
if (i + 1) in a:
list[i] = 0
else:
list[i] = (list[i - 1] + list[i - 2]) % MOD
ans = list[N - 1]
print(ans)
|
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] = 1
elif i == 1:
if a[j] == 2:
list[i] = 0
elif a[0] == 1:
list[i] = 1
else:
list[i] = 2
else:
if a[j] == i + 1:
list[i] = 0
else:
list[i] = (list[i - 1] + list[i - 2]) % MOD
if i + 1 == a[j] and j < M - 1:
j += 1
else:
for i in range(N):
if i == 0:
list[i] = 1
elif i == 1:
list[i] = 2
else:
list[i] = (list[i - 1] + list[i - 2]) % MOD
ans = list[N - 1]
print(ans)
|
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] = fibs[1]
fibs[1] = next
print((fibs[-1]))
|
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]
if next > 1000000007:
next -= 1000000007
fibs[0] = fibs[1]
fibs[1] = next
print((fibs[-1]))
|
p03013
|
MOD=10**9+7
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
dp=[0]*(n+1)
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 i in a:
dp[i]=0
else:
dp[i]=(dp[i-1]+dp[i-2])%MOD
print((dp[-1]%MOD))
|
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):
if i in a:
dp[i]=0
else:
dp[i]=(dp[i-1]+dp[i-2])%MOD
print((dp[-1]%MOD))
|
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:
ans=[0,1,2]
@lru_cache(maxsize=None)
def cnt(x):
if x<3:
return ans[x]
if x in a:
return 0
else:
return (cnt(x-1)+cnt(x-2))%MOD
print((cnt(n)))
|
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:
s=(ans[-1]+ans[-2])%MOD
ans.append(s)
print((ans[-1]%MOD))
|
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:
l=[a[0]]
for i in range(len(a)-1):
l.append(a[i+1]-a[i]-1)
l.append(n-a[-1])
k=1
for i in l:
k=fib[i]*k%mod
print((k%mod))
else:
print((fib[n+1]%mod))
|
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] = (memo[i + 1] + memo[i]) % mod
if i + 2 not in a:
memo[i + 2] = (memo[i + 2] + memo[i]) % mod
print((memo[n]))
|
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:
dp[step] = dp[step-1] + dp[step-2]
dp[step] %= MOD
return dp[N+1]
if __name__ == '__main__':
print((main()))
|
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):
step = i+2
if is_safe[i+1]:
dp[step] = dp[step-1] + dp[step-2]
dp[step] %= MOD
else:
dp[step] = 0
return dp[N+1]
if __name__ == '__main__':
print((main()))
|
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):
step = i+2
if is_safe[i+1]:
dp[step] = dp[step-1] + dp[step-2]
dp[step] %= MOD
else:
dp[step] = 0
return dp[N+1]
if __name__ == '__main__':
print((main()))
|
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
|
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
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
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[i-2])%mod
#print(dp)
print((dp[n]))
|
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]=(dp[i-1]+dp[i-2])%mod
#print(dp)
print((dp[n]))
|
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
#print(aa)
d[0]=1
if aa[1] == 0:
d[1]=1
else:
d[1]=0
if aa[2] == 0:
d[2]=d[1]+d[0]
else:
d[2]=0
for i in range(2,n+1):
if aa[i] == 0:
d[i]=d[i-1]+d[i-2]
d[i]=d[i]%p
else:
d[i]=0
#print(d)
print((d[n]%p))
|
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:
d[1]=1
else:
d[1]=0
if aa[2] == 0:
d[2]=d[1]+d[0]
else:
d[2]=0
for i in range(2,n+1):
if aa[i] == 0:
d[i]=d[i-1]+d[i-2]
d[i]=d[i]%p
else:
d[i]=0
#print(d)
print((d[n]%p))
|
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
print(dp[N]%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:
dp[i+2]+=dp[i]
dp[i+2]%=mod
print(dp[N]%mod)
|
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[i + 1] = (dp[i] + dp[i - 1]) % mod
print((dp[n]))
|
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] + dp[i - 1]) % mod
print((dp[n]))
|
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
print((dp[n]%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
print((dp[n]%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 next_ not in a:
steps[next_] += steps[now]
steps[next_] %= MOD
print((steps[-1]))
if __name__ == '__main__':
main()
|
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 next_ not in a:
steps[next_] += steps[now] % MOD
steps[next_] %= MOD
print((steps[-1]))
if __name__ == '__main__':
main()
|
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:
continue
dp[i] = (dp[i-1]+dp[i-2])%mod
print((dp[n]))
main()
|
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 > n//2:
r = n - r
val = 1
for i in range(r):
val *= n - i
val //= i + 1
return val
ans = 1
for k in key:
val = 0
for i in range(k//2 + 1):
val += cmb(k - i, i)
ans *= val**d[k]
ans %= 10**9 + 7
print(ans)
|
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]*(ma + 1)
for i in range(2, ma + 1):
fib[i] = fib[i - 2] + fib[i - 1]
ans = 1
for k in key:
ans *= fib[k]**d[k]
ans %= 10**9 + 7
print(ans)
|
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[-1]))
|
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] + dp[i - 2]
dp[i] %= MOD
print((dp[-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):
if i == A[index]:
if count == 0:
return 0
else:
steps.append(count)
count = 0
if index < M:
index += 1
else:
count += 1
else:
steps.append(count)
count = 0
smax = max(steps)
fibs = [0] * smax
#fibテーブル生成 O(n)
for i in range(smax):
if i == 0 or i == 1:
fibs[i] = 1
else:
fibs[i] = fibs[i-1] + fibs[i-2]
else:
ans = 1
for s in steps:
#print(s)
ans *= fibs[s-1]
#print(ans)
ans %= key
#print(A)
#print(steps)
#print(fibs)
return ans
ans = solve()
print(ans)
|
# -*- 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(input())) for _ in range(M)]+[-1]
fibs = [0]*(N+1)
index = 0
for i in range(N+1):
#壊れたところの値を0にすれば良い
if i == A[index]:
fibs[i] = 0
index += 1
elif i == 0 or i == 1:
fibs[i] = 1
else:
fibs[i] = (fibs[i-1] + fibs[i-2])%key
print((fibs[N]))
|
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
else:
if step[i-2] == step[i-1] == -1:
print((0))
exit()
elif step[i-2] == -1 or step[i-1] == -1:
step[i] = max(step[i-2], step[i-1])
else:
step[i] = (step[i-2] + step[i-1]) % MOD
print((step[n]))
|
### 解説読んでから書いたコード ###
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 # 存在しない段(計算用)
step[0] = 1 # 0段目は1通り
for i in range(1, n+1):
if a[a_i] == i:
step[i] = -1 # 壊れている床は-1
a_i += 1
else:
if step[i-2] == step[i-1] == -1:
print((0)) # 2段続けて壊れている場合は0通り
exit()
elif step[i-2] == -1 or step[i-1] == -1:
step[i] = max(step[i-2], step[i-1]) # [1,2]段前が壊れている場合
else:
step[i] = (step[i-2] + step[i-1]) % MOD # 通常の場合
print((step[n]))
|
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):
if i in A:
ret.append(0)
else:
ret.append((ret[-1] + ret[-2]) % MOD)
print((ret[-1] % MOD))
if __name__ == '__main__':
main()
|
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 + 1):
if i in A:
ret.append(0)
else:
ret.append((ret[-1] + ret[-2]) % MOD)
print((ret[-1] % MOD))
if __name__ == '__main__':
main()
|
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: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = il()
A = set(iln(M))
dp = [0]*(N+1)
dp[0] = 1
for n in range(1, N+1):
if n in A:
dp[n] = 0
else:
dp[n] = dp[n-1] + dp[n-2]
print((dp[N]%MOD))
if __name__ == '__main__':
main()
|
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: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]
lcm = lambda x, y: (x * y) // math.gcd(x, y)
# lcm = lambda x, y: (x * y) // fractions.gcd(x, y)
MOD = 10 ** 9 + 7
MAX = float('inf')
def main():
if os.getenv("LOCAL"):
sys.stdin = open("input.txt", "r")
N, M = il()
A = set(iln(M))
dp = [0]*(N+1)
dp[0] = 1
for n in range(1, N+1):
if n in A:
dp[n] = 0
else:
dp[n] = (dp[n-1] + dp[n-2])%MOD
print((dp[N]%MOD))
if __name__ == '__main__':
main()
|
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
else:
dp[i] = (dp[i-1]+ dp[i-2])%mod
print((dp[n]))
|
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]
if(curr>0 and (curr in brkn)):
dp[curr]=0
return dp[curr]%mod
if(curr==1):
dp[1]=1
return dp[1]
if(dp[curr]!=-1):
return dp[curr]%mod
else:
dp[curr] = (func(curr-1) + func(curr-2))%mod
return dp[curr]%mod
print((func(n)))
|
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
else:
seat = steps - j
cnt += combinations_count(seat,j)
print((cnt % (10**9+7)))
exit()
l = [-1]+[int(eval(input()))]
for i in range(m-1):
a = int(eval(input()))
if a == l[-1]+1:
print((0))
exit()
l.append(a)
l.append(n+1)
# print(l)
ans = 1
for i in range(m+1):
cnt = 0
steps = l[i+1] - l[i] -2
for j in range(steps//2+1):
if j == 0:
cnt += 1
else:
seat = steps - j
cnt += combinations_count(seat,j)
ans *= cnt
print((ans % (10**9+7)))
|
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] %= (10**9+7)
print((dp[n]))
|
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(memo)
ans = 1
for i in range(M):
a[i] = int(eval(input()))
if i != 0 and abs(a[i] - a[i-1]) == 1:
print((0))
return
if a[i] == 1:
ans *= 1
elif i == 0:
ans *= memo[a[i] - 1]
ans %= MOD
# print(a[i], ans, a[i] - 1)
else:
ans *= memo[a[i] - a[i-1] - 2]
ans %= MOD
# print(a[i], ans, a[i] - a[i-1] - 2)
if M == 0:
ans *= memo[N]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
else:
ans *= memo[N - a[M-1] - 1]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
if __name__ == '__main__':
main()
|
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]
ans = 1
for i in range(M):
a[i] = int(eval(input()))
if i != 0 and abs(a[i] - a[i-1]) == 1:
print((0))
return
if a[i] == 1:
ans *= 1
elif i == 0:
ans *= memo[a[i] - 1]
ans %= MOD
# print(a[i], ans, a[i] - 1)
else:
ans *= memo[a[i] - a[i-1] - 2]
ans %= MOD
# print(a[i], ans, a[i] - a[i-1] - 2)
if M == 0:
ans *= memo[N]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
else:
ans *= memo[N - a[M-1] - 1]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
if __name__ == '__main__':
main()
|
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]
ans = 1
for i in range(M):
a[i] = int(eval(input()))
if i != 0 and abs(a[i] - a[i-1]) == 1:
print((0))
return
if a[i] == 1:
ans *= 1
elif i == 0:
ans *= memo[a[i] - 1]
ans %= MOD
# print(a[i], ans, a[i] - 1)
else:
ans *= memo[a[i] - a[i-1] - 2]
ans %= MOD
# print(a[i], ans, a[i] - a[i-1] - 2)
if M == 0:
ans *= memo[N]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
else:
ans *= memo[N - a[M-1] - 1]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
if __name__ == '__main__':
main()
|
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()))
if i != 0 and abs(a[i] - a[i-1]) == 1:
print((0))
return
if a[i] == 1:
ans *= 1
elif i == 0:
ans *= dp[a[i] - 1]
ans %= MOD
# print(a[i], ans, a[i] - 1)
else:
ans *= dp[a[i] - a[i-1] - 2]
ans %= MOD
# print(a[i], ans, a[i] - a[i-1] - 2)
if M == 0:
ans *= dp[N]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
else:
ans *= dp[N - a[M-1] - 1]
ans %= MOD
# print(ans, N - a[M-1] - 1)
print(ans)
def good(N, M, dp):
a = [0] * len(dp)
for i in range(M):
a[int(eval(input()))-1] = True
dp[0] = 0 if a[0] is True else 1
dp[1] = 0 if a[1] is True else dp[0] + 1
if N == 1:
print((dp[0]))
return
elif N == 2:
print((dp[1]))
return
for i in range(2, N):
if a[i] is True:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= MOD
print((dp[N-1] % MOD))
# print(dp)
def main():
N, M = list(map(int, input().split()))
dp = [0] * max((N + 1), MIN)
good(N, M, dp)
if __name__ == '__main__':
main()
|
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:
if ans[i-1]==0 and ans[i-2]==0:
print((0))
exit()
ans[i]=(ans[i-1]%mod+ans[i-2]%mod)%mod
print((ans[-1]))
if __name__ == '__main__':
main()
|
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__':
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]) % 1000000007
print((ans[maxNum]))
|
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]) % 1000000007
print((ans[0]))
|
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.