input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
N,M = (int(i) for i in input().split())
a = [int(eval(input())) for i in range(M)]
hoge = [0] * N
if 1 not in a:
hoge[0] = 1
if 2 not in a and N >= 2:
hoge[1] = hoge[0] + 1
for i in range(2,N):
if i + 1 not in a:
hoge[i] += hoge[i - 1]
hoge[i] += hoge[i - 2]
print((hoge[N-1] % (10**9 + 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 in A:
continue
if i == 1:
dp[i] = 1
continue
dp[i] = dp[i-1] + dp[i-2]
print((dp[N] % mod))
|
p03013
|
N,M = (int(i) for i in input().split())
a = [int(eval(input())) for i in range(M)]
hoge = [0] * N
if 1 not in a:
hoge[0] = 1
if 2 not in a and N >= 2:
hoge[1] = hoge[0] + 1
for i in range(2,N):
if i + 1 not in a:
hoge[i] = hoge[i - 1] + hoge[i - 2]
print((hoge[N-1] % (10**9 + 7)))
|
N,M = (int(i) for i in input().split())
a = set([int(eval(input())) for i in range(M)])
hoge = [0] * N
if 1 not in a:
hoge[0] = 1
if 2 not in a and N >= 2:
hoge[1] = hoge[0] + 1
for i in range(2,N):
if i + 1 not in a:
hoge[i] = hoge[i - 1] + hoge[i - 2]
print((hoge[N-1] % (10**9 + 7)))
|
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
for i in range(1, n+1):
if i in A:
dp[i] = 0
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[-1]))
|
n, m = list(map(int, input().split()))
A = [False for i in range(n+1)]
for i in range(m):
a = int(eval(input()))
A[a] = True
dp = [0 for i in range(n+1)]
dp[0] = 1
for i in range(1, n+1):
if A[i]:
dp[i] = 0
else:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
stairs = [i for i in range(1, n+1)]
a = [0 for _ in range(m)]
for i in range(m):
a[i] = int(eval(input()))
a = set(a)
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n+1):
if i in a:
continue
dp[i] = dp[i] + dp[i-1]
if i > 1:
dp[i] = dp[i] + dp[i-2]
print((dp[n] % 1000000007))
|
n, m = list(map(int, input().split()))
stairs = [i for i in range(1, n+1)]
a = [0 for _ in range(m)]
for i in range(m):
a[i] = int(eval(input()))
a = set(a)
dp = [0] * (n + 1)
dp[0] = 1
for i in range(1, n+1):
if i in a:
continue
dp[i] = dp[i-1]
if i > 1:
dp[i] += dp[i-2]
print((dp[n] % 1000000007))
|
p03013
|
MOD = 1000000007
N = 100001
fibo = [1, 1] + [0] * N
for i in range(2, N):
fibo[i] = (fibo[i - 1] + fibo[i - 2]) % MOD
n, m = list(map(int, input().split(" ")))
a_list = [int(eval(input())) for _ in range(m)]
ngs = [i in a_list for i in range(n)]
ngs.append(False)
for i in range(n):
if ngs[i] and ngs[i + 1]:
print((0))
exit()
cnts = []
cnt = 0
for ng in ngs:
if ng:
cnts.append(cnt)
cnt = 0
continue
cnt += 1
cnts.append(cnt)
ans = 1
for c in cnts:
if c != 0:
ans *= fibo[c - 1]
# print(ngs)
# print(cnts)
print((ans % MOD))
|
MOD = 1000000007
N = 100001
fibo = [1, 1] + [0] * N
for i in range(2, N):
fibo[i] = (fibo[i - 1] + fibo[i - 2]) % MOD
n, m = list(map(int, input().split(" ")))
a_list = [int(eval(input())) for _ in range(m)]
is_ngs = [0] * (n + 2)
for a in a_list:
is_ngs[a] = 1
for i in range(n):
if is_ngs[i] and is_ngs[i + 1]:
print((0))
exit()
cnts = []
cnt = 0
for i in range(n + 1):
if is_ngs[i]:
cnts.append(cnt)
cnt = 0
continue
cnt += 1
cnts.append(cnt)
ans = 1
for c in cnts:
if c != 0:
ans *= fibo[c - 1]
# print(is_ngs)
# print(cnts)
print((ans % MOD))
|
p03013
|
MOD = 1000000007
n , m = list(map(int,input().split()))
count = [-1 for i in range(n+1)]
for i in range(m):
count[int(eval(input()))] = 0
for i in range(1,n+1):
if count[i] == 0:
continue
if i == 1:
count[i] = 1
elif i == 2:
count[i] = count[i-1] + 1
else:
count[i] = (count[i-1] + count[i-2]) % MOD
print((count[n]))
|
import sys
input = sys.stdin.readline
MOD = 1000000007
n , m = list(map(int,input().split()))
count = [-1] * (n+1)
for i in range(m):
count[int(eval(input()))] = 0
for i in range(1,n+1):
if count[i] == 0:
continue
if i == 1:
count[i] = 1
elif i == 2:
count[i] = count[i-1] + 1
else:
count[i] = (count[i-1] + count[i-2]) % MOD
print((count[n]))
|
p03013
|
MOD = 1000000007
def main():
n,m = list(map(int,input().split()))
al = [False for _ in range(n+1)]
for i in range(m):
a = int(eval(input()))
al[a] = True
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1 if al[1] == False else 0
for i in range(2,n+1):
if not al[i]:
dp[i] = dp[i-2] + dp[i-1]
print((dp[n] % MOD))
if __name__ == "__main__":
main()
|
MOD = 1000000007
def main():
n,m = list(map(int,input().split()))
al = [False for _ in range(n+1)]
for i in range(m):
a = int(eval(input()))
al[a] = True
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1 if al[1] == False else 0
for i in range(2,n+1):
if not al[i]:
dp[i] = (dp[i-2] + dp[i-1]) % MOD
print((dp[n]))
if __name__ == "__main__":
main()
|
p03013
|
# -*- coding: utf-8 -*-
import itertools as itr
N, M = list(map(int, input().split()))
a = [int(eval(input())) for x in range(M)]
def calc_routes(dan):
tmp = 1
for i in range(int(dan/2)):
i += 1
n = dan - i
tmp += len(list(itr.combinations(list(range(n)), i)))
return tmp
routes = 1
prev = 0
for x in a:
if x == prev:
routes = 0
break
else:
dan = (x-1) - prev
routes = (routes * calc_routes(dan)) % 1000000007
prev = x+1
routes = (routes * calc_routes(N-prev)) % 1000000007
print((int(routes)))
|
# -*- coding: utf-8 -*-
from math import factorial
N, M = list(map(int, input().split()))
a = [int(eval(input())) for x in range(M)]
def fibo(dan):
tmp = [1, 1]
for i in range(2, dan+1):
tmp.append(tmp[i-1] + tmp[i-2])
return tmp[dan]
routes = 1
prev = 0
for x in a:
if x == prev:
routes = 0
break
else:
dan = (x-1) - prev
routes = (routes * fibo(dan))
prev = x+1
routes = (routes * fibo(N-prev)) % 1000000007
print((int(routes)))
|
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]) % (10**9 + 7)
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
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]) % (10**9 + 7)
print((dp[n]))
|
p03013
|
MOD = 1000000007
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)] + [N + 2]
dp, id = [0, 1], 0
for i in range(N):
if A[id] - 1 == i:
id += 1
dp.append(0)
else:
dp.append(dp[-1] + dp[-2])
print((dp[-1] % MOD))
|
MOD = 1000000007
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)] + [N + 10]
dp, id = [0, 1], 0
for i in range(N):
if A[id] - 1 == i:
id += 1
dp.append(0)
else:
dp.append(dp[-1] + dp[-2])
print((dp[-1] % MOD))
|
p03013
|
#n段の上り方のバリエーションはフィボナッチ数列になっている
N, M = list(map(int,input().split()))
alist = list()
for _ in range(M):
alist.append(int(eval(input())))
li = {}
li[0] = 1
for i in range(1,N+1):
if i in alist:
li[i] = 0
else:
if i == 1:
li[i] = 1
else:
li[i] = ((li[i-1] + li[i-2])%(10**9+7))
print((li[N]%(10**9+7)))
|
N, M = list(map(int,input().split()))
alist = list()
for _ in range(M):
alist.append(int(eval(input())))
li = {}
li[0] = 1
for i in range(1,N+1):
if len(alist)>=1 and i == alist[0]:
li[i] = 0
alist.pop(0)
else:
if i == 1:
li[i] = 1
else:
li[i] = ((li[i-1] + li[i-2])%(10**9+7))
print((li[N]%(10**9+7)))
|
p03013
|
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
# input = sys.stdin.readline
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, pow(b, self.m-2, self.m))
def pow(self, a, b):
return pow(a, b, self.m)
m = Mod(10**9 + 7)
def slv(N, M, A):
dp = [0] * (N+10)
b = [False] * (N+10)
for a in A:
b[a] = True
dp[0] = 1
for i in range(N):
if not b[i+1]:
dp[i+1] = m.add(dp[i+1], dp[i])
if not b[i+2]:
dp[i+2] = m.add(dp[i+2], dp[i])
return dp[N]
def main():
N, M = read_int_n()
A = [read_int() for _ in range(M)]
print(slv(N, M, A))
if __name__ == '__main__':
main()
|
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(100000)
# input = sys.stdin.readline
def read_int():
return int(eval(input()))
def read_int_n():
return list(map(int, input().split()))
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b) % self.m
def slv(N, M, A):
m = Mod(10**9 + 7)
dp = [0] * (N+10)
b = [False] * (N+10)
for a in A:
b[a] = True
dp[0] = 1
for i in range(N):
if not b[i+1]:
dp[i+1] = m.add(dp[i+1], dp[i])
if not b[i+2]:
dp[i+2] = m.add(dp[i+2], dp[i])
return dp[N]
def main():
N, M = read_int_n()
A = [read_int() for _ in range(M)]
print((slv(N, M, A)))
if __name__ == '__main__':
main()
|
p03013
|
N, M = list(map(int, input().split()))
A = [True] * (N + 1)
for i in range(M):
a = int(eval(input()))
A[a] = False
dp = [0] * (N + 1)
dp[0] = 1
mod = 10 ** 9 + 7
for i in range(N):
for j in range(i + 1, min(N, i + 2) + 1):
if A[j]:
dp[j] += dp[i]
dp[j] %= mod
# print(dp)
print((dp[N]))
|
N, M = list(map(int, input().split()))
A = [True] * (N + 1)
for _ in range(M):
a = int(eval(input()))
A[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 A[j] is True:
dp[j] += dp[i]
dp[j] %= 10 ** 9 + 7
print((dp[N]))
|
p03013
|
import sys
n, m = list(map(int, input().split()))
aaa = set(map(int, sys.stdin))
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if 1 not in aaa else 0
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if i in aaa:
continue
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD
print((dp[n]))
|
import sys
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
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if i in aaa:
continue
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD
print((dp[n]))
|
p03013
|
N, M = list(map(int, input().split()))
broken = []
for _ in range(M):
broken.append(int(eval(input())))
mod = 10 ** 9 + 7
f2, f1 = 0, 1
for i in range(1, N + 1):
if i in broken:
if i - 1 in broken:
print((0))
exit()
f2 = f1
f1 = 0
continue
f = (f2 + f1) % mod
f2 = f1
f1 = f
print(f)
|
import sys
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
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if i in aaa:
continue
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD
print((dp[n]))
|
p03013
|
import math
import sys
n,m = list(map(int, input().split()))
a = [int(eval(input())) for i in range(m)]
def nCr(n, r):
c = math.factorial(n) // (math.factorial(n-r) * math.factorial(r))
return c
for i in range(m-1):
if a[i] + 1 == a[i+1]:
print('0')
sys.exit()
a.insert(0, -1)
a.append(n+1)
cnt = 1
for i in range(m+1):
step = (a[i+1] - 1) - (a[i] + 1)
pattern = 1
for j in range(1, step//2 + 1):
k = j
if j > (step - j) // 2:
k = step - 2*j
pattern += nCr(step - j, k)
cnt *= pattern
print((cnt%1000000007))
|
n,m = list(map(int, input().split()))
step = []
now = 0
for i in range(m):
next = int(eval(input())) - 1
step.append(next - now)
now = next + 2
step.append(n-now)
step.sort()
def fibo():
s = []
a = 1
b = 1
s.append(a)
s.append(b)
for i in range(n):
c = a+b
a = b
b = c
s.append(c)
return s
ans = 1
if step[0] < 0:
ans = 0
else:
f = fibo()
for i in step:
ans *= f[i]
print((ans % 1000000007))
|
p03013
|
# 再帰上限あげとく
import sys
sys.setrecursionlimit(10**6)
# 値入力
mod = 7+10**9
N,M = list(map(int, input().split()))
a = [0]*M
for i in range(M):
a[i] = int(eval(input()))
# メモ化フィボナッチ
# 参考:http://python-remrin.hatenadiary.jp/entry/2017/05/19/153228
fib_memo = {}
def fib(n):
if n < 3: return 1
if n not in fib_memo:
fib_memo[n] = fib(n-1) + fib(n-2)
return fib_memo[n]
now = 0 # 今いる場所と考える
count = 1
for i in a:
count *= fib(i-now)
count = count%mod
if now == i:
print((0))
quit()
now = i+1 # 穴を超えた次の段に移動する
# 最上段までを計算
count *= fib(N-now+1)
print((count%mod))
|
# 再帰上限あげとく
import sys
sys.setrecursionlimit(10**6)
# 値入力
mod = 7+10**9
N,M = list(map(int, input().split()))
a = [0]*M
for i in range(M):
a[i] = int(eval(input()))
# メモ化フィボナッチ
# 参考:http://python-remrin.hatenadiary.jp/entry/2017/05/19/153228
memo = [0]*(N+2)
def fibonacci(n):
if n < 3:
return 1
if memo[n] < 1:
memo[n] = fibonacci(n-1) + fibonacci(n-2)
return memo[n]
now = 0 # 今いる場所と考える
count = 1
for i in a:
count *= fibonacci(i-now)
count = count%mod
if now == i:
print((0))
quit()
now = i+1 # 穴を超えた次の段に移動する
# 最上段までを計算
count *= fibonacci(N-now+1)
print((count%mod))
|
p03013
|
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
a = [int(eval(input())) for _ in range(M)]
dp = [0 for _ in range(N + 1)]
dp[0] = 1
for now in range(N):
for next in range(now + 1, min(N + 1, now + 3)):
if next not in a:
dp[next] += dp[now]
dp[next] = dp[next] % MOD
print((dp[N]))
|
N, M = list(map(int, input().split()))
MOD = 10 ** 9 + 7
is_broken = [False for _ in range(N + 1)]
for _ in range(M):
a = int(eval(input()))
is_broken[a] = True
dp = [0 for _ in range(N + 1)]
dp[0] = 1
for i in range(1, N + 1):
if is_broken[i]:
continue
if i == 1:
dp[i] += dp[i - 1]
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()))
MOD = 10 ** 9 + 7
is_broken = [False for _ in range(N + 1)]
for _ in range(M):
a = int(eval(input()))
is_broken[a] = True
dp = [0 for _ in range(N + 1)]
dp[0] = 1
for i in range(1, N + 1):
if is_broken[i]:
continue
if i == 1:
dp[i] += dp[i - 1]
else:
dp[i] += dp[i - 1] + dp[i - 2]
dp[i] = dp[i] % MOD
print((dp[N]))
|
import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M = list(map(int, input().split()))
dp = [0] * (N + 1)
safe = [True] * (N + 1)
for _ in range(M):
a = int(eval(input()))
safe[a] = False
dp[0] = 1
for i in range(1, N + 1):
if i == 1 and safe[i]:
dp[i] = dp[i - 1]
else:
if safe[i]:
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= MOD
print((dp[-1]))
if __name__ == "__main__":
main()
|
p03013
|
n, m = [int(e) for e in input().split()]
a = set(int(eval(input())) for i in range(m))
t = [0] * (n + 2)
t[0] = 1
for i in range(n):
if i in a:
t[i] = 0
else:
t[i + 1] = (t[i + 1] + t[i]) % 1000000007
t[i + 2] = (t[i + 2] + t[i]) % 1000000007
print((t[n]))
|
# DP(動的計画法)
N, M = list(map(int, input().split()))
A = set(int(eval(input())) for _ in range(M))
m = 1000000007
t = [0] * (N + 2)
t[0] = 1
for i in range(N):
if i in A:
t[i] = 0
else:
t[i + 1] = (t[i + 1] + t[i]) % m
t[i + 2] = (t[i + 2] + t[i]) % m
print((t[N]))
|
p03013
|
#!/home/ryo/.pyenv/versions/anaconda3-2019.03/envs/hoge/bin/python
import sys
lim=10**9+7
N,M = list(map(int,input().split()))
A=[]
for i in range(0,M):
A.append(int(eval(input())))
memo = [0] * (N+1)
memo[0]=1
for i in range(0,M-1):
if A[i+1] - A[i] == 1:
print((0))
sys.exit()
if not 1 in A:
memo[1]=1
for i in range(2, N+1):
if not i in A:
memo[i] = (memo[i - 1] + memo[i - 2]) % lim
print((memo[-1]))
|
#!/home/ryo/.pyenv/versions/anaconda3-2019.03/envs/hoge/bin/python
import sys
lim=10**9+7
N,M = list(map(int,input().split()))
A = set([int(eval(input())) for _ in range(M)])
memo = [0] * (N+1)
memo[0]=1
if not 1 in A:
memo[1]=1
for i in range(2, N+1):
if not i in A:
memo[i] = (memo[i - 1] + memo[i - 2]) % lim
print((memo[-1]))
|
p03013
|
N,M=list(map(int,input().split()))
num=[0]*(N+1)
num[0]=1
num[1]=1
A=[]
for i in range(M):
A.append(int(eval(input())))
P=10**9+7
if 1 in A:
num[1]=0
if N>=2:
for i in range(2,N+1):
num[i]=(num[i-1]+num[i-2])%P
if i in A:
num[i]=0
print((num[N]))
|
N,M=list(map(int,input().split()))
num=[0]*(N+1)
num[0]=1
num[1]=1
A=[]
for i in range(M):
A.append(int(eval(input())))
P=10**9+7
index=0
if 1 in A:
num[1]=0
index+=1
if N>=2:
for i in range(2,N+1):
num[i]=(num[i-1]+num[i-2])%P
if index<=M-1 and i==A[index]:
num[i]=0
index+=1
print((num[N]))
|
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])%(10**9+7)
print((dp[n]))
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for i 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:
dp[i]=(dp[i-1]+dp[i-2])%(10**9+7)
print((dp[n]))
|
p03013
|
mod = pow(10,9)+7
N,M = list(map(int,input().split()))
A = [int(eval(input())) for i in range(M)]+[mod]
DP = [1]
for i in range(1,N+1):
if i==A[0]:
DP.append(0)
A = A[1:]
else:
a = DP[i-1]
b = DP[i-2] if i>1 else 0
DP.append(a+b)
print((DP[N]%mod))
|
mod = pow(10,9)+7
N,M = list(map(int,input().split()))
A = [int(eval(input())) for i in range(M)]+[mod]
DP = [1]
k = 0
for i in range(1,N+1):
if i==A[k]:
DP.append(0)
k+=1
else:
a = DP[i-1]
b = DP[i-2] if i>1 else 0
DP.append((a+b)%mod)
print((DP[N]%mod))
|
p03013
|
n, m = list(map(int, input().split()))
broken = [int(eval(input())) for _ in range(m)]
ways = [0] * (n+1)
ways[0] = 1
keep = 1
noway = False
for i in range(1, n+1):
if i in broken:
if i-1 in broken:
noway = True
break
ways[i] = ways[i-1]
keep = 0
else:
if keep == 2:
ways[i] = ways[i-1] + ways[i-2]
else:
ways[i] = ways[i-1]
keep += 1
print((ways[-1] % 1000000007 if not noway else 0))
|
n, m = list(map(int, input().split()))
broken = [int(eval(input())) for _ in range(m)]
ways = [1] * (n+1)
for i in broken:
ways[i] = 0
keep = 1
for i in range(1, n+1):
if ways[i]:
if keep == 2:
ways[i] = ways[i-1] + ways[i-2]
elif keep == 1:
ways[i] = ways[i-1]
keep += 1
else:
ways[i] = ways[i-2]
keep += 1
else:
keep = 0
print((ways[-1] % 1000000007))
|
p03013
|
def main(N, M, a):
dp = [0] * (N+1)
dp[0] = 1
dp[1] = 1 if 1 not in a else 0
for i in range(2, len(dp)):
dp[i] = dp[i-1] + dp[i-2] if i not in a else 0
return dp[-1] % (10**9+7)
N, M = list(map(int, input().split()))
a = list(int(eval(input())) for _ in range(M))
print((main(N,M,a)))
|
def main(N, M, a):
dp = [-1] * (N+1)
dp[0] = 1
dp[1] = 1
for i in a :
dp[i] = 0
for i in range(2, len(dp)):
dp[i] = dp[i-1] + dp[i-2] if dp[i] != 0 else 0
return dp[-1] % (10**9+7)
N, M = list(map(int, input().split()))
a = list(int(eval(input())) for _ in range(M))
print((main(N,M,a)))
|
p03013
|
def main():
n, m = list(map(int, input().split()))
dp = [0] * (n + 1)
dp[0] = 1
for _ in range(m):
a = int(eval(input()))
dp[a] = -1
mod = 10 ** 9 + 7
for i in range(n + 1):
if dp[i] != -1:
if i + 1 <= n and dp[i + 1] != -1:
dp[i + 1] = (dp[i + 1] + dp[i]) % mod
if i + 2 <= n and dp[i + 2] != -1:
dp[i + 2] = (dp[i + 2] + dp[i]) % mod
print((dp[-1] % mod))
if __name__ == "__main__":
main()
|
def main():
n, m = list(map(int, input().split()))
dp = [0] * (n + 1)
dp[0] = 1
for _ in range(m):
a = int(eval(input()))
dp[a] = -1
mod = 10 ** 9 + 7
for i in range(n + 1):
if dp[i] == 0:
if i - 1 >= 0 and dp[i - 1] != -1:
dp[i] = (dp[i] + dp[i - 1]) % mod
if i - 2 >= 0 and dp[i - 2] != -1:
dp[i] = (dp[i] + dp[i - 2]) % mod
print((dp[-1] % mod))
if __name__ == "__main__":
main()
|
p03013
|
from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
def main(N, M, a_list):
div = 10**9 + 7
@lru_cache(maxsize=None)
def fib(n):
if n in a_list:
return 0
else:
if n == -1:
return 0
elif n == 0 or n == 1:
return 1
else:
return fib(n-1) % div + fib(n-2) % div
print((fib(N) % div ))
if __name__ == "__main__":
N, M = [int(x) for x in input().split()]
a_list = []
for _ in range(M):
a_list.append(int(eval(input())))
main(N, M, a_list)
|
from functools import lru_cache
import sys
sys.setrecursionlimit(10**6)
def main(N, M, a_list):
div = 10**9 + 7
@lru_cache(maxsize=None)
def fib(n):
if n in a_list:
return 0
else:
if n == -1:
return 0
elif n == 0 or n == 1:
return 1
else:
return fib(n-2) % div + fib(n-1) % div
print((fib(N) % div ))
if __name__ == "__main__":
N, M = [int(x) for x in input().split()]
a_list = []
for _ in range(M):
a_list.append(int(eval(input())))
main(N, M, a_list)
|
p03013
|
def main(N, M, a_list):
div = 10**9 + 7
dp = {}
dp[0] = 1
if 1 in a_list:
dp[1] = 0
else:
dp[1] = 1
for i in range(N):
if i+2 in a_list:
dp[i+2] = 0
else:
dp[i+2] = (dp[i+1] + dp[i])
print((dp[N] % div))
if __name__ == "__main__":
N, M = [int(x) for x in input().split()]
a_list = []
for _ in range(M):
a_list.append(int(eval(input())))
main(N, M, a_list)
|
def main(N, M, a_list):
div = 10**9 + 7
a_set = set(a_list)
dp = {}
dp[0] = 1
if 1 in a_set:
dp[1] = 0
else:
dp[1] = 1
for i in range(N):
if i+2 in a_set:
dp[i+2] = 0
else:
dp[i+2] = (dp[i+1] + dp[i])
print((dp[N] % div))
if __name__ == "__main__":
N, M = [int(x) for x in input().split()]
a_list = []
for _ in range(M):
a_list.append(int(eval(input())))
main(N, M, a_list)
|
p03013
|
N,M=[int(i) for i in input().split()]
inf=1000000007
aa=[]
for i in range(M):
aa.append(int(eval(input())))
dp=[0]*(N+1)
dp[0]=1
if 1 in aa:
dp[1]=0
else:
dp[1]=1
for i in range(2,N+1):
if i in aa:
dp[i]=0
else:
dp[i]=dp[i-2]%inf+dp[i-1]%inf
print((dp[N]%inf))
|
N,M=[int(i) for i in input().split()]
inf=1000000007
dp=[-1]*(N+1)
for i in range(M):
dp[int(eval(input()))]=0
dp[0]=1
if dp[1]==-1:
dp[1]=1
for i in range(2,N+1):
if dp[i]==0:
continue
else:
dp[i]=(dp[i-2]+dp[i-1])%inf
print((dp[N]%inf))
|
p03013
|
N, M = list(map(int, input().split()))
a = [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
for i in range(2, N + 1):
if i in a:
continue
else:
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= 1000000007
print((dp[-1]))
|
N, M = list(map(int, input().split()))
# a = [int(input()) for _ in range(M)]
a = set([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
for i in range(2, N + 1):
if i in a:
continue
else:
dp[i] = dp[i - 1] + dp[i - 2]
dp[i] %= 1000000007
print((dp[-1]))
|
p03013
|
import math
n, m = list(map(int, input().split()))
now_step = 0
checked_steps = {}
factorial_dict = {}
divide_num = 1000000007
def count_steps(number):
global checked_steps
global factorial_dict
if(number in list(checked_steps.keys())):
return checked_steps[number]
# count=1*a+2*bとなるような、0以上の全てのa,bについて、1をa個、2をb個並べる並べ方を返す.
# [1,(a+b)]からa個を選ぶ選び方と同じ
# 余り残は和・積に関して分割法則が成り立つので1,000,000,007 で割ってもいい
counter = 0
for i in range(0, number + 1, 2):
a = number - i
b = i // 2
if((a+b) not in factorial_dict):
factorial_dict[a+b] = math.factorial(a+b)
if(a not in factorial_dict):
factorial_dict[a] = math.factorial(a)
if(b not in factorial_dict):
factorial_dict[b] = math.factorial(b)
counter += factorial_dict[a+b] // (factorial_dict[a] * factorial_dict[b])
checked_steps[number] = counter % divide_num
return checked_steps[number]
all_count = 1
for i in range(m):
a = int(eval(input()))
all_count = (all_count * count_steps(a - 1 - now_step)) % divide_num
now_step = a + 1
all_count = (all_count * count_steps(n - now_step)) % divide_num
print((all_count % divide_num))
|
n, m = list(map(int, input().split()))
now_step = 0
# count=1*a+2*bとなるような、0以上の全てのa,bについて、1をa個、2をb個並べる並べ方を返す.
# [1,(a+b)]からa個を選ぶ選び方と同じ
# ただし、これはnumber-1とnumber-2が分かっている場合は、number-1から1つ、あるいはnumber-2から二つ進む進み方の和で表せる
# よって、counte_steps(number) = count_steps(number-1) + count_steps(number-2)
# 初期値はcount_steps(1) = 1, count_steps(2) = 2,count_steps(0) = 1
checked_steps = {-1:0, 0:1, 1:1}
divide_num = 1000000007
for i in range(2, n+1):
checked_steps[i] = (checked_steps[i-1] + checked_steps[i-2]) % divide_num
all_count = 1
for i in range(m):
a = int(eval(input()))
if(a < now_step):
continue
all_count = (all_count * checked_steps[a - 1 - now_step]) % divide_num
now_step = a + 1
all_count = (all_count * checked_steps[n - now_step]) % divide_num
print(all_count)
|
p03013
|
n,m=list(map(int,input().split()))
a=[]
for i in range(m):
a.append(int(eval(input())))
b=[0 for x in range(n+1)]
b[0]=1
for i in range(1,n+1):
if i in a:
continue
x=b[i-1]
if i>1:x+=b[i-2]
b[i]=x
print((b[n]%(10**9+7)))
|
n,m=list(map(int,input().split()))
a=[]
a = set(int(eval(input())) for _ in range(m))
#for i in range(m):
# a.append(int(input()))
b=[0 for x in range(n+1)]
b[0]=1
for i in range(1,n+1):
if i in a:
continue
x=b[i-1]
if i>1:x+=b[i-2]
b[i]=x
print((b[n]%(10**9+7)))
|
p03013
|
n,m=list(map(int,input().split()))
a = set(int(eval(input())) for i in range(m))
#for i in range(m):
# a.append(int(input()))
b=[0 for x in range(n+1)]
b[0]=1
for i in range(1,n+1):
if i in a:
continue
x=b[i-1]
if i>1:x+=b[i-2]
b[i]=x
print((b[n]%(10**9+7)))
|
n,m=list(map(int,input().split()))
a = set(int(eval(input())) for i in range(m))
#for i in range(m):
# a.append(int(input()))
b=[0 for x in range(n+1)]
b[0]=1
for i in range(1,n+1):
if i in a:
continue
x=b[i-1]
if i>1:x+=b[i-2]
b[i]=x%(10**9+7)
print((b[n]))
|
p03013
|
n, m = [int(i) for i in input().split()]
a = []
for _ in range(m):
a.append(int(eval(input())))
ways = [0] * 3
ways[1] = 0 if 1 in a else 1
ways[2] = 0 if 2 in a else ways[1] + 1
for i in range(3, n+1):
if i in a:
ways.append(0)
else:
ways.append((ways[-2]+ways[-1])%(10**9+7))
print((ways[n]))
|
n, m = [int(i) for i in input().split()]
a = []
broken = [False] * max(n+1, 3)
for _ in range(m):
i = int(eval(input()))
a.append(i)
broken[i] = True
ways = [0] * 3
ways[1] = 0 if broken[1] else 1
ways[2] = 0 if broken[2] else ways[1] + 1
for i in range(3, n+1):
if broken[i]:
ways.append(0)
else:
ways.append((ways[-2]+ways[-1])%(10**9+7))
print((ways[n]))
|
p03013
|
import sys
sys.setrecursionlimit(10**6)
from functools import lru_cache
n,m=list(map(int,input().split()))
A = [int(eval(input())) for i in range(m)]
mod = 10**9+7
memo={}
memo[1]=1
memo[0]=1
@lru_cache(maxsize=10000000)
def fib(n):
if n in A:
memo[n]=0
return 0
if n not in memo:
memo[n] = fib(n-1) + fib(n-2)
return memo[n]
print((fib(n)%mod))
|
n,m=list(map(int,input().split()))
A = [int(eval(input())) for i in range(m)]
ls =[-1]*(n+1)
ls[0]=ls[1]=1
mod = 10**9+7
for a in A:
ls[a]= 0
for i in range(2,n+1):
if ls[i]==-1:
ls[i]= ls[i-1]+ls[i-2]
print((ls[-1]%mod))
|
p03013
|
n,m = list(map(int,input().split()))
list1 = []
for i in range(m):
list1.append(int(eval(input())))
dp = [0]*(n+1)
dp[0] = 1
if not 1 in list1:
dp[1] = 1 #i+2まで考えるため、初期設定はi = 1まで必要
for i in range(n-1):
if i not in list1:
dp[i+2] += dp[i]
if i+1 not in list1:
dp[i+2] += dp[i+1]
print((dp[n]%1000000007))
|
n,m = list(map(int,input().split()))
dp = [0]*(n+1)
dp[0] = 1
for i in range(m):
dp[int(eval(input()))] = -1
if dp[1] != -1:
dp[1] = 1
for i in range(n-1):
if dp[i+2] != -1:
if dp[i+1] != -1:
dp[i+2] += dp[i+1]
if dp[i] != -1:
dp[i+2] += dp[i]
print((dp[n]%1000000007))
|
p03013
|
N, M = list(map(int, input().split()))
S = [True]*(N+1)
for _ in range(M):
a = eval(input())
S[a] = False
T = [0]*(N+1)
T[0] = 1
T[1] = 1 if S[1] else 0
for i in range(2, N+1):
if S[i]:
T[i] = (T[i-1]+T[i-2])%1000000007
print(T[N])
|
N, M = list(map(int, input().split()))
S = [True]*(N+1)
for _ in range(M):
a = int(eval(input()))
S[a] = False
T = [0]*(N+1)
T[0] = 1
T[1] = 1 if S[1] else 0
for i in range(2, N+1):
if S[i]:
T[i] = (T[i-1]+T[i-2])%1000000007
print((T[N]))
|
p03013
|
#
import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop
def main():
MOD = 1000000007
N, M = list(map(int, input().split()))
A = set()
for _ in range(M):
a = int(eval(input()))
A.add(a)
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i not in A:
if i == 1:
dp[i] = dp[i - 1]
else:
dp[i] = dp[i - 1] + dp[i - 2]
# print(dp)
print((dp[N] % MOD))
if __name__ == '__main__':
main()
|
#
import itertools
from collections import Counter
from collections import defaultdict
import bisect
from heapq import heappush, heappop
def main():
MOD = 1000000007
N, M = list(map(int, input().split()))
A = set()
for _ in range(M):
a = int(eval(input()))
A.add(a)
dp = [0] * (N + 1)
dp[0] = 1
for i in range(1, N + 1):
if i not in A:
if i == 1:
dp[i] = dp[i - 1]
else:
dp[i] = dp[i - 1] + dp[i - 2]
# print(dp)
ans = dp[N] % MOD
print(ans)
if __name__ == '__main__':
main()
|
p03013
|
import sys
input = sys.stdin.readline
def isSafe(position):
return not position in listM
STEP = 2
N,M = list(map(int,input().split()))
dp = [0] * (N+1)
cnt = 0
listM=[int(eval(input())) for i in range(M)]
dp[0] = 1
for i in range(N):
if i+1 > N:
break
if isSafe(i+1):
dp[i+1] += dp[i]
if i+2 > N:
break
if isSafe(i+2):
dp[i+2] += dp[i]
#dp[j] = 0
#print(dp)
print((dp[N] % 1000000007))
|
import sys
input = sys.stdin.readline
def isSafe(position):
return not position in listM
STEP = 2
N,M = list(map(int,input().split()))
dp = [0] * (N+1)
cnt = 0
listM={int(eval(input())) for i in range(M)}
dp[0] = 1
for i in range(N):
if i+1 > N:
break
if isSafe(i+1):
dp[i+1] += dp[i]
if i+2 > N:
break
if isSafe(i+2):
dp[i+2] += dp[i]
#dp[j] = 0
#print(dp)
print((dp[N] % 1000000007))
|
p03013
|
N, M = list(map(int, input().split()))
dp = [0] * N
for _ in range(M):
a = int(eval(input()))
dp[a-1] = -1
k = 1000000007
for i in range(N):
if dp[i] == -1:
dp[i] = 0
continue
if i == 0:
dp[i] = 1
continue
if i == 1:
dp[i] = dp[i-1] + 1
continue
dp[i] = dp[i-1] + dp[i-2]
n = dp[-1] % k
print(n)
|
N, M = list(map(int, input().split()))
dp = [0] * N
for _ in range(M):
a = int(eval(input()))
dp[a-1] = -1
k = 1000000007
for i in range(N):
if dp[i] == -1:
dp[i] = 0
continue
if i == 0:
dp[i] = 1
continue
if i == 1:
dp[i] = dp[i-1] + 1
continue
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= k
print((dp[-1]))
|
p03013
|
n,m=list(map(int,input().split()))
mod=10**9+7
t=[int(eval(input())) for i in range(m)]
dp=[-1]*(n+1)
dp[0]=1
dp[1]=1
for i in range(m):
dp[t[i]]=0
for i in range(2,n+1):
if dp[i]==-1:
dp[i]=dp[i-1]+dp[i-2]
print((dp[-1]%mod))
|
n,m=list(map(int,input().split()))
mod=10**9+7
t=[int(eval(input())) for i in range(m)]
dp=[-1]*(n+1)
dp[0]=1 #0が１なのは２段目の回答を合わせるためdp[０]＝０、dp[1]=0,ds[2]=1
#は入力が1,0のきエラーになるので、だめ
dp[1]=1
for i in range(m):
dp[t[i]]=0#ここはそもそもいけないので０になる
for i in range(2,n+1):
if dp[i]==-1:
dp[i]=dp[i-1]+dp[i-2]#このばしょにくるほうほうは二個前からくるか一個前からくるか、そこのあたいをたっせばいい
print((dp[-1]%mod))
|
p03013
|
n,m = list(map(int,input().split()))
brokensteps = [int(eval(input())) for x in range(m)]
dp = [0] * (n+1)
for i in range(n+1):
if i in brokensteps:
dp[i] = 0
continue
elif i <= 1:
dp[i] = 1
else:
dp[i] = (dp[i-1]%(10**9+7) + dp[i-2]%(10**9+7))%(10**9+7)
print((dp[n]))
|
n,m = list(map(int,input().split()))
brokensteps = set([int(eval(input())) for x in range(m)])
dp = [0] * (n+1)
for i in range(n+1):
if i in brokensteps:
dp[i] = 0
continue
elif i <= 1:
dp[i] = 1
else:
dp[i] = (dp[i-1] + dp[i-2])%(10**9+7)
print((dp[n]))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)] + [0]
mod = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
b = a[0]
j = 1
for i in range(1, n + 1):
if i == b:
b = a[j]
j += 1
else:
tmp = dp[i - 2] + dp[i - 1]
if tmp >= mod:
tmp -= mod
dp[i] = tmp
print((int(dp[-1])))
|
import sys
input = sys.stdin.buffer.readline
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)] + [0]
mod = 10 ** 9 + 7
dp = [0] * (n + 1)
dp[0] = 1
b = a[0]
j = 1
for i in range(1, n + 1):
if i == b:
b = a[j]
j += 1
else:
tmp = dp[i - 2] + dp[i - 1]
if tmp >= mod:
tmp -= mod
dp[i] = tmp
print((int(dp[-1])))
|
p03013
|
import sys
sys.setrecursionlimit(10 ** 5 + 10)
mod = 10 ** 9 + 7
# フィボナッチ数列
fib_memo = {}
def fib(N):
if N < 2: return 1
if N not in fib_memo:
fib_memo[N] = fib(N-1) + fib(N-2)
return fib_memo[N]
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
tmp_list = [0] * (M+1)
now_kaidan = 0
for i in range(M):
tmp_list[i] = (A[i] - 1) - now_kaidan
now_kaidan = A[i] + 1
tmp_list[-1] = N-now_kaidan
ans = 1
for v in tmp_list:
if v == -1: # 壊れた階段が連続している時は0移動方法がない
print((0))
exit()
ans *= fib(v)
ans %= mod
print((ans%mod))
|
# DP
mod = 10 ** 9 + 7
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
if N == 1:
print((1))
exit()
if N == 2:
if M == 0:
print((2))
if M == 1:
print((1))
exit()
safe = [True] * (N+1)
for i in range(M):
safe[A[i]] = False
dp = [0] * (N+1)
dp[0] = 0
dp[1] = 1
dp[2] = 2
if 1 in A:
dp[1] = 0
dp[2] = 1
if 2 in A:
dp[2] = 0
for i in range(3, N+1):
if safe[i]:
dp[i] = dp[i-1] + dp[i-2]
##print(dp)
print(((dp[N]+mod)%mod))
|
p03013
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
broken = set()
for i in range(m):
a = int(eval(input()))
broken.add(a)
pattern = [0]*(n+1)
pattern[0] = 1
if 1 in broken:
pattern[1] = 0
else:
pattern[1] = 1
for i in range(2, n+1):
if i in broken:
pattern[i] = 0
else:
pattern[i] = pattern[i-1] + pattern[i-2]
print((pattern[n] % (10**9+7)))
|
import sys
input = sys.stdin.readline
mod = 10**9+7
n, m = list(map(int, input().split()))
broken = set(int(eval(input())) for i in range(m))
pattern = [0]*(n+1)
pattern[0] = 1
if 1 in broken:
pattern[1] = 0
else:
pattern[1] = 1
for i in range(2, n+1):
if i in broken:
continue
else:
pattern[i] = (pattern[i-1] + pattern[i-2]) % mod
print((pattern[n]))
|
p03013
|
#d=["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
#import numpy as np
#n=int(input())
#import fractions
#import math
#lis=list(input().split())
#lis=list(map(float,input().split()))
#n=int(input())
#S=input()
import itertools
lis=list(map(int,input().split()))
alist=[-1]
ans=1
for i in range(lis[1]):
alist.append(int(eval(input())))
alist.append(lis[0]+1)
for i in range(lis[1]+1):
l=alist[i+1]-alist[i]-2
tmp=0
t=int((l+l%2)/2)
h=int((l-l%2)/2)
for j in range(h+1):
tmp+=len(list(itertools.combinations(list(range(t+j)),h-j)))%((10**9)+7)
ans=(ans*tmp)%((10**9)+7)
print(ans)
|
lis=list(map(int,input().split()))
alist=[]
for i in range(lis[1]):
alist.append(int(eval(input())))
steps=[0]*(lis[0]+2)
steps[1]=1
for i in range(2,lis[0]+2):
if i-1 not in alist:
steps[i]=(steps[i-1]+steps[i-2])%((10**9)+7)
ans=steps[-1]
print(ans)
|
p03013
|
lis=list(map(int,input().split()))
alist=list([int(eval(input())) for _ in range(lis[1])])
steps=[0]*(lis[0]+2)
steps[1]=1
for i in range(2,lis[0]+2):
if i-1 not in alist:
steps[i]=(steps[i-1]+steps[i-2])
ans=steps[-1]%((10**9)+7)
print(ans)
|
lis=list(map(int,input().split()))
alist=[0]*(lis[0]+1)
for i in range(lis[1]):
a=int(eval(input()))
alist[a]=1
steps=[0]*(lis[0]+2)
steps[1]=1
mod=(10**9)+7
for i in range(2,lis[0]+2):
if alist[i-1]==0:
steps[i]=(steps[i-1]+steps[i-2])%mod
ans=steps[-1]
print(ans)
|
p03013
|
n,m=list(map(int,input().split()))
lst=[int(eval(input())) for i in range(m)]
DP=[0]*(n+1)
temp=0
DP[0]=1
for i in range(1, n+1):
if i==1 and i not in lst:
DP[i]=1
elif i==1 and i in lst:
DP[i]=0
elif i in lst:
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()))
br=set([int(eval(input())) for _ in range(M)])
dp=[0]*(N+1)
dp[0]=1
if not 1 in br:
dp[1]=1
for i in range(2,N+1):
if not i in br:
dp[i]+=(dp[i-1]+dp[i-2])%1000000007
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
mod = 10**9+7
facs = [1] * (n-m+1)
invs = [1] * (n-m+1)
nfac = 1
for i in range(1, n-m+1):
nfac = nfac * i % mod
facs[i] = nfac
invs[i] = pow(facs[i], mod-2, mod)
ans = 1
start = 0
def steps(start, end):
t = end - start
pat = 0
for j in range(t//2+1):
pat += (facs[t-j] * invs[j] * invs[t-j-j]) % mod
return pat%mod
for i in range(m):
a = int(eval(input()))
end = a-1
if start == end+1:
print((0))
break
# startからendまで行く方法
ans *= steps(start, end)
ans %= mod
start = a+1
else:
ans *= steps(start, n)
ans %= mod
print(ans)
|
n, m = list(map(int, input().split()))
mod = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
dp[1] = 1
seta = set([int(eval(input())) for _ in range(m)])
for i in range(2, n+1):
if not i-1 in seta:
dp[i] += dp[i-1]
if not i-2 in seta:
dp[i] += dp[i-2]
dp[i] %= mod
print((dp[-1]))
|
p03013
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
#TLEの対策.配列ではなく変数を使う.
p,q=0,1
for i in range(1,n+1):
#最新のp,q以前の値は捨てて良い.つまり配列を使用する必要なし.
p,q=q,(p+q)%(10**9+7)*(not i in a) #n*Trueは1, n*Falseは0を表す.
print(q)
|
n,m=list(map(int,input().split()))
#TLEの対策1. a in listと比べて a in setはめちゃんこ速い!!
a=set([int(eval(input())) for _ in range(m)])
#TLEの対策2.配列ではなく変数を使う(対策1と比べると対して効果なし).
p,q=0,1
for i in range(1,n+1):
#最新のp,q以前の値は捨てて良い.つまり配列を使用する必要なし.
p,q=q,(p+q)%(10**9+7)*(not i in a) #n*Trueは1, n*Falseは0を表す.
print(q)
|
p03013
|
n,m=list(map(int,input().split()))
#TLEの対策1. a in listと比べて a in setはめちゃんこ速い!!
a=set([int(eval(input())) for _ in range(m)])
#TLEの対策2.配列ではなく変数を使う(対策1と比べると対して効果なし).
p,q=0,1
for i in range(1,n+1):
#最新のp,q以前の値は捨てて良い.つまり配列を使用する必要なし.
p,q=q,(p+q)%(10**9+7)*(not i in a) #n*Trueは1, n*Falseは0を表す.
print(q)
|
n, m = list(map(int, input().split()))
A = set([int(eval(input())) for _ in range(m)])
p, q = 0, 1
mod = 10 **9 + 7
for i in range(1, n+1):
p, q = q, ((p+q)%mod)*(i not in A)
print(q)
|
p03013
|
n, m = [int(x) for x in input().split()]
a = [int(eval(input())) for x in range(m)]
_MOD = 1000000007
dp = [0] * (n + 1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(1,n):
if (i + 1) in a:
dp[i + 1] = 0
else:
dp[i + 1] = (dp[i] + dp[i - 1]) % _MOD
print((dp[n]))
|
n, m = [int(x) for x in input().split()]
#a = [int(input()) for x in range(m)]
a = set(int(eval(input())) for x in range(m))
_MOD = 1000000007
dp = [0] * (n + 1)
dp[0] = 1
if 1 in a:
dp[1] = 0
else:
dp[1] = 1
for i in range(1,n):
if (i + 1) in a:
dp[i + 1] = 0
else:
dp[i + 1] = (dp[i] + dp[i - 1]) % _MOD
print((dp[n]))
|
p03013
|
import sys
n, m = list(map(int, sys.stdin.readline().split()))
A = [int(sys.stdin.readline()) for _ in range(m)]
dp = [0 for i in range(n+1)]
dp[0] =1
#print(dp)
for i in range(1, n+1):
if i in A:
continue
if i-2>=0:
dp[i] = dp[i-1] + dp[i-2]
else:
dp[i] = dp[i-1]
print((dp[-1]%1000000007))
|
import sys
n, m = list(map(int, sys.stdin.readline().split()))
A = [int(sys.stdin.readline()) for _ in range(m)]
bloken = [0 for i in range(n+1)]
for a in A:
bloken[a]=1
dp = [0 for i in range(n+1)]
dp[0] =1
#print(dp)
for i in range(1, n+1):
if bloken[i]==1:
continue
if i-2>=0:
dp[i] = dp[i-1] + dp[i-2]
else:
dp[i] = dp[i-1]
print((dp[-1]%1000000007))
|
p03013
|
n,m = list(map(int,input().split()))
ais = []
for _ in range(m):
ai = int(eval(input()))
ais.append(ai)
dp = [0]*(n+1)
dp[0]=1
if 1 in ais:
dp[1]=0
else:
dp[1]=1
for i in range(2,n+1):
if i in ais:
dp[i] = 0
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%1000000007))
|
n,m = list(map(int,input().split()))
ais = []
for _ in range(m):
ai = int(eval(input()))
ais.append(ai)
dp = [0]*(n+1)
dp[0]=1
if len(ais)>0 and ais[0]==1:
dp[1]=0
ais.pop(0)
else:
dp[1]=1
for i in range(2,n+1):
if len(ais)>0 and ais[0]==i:
dp[i] = 0
ais.pop(0)
else:
dp[i] = dp[i-1] + dp[i-2]
print((dp[n]%1000000007))
|
p03013
|
import sys
n,m=list(map(int,input().split()))
arr=[1,2]
arr=arr+[0]*(n-2)
danger=list(map(int,sys.stdin))
danger.append(0)
if 1 in danger:
arr[0]=0
arr[1]=1
for i in range(n):
if i+1 in danger:
arr[i]=0
elif i==0 or i==1:
continue
else:
arr[i]=(arr[i-1]+arr[i-2])%(10**9+7)
print((arr[n-1]%(10**9+7)))
|
import sys
n,m=list(map(int,input().split()))
arr=[1,2]
arr=arr+[0]*(n-2)
danger=list(map(int,sys.stdin))
danger.append(0)
m=0
if 1 == danger[0]:
arr[0]=0
arr[1]=1
m=1
for i in range(n):
if i+1 == danger[m]:
arr[i]=0
m+=1
elif i==0 or i==1:
continue
else:
arr[i]=(arr[i-1]+arr[i-2])%(10**9+7)
print((arr[n-1]%(10**9+7)))
|
p03013
|
n,m = list(map(int,input().split()))
ab = []
for _ in range(m):
a=int(eval(input()))
ab.append(a)
dp = [0]*(n+1)
dp[0] = 1
for i in range(1, n+1):
dp[i] = (dp[i-1] + dp[i-2])%1000000007
if i in ab:
dp[i] = 0
print((dp[-1]))
|
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
|
from collections import deque
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
tmp = [0 for _ in range(N + 1)]
if 1 not in A:
tmp[1] = 1
if 2 not in A and N >= 2:
tmp[2] = tmp[1] + 1
for i in range(3, N+1):
if i not in A:
tmp[i] = tmp[i-1] + tmp[i-2]
print((tmp[-1]%(10**9+7)))
|
from collections import deque
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
tmp = [0 for _ in range(N + 1)]
now = 0
if 1 not in A:
tmp[1] = 1
else:
now += 1
if (2 not in A) and N >= 2:
tmp[2] = tmp[1] + 1
else:
now += 1
for i in range(3, N+1):
try:
if i != A[now]:
tmp[i] = tmp[i-1] + tmp[i-2]
else:
now += 1
except:
tmp[i] = tmp[i-1] + tmp[i-2]
print((tmp[-1]%(10**9+7)))
|
p03013
|
# C - Typical Stairs
N,M = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(M)]
A = set(A)
# dp[i]: i 段目まで来た時の移動方法の総数
dp = [0]*(N+1)
# 初期条件
dp[0] = 1
for v in range(1,N+1):
if v in A:
continue
dp[v] = (dp[v] + dp[v-1])%(1000000007)
if v > 1:
dp[v] = (dp[v] + dp[v-2])%(1000000007)
print((dp[N]))
|
#96 C - Typical Stairs
N,M = list(map(int,input().split()))
A = [int(eval(input())) for _ in range(M)]
A = set(A)
MOD = 1000000007
dp = [0]*(N+1)
dp[0] = 1
for i in range(1,N+1):
if i in A:
continue
dp[i] = (dp[i-1] + dp[i-2])%MOD
print((dp[N]))
|
p03013
|
import math
N,M = list(map(int,input().split(' ')))
An = [ int(eval(input())) for _ in range(M)]
'''
factorial_list = [1] * (N+1)
for i in range(1,N+1):
factorial_list[i] = factorial_list[i-1] * i
def combinations_count(n, r):
return factorial_list[n] // (factorial_list[n - r] * factorial_list[r])
'''
def nCk(n, k):
ret = 1
mo = 10**9 + 7
for i in range(k):
ret = ret * (n - i) * pow(i + 1, mo - 2, mo) % mo
return ret
def one_two_comb(N):
two_n = N//2
comb_list = []
for i in range(1,two_n+1):
comb_list.append([N-i,i])
return comb_list
def sum_comb(comb_list):
comb_sum = 0
for val in comb_list:
comb_sum += nCk(val[0],val[1])
return comb_sum
diff_list = []
current_num = 0
max_diff = -1
for a in An:
diff = a - current_num
if diff == 0:
print((0))
exit(0)
diff_list.append(diff)
current_num = a +1
diff = N+1 - current_num
diff_list.append(diff)
#print(diff_list)
all_sum = 1
for idx,diff in enumerate(diff_list):
if idx == 0 or len(diff_list):
diff -= 1
'''
else:
diff -= 2
'''
if diff == 0:
all_sum *= 1
else:
internal_comb_list = one_two_comb(diff)
comb_count = sum_comb(internal_comb_list) + 1
if all_sum > 10**9+7:
all_sum = all_sum%(10**9+7)
all_sum *= comb_count
print((all_sum%(10**9+7)))
|
import math
N,M = list(map(int,input().split(' ')))
An = [ int(eval(input())) for _ in range(M)]
'''
factorial_list = [1] * (N+1)
for i in range(1,N+1):
factorial_list[i] = factorial_list[i-1] * i
def combinations_count(n, r):
return factorial_list[n] // (factorial_list[n - r] * factorial_list[r])
'''
feruma_list = [1] * (N+1)
for i in range(2,N+1):
feruma_list[i] = feruma_list[i-2] + feruma_list[i-1]
def nCk(n, k):
ret = 1
mo = 10**9 + 7
for i in range(k):
ret = ret * (n - i) * pow(i + 1, mo - 2, mo) % mo
return ret
def one_two_comb(N):
two_n = N//2
comb_list = []
for i in range(1,two_n+1):
comb_list.append([N-i,i])
return comb_list
def sum_comb(comb_list):
comb_sum = 0
for val in comb_list:
comb_sum += nCk(val[0],val[1])
return comb_sum
diff_list = []
current_num = 0
max_diff = -1
for a in An:
diff = a - current_num
if diff == 0:
print((0))
exit(0)
diff_list.append(diff)
current_num = a +1
diff = N+1 - current_num
diff_list.append(diff)
#print(diff_list)
all_sum = 1
for idx,diff in enumerate(diff_list):
if idx == 0 or len(diff_list):
diff -= 1
'''
if diff == 0:
all_sum *= 1
else:
internal_comb_list = one_two_comb(diff)
comb_count = sum_comb(internal_comb_list) + 1
if all_sum > 10**9+7:
all_sum = all_sum%(10**9+7)
all_sum *= comb_count
'''
comb_count = feruma_list[diff]
if all_sum > 10**9+7:
all_sum = all_sum%(10**9+7)
all_sum *= comb_count
print((all_sum%(10**9+7)))
|
p03013
|
def resolve():
modu = 1000000007
n, m = list(map(int, input().split()))
a = [False]*n
for _ in range(m):
a[int(eval(input()))] = True
dp = [0]*(n+1)
dp[0], dp[1] = 1, 1
for i in range(2, n+1):
if i in a:
continue
multi = []
if not a[i-1]:
multi.append(dp[i-1])
if not a[i-2]:
multi.append(dp[i-2])
dp[i] = sum(multi) % modu
print((dp[-1]))
resolve()
|
def resolve():
modu = 1000000007
n, m = list(map(int, input().split()))
a = [False]*n
for _ in range(m):
a[int(eval(input()))] = True
dp = [0]*(n+1)
dp[0], dp[1] = 1, 1
for i in range(2, n+1):
if i < n and a[i]:
continue
multi = []
if not a[i-1]:
multi.append(dp[i-1])
if not a[i-2]:
multi.append(dp[i-2])
dp[i] = sum(multi) % modu
print((dp[-1]))
resolve()
|
p03013
|
if __name__ == "__main__":
mod = 10 ** 9 + 7
n, m = list(map(int, input().split()))
a = list()
for i in range(m):
a.append(int(eval(input())))
dp = [0] * (n + 1)
if 1 not in a:
dp[1] = 1
if n > 1:
if 2 not in a:
dp[2] = 1 + dp[1]
for i in range(3, n + 1):
if i not in a:
dp[i] = (dp[i-2] + dp[i-1]) % mod
print((dp[n]))
|
if __name__ == "__main__":
mod = 10 ** 9 + 7
n, m = list(map(int, input().split()))
a = list()
for i in range(m):
a.append(int(eval(input())))
dp = [0] * (n + 1)
for aa in a:
dp[aa] = -1
if dp[1] != -1:
dp[1] = 1
else:
dp[1] = 0
if n > 1:
if dp[2] != -1:
dp[2] = 1 + dp[1]
else:
dp[2] = 0
for i in range(3, n+1):
if dp[i] != -1:
dp[i] = (dp[i-2] + dp[i-1]) % mod
else:
dp[i] = 0
print((dp[n]))
|
p03013
|
if __name__ == "__main__":
mod = 10 ** 9 + 7
n, m = list(map(int, input().split()))
a = list()
for i in range(m):
a.append(int(eval(input())))
dp = [0] * (n + 1)
for aa in a:
dp[aa] = -1
if dp[1] != -1:
dp[1] = 1
else:
dp[1] = 0
if n > 1:
if dp[2] != -1:
dp[2] = 1 + dp[1]
else:
dp[2] = 0
for i in range(3, n+1):
if dp[i] != -1:
dp[i] = (dp[i-2] + dp[i-1]) % mod
else:
dp[i] = 0
print((dp[n]))
|
def solve(N, a):
mod = 10**9 + 7
dp = [0] * (N+1)
step = [0] * (N+1)
for aa in a:
step[aa] = 1
dp[0] = 1
if step[1] == 0:
dp[1] = 1
for i in range(2, N+1):
if step[i] == 0:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
return dp[N]
if __name__ == "__main__":
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
print((solve(N, a)))
|
p03013
|
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(M)]
mod = 10 ** 9 + 7
dp = [0] * (N + 3)
dp[0] = 1
not_use = [False] * (N + 3)
for a in a_list:
not_use[a] = True
for i in range(N+1):
not_u = not_use[i]
if not_u:
continue
else:
if i < N:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
if i < N - 1:
dp[i + 2] += dp[i]
dp[i + 2] %= mod
print((dp[N] % mod))
|
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(M)]
mod = 10 ** 9 + 7
dp = [0] * (N + 100)
dp[0] = 1
not_use = [False] * (N + 100)
for a in a_list:
not_use[a] = True
for i in range(N+1):
not_u = not_use[i]
if not_u:
continue
else:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
dp[i + 2] += dp[i]
dp[i + 2] %= mod
print((dp[N] % mod))
|
p03013
|
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(M)]
mod = 10 ** 9 + 7
dp = [0] * (N + 100)
dp[0] = 1
a_set = set(a_list)
for i in range(N+10):
if i in a_set:
continue
else:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
dp[i + 2] += dp[i]
dp[i + 2] %= mod
print((dp[N] % mod))
|
N, M = list(map(int, input().split()))
a_list = [int(eval(input())) for _ in range(M)]
mod = 10 ** 9 + 7
dp = [0] * (N + 100)
dp[0] = 1
a_set = set(a_list)
for i in range(N):
if i in a_set:
continue
else:
dp[i + 1] += dp[i]
dp[i + 1] %= mod
dp[i + 2] += dp[i]
dp[i + 2] %= mod
print((dp[N] % mod))
|
p03013
|
n,m=list(map(int,input().split()))
a=[]
for _ in range(m):
a.append(int(eval(input())))
if m==0:
a=[-1]
dp=[0]*(n+1)
dp[0]=1
if 1 not in a:
dp[1]=1
for i in range(2,n+1):
if i-2 not in a and i-1 not in a:
dp[i]=dp[i-2]+dp[i-1]
elif i-2 not in a and i-1 in a:
dp[i]=dp[i-2]
elif i-2 in a and i-1 not in a:
dp[i]=dp[i-1]
else:
dp[i]=0
print((dp[n]%(10**9+7)))
|
n,m=list(map(int,input().split()))
a=[0]*(n)
if n==1:
print((1))
exit()
if m>0:
for _ in range(m):
a[int(eval(input()))]+=1
dp=[0]*(n+1)
dp[0]=1
if a[1]!=1:
dp[1]=1
for i in range(2,n+1):
if a[i-2]==0 and a[i-1]==0:
dp[i]=dp[i-2]+dp[i-1]
elif a[i-1]!=0 and a[i-2]==0:
dp[i]=dp[i-2]
elif a[i-2]!=0 and a[i-1]==0:
dp[i]=dp[i-1]
else:
dp[i]=0
print((dp[n]%(10**9+7)))
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
dp = [-1]*(N+1)
dp[0] = 1
ans = 0
for i in range(1, N+1):
if i in a:
dp[i] = 0
if dp[i-1] == 0:
ans = 0
break
else:
if i > 1:
dp[i] = dp[i-1] + dp[i-2]
else:
dp[i] = dp[i-1]
else:
ans = dp[-1] % 1000000007
print(ans)
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
dp = [-1]*(N+1)
for i in a:
dp[i] = 0
dp[0] = 1
mod = 1000000007
for i in range(1, N+1):
if dp[i] == 0:
continue
else:
if i > 1:
dp[i] = (dp[i-1] + dp[i-2]) % mod
else:
dp[i] = dp[i-1] % mod
print((dp[-1]))
|
p03013
|
import sys
sys.setrecursionlimit(1000000)
# 壊れている床を無視すればフィボナッチ数になってる
from collections import defaultdict
def Fib(n, dd, broken):
if n in broken:
return 0
if dd[n] != 0:
return dd[n]
if n <= 1:
return 1
x = Fib(n-1, dd, broken) + Fib(n-2, dd, broken)
dd[n] = x
return x
dd = defaultdict(int)
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
ans = Fib(n, dd, A)
print((ans % 1000000007))
|
# 壊れている床を無視すればフィボナッチ数になってる
from collections import defaultdict
def Fib(n, broken):
dd = defaultdict(int)
dd[0] = 1
for i in range(n):
for j in range(i+1, min(n, i+2)+1):
if broken[j] == 0:
dd[j] += dd[i]
dd[j] %= 1000000007
return dd[n]
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
broken = defaultdict(int)
for c in A:
broken[c] = 1
ans = Fib(n, broken)
print((ans % 1000000007))
|
p03013
|
# 壊れている床を無視すればフィボナッチ数になってる
from collections import defaultdict
def Fib(n, broken):
dd = defaultdict(int)
dd[0] = 1
dd[1] = 1
for i in range(2, n+1):
if broken[i-1] == 0:
dd[i] += dd[i-1]
if broken[i-2] == 0:
dd[i] += dd[i-2]
return dd[n]
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
broken = defaultdict(int)
for c in A:
broken[c] = 1
ans = Fib(n, broken)
print((ans % 1000000007))
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
N, M = list(map(int, input().split()))
A = [0] * M
dp = [-1] * (N+1)
for i in range(M):
a = int(eval(input()))
dp[a] = 0
dp[0] = 1
if dp[1] != 0:
dp[1] = 1
for i in range(2, N+1):
if dp[i] != 0:
dp[i] = dp[i-1] + dp[i-2]
print((dp[N] % 1000000007))
|
p03013
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
N, M = list(map(int, input().split()))
A = [0] * M
dp = [-1] * (N+1)
for i in range(M):
a = int(eval(input()))
dp[a] = 0
dp[0] = 1
if dp[1] != 0:
dp[1] = 1
for i in range(2, N+1):
if dp[i] != 0:
dp[i] = dp[i-1] + dp[i-2]
print((dp[N] % 1000000007))
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
##############################
N, M = list(map(int, input().split()))
A = [0] * M
dp = [-1] * (N+1)
for i in range(M):
a = int(eval(input()))
dp[a] = 0
dp[0] = 1
if dp[1] != 0:
dp[1] = 1
for i in range(2, N+1):
if dp[i] != 0:
dp[i] = (dp[i-1] + dp[i-2]) % 1000000007
print((dp[N]))
|
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
dp[1] = 1 if 1 not in a else 0
for i in range(2, N+1):
if i in a:
continue
dp[i] = (dp[i-1] + dp[i-2])
print((dp[N] % 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
dp[1] = 1 if 1 not in a else 0
a = set(list(range(2,N+1))) - set(a)
for i in a:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[N] % MOD))
|
p03013
|
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=sys.stdin.readline
def resolve():
n,m=list(map(int,input().split()))
fib=[0,1]
a,b=0,1
for _ in range(n):
a,b=b,(a+b)%MOD
fib.append(b)
A=[-1]+[int(eval(input())) for _ in range(m)]+[n+1]
ans=1
for i in range(m+1):
ans*=fib[A[i+1]-A[i]-1]%MOD
print((ans%MOD))
resolve()
|
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, m = list(map(int, input().split()))
S = set(int(eval(input())) for _ in range(m))
a, b = 0, 1 # a[-1], a[0]
for i in range(1, n + 1):
if i in S:
a, b = b, 0
else:
a, b = b, (a + b) % MOD
print(b)
resolve()
|
p03013
|
import math
def cmb(n, r, mod, g1, g2):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
def main():
N, M = list(map(int, input().split()))
A = [-1] + [int(eval(input())) for i in range(M)] + [N + 1]
mod = 10**9+7 #出力の制限
N = 10**5
g1 = [1, 1] # 元テーブル
g2 = [1, 1] #逆元テーブル
inverse = [0, 1] #逆元テーブル計算用テーブル
for i in range( 2, N + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
d = [0] * (len(A) - 1)
for i in range(len(A) - 1):
if A[i+1] - A[i] == 1:
print((0))
exit(0)
d[i] = A[i+1] - 1 - (A[i] + 1)
ans = 1
for dd in d:
if dd > 1:
tmp = 0
for j in range(dd//2 + 1):
tmp += cmb(dd - j, j, mod, g1, g2)
ans *= tmp
print((ans % 1000000007))
if __name__ == '__main__':
main()
|
def main():
N, M = list(map(int, input().split()))
A = [int(eval(input())) for i in range(M)] + [0]
a = 0
b = 1
j = 0
tmp = 0
if N == 1:
print((1))
else:
for i in range(1, N + 1):
if A[j] == i:
if tmp == 1:
print((0))
exit()
tmp = 1
j += 1
a = 0
else:
if tmp == 1:
b = a + b
a = 0
else:
c = a + b
a = b
b = c
tmp = 0
print((b % 1000000007))
if __name__ == '__main__':
main()
|
p03013
|
N, M = list(map(int, input().split()))
mod = 10 ** 9 + 7
dp = [0] * (N+1)
dp[0] = 1
idx = 0
for m in range(M):
a = int(eval(input()))
for i in range(idx+1, a):
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
idx = a
for i in range(idx+1, N+1):
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
print((dp[-1]))
|
N, M = list(map(int, input().split()))
mod = 10 ** 9 + 7
A = [True] * (N+1)
for _ in range(M):
a = int(eval(input()))
A[a] = False
dp = [0] * (N+1)
dp[:2] = 1, 1 if A[1] else 0
for i in range(2, N+1):
if A[i]:
dp[i] = dp[i-1] + dp[i-2]
dp[i] %= mod
print((dp[N]))
|
p03013
|
N,M=list(map(int,input().split()))
A=[int(eval(input())) for i in range(M)]
if 1 in A:
B=[1]+[0]*N
else:
B=[1]+[1]+[0]*(N-1)
i=2
while i<=N:
if i not in A:
B[i] = (B[i - 1] + B[i - 2]) % (10 ** 9 + 7)
i+=1
print((B[N]))
|
N,M=list(map(int,input().split()))
B=[1]+[1]+[0]*(N-1)
for j in range(M):
a=int(eval(input()))
B[a]=-1
if a==1:
B[a]=0
i=2
while i<=N:
if B[i]==-1:
B[i]=0
else:
B[i] = (B[i - 1] + B[i - 2]) % (10 ** 9 + 7)
i+=1
print((B[N]))
|
p03013
|
n, m = list(map(int, input().split()))
if m > 0:
aaa = [int(eval(input())) for i in range(m)]
else:
aaa = set()
dp = [0] * (n + 1)
dp[0] = 1
dp[1] = 1 if 1 not in aaa else 0
MOD = 10 ** 9 + 7
for i in range(2, n + 1):
if i in aaa:
continue
dp[i] = (dp[i - 2] + dp[i - 1]) % MOD
print((dp[n]))
|
import sys
input = sys.stdin.readline
n, m = list(map(int, input().split()))
s = set(map(int, [eval(input()) for _ in range(m)]))
MOD = 10 ** 9 + 7
a = 1 if not 0 in s else 0
b = 1 if not 1 in s else 0
for i in range(2, n + 1):
if i in s:
a, b = b, 0
else:
a, b = b, (a + b) % MOD
print(b)
|
p03013
|
n,m = list(map(int,input().split()))
c=10**9+7
a = [-1]
for i in range(1, m+1):
a = a + [int(eval(input()))]
a =a+[n+1]
for i in range(m+1):
a[i]=a[i+1] - a[i]-1
b=[0]
b=b+[1]
for i in range(2, max(a)+1):
b=b+[(b[i-1] + b[i-2])%c]
s=1
for i in range(m+1):
s=(s*b[a[i]])%c
print(s)
|
n,m = list(map(int,input().split()))
c=10**9+7
a = [-1 for _ in range(m + 1)]
for i in range(1, m+1):
a[i] = int(eval(input()))
a =a+[n+1]
for i in range(m+1):
a[i]=a[i+1] - a[i]-1
b=[0 for _ in range(max(a) + 1)]
b[1]=1
for i in range(2, max(a)+1):
b[i] = (b[i-1] + b[i-2])%c
s=1
for i in range(m+1):
s=(s*b[a[i]])%c
print(s)
|
p03013
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
class comb():
F = [1, 1]
Fi = [1, 1]
I = [0, 1]
def __init__(self, num, mod):
self.MOD = mod
for i in range(2, num + 1):
self.F.append((self.F[-1] * i) % mod)
self.I.append(mod - self.I[mod % i] * (mod // i) % mod)
self.Fi.append(self.Fi[-1] * self.I[i] % mod)
def com(self, n, k):
if n < k: return 0
if n < 0 or k < 0: return 0
return self.F[n] * (self.Fi[k] * self.Fi[n - k] % self.MOD) % self.MOD
MOD = 10 ** 9 + 7
for i in range(1, M):
if a[i] - a[i - 1] == 1:
print((0))
exit()
com = comb(200000, MOD)
ans = 1
x = 0
a = a + [N + 1]
for i in a:
t = i - 1 - x
at = 0
for j in range(t // 2 + 1):
k = t - j
at = at + com.com(k, j) % MOD
ans = ans * at % MOD
x = i + 1
print(ans)
|
N, M = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(M)]
MOD = 10 ** 9 + 7
D = [0] * (N + 1)
D[0] = 1
a.append(10 ** 15)
c = 0
for i in range(1, N + 1):
if a[c] == i:
c += 1
continue
D[i] = D[i - 1]
if i - 2 >= 0:
D[i] = (D[i] + D[i - 2]) % MOD
print((D[-1]))
|
p03013
|
nm=list(map(int,input().split()))
n=nm[0]
m=nm[1]
inp=[]
if m==0:
inp=[n+1]
dis=[n+1]
else:
for inpset in range(m):
inp.append(int(eval(input())))
dis=[max(inp[0],1)]
p=0
for i in inp[:-1]:
dis.append(inp[p+1]-inp[p]-1)
p+=1
dis.append(max(n-inp[-1],1))
#print (dis)
import math
def kaijo(x):
ans=(math(100000)%1000000007)
return ans
def combinations_count(n, r):
return (math.factorial(n) // (math.factorial(n - r) * math.factorial(r)))%1000000007
def counting(x):
if x==1:
return 1
else:
res=0
for a in range(x-1):
if x-1-a>=a:
res+=combinations_count(x-1-a,a)
# print(x-1-a,a)
else:
break
res=res%1000000007
return res
if 0 in dis:
print((0))
else:
ans=1
dis.sort()
for d in dis:
ans*=counting(d)
ans=ans%1000000007
print(ans)
|
nm=list(map(int,input().split()))
n=nm[0]
m=nm[1]
inp=[]
if m==0:
inp=[n+1]
dis=[n+1]
else:
for inpset in range(m):
inp.append(int(eval(input())))
dis=[max(inp[0],1)]
p=0
for i in inp[:-1]:
dis.append(inp[p+1]-inp[p]-1)
p+=1
dis.append(max(n-inp[-1],1))
#print (dis)
def fib(x):
a=0
b=1
for step in range(x):
c=a+b
a=b
b=c
return a
def counting(x):
if x==1:
return 1
else:
res=0
for a in range(x-1):
if x-1-a>=a:
res+=combinations_count(x-1-a,a)
# print(x-1-a,a)
else:
break
res=res%1000000007
return res
if 0 in dis:
print((0))
else:
ans=1
dis.sort()
for d in dis:
ans*=fib(d)%1000000007
ans=ans%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
j=0
for i in range(1,n+1):
if i in a:
#dp[a[j]] = 0
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()))
#a = [int(input()) for i in range(m)]
a=set()
for i in range(m):
tmp=int(eval(input()))
a.add(tmp)
mod = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
j=0
for i in range(1,n+1):
if i in a:
#dp[a[j]] = 0
continue
if i==1:
dp[1] = dp[0]
continue
dp[i] = dp[i-1]+dp[i-2]
dp[i]%=mod
print((dp[n]))
|
p03013
|
from functools import lru_cache
import sys
sys.setrecursionlimit(30000)
N, M = list(map(int, input().split()))
a = list(int(eval(input())) for _ in range(M))
MOD = pow(10, 9) + 7
isOk = True
for i in range(M-1):
if a[i] + 1 == a[i+1]:
isOk = False
funcb = [-1] * 100001
def func(n):
if n <= 0:
return 1
cnt = funcb[n]
if cnt > 0:
return cnt
cnt = 0
if n >= 2:
cnt += func(n-2)
if n >= 1:
cnt += func(n-1)
funcb[n] = cnt % MOD
return funcb[n]
func(30000)
func(50000)
func(80000)
func(100000)
if not isOk:
print((0))
else:
ans = 1
s = 0
for i in range(M+1):
if i >= M:
e = N
else:
e = a[i] - 1
ans = ans * func(e-s) % MOD
if i >= M:
break
s = a[i] + 1
print(ans)
|
N, M = list(map(int, input().split()))
a = list(int(eval(input())) for _ in range(M))
MOD = pow(10, 9) + 7
MAP = [0] * (N + 1)
for x in a:
MAP[x] = -1
MAP[0] = 1
for i in range(N):
if MAP[i] < 0:
continue
MAP[i] %= MOD
if i + 1 <= N and MAP[i+1] >= 0:
MAP[i+1] += MAP[i]
if i + 2 <= N and MAP[i+2] >= 0:
MAP[i+2] += MAP[i]
print((MAP[N] % MOD))
|
p03013
|
n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
for i in range(len(a)-1):
if a[i+1] == a[i]+1:
print((0))
exit()
x = [0]*(n+1)
x[0]=1
div = 1000000007
if not 1 in a:
x[1]=1
for i in range(2,n+1):
if not i in a:
x[i] = (x[i-2] + x[i-1]) % div
print((x[n]))
|
def Fib(n):
a, b = 1, 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
n,m = list(map(int,input().split()))
a = [int(eval(input())) for _ in range(m)]
for i in range(len(a)-1):
if a[i+1] == a[i]+1:
print((0))
exit()
x = []
temp=0
for i in range(m):
x.append(a[i]-temp-1)
temp = a[i]+1
x.append(n-temp)
temp = 1
div = 1000000007
for i in x:
temp = (temp*Fib(i+1))%div
print(temp)
|
p03013
|
mod = 10**9+7
N, M = list(map(int, input().split()))
A_ = [int(eval(input())) for _ in range(M)]
A = [0] * (N+1)
for a in A_:
A[a] = 1
dp = [0] * (N+3)
dp[0] = 1
for i in range(1, N+1):
if A[i-1] == 0:
dp[i] += dp[i-1]
if A[i-2] == 0:
dp[i] += dp[i-2]
dp[i] %= mod
print((dp[N]))
|
mod = 10**9+7
N, M = list(map(int, input().split()))
A_ = [int(eval(input())) for _ in range(M)]
A = [0] * (N+3)
for a in A_:
A[a] = 1
dp = [0] * (N+3)
dp[0] = 1
for i in range(1, N+1):
if A[i-1] == 0:
dp[i] += dp[i-1]
if A[i-2] == 0:
dp[i] += dp[i-2]
dp[i] %= mod
print((dp[N]))
|
p03013
|
N,M=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(M)]
n1,n2=0,1
for i in range(1,N+1):
if i in A:
n1=n2
n2=0
else:
tmp=n2
n2=(n1+n2)%1000000007
n1=tmp
print(n2)
|
N,M=list(map(int,input().split()))
A=[int(eval(input())) for _ in range(M)]
ai=0
n1,n2=0,1
for i in range(1,N+1):
if ai<M and i==A[ai]:
ai+=1
n1=n2
n2=0
else:
tmp=n2
n2=(n1+n2)%1000000007
n1=tmp
print(n2)
|
p03013
|
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]
print((dp[n]%mod))
main()
|
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
|
n,m=list(map(int,input().split()))
a=[int(eval(input())) for _ in range(m)]
b=[(True if i in a else False) for i in range(n+1)]
fib=[0]*(n+1)
fib[0]=1
fib[1]=[1,0][b[1]]
for i in range(2,n+1):
fib[i]=[fib[i-1]+fib[i-2],0][b[i]]
fib[i]%=10**9+7
print((fib[n]))
|
n,m=list(map(int,input().split()))
mod=10**9+7
a=[False]*(n+1)
for i in range(m):
a[int(eval(input()))]=True
fib=[0]*(n+1)
fib[0]=1
fib[1]=[1,0][a[1]]
for i in range(2,n+1):
if a[i]:
fib[i]=0
else:
fib[i]=(fib[i-1]+fib[i-2])%mod
print((fib[n]))
|
p03013
|
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
m = 10**9+7
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1
if 1 in a:
dp[1] = 0
for i in range(2, n+1):
dp[i] = 0 if i in a else (dp[i-2] + dp[i-1]) % m
print((dp[-1]))
|
n, m = list(map(int, input().split()))
a = set(int(eval(input())) for _ in range(m))
m = 10**9+7
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1
if 1 in a:
dp[1] = 0
for i in range(2, n+1):
dp[i] = 0 if i in a else (dp[i-2] + dp[i-1]) % m
print((dp[-1]))
|
p03013
|
n, m = list(map(int, input().split()))
a = set(int(eval(input())) for _ in range(m))
m = 10**9+7
dp = [0 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1
if 1 in a:
dp[1] = 0
for i in range(2, n+1):
dp[i] = 0 if i in a else (dp[i-2] + dp[i-1]) % m
print((dp[-1]))
|
n, m = list(map(int, input().split()))
P = 10**9+7
dp = [-1 for _ in range(n+1)]
dp[0] = 1
dp[1] = 1
for _ in range(m):
dp[int(eval(input()))] = 0
for i in range(2, n+1):
if not dp[i] == 0:
dp[i] = (dp[i-2] + dp[i-1]) % P
print((dp[-1]))
|
p03013
|
n,m = list(map(int,input().split()))
o = [int(eval(input())) for _ in range(m)]
#print(o)
mod = (10**9)+7
dp = [1]+[0]*(n)
for i in range(1,n+1):
dp[i] = (dp[i-1]+dp[i-2])%mod
if i in o:
dp[i] = 0
#print(i,dp)
#print(dp)
print((dp[-1]))
|
n,m = list(map(int,input().split()))
o = set(int(eval(input())) for _ in range(m))
#print(o)
mod = (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])%mod
if i in o:
dp[i] = 0
#print(i,dp)
#print(dp)
print((dp[-1]))
|
p03013
|
n,m = list(map(int,input().split()))
o = set(int(eval(input())) for _ in range(m))
#print(o)
mod = (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])%mod
if i in o:
dp[i] = 0
#print(i,dp)
#print(dp)
print((dp[-1]))
|
n,m = list(map(int,input().split()))
a = set([int(eval(input())) for _ in range(m)])
#print(a)
mod = 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])%mod
if i in a:
dp[i] = 0
print((dp[-1]))
|
p03013
|
def main():
N, M = list(map(int, input().split()))
a = [0] * (1 + 10 ** 5)
for _ in range(M):
a[int(eval(input()))] = 1
dp = [0] * (N + 1)
dp[0] = 1
if not a[1]:
dp[1] = 1
for i in range(2, N + 1):
if not a[i]:
dp[i] += dp[i-1] + dp[i-2]
dp[i] %= 1000000007
print((dp[N]))
main()
|
def main():
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
a = [0] * (1 + 10 ** 5)
for _ in range(M):
a[int(eval(input()))] = 1
dp = [0] * (N + 1)
dp[0] = 1
if not a[1]:
dp[1] = 1
for i in range(2, N + 1):
if not a[i]:
dp[i] += dp[i-1] + dp[i-2]
dp[i] %= 1000000007
print((dp[N]))
main()
|
p03013
|
MOD = 10**9+7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
dp = [0] * (n+1)
dp[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]))
|
MOD = 10**9+7
n, m = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(m)]
safe = [True] * (n+1)
for a in A:
safe[a] = False
dp = [0] * (n+1)
dp[0] = 1
for i in range(1, n+1):
if safe[i]:
dp[i] = (dp[i-1] + 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)]
safe = [True] * (n+1)
for a in A:
safe[a] = False
dp = [0] * (n+1)
dp[0] = 1
for i in range(1, n+1):
if safe[i]:
dp[i] = (dp[i-1] + dp[i-2]) % MOD
print((dp[n]))
|
MOD = 10**9+7
n, m = list(map(int, input().split()))
a = [int(eval(input())) for _ in range(m)]
a = set(a)
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
for i in range(0, N, 1):
if i+1 == 1 and not (i+1) in A:
dp[i+1] = dp[i]
elif not (i+1 in A) and not(i in A) and not(i-1 in A):
dp[i+1] = dp[i] + dp[i-1]
elif not(i+1 in A) and not (i in A) and (i-1 in A):
dp[i+1] = dp[i]
elif not(i+1 in A) and (i in A) and not(i-1 in A):
dp[i+1] = dp[i-1]
print((dp[N]%1000000007))
|
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(0, N, 1):
if i+1 == 1 and not (i+1) in A:
dp[i+1] = dp[i]
elif not (i+1 in A) and not(i in A) and not(i-1 in A):
dp[i+1] = dp[i] + dp[i-1]
elif not(i+1 in A) and not (i in A) and (i-1 in A):
dp[i+1] = dp[i]
elif not(i+1 in A) and (i in A) and not(i-1 in A):
dp[i+1] = dp[i-1]
print((dp[N]%1000000007))
|
p03013
|
MOD = 10**9+7
n,m = list(map(int, input().split()))
al = [True]*(n+1)
for _ in range(m):
al[int(eval(input()))] = False
dp = [0]*(n+1)
dp[0] = 1
for i in range(n):
if i+2 <= n and al[i+2]:
dp[i+2] += dp[i]
if i+1 <= n and al[i+1]:
dp[i+1] += dp[i]
print((dp[n]%MOD))
|
n,m = list(map(int, input().split()))
al = [True]*(n+1)
for _ in range(m):
a = int(eval(input()))
al[a] = False
MOD = 10**9+7
dp = [0]*(n+1)
dp[0] = 1
for i in range(n):
if i+1 <= n and al[i+1]:
dp[i+1] += dp[i]
dp[i+1]%=MOD
if i+2 <= n and al[i+2]:
dp[i+2] += dp[i]
dp[i+2]%=MOD
print((dp[n]))
|
p03013
|
N,M = list(map(int,input().split()))
a = [int(eval(input())) for i in range(M)]
dp = [0]*(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:
continue
dp[i] = dp[i-2] + dp[i-1]
dp[i] = dp[i] % (10**9+7)
print((dp[N]))
|
N,M = list(map(int,input().split()))
a = [int(eval(input())) for i in range(M)]
dp = [-float("inf")]*(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:
continue
dp[i] = dp[i-2] + dp[i-1]
dp[i] = dp[i] % (10**9+7)
print((dp[N]))
|
p03013
|
import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 1000000007
a=open(0)
N,_,*a = list(map(int, a.read().split()))
dp = [-1 for _ in range(100010)]
dp[0] = 0
for i in a: dp[i] = 0
def rec(i):
if dp[i] > -1:
return dp[i]
if i<3:
dp[i] = rec(i-1) + 1
return dp[i]
dp[i] = (rec(i-1)+rec(i-2))%MOD
return dp[i]
print((rec(N)))
|
MOD=10**9+7
N,_,*a = list(map(int, open(0).read().split()))
A=set(a)
dp = [0 for _ in range(N+1)]
dp[:2] = 1, 0 if 1 in A else 1
for i in range(2,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()))
para = [int(eval(input())) for i in range(m)]
mod = 10**9+7
dp = [0]*(n+1)
for i in range(n+1):
if i not in para :
if i == 1 or i==0:
dp[i] = 1
else:
dp[i] = (dp[i-1] + dp[i-2])%mod
else :
dp[i] = 0
print(("{}".format(dp[-1])))
|
n,m = list(map(int,input().split()))
para = [int(eval(input())) for i in range(m)]
mod = 10**9+7
dp = [-1]*(n+1)
for i in para:
dp[i] = 0
for i in range(n+1):
if dp[i] != 0 :
if i == 1 or i==0:
dp[i] = 1
else:
dp[i] = (dp[i-1] + dp[i-2])%mod
print(("{}".format(dp[-1])))
|
p03013
|
n, m = list(map(int, input().split()))
broken = []
for i in range(m):
broken.append(int(eval(input())))
MOD = 10 ** 9 + 7
dp = [0] * (n+1)
dp[0] = 1
if 1 not in broken:
dp[1] = 1
for i in range(2, n+1):
if i not in broken:
dp[i] = (dp[i-1] + dp[i-2])%MOD
print((dp[-1]))
|
# ABC129C - Typical Stairs
import sys
input = sys.stdin.readline
def main():
N, M = tuple(map(int, input().split()))
A = set(map(int, [eval(input()) for _ in range(M)]))
MOD = 10 ** 9 + 7
dp = [0] * (N + 1)
dp[:2] = 1, 1 if 1 not in A else 0
for i in range(2, N + 1):
if i in A:
continue
else:
dp[i] = (dp[i - 1] + dp[i - 2]) % MOD
print((dp[-1]))
if __name__ == "__main__":
main()
|
p03013
|
N, M = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(M)]
mod = 10 ** 9 + 7
dp = [0] * (N + 1)
dp[0] = 1
for i in range(N):
if i + 1 not in A:
dp[i + 1] += dp[i]
if i + 2 <= N and i + 2 not in A:
dp[i + 2] += dp[i]
print((dp[N] % mod))
# print(dp)
|
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 a in A:
dp[a] = -1
for i in range(N):
if dp[i] >= 0:
if dp[i + 1] >= 0:
dp[i + 1] += dp[i]
if i + 2 <= N and dp[i + 2] >= 0:
dp[i + 2] += dp[i]
print((dp[N] % mod))
# print(dp)
|
p03013
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.