input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
H, W, M = list(map(int, input().split()))
hn = {}
wn = {}
flag = set()
for i in range(M):
h, w = list(map(int, input().split()))
if (h,w) not in flag:
if h in hn:
hn[h] += 1
else:
hn[h] = 1
if w in wn:
wn[w] += 1
else:
wn[w] = 1
flag.add((h,w))
hrank = sorted(list(hn.items()), key=lambda t:-t[1])
wrank = sorted(list(wn.items()), key=lambda t:-t[1])
hmax = hrank[0][1]
wmax = wrank[0][1]
hmaxlist =[]
for k,v in hrank:
if v == hmax:
hmaxlist.append(k)
else:
break
wmaxlist =[]
for k,v in wrank:
if v == wmax:
wmaxlist.append(k)
else:
break
flag2 = set()
for i in hmaxlist:
for j in wmaxlist:
flag2.add((i,j))
if len(flag2 - flag) == 0:
print((hmax+wmax -1))
else:
print((hmax+wmax)) | import sys
H, W, M = list(map(int, input().split()))
hn = [0]*H
wn = [0]*W
flag = set()
for i in range(M):
h, w = list(map(int, input().split()))
hn[h-1] += 1
wn[w-1] += 1
flag.add((h,w))
#hrank = sorted(hn, key=lambda t:-t[1])
#wrank = sorted(wn, key=lambda t:-t[1])
hmax = max(hn)
wmax = max(wn)
hmaxlist = {i+1 for i,h in enumerate(hn) if h == hmax}
#for h in hn:
# if h == hmax:
# hmaxlist.append(h)
wmaxlist = {i+1 for i,w in enumerate(wn) if w == wmax}
#for w in wn:
# if w == wmax:
# wmaxlist.append(w)
for i in hmaxlist:
for j in wmaxlist:
if (i,j) not in flag:
print((hmax+wmax))
sys.exit()
print((hmax+wmax-1)) | p02580 |
#!/usr/bin/env python3
import collections
H, W, M = list(map(int, input().split()))
tate = []
yoko = []
S = []
for i in range(M):
h, w = list(map(int, input().split()))
tate.append(h-1)
yoko.append(w-1)
S.append([h-1, w-1])
tate = collections.Counter(tate)
yoko = collections.Counter(yoko)
yoko_max = yoko.most_common()[0][1]
yoko_index = []
tate_max = tate.most_common()[0][1]
tate_index = []
for k, v in yoko.most_common():
if v == yoko_max: yoko_index.append(k)
else: break
for k, v in tate.most_common():
if v == tate_max: tate_index.append(k)
else: break
for i in range(len(yoko_index)):
for j in range(len(tate_index)):
if [tate_index[j], yoko_index[i]] in S:
continue
else:
print((tate_max + yoko_max))
exit()
print((tate_max + yoko_max - 1))
| #!/usr/bin/env python3
import collections
H, W, M = list(map(int, input().split()))
tate = []
yoko = []
S = set()
for i in range(M):
h, w = list(map(int, input().split()))
tate.append(h-1)
yoko.append(w-1)
S.add((h-1, w-1))
tate = collections.Counter(tate)
yoko = collections.Counter(yoko)
yoko_max = yoko.most_common()[0][1]
yoko_index = []
tate_max = tate.most_common()[0][1]
tate_index = []
for k, v in yoko.most_common():
if v == yoko_max: yoko_index.append(k)
else: break
for k, v in tate.most_common():
if v == tate_max: tate_index.append(k)
else: break
for i in yoko_index:
for j in tate_index:
if (j, i) in S:
continue
else:
print((tate_max + yoko_max))
exit()
print((tate_max + yoko_max - 1))
| p02580 |
import math
while 1:
n = int(input())
if not n:
break
ans = 0
for p in range(1, int(math.sqrt(2*n))+1):
if 2*n % p ==0:
q = 2*n / p
if p>1 and (p+q)%2:
ans += 1
print(ans) | while 1:
n = int(input())
if not n:
break
ans = 0
p = 2
while p**2 <= 2*n:
if not 2*n % p:
if (p + 2*n/p) % 2:
ans += 1
p += 1
print(ans) | p01314 |
if __name__ == "__main__":
while True:
n = int(eval(input()))
if n ==0:break
nline = [i for i in range(1,n+1)]
count = 0
for i in range(n):
for j in range(i+1,n):
if sum(nline[i:j]) > n:break
if sum(nline[i:j]) == n:count +=1
print(count) | if __name__ == "__main__":
while True:
n = int(eval(input()))
if n ==0:break
count = 0
for i in range(1,n):
for j in range(i+1,n):
sum = (i+j)*(j-i+1)/2
if sum> n:break
if sum == n:count +=1
print(count) | p01314 |
import sys
from io import StringIO
import unittest
import math
def resolve():
x = int(input())
a = math.floor(x ** 0.2)
b5 = a ** 5 - x # マイナスになる
b = 0
right = 0
left = b5 - 10
if x == 1:
a = 0
b = -1
else:
while 1:
mid = (right + left) // 2
if mid ** 5 > b5:
right = mid - 1
elif mid ** 5 < b5:
left = mid + 1
else:
b = mid
break
print(a, b, sep=' ')
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """33"""
output = """2 -1"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """1"""
output = """0 -1"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
| import sys
from io import StringIO
import unittest
import math
def resolve():
x = int(input())
a = math.floor(x ** 0.2) + 1
b5 = a ** 5 - x
if x == 1:
a = 0
b = -1
elif b5 == 0:
b = 0
else:
right = (10 ** 9)
left = -1 * (10 ** 9)
pre_right = (10 ** 9)
pre_left = -1 * (10 ** 9)
b = 0
pre_mid = 10 ** 9
while 1:
mid = (right + left) // 2
ans = mid ** 5
# print(left, right)
if ans > b5:
right = mid - 1
elif ans < b5:
left = mid + 1
else:
b = mid
break
if [pre_right, pre_left] == [right, left]:
a -= 1
b5 = a ** 5 - x
right = (10 ** 9)
left = -1 * (10 ** 9)
pre_right = right
pre_left = left
print(a, b, sep=' ')
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys.stdout, sys.stdin
sys.stdout, sys.stdin = StringIO(), StringIO(input)
resolve()
sys.stdout.seek(0)
out = sys.stdout.read()[:-1]
sys.stdout, sys.stdin = stdout, stdin
self.assertEqual(out, output)
def test_入力例_1(self):
input = """33"""
output = """2 -1"""
self.assertIO(input, output)
def test_入力例_2(self):
input = """1"""
output = """0 -1"""
self.assertIO(input, output)
if __name__ == "__main__":
# unittest.main()
resolve()
| p02690 |
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
def fib_bad(n):
if not n or n == 1:
return 1
return fib_bad(n - 2) + fib_bad(n - 1)
def fib_dp(n):
fib_list[:1] = [1, 1]
for i in range(2, n + 1):
fib_list[i] = fib_list[i - 2] + fib_list[i - 1]
return fib_list.pop()
if __name__ == '__main__':
_input = sys.stdin.readlines()
index = int(_input[0])
fib_list = [None] * index
# print(fib_bad(index))
print((fib_dp(index))) | #!/usr/bin/env python
# -*- coding: utf-8 -*-
import sys
# def fib_bad(n):
# if not n or n == 1:
# return 1
# return fib_bad(n - 2) + fib_bad(n - 1)
def fib_dp(n):
fib_list[:1] = [1, 1]
for i in range(2, n + 1):
fib_list[i] = fib_list[i - 2] + fib_list[i - 1]
return fib_list.pop()
if __name__ == '__main__':
_input = sys.stdin.readlines()
index = int(_input[0])
fib_list = [None] * index
print((fib_dp(index))) | p02233 |
def fibonacci(n):
if n == 0 or n == 1:
return 1
return fibonacci(n - 2) + fibonacci(n - 1)
print((fibonacci(int(eval(input()))))) | def fibonacci(f, n):
if n == 0 or n == 1:
f[n] = 1
return f[n]
if f[n]:
return f[n]
f[n] = fibonacci(f, n - 2) + fibonacci(f, n - 1)
return f[n]
n = int(eval(input()))
f = [None for i in range(n + 1)]
print((fibonacci(f, n))) | p02233 |
f=lambda n:f(n-1)+f(n-2)if n>1 else 1
print((f(int(eval(input())))))
| f=[1,1]
for _ in range(2,45):f+=[sum(f[-2:])]
print((f[int(eval(input()))]))
| p02233 |
#coding:UTF-8
def FN(n):
if n==0 or n==1:
return 1
else:
ans=FN(n-1)+FN(n-2)
return ans
if __name__=="__main__":
n=int(eval(input()))
ans=FN(n)
print(ans) | #coding:UTF-8
def FN(n):
if n==0 or n==1:
F[n]=1
return F[n]
if F[n]!=None:
return F[n]
F[n]=FN(n-1)+FN(n-2)
return F[n]
if __name__=="__main__":
n=int(eval(input()))
F=[None]*(n+1)
ans=FN(n)
print(ans) | p02233 |
n = int(input())
def fib(N):
if N in [0, 1]:
return 1
else:
return fib(N-1) + fib(N-2)
print(fib(n)) | n = int(input())
a = 1
b = 1
for i in range(n-1):
tmp = a
a = b
b += tmp
print(b) | p02233 |
def fib(n):
if n == 0:
return 1
elif n == 1:
return 1
else:
return fib(n - 1) + fib(n - 2)
n = eval(input())
print(fib(n)) | cache = {}
def fib(x):
if x in cache:
return cache[x]
elif x == 0 or x == 1:
return 1
else:
v = fib(x - 1) + fib(x - 2)
cache[x] = v
return v
x = eval(input())
print(fib(x)) | p02233 |
def fib(n):
if n==0 or n==1:
return 1
else:
return fib(n-1) + fib(n-2)
print((fib(int(eval(input())))))
| def fib(n):
if n ==0 or n == 1:
return 1
l = [0] * (n+1)
l[0] = 1
l[1] = 1
for i in range(2,n+1):
l[i] = l[i-2] + l[i-1]
return l[i]
print((fib(int(eval(input())))))
| p02233 |
def fib(n):
return 1 if n == 0 or n == 1 else fib(n - 1) + fib(n - 2)
print((fib(int(eval(input()))))) | def fib(n):
n1 = n2 = tmp = 1
for _ in range(n - 1):
tmp = n1 + n2
n1, n2 = n2, tmp
return tmp
print((fib(int(eval(input()))))) | p02233 |
def fib(n):
if n == 0 or n == 1:
return 1
return fib(n-1) + fib(n-2)
n = int(eval(input()))
print((fib(n))) | def fib(n, fib_table):
if n == 0 or n == 1:
return 1
if fib_table[n] != None:
return fib_table[n]
fib_table[n] = fib(n-1, fib_table) + fib(n-2, fib_table)
return fib_table[n]
n = int(eval(input()))
fib_table = [None]*(n+1)
fib_table[0] = 1
fib_table[1] = 1
print((fib(n, fib_table))) | p02233 |
def fibonacci(n):
if n == 0 or n == 1:
return 1
else:
return fibonacci(n-1) + fibonacci(n-2)
if __name__ == '__main__':
n = int(eval(input()))
print((fibonacci(n))) | def fibonacci(n):
a, b = 1, 1
for i in range(n-1):
a, b = b, a+b
return b
if __name__ == '__main__':
n = int(eval(input()))
print((fibonacci(n))) | p02233 |
F_list = [1,1] + [None]*43
def fibo(n):
F=F_list[n]
if n==0 or n==1: return F
F = fibo(n-1)+fibo(n-2)
F_list[n]=F
return F
n = int(eval(input()))
print((fibo(n))) | F =[1,1] + [0 for i in range(44)]
n = int(eval(input()))
for i in range(2,n+1):
F[i]=F[i-1]+F[i-2]
print((F[n])) | p02233 |
# undo が出来るゲームは全て2手だけ見ればよい
ops = ["+", "*", "-", "&", "^", "|"]
numbers = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "0"]
def check(x):
# +*
op = 0
for c in x:
if c in ops:
op += 1
if op >= 2:
return None
else:
op = 0
# +...
for op in ops:
if x.startswith(op):
return None
if ("(" + op) in x:
return None
# 0がないか
zero_ok = False
for c in x:
if not zero_ok and c == "0":
return None
if c in ops:
zero_ok = False
elif c in numbers:
zero_ok = True
else: # ( )
zero_ok = False
try:
val = int(eval(x))
return val
except:
return None
def get_nexts(x):
# 削除
result = []
for i in range(len(x)):
y = x[:i] + x[i + 1:]
val = check(y)
if val != None:
result.append((val, y))
# 追加
for i in range(len(x) + 1):
add_list = numbers + ops
for s in add_list:
y = x[:i] + s + x[i:]
val = check(y)
if val != None:
result.append((val, y))
return result
while True:
n, x = input().split(" ")
n = int(n)
if n == 0:
quit()
nexts = get_nexts(x)
if n == 1:
nexts.sort(key=lambda a: - a[0])
print((nexts[0][0]))
continue
maxval = eval(x)
tele = x
minvals = []
for (val, y) in nexts:
nextss = get_nexts(y)
nextss.sort(key=lambda a: a[0])
minvals.append(nextss[0][0])
if maxval < nextss[0][0]:
maxval = nextss[0][0]
tele = nextss[0][1]
if n % 2 == 0:
print((max(minvals))) # 999+9999 -> 9&99+9999
continue
nexts = get_nexts(tele)
if n % 2 == 1:
nexts.sort(key=lambda a: -a[0])
print((nexts[0][0]))
continue
| # undo が出来るゲームは全て2手だけ見ればよい
ops = ["+", "*", "-", "&", "^", "|"]
numbers = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "0"]
def check(x):
# +*
op = 0
for c in x:
if c in ops:
op += 1
if op >= 2:
return None
else:
op = 0
# +...
for op in ops:
if x.startswith(op):
return None
if ("(" + op) in x:
return None
# 0がないか
zero_ok = False
for c in x:
if not zero_ok and c == "0":
return None
if c in ops:
zero_ok = False
elif c in numbers:
zero_ok = True
else: # ( )
zero_ok = False
try:
val = int(eval(x))
return val
except:
return None
def get_nexts(x):
# 削除
result = []
for i in range(len(x)):
y = x[:i] + x[i + 1:]
val = check(y)
if val != None:
result.append((val, y))
# 追加
for i in range(len(x) + 1):
add_list = numbers + ops
for s in add_list:
y = x[:i] + s + x[i:]
val = check(y)
if val != None:
result.append((val, y))
return result
while True:
n, x = input().split(" ")
n = int(n)
if n == 0:
quit()
nexts = get_nexts(x)
if n % 2 == 1:
nexts.sort(key=lambda a: - a[0])
print((nexts[0][0]))
continue
minvals = []
for (val, y) in nexts:
nextss = get_nexts(y)
nextss.sort(key=lambda a: a[0])
minvals.append(nextss[0][0])
print((max(minvals)))
| p01624 |
# undo が出来るゲームは全て2手だけ見ればよい
ops = ["+", "*", "-", "&", "^", "|"]
numbers = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "0"]
def check(x):
# +*
op = 0
for c in x:
if c in ops:
op += 1
if op >= 2:
return None
else:
op = 0
# +...
for op in ops:
if x.startswith(op):
return None
if ("(" + op) in x:
return None
# 0がないか
zero_ok = False
for c in x:
if not zero_ok and c == "0":
return None
if c in ops:
zero_ok = False
elif c in numbers:
zero_ok = True
else: # ( )
zero_ok = False
try:
val = int(eval(x))
return val
except:
return None
def get_nexts(x):
# 削除
result = []
for i in range(len(x)):
y = x[:i] + x[i + 1:]
val = check(y)
if val != None:
result.append((val, y))
# 追加
for i in range(len(x) + 1):
add_list = numbers + ops
for s in add_list:
y = x[:i] + s + x[i:]
val = check(y)
if val != None:
result.append((val, y))
return result
while True:
n, x = input().split(" ")
n = int(n)
if n == 0:
quit()
nexts = get_nexts(x)
if n % 2 == 1:
nexts.sort(key=lambda a: - a[0])
print((nexts[0][0]))
continue
minvals = []
for (val, y) in nexts:
nextss = get_nexts(y)
nextss.sort(key=lambda a: a[0])
minvals.append(nextss[0][0])
print((max(minvals)))
| # undo が出来るゲームは全て2手だけ見ればよい
ops = ["+", "*", "-", "&", "^", "|"]
numbers = ["1", "2", "3", "4", "5", "6", "7", "8", "9", "0"]
def check(x):
# +*
op = 0
for c in x:
if c in ops:
op += 1
if op >= 2:
return None
else:
op = 0
# +...
for op in ops:
if x.startswith(op):
return None
if ("(" + op) in x:
return None
# 0がないか
zero_ok = False
for c in x:
if not zero_ok and c == "0":
return None
if c in numbers:
zero_ok = True
else:
zero_ok = False
try:
return int(eval(x))
except:
return None
def get_nexts(x):
# 削除
result = []
for i in range(len(x)):
y = x[:i] + x[i + 1:]
val = check(y)
if val != None:
result.append((val, y))
# 追加
for i in range(len(x) + 1):
add_list = numbers + ops
for s in add_list:
y = x[:i] + s + x[i:]
val = check(y)
if val != None:
result.append((val, y))
return result
def get_nexts_val(x):
# 削除
result = []
for i in range(len(x)):
y = x[:i] + x[i + 1:]
val = check(y)
if val != None:
result.append(val)
# 追加
for i in range(len(x) + 1):
add_list = numbers + ops
for s in add_list:
y = x[:i] + s + x[i:]
val = check(y)
if val != None:
result.append(val)
return result
while True:
n, x = input().split(" ")
n = int(n)
if n == 0:
quit()
nexts = get_nexts(x)
if n % 2 == 1:
nexts.sort(key=lambda a: - a[0])
print((nexts[0][0]))
continue
minvals = []
for (val, y) in nexts:
nextss = get_nexts_val(y)
nextss.sort()
minvals.append(nextss[0])
print((max(minvals)))
| p01624 |
def check(pattern):
for i in range(W - 2):
mask = 0b11 << i
if pattern & mask == mask:
return False
return True
def simulate(a1, pattern):
pat = [pattern & (1 << w) != 0 for w in range(W - 1)]
if a1 != W - 1 and pat[a1]:
return a1 + 1
elif a1 != 0 and pat[a1 - 1]:
return a1 - 1
else:
return a1
H, W, K = list(map(int, input().split()))
dp = [[0] * W for h in range(H + 1)]
dp[0][0] = 1
for h in range(1, H + 1):
for pattern in range(2 ** (W - 1)):
for w in range(W):
if check(pattern):
dp[h][simulate(w, pattern)] += dp[h - 1][w]
dp[h][simulate(w, pattern)] %= 1000000007
print((dp[H][K - 1]))
| def check(pat):
for i in range(W - 2):
mask = 0b11 << i
if pat & mask == mask:
return False
return True
def simulate(a1, pat):
if a1 != W - 1 and pat & 1 << a1 != 0:
return a1 + 1
elif a1 != 0 and pat & 1 << a1 - 1 != 0:
return a1 - 1
else:
return a1
H, W, K = list(map(int, input().split()))
dp = [[0] * W for h in range(H + 1)]
dp[0][0] = 1
for h in range(1, H + 1):
for pat in range(2 ** (W - 1)):
for w in range(W):
if check(pat):
dp[h][simulate(w, pat)] += dp[h - 1][w]
dp[h][simulate(w, pat)] %= 1000000007
print((dp[H][K - 1]))
| p03222 |
H,W,K = list(map(int, input().split()))
MOD = 10**9 + 7
dp = [[0 for _ in range(W)] for _ in range(H+1)]
dp[0][0] = 1
ws = set()
for bit in range(1 << (W-1)):
if "11" in bin(bit):
continue
ws.add(bit)
for i in range(H):
for bit in ws:
# 高さi、左からj本目の縦棒にいるとき、どう移動するか。
for j in range(W):
# 右に移る棒がある時に、右に行ってから下へ移動する場合
if j != W-1 and bit & (1 << (W-2-j)): # j=0 の時に左端に1が立っているか確認したい、
dp[i+1][j+1] += dp[i][j]
dp[i+1][j+1] %= MOD
# 左に移る棒があるときに、左に行ってから下へ移動する場合
elif j != 0 and bit & (1 << (W-1-j)): # j=W-1 のときに、右端に1が立っているか確認したい。
dp[i+1][j-1] += dp[i][j]
dp[i+1][j-1] %= MOD
else:
# そのまま下への移動
dp[i+1][j] += dp[i][j]
dp[i+1][j] %= MOD
#print(i,bin(bit),j,dp)
print((dp[-1][K-1]))
#print(dp)
#print(ws) |
"""
AtCoder Beginner Contest 113 D - Number of Amidakuji
愚直に考えると、
・それぞれの縦棒の間に、横棒があるかないかの2通り。これがある高さhだけで、2^(W-1)通りある（横棒が２連続で続かないので、厳密には違うが）。
・これが高さH（最大100個分）あるので、(2^7)^100 とか？とにかく全探索は間に合わない。
メタ視点だが、W<=8なので、bitDPとかやれそう。
愚直解の何がよくないかというと、たとえば H = 6,W = 4 みたいなあみだくじについて考えるとして、
・この中で上から3段目までが同じでそれより下が異なるあみだくじというのがあるが、同じ部分も毎回シミュレートしてしまうのが重複計算になって無駄。
なので、高さごとに取りうる横棒のパターンを確認して、それらについて移動先の場合の数を求めていけばいいか。
各高さについて毎回横棒のパターンをbitで探索するが何故か思いつかなかった。
"""
H,W,K = list(map(int, input().split()))
MOD = 10**9 + 7
dp = [[0 for _ in range(W)] for _ in range(H+1)]
dp[0][0] = 1
ws = set()
for bit in range(1 << (W-1)):
if "11" in bin(bit):
continue
ws.add(bit)
for i in range(H):
for bit in ws:
# 高さi、左からj本目の縦棒にいるとき、どう移動するか。
for j in range(W):
# 右に移る棒がある時に、右に行ってから下へ移動する場合
if j != W-1 and bit & (1 << (W-2-j)): # j=0 の時に左端に1が立っているか確認したい、
dp[i+1][j+1] += dp[i][j]
dp[i+1][j+1] %= MOD
# 左に移る棒があるときに、左に行ってから下へ移動する場合
elif j != 0 and bit & (1 << (W-1-j)): # j=W-1 のときに、右端に1が立っているか確認したい。
dp[i+1][j-1] += dp[i][j]
dp[i+1][j-1] %= MOD
else:
# そのまま下への移動
dp[i+1][j] += dp[i][j]
dp[i+1][j] %= MOD
#print(i,bin(bit),j,dp)
print((dp[-1][K-1]))
#print(dp)
#print(ws) | p03222 |
H, W, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
F = [1, 1, 2, 3, 5, 8, 13, 21, 34]
inv_F = pow(F[W], mod - 2, mod)
P = [[0 for w in range(W + 2)] for h in range(H + 1)]
P[0][1] = 1
if W > 1:
for h in range(1, H + 1):
for w in range(1, W + 1):
P[h][w] = (P[h - 1][w - 1] * F[w - 2] * F[W - w] % mod
+ P[h - 1][w] * F[w - 1] * F[W - w] % mod
+ P[h - 1][w + 1] * F[w - 1] * F[W - w - 1] % mod) * inv_F % mod
print((P[H][K] * pow(F[W], H, mod) % mod))
else:
print((1)) | H, W, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
F = [1, 1, 2, 3, 5, 8, 13, 21, 34]
inv_F = pow(F[W], mod - 2, mod)
P = [[0 for w in range(W + 2)] for h in range(H + 1)]
P[0][1] = 1
for h in range(1, H + 1):
for w in range(1, W + 1):
P[h][w] = (P[h - 1][w - 1] * F[w - 2] * F[W - w] % mod
+ P[h - 1][w] * F[w - 1] * F[W - w] % mod
+ P[h - 1][w + 1] * F[w - 1] * F[W - w - 1] % mod) * inv_F % mod
print((P[H][K] * pow(F[W], H, mod) % mod))
| p03222 |
H, W, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
# 高さiにおいて左からj番目の棒にいる通り数
dp = [[0] * W for i in range(H + 1)]
dp[0][0] = 1
def pattern(w):
""" 幅wのあみだにおいて、validなものの通り数を返す """
# 例外処理
if w < 0:
return 1
cnt = 0
for i in range(2 ** w):
b = bin(2 ** w + i)[3:]
if '11' not in b:
cnt += 1
return cnt
for i in range(1, H + 1):
for j in range(W):
tmp = 0
# 上からおりてくる
tmp += dp[i - 1][j] * pattern(j - 1) * pattern(W - j - 2) % mod
# 左からおりてくる
if j > 0:
tmp += dp[i - 1][j - 1] * pattern(j - 2) * pattern(W - j - 2) % mod
# 右からおりてくる
if j < W - 1:
tmp += dp[i - 1][j + 1] * pattern(j - 1) * pattern(W - j - 3) % mod
dp[i][j] += tmp
print((dp[H][K - 1] % mod))
| from itertools import product
H, W, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
# dp[i][j]:= 上からi番目, 左からj番目にいる通り数
dp = [[0] * W for i in range(H + 1)]
dp[0][0] = 1
def calc(x):
if x < 0:
return 1
ret = 0
for p in product(['0', '1'], repeat=x):
p = ''.join(p)
if '11' not in p:
ret += 1
return ret
for i in range(1, H + 1):
for j in range(W):
tmp = 0
if j > 0: # 左から
tmp += dp[i - 1][j - 1] * calc(j - 2) * calc(W - j - 2) % mod
# 上から
tmp += dp[i - 1][j] * calc(j - 1) * calc(W - j - 2) % mod
if j + 1 < W: # 右から
tmp += dp[i - 1][j + 1] * calc(j - 1) * calc(W - j - 3) % mod
dp[i][j] = tmp
print((dp[H][K - 1] % mod))
| p03222 |
from itertools import product
H, W, K = list(map(int, input().split()))
mod = 10 ** 9 + 7
# dp[i][j]:= 上からi番目, 左からj番目にいる通り数
dp = [[0] * W for i in range(H + 1)]
dp[0][0] = 1
def calc(x):
if x < 0:
return 1
ret = 0
for p in product(['0', '1'], repeat=x):
p = ''.join(p)
if '11' not in p:
ret += 1
return ret
for i in range(1, H + 1):
for j in range(W):
tmp = 0
if j > 0: # 左から
tmp += dp[i - 1][j - 1] * calc(j - 2) * calc(W - j - 2) % mod
# 上から
tmp += dp[i - 1][j] * calc(j - 1) * calc(W - j - 2) % mod
if j + 1 < W: # 右から
tmp += dp[i - 1][j + 1] * calc(j - 1) * calc(W - j - 3) % mod
dp[i][j] = tmp
print((dp[H][K - 1] % mod))
| H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
def transition(w):
X = [1, 2, 3, 5, 8, 13, 21, 34]
if w >= 0:
return X[w]
else:
return 1
# h行w列に到達する方法
dp = [[0] * W for h in range(H + 1)]
dp[0][0] = 1
for h in range(H):
for w in range(W):
# 真下へ
dp[h + 1][w] += dp[h][w] * (transition(w - 1) * transition(W - w - 2))
dp[h + 1][w] %= MOD
# 右下へ
if w + 1 < W:
dp[h + 1][w + 1] += dp[h][w] * (transition(w - 1) * transition(W - w - 3))
dp[h + 1][w + 1] %= MOD
# 左下へ
if w - 1 >= 0:
dp[h + 1][w - 1] += dp[h][w] * (transition(w - 2) * transition(W - w - 2))
dp[h + 1][w - 1] %= MOD
print((dp[H][K - 1]))
| p03222 |
from itertools import product
H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
dp = [[0] * W for i in range(H + 1)]
dp[0][0] = 1
def calc(w):
if w <= 0:
return 1
ret = 0
for pattern in product([0, 1], repeat=w):
pattern = ''.join(list(map(str, pattern)))
if '11' not in pattern:
ret += 1
return ret
for h in range(H):
for w in range(W):
dp[h + 1][w] = (dp[h + 1][w] + dp[h][w] * calc(w - 1) * calc(W - w - 2)) % MOD
if w + 1 < W:
dp[h + 1][w + 1] = (dp[h + 1][w + 1] + dp[h][w] * calc(w - 1) * calc(W - w - 3) % MOD)
if w - 1 >= 0:
dp[h + 1][w - 1] = (dp[h + 1][w - 1] + dp[h][w] * calc(w - 2) * calc(W - w - 2) % MOD)
print((dp[H][K - 1] % MOD))
| H, W, K = list(map(int, input().split()))
MOD = 10 ** 9 + 7
dp = [[0] * W for i in range(H + 1)]
dp[0][0] = 1
fib = [1, 2, 3, 5, 8, 13, 21, 34]
def calc(w):
if w < 0:
return 1
return fib[w]
for h in range(H):
for w in range(W):
dp[h + 1][w] = (dp[h + 1][w] + dp[h][w] * calc(w - 1) * calc(W - w - 2)) % MOD
if w + 1 < W:
dp[h + 1][w + 1] = (dp[h + 1][w + 1] + dp[h][w] * calc(w - 1) * calc(W - w - 3) % MOD)
if w - 1 >= 0:
dp[h + 1][w - 1] = (dp[h + 1][w - 1] + dp[h][w] * calc(w - 2) * calc(W - w - 2) % MOD)
print((dp[H][K - 1] % MOD))
| p03222 |
import sys
def S(): return sys.stdin.readline().rstrip()
H,W,K = list(map(int,S().split()))
mod = 10**9+7
if W == 1:
print((1))
exit()
fib = [1,1,2,3,5,8,13,21] # fib[i] = i本の縦線に横線を引く方法の数(同じ高さ)
dp = [[0]*(W+1) for _ in range(H+1)] # dp[i][j] = i行目にjに達する横線の引き方
for i in range(H+1):
for j in range(W+1):
if i == 0:
if j == 1:
dp[i][j] = 1
else:
if j == 1:
dp[i][j] = dp[i-1][j]*fib[W-1] + dp[i-1][j+1]*fib[W-2]
dp[i][j] %= mod
elif j == W:
dp[i][j] = dp[i-1][j-1]*fib[W-2] + dp[i-1][j]*fib[W-1]
dp[i][j] %= mod
elif 2 <= j <= W-1:
dp[i][j] = dp[i-1][j-1]*(fib[j-2]*fib[W-j]) + dp[i-1][j]*(fib[j-1]*fib[W-j]) + dp[i-1][j+1]*(fib[j-1]*fib[W-j-1])
dp[i][j] %= mod
print((dp[H][K])) | import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
H,W,K = MI()
mod = 10**9+7
if W == 1:
print((1))
exit()
fib = [1,1,2,3,5,8,13,21,34]
dp = [[0]*(W+1) for _ in range(H+1)]
dp[0][1] = 1
for i in range(1,H+1):
for j in range(1,W+1):
if W == 2:
if j == 1:
dp[i][j] = dp[i-1][j] + dp[i-1][j+1]
dp[i][j] %= mod
else:
dp[i][j] = dp[i-1][j] + dp[i-1][j-1]
dp[i][j] %= mod
else:
if j == 1:
dp[i][j] = dp[i-1][j+1]*fib[W-2] + dp[i-1][j]*fib[W-j]
dp[i][j] %= mod
elif j == W:
dp[i][j] = dp[i-1][j-1]*fib[W-2] + dp[i-1][j]*fib[j-1]
dp[i][j] %= mod
else:
dp[i][j] = dp[i-1][j-1]*fib[j-2]*fib[W-j] + dp[i-1][j+1]*fib[j-1]*fib[W-j-1] + dp[i-1][j]*(fib[W-j]*fib[j-1])
dp[i][j] %= mod
print((dp[H][K]))
| p03222 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split()) #空白あり
def LS2(): return list(sys.stdin.readline().rstrip()) #空白なし
H,W,K = MI()
mod = 10**9+7
if W == 1:
print((1))
exit()
fib = [1,1,2,3,5,8,13,21,34]
dp = [[0]*(W+1) for _ in range(H+1)]
dp[0][1] = 1
for i in range(1,H+1):
for j in range(1,W+1):
if W == 2:
if j == 1:
dp[i][j] = dp[i-1][j] + dp[i-1][j+1]
dp[i][j] %= mod
else:
dp[i][j] = dp[i-1][j] + dp[i-1][j-1]
dp[i][j] %= mod
else:
if j == 1:
dp[i][j] = dp[i-1][j+1]*fib[W-2] + dp[i-1][j]*fib[W-j]
dp[i][j] %= mod
elif j == W:
dp[i][j] = dp[i-1][j-1]*fib[W-2] + dp[i-1][j]*fib[j-1]
dp[i][j] %= mod
else:
dp[i][j] = dp[i-1][j-1]*fib[j-2]*fib[W-j] + dp[i-1][j+1]*fib[j-1]*fib[W-j-1] + dp[i-1][j]*(fib[W-j]*fib[j-1])
dp[i][j] %= mod
print((dp[H][K]))
| import sys
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
H,W,K = MI()
mod = 10**9+7
if W == 1:
print((1))
exit()
fib = [1,1,2,3,5,8,13,21] # fib[i] = i本のあみだくじの、ある列に横線を引く方法の数
dp = [[0]*(W+1) for _ in range(H+1)] # dp[i][j] = i段横線を引いたときに1からKに至るような横線の引き方
dp[0][1] = 1
for i in range(1,H+1):
for j in range(1,W+1):
if j == 1:
dp[i][j] = dp[i-1][j+1]*fib[W-j-1] + dp[i-1][j]*fib[W-j]
dp[i][j] %= mod
elif j == W:
dp[i][j] = dp[i-1][j-1]*fib[j-2] + dp[i-1][j]*fib[j-1]
dp[i][j] %= mod
else:
dp[i][j] = dp[i-1][j-1]*fib[j-2]*fib[W-j] + dp[i-1][j+1]*fib[j-1]*fib[W-j-1] + dp[i-1][j]*fib[W-j]*fib[j-1]
dp[i][j] %= mod
print((dp[H][K]))
| p03222 |
H,W,K=list(map(int,input().split()))
fibo=[1,1,2]
for i in range(W):
fibo.append(fibo[-1]+fibo[-2])
mod=1000000007
def f(H,K):
if H==0:
if K==1:
return 1
else:
return 0
else:
if K==0 or K==W+1:
return 0
else:
return (f(H-1,K)*fibo[K-1]*fibo[W-K]\
+f(H-1,K-1)*fibo[K-2]*fibo[W-K]\
+f(H-1,K+1)*fibo[K-1]*fibo[W-K-1])%mod
print(f(H,K)) | H,W,K=list(map(int,input().split()))
fibo=[1,1,2]
for i in range(W):
fibo.append(fibo[-1]+fibo[-2])
mod=1000000007
f=[[1 if i==1 else 0 for i in range(W+2)]]
for i in range(H):
for j in range(W):
f.append([(f[-1][j]*fibo[j-1]*fibo[W-j]+f[-1][j-1]*fibo[j-2]*fibo[W-j]\
+f[-1][j+1]*fibo[j-1]*fibo[W-j-1])% mod\
if (j>=1 and j<=W) else 0 for j in range(W+2)])
print(f[H][K]) | p03222 |
import sys
MOD = 10 ** 9 + 7
h, w, k = list(map(int, sys.stdin.readline().split()))
def main():
ok = []
for i in range(2 ** (w - 1)):
prev = False
for j in range(w-1):
if i >> j & 1:
if prev:
break
else:
prev = True
else:
prev = False
else:
ok.append(i)
res = [0] * w
res[0] = 1
for _ in range(h):
nex = [0] * w
for i in ok:
j = 0
while j < w:
if i >> j & 1:
nex[j] += res[j+1]
nex[j+1] += res[j]
j += 2
else:
nex[j] += res[j]
j += 1
for j in range(w):
nex[j] %= MOD
res = nex
return res[k-1]
if __name__ == '__main__':
ans = main()
print(ans) | import sys
MOD = 10 ** 9 + 7
h, w, k = list(map(int, sys.stdin.readline().split()))
def main():
if w == 1:
return 1
ok = []
for i in range(2 ** (w - 1)):
prev = False
for j in range(w-1):
if i >> j & 1:
if prev:
break
else:
prev = True
else:
prev = False
else:
ok.append(i)
lcr = [(letter, 0) for letter in 'lcr']
a = [dict(lcr) for _ in range(w)]
for i in ok:
j = 0
while j < w:
if i >> j & 1:
a[j]['r'] += 1
a[j+1]['l'] += 1
j += 2
else:
a[j]['c'] += 1
j += 1
res = [0] * w
res[0] = 1
for _ in range(h):
nex = [0] * w
for j in range(w):
if j == 0:
nex[j] = res[j] * a[j]['c'] + res[j+1] * a[j]['r']
elif j < w - 1:
nex[j] = res[j-1] * a[j]['l'] + res[j] * a[j]['c'] + res[j+1] * a[j]['r']
else:
nex[j] = res[j-1] * a[j]['l'] + res[j] * a[j]['c']
for j in range(w):
nex[j] %= MOD
res = nex
return res[k-1]
if __name__ == '__main__':
ans = main()
print(ans) | p03222 |
MOD = 10**9 + 7
H, W, K = list(map(int, input().split()))
pats = []
for pat in range(1<<(W-1)):
for i in range(W-2):
if pat & (1<<i) and pat & (1<<(i+1)):
break
else:
pats.append(pat*2)
dp = [[0]*W for _ in range(H+1)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
for pat in pats:
L = pat & (1<<j)
R = pat & (1<<(j+1))
if L == 0 and R == 0:
dp[i+1][j] += dp[i][j]
elif L != 0 and R == 0:
dp[i+1][j-1] += dp[i][j]
elif L == 0 and R != 0:
dp[i+1][j+1] += dp[i][j]
for j in range(W):
dp[i+1][j] %= MOD
print((dp[H][K-1]))
| MOD = 10**9 + 7
H, W, K = list(map(int, input().split()))
fibs = [0, 1, 1, 2, 3, 5, 8, 13, 21, 34]
def getFib(i):
return fibs[i+2]
numLs, numCs, numRs = [0]*W, [0]*W, [0]*W
for j in range(W):
numCs[j] = getFib(j-1) * getFib(W-1-j-1)
numLs[j] = getFib(j-2) * getFib(W-1-j-1)
numRs[j] = getFib(j-1) * getFib(W-1-j-2)
dp = [[0]*W for _ in range(H+1)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
dp[i+1][j] += dp[i][j] * numCs[j]
if j > 0:
dp[i+1][j-1] += dp[i][j] * numLs[j]
if j < W-1:
dp[i+1][j+1] += dp[i][j] * numRs[j]
for j in range(W):
dp[i+1][j] %= MOD
print((dp[H][K-1]))
| p03222 |
H, W, K = list(map(int, input().split()))
W2 = W-1
c = [0] * (W2+1)
cnt = 0
MOD = 10**9 + 7
for bit in range(1 << W2):
s0 = bit&1
flg=True
for i in range(1, W2):
if (bit>>i)&1 and s0 == 1:
flg = False
break
s0 = (bit>>i)&1
if flg:
cnt += 1
for i in range(W2):
if (bit >> i)&1:
c[i] += 1
dp = [[0]*W for _ in range(H+1)]
dp[0][0] = 1
for h in range(H):
for i in range(W):
if i != 0:
dp[h+1][i-1] += dp[h][i]*c[i-1]
dp[h+1][i-1] %= MOD
if i != W-1:
dp[h+1][i+1] += dp[h][i]*c[i]
dp[h+1][i+1] %= MOD
dp[h+1][i] += dp[h][i]*(cnt-c[i-1]-c[i])
dp[h+1][i] %= MOD
print((dp[H][K-1])) | H, W, K = list(map(int, input().split()))
MOD, p, cnt = 10**9+7, [0]*W, 0
for bit in range(1<<(W-1)):
s0 = bit&1
flg=True
for w in range(1, W-1):
if (bit>>w)&1 and s0 == 1:flg=False; break
s0 = (bit>>w)&1
if flg:
cnt += 1
for w in range(W - 1):
if (bit >> w)&1:p[w] += 1
dp = [[0]*W for _ in range(H+1)]
dp[0][0] = 1
for h in range(H):
for w in range(W):
if w:
dp[h+1][w-1] += dp[h][w]*p[w-1]
dp[h+1][w-1] %= MOD
if w-(W - 1):
dp[h+1][w+1] += dp[h][w]*p[w]
dp[h+1][w+1] %= MOD
dp[h+1][w]+=dp[h][w]*(cnt-p[w-1]-p[w])
dp[h+1][w]%=MOD
print((dp[H][K-1])) | p03222 |
mod = 10**9+7
h,w,k = list(map(int,input().split()))
k = k-1
dp = [0]*1000 #dp[i]=i個縦棒がある時の横棒の引き方
dp[0]=1
dp[1]=1
dp[2]=2
for i in range(3,1000):
dp[i] = (dp[i-1]+dp[i-2])%mod
#i-1とi番目に横棒を引かないとき、横棒の置き方は1からi-1番目の置き方と同じ
#i-1とi番目に横棒を引くとき、横棒の置き方は1からi-2番目の置き方と同じ（i-1とi-2の間には置けないから）
#→iの横棒の置き方はf(i-1)+f(i-2) ※場合わけにおける組み合わせ総数
dp2=[[0 for j in range(w)] for i in range(h+1)] #上からi下がったところでj番目にいく縦線を引くようなあみだくじの総数
dp2[0][0] = 1
for i in range(h):
for j in range(w):
#dp[i][j]からdp[i+1][j]への遷移が起こる条件は
#j-1とjの間、jとj+1の間に横棒がない
#このような横棒の置き方は
#（縦棒1から縦棒j-1の置き方）*（縦棒j+1からwまでの棒の置き方）
dp2[i+1][j] = (dp2[i+1][j]+dp2[i][j]*dp[j]%mod*dp[w-j-1]%mod)%mod
#dp[i][j]からdp[i+1][j-1]に遷移する条件
#jとj-1の間に横棒がある
#j-1とj-2の間、j+1とjの間に横棒がない
#この置き方は
#（縦棒1から縦棒j-2までの横棒の置き方）* （縦棒jから縦棒wまでの横棒の置き方置き方）
if (j-1>=0):
dp2[i+1][j-1]=(dp2[i+1][j-1]+dp2[i][j]*dp[j-1]%mod*dp[w-j-1]%mod)%mod
#dp[i][j]からdp[i+1][j+1]への遷移が起こる条件は
#j+1とjの間に横棒がある
#jとj-1の間、j+2とj+1の間に横棒がない
#この置き方は
#(縦棒1から縦棒j-1の置き方)*(縦棒j+2*wまでの横棒の置き方)
if (j+1<w):
dp2[i+1][j+1]=(dp2[i+1][j+1]+dp2[i][j]*dp[j]%mod*dp[w-j-2]%mod)%mod
print((dp2[h][k]))
| mod = 10**9+7
h,w,k = list(map(int,input().split()))
fibonacchi =[1, 1, 2, 3, 5, 8, 13, 21, 34]
dp = [[0] * (w + 1) for _ in range(h + 1)]
dp[0][1] = 1
for i in range(h):
for j in range(w+1):
#dp[i][j]からdp[i+1][j-1]に遷移する条件
#jとj-1の間に横棒がある&j-1とj-2の間、j+1とjの間に横棒がない
#この置き方は
#（縦棒1から縦棒j-2までの横棒の置き方）* （縦棒j+1から縦棒wまでの横棒の置き方置き方）
if j >= 2:
dp[i+1][j-1] += (fibonacchi[j-2]*fibonacchi[w-j])*dp[i][j]
dp[i+1][j-1]%=mod
#dp[i][j]からdp[i+1][j+1]への遷移が起こる条件は
#j+1とjの間に横棒がある&jとj-1の間、j+2とj+1の間に横棒がない
#この置き方は
#(縦棒1から縦棒j-1の置き方)*(縦棒j+2*wまでの横棒の置き方)
if j <= w-1:
dp[i+1][j+1] += (fibonacchi[j-1]*fibonacchi[w-j-1])*dp[i][j]
dp[i+1][j+1]%=mod
#dp[i][j]からdp[i+1][j]への遷移が起こる条件は
#j-1とjの間、jとj+1の間に横棒がない
#このような横棒の置き方は
#（縦棒1から縦棒j-1の置き方）*（縦棒j+1からwまでの棒の置き方）
dp[i+1][j] += (fibonacchi[j-1]*fibonacchi[w-j])*dp[i][j]
dp[i+1][j] %=mod
print((dp[h][k]))
| p03222 |
import itertools
h, w, k = list(map(int, input().split()))
if w == 1:
print((1))
exit()
mod = 10**9 + 7
path = [[i, i+1] for i in range(w-1)]
DP = [[0]*(h+1) for _ in range(w)]
DP[0][0] = 1
for height in range(h):
for pos in range(w):
down_unable = {pos}
left_unable = {pos-1, pos}
right_unable = {pos, pos+1}
down_count = 1
left_count = 1
right_count = 1
for pick in range(1, 1 + w//2):
all_pattern = list(itertools.combinations(path, pick))
for pattern in all_pattern:
check = set()
possible = True
for a, b in pattern:
if check & {a, b}:
possible = False
break
check |= {a, b}
if not possible:
continue
if not check & down_unable:
down_count += 1
if not check & left_unable:
left_count += 1
if not check & right_unable:
right_count += 1
if pos == 0:
DP[pos][height+1] += DP[pos][height] * down_count % mod
DP[pos+1][height+1] += DP[pos][height] * right_count % mod
elif pos == w-1:
DP[pos][height+1] += DP[pos][height] * down_count % mod
DP[pos-1][height+1] += DP[pos][height] * left_count % mod
else:
DP[pos][height+1] += DP[pos][height] * down_count % mod
DP[pos+1][height+1] += DP[pos][height] * right_count % mod
DP[pos-1][height+1] += DP[pos][height] * left_count % mod
print((DP[k-1][h] % mod))
| import itertools
h, w, k = list(map(int, input().split()))
DP = [0] * w
DP[0] = 1
mod = 10**9 + 7
patterns = []
for line_count in range(w):
candidates = itertools.combinations(list(range(w-1)), line_count)
for pattern in candidates:
usable = True
prev = 10
for num in pattern:
if num == prev + 1:
usable = False
break
else:
prev = num
if usable:
patterns.append(pattern)
for i in range(h):
next_DP = [0] * w
for pattern in patterns:
straight = set(range(w))
for line in pattern:
next_DP[line] += DP[line+1]
next_DP[line] %= mod
next_DP[line+1] += DP[line]
next_DP[line+1] % mod
straight.discard(line)
straight.discard(line+1)
for line in straight:
next_DP[line] += DP[line]
next_DP[line] %= mod
DP = next_DP.copy()
ans = DP[k-1]
print((ans%mod)) | p03222 |
l=[[] for i in range(9)]
l[1]=[""]
l[2]=["0","1"]
for i in range(3,9):
for s in l[i-1]:
l[i].append("0"+s)
if s[0]!="1":
l[i].append("1"+s)
mod=1000000007
s=input().split()
h,w,k=int(s[0]),int(s[1]),int(s[2])
res=[[0]*(w) for i in range(h+1)]
res[0][0]=1
for i in range(h):
for s in l[w]:
s="0"+s+"0" #どの縦棒から見ても左右が参照できるように両端に0をつけておく
for j in range(w):
if s[j]=="0" and s[j+1]=="0": #直進
res[i+1][j]+=res[i][j]
res[i+1][j]%=mod
if s[j]=="0" and s[j+1]=="1": #左列に移る
res[i+1][j+1]+=res[i][j]
res[i+1][j+1]%=mod
if s[j]=="1" and s[j+1]=="0": #右列に移る
res[i+1][j-1]+=res[i][j]
res[i+1][j-1]%=mod
print((res[h][k-1])) | l=[[] for i in range(9)]
l[1]=[""]
l[2]=["0","1"]
for i in range(3,9):
for s in l[i-1]:
l[i].append("0"+s)
if s[0]!="1":
l[i].append("1"+s)
mod=1000000007
s=input().split()
h,w,k=int(s[0]),int(s[1]),int(s[2])
dp=[[0]*(w) for i in range(h+1)]
dp[0][0]=1
for i in range(h):
for s in l[w]:
s="0"+s+"0" #どの縦棒から見ても左右が参照できるように両端に0をつけておく
for j in range(w):
if s[j]=="0" and s[j+1]=="0": #直進
dp[i+1][j]+=dp[i][j]
dp[i+1][j]%=mod
if s[j]=="0" and s[j+1]=="1": #左列に移る
dp[i+1][j+1]+=dp[i][j]
dp[i+1][j+1]%=mod
if s[j]=="1" and s[j+1]=="0": #右列に移る
dp[i+1][j-1]+=dp[i][j]
dp[i+1][j-1]%=mod
print((dp[h][k-1])) | p03222 |
H,W,K=list(map(int,input().split()))
mod=10**9+7
fib=[1,1,2,3,5,8,13,21]
from functools import lru_cache
@lru_cache(maxsize=None)
def dfs(cur,now):
if cur==H:
if now==K:
return 1
else:
return 0
elif now==1:
if W==1:
return dfs(cur+1,1)%mod
else:
return (fib[W-1]*dfs(cur+1,1)+fib[W-2]*dfs(cur+1,2))%mod
elif now==W:
return (fib[W-2]*dfs(cur+1,W-1)+fib[W-1]*dfs(cur+1,W))%mod
else:
return (fib[W-now]*fib[now-2]*dfs(cur+1,now-1)+fib[W-now]*fib[now-1]*dfs(cur+1,now)+fib[W-now-1]*fib[now-1]*dfs(cur+1,now+1))%mod
print((dfs(0,1))) | H,W,K=list(map(int,input().split()))
mod=10**9+7
fib=[1,1,2,3,5,8,13,21]
memo=[[None]*W for _ in range(H+1)]
def dfs(cur,now):
if cur==H:
if now==K:
return 1
else:
return 0
elif now==1:
if W==1:
if memo[cur+1][0]==None:
memo[cur+1][0]=dfs(cur+1,1)%mod
return memo[cur+1][0]
else:
if memo[cur+1][0]==None:
memo[cur+1][0]=dfs(cur+1,1)%mod
if memo[cur+1][1]==None:
memo[cur+1][1]=dfs(cur+1,2)%mod
return (fib[W-1]*memo[cur+1][0]+fib[W-2]*memo[cur+1][1])%mod
elif now==W:
if memo[cur+1][W-2]==None:
memo[cur+1][W-2]=dfs(cur+1,W-1)%mod
if memo[cur+1][W-1]==None:
memo[cur+1][W-1]=dfs(cur+1,W)%mod
return (fib[W-2]*memo[cur+1][W-2]+fib[W-1]*memo[cur+1][W-1])%mod
else:
if memo[cur+1][now-2]==None:
memo[cur+1][now-2]=dfs(cur+1,now-1)%mod
if memo[cur+1][now-1]==None:
memo[cur+1][now-1]=dfs(cur+1,now)%mod
if memo[cur+1][now]==None:
memo[cur+1][now]=dfs(cur+1,now+1)%mod
return (fib[W-now]*fib[now-2]*memo[cur+1][now-2]+fib[W-now]*fib[now-1]*memo[cur+1][now-1]+fib[W-now-1]*fib[now-1]*memo[cur+1][now])%mod
print((dfs(0,1))) | p03222 |
MOD = 10 ** 9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
# 0-indexed
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
# dp[h][k]
# h段のあみだくじで横線kに到達する本数
for h in range(H):
# h: 移動前の高さ
for b in range(1 << (W - 1)):
# 各段はW - 1箇所の横線配置位置をもつ
if '11' in bin(b): continue
# 横線同士がつながっているケースは不適
goto = [i for i in range(W)]
# goto[i]: 縦線iからの移動先
for j in range(W - 1):
# j: 横線の番号 かつ 横線の左側の縦線の番号
if (b >> j) & 1 == 1:
# 横線が存在する場合
goto[j], goto[j + 1] = goto[j + 1], goto[j]
# gotoで横線配置bによる移動を表現する
for i in range(W):
# i: 移動前の縦線
dp[h + 1][goto[i]] += dp[h][i]
dp[h + 1][goto[i]] %= MOD
print((dp[H][K]))
| def f(n):
# 縦線n本で構成できる横線の組み合わせ
if n <= 1: return 1
return f(n - 1) + f(n - 2)
MOD = 10 ** 9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
# 0-indexed
dp = [[0 for _ in range(W)] for _ in range(H + 1)]
dp[0][0] = 1
# dp[h][k]
# h段のあみだくじで横線kに到達する本数
for h in range(H):
# h: 移動前の高さ
for i in range(W):
# i: 移動前の縦線
if i >= 1:
dp[h + 1][i - 1] += dp[h][i] * f(i - 1) * f(W - 1 - i)
dp[h + 1][i - 1] %= MOD
dp[h + 1][i] += dp[h][i] * f(i) * f(W - 1 - i)
dp[h + 1][i] %= MOD
if i < W - 1:
dp[h + 1][i + 1] += dp[h][i] * f(i) * f(W - 2 - i)
dp[h + 1][i + 1] %= MOD
print((dp[H][K]))
| p03222 |
mod = 10 ** 9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
dp = [0] * W
dp[0] = 1
ndp = [0] * W
for r in range(H):
for i in range(1 << (W - 1)):
if '11' in bin(i): continue
perm = [i for i in range(W)]
for j in range(W - 1):
if (i >> j) & 1:
perm[j], perm[j + 1] = perm[j + 1], perm[j]
for j in range(W):
next_line = perm[j]
ndp[next_line] += dp[j]
ndp[next_line] %= mod
dp = ndp.copy()
ndp = [0] * W
print((dp[K]))
| mod = 10 ** 9 + 7
h, w, k = list(map(int, input().split()))
k -= 1
dp = [0] * w
dp[0] = 1
ndp = [0] * w
for _ in range(h):
for bits in range(1 << w - 1):
if '11' in bin(bits): continue
to = list(range(w))
for i in range(w - 1):
if (bits >> i) & 1:
to[i], to[i + 1] = to[i + 1], to[i]
for i in range(w):
ndp[to[i]] += dp[i]
ndp[to[i]] %= mod
dp = ndp
ndp = [0] * w
print((dp[k]))
| p03222 |
h,w,kk = list(map(int,input().split()))
dp = [[[] for j in range(w)] for i in range(h+1)]
# dp[i][j]
# 高さiにおいて点jに行き得る通り数
for i in range(h+1):
for j in range(w):
dp[i][j] = 0
dp[0][0]=1
mod = 1000000007
for i in range(1,h+1):
for j in range(1<<(w-1)):
yoko = [False for loo in range(w)]
for k in range((w-1)):
yoko[k] = True if ((j>>k)&1) else False
ok = True
for l in range(w-2):
if(yoko[l]==True and yoko[l+1]==True):
ok = False
if(not ok):
continue
for l in range(w):
if(l==0):
if(yoko[l]):
dp[i][l] += dp[i-1][l+1]
else:
dp[i][l] += dp[i-1][l]
dp[i][l]%=mod
continue
if(l==w-1):
if(yoko[l-1]):
dp[i][l] += dp[i-1][l-1]
else:
dp[i][l] += dp[i-1][l]
dp[i][l]%=mod
continue
if(yoko[l-1] or yoko[l]):
if(yoko[l-1]):
dp[i][l]+= dp[i-1][l-1]
else:
dp[i][l]+= dp[i-1][l+1]
else:
dp[i][l] += dp[i-1][l]
dp[i][l]%=mod
print((dp[h][kk-1])) | mod = 10**9+7
h,w,k = list(map(int,input().split()))
dp =[[0]*w for _ in range(h+1)]
dp[0][0]=1
fibo=[1]*10
for i in range(2,10):
fibo[i] = fibo[i-2]+fibo[i-1]
for i in range(1,h+1):
for j in range(w):
dp[i][j] = dp[i-1][j]*fibo[j]*fibo[w-j-1]%mod
if(j>0):
dp[i][j] += dp[i-1][j-1]*fibo[j-1]*fibo[w-j-1]%mod
dp[i][j] %= mod
if(j<w-1):
dp[i][j] += dp[i-1][j+1]*fibo[j]*fibo[w-j-2]%mod
dp[i][j]%=mod
print((dp[h][k-1])) | p03222 |
# -*- coding: utf-8 -*-
H, W, K = list(map(int,input().split()))
fibonacci = [1,1,2,3,5,8,13,21] # W <= 8なのでこれだけでいい
Amida = [ [0] * W for h in range(H+1)]
for h in range(H+1):
if W == 1:
break
for w in range(W):
if h == 0:
if w == 0:
Amida[h][w] = 1
else:
break
elif w == 0:
Amida[h][w] = fibonacci[W-2] * Amida[h-1][w+1] + fibonacci[W-1] * Amida[h-1][w]
elif w == W-1:
Amida[h][w] = fibonacci[W-2] * Amida[h-1][w-1] + fibonacci[W-1] * Amida[h-1][w]
else:
Amida[h][w] += (fibonacci[w-1] * fibonacci[W-w-1] * Amida[h-1][w-1])
Amida[h][w] += (fibonacci[w] * fibonacci[W-w-1] * Amida[h-1][w])
Amida[h][w] += fibonacci[w] * fibonacci[W-w-2] * Amida[h-1][w+1]
Amida[h][w] = Amida[h][w] % 1000000007
if W == 1:
if K == 1:
print((1))
else:
print((0))
else:
print((Amida[H][K-1])) | H, W, K = list(map(int,input().split()))
mod = 1000000007
fibonacci = [1,1,2,3,5,8,13,21] # W <= 8なのでこれだけでいい
Amida = [ [0] * W for h in range(H+1)]
for h in range(H+1):
if W == 1:
break
for w in range(W):
if h == 0:
if w == 0:
Amida[h][w] = 1
else:
break
elif w == 0:
Amida[h][w] = fibonacci[W-2] * Amida[h-1][w+1] + fibonacci[W-1] * Amida[h-1][w]
elif w == W-1:
Amida[h][w] = fibonacci[W-2] * Amida[h-1][w-1] + fibonacci[W-1] * Amida[h-1][w]
else:
Amida[h][w] += (fibonacci[w-1] * fibonacci[W-w-1] * Amida[h-1][w-1])
Amida[h][w] += (fibonacci[w] * fibonacci[W-w-1] * Amida[h-1][w])
Amida[h][w] += fibonacci[w] * fibonacci[W-w-2] * Amida[h-1][w+1]
Amida[h][w] = Amida[h][w] % mod
if W == 1:
if K == 1:
print((1))
else:
print((0))
else:
print((Amida[H][K-1])) | p03222 |
#!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] = SR()
return l
mod = 1000000007
#A
def A():
return
#B
def B():
return
#C
def C():
n,m = LI()
v = LIR(m)
for i in range(m):
v[i] = [v[i][0],v[i][1],i]
v.sort(key = lambda x:x[1])
f = [0 for i in range(n+1)]
ans = [None for i in range(m)]
for p,y,i in v:
f[p] += 1
s = "{:0>6}".format(p)
t = "{:0>6}".format(f[p])
ans[i] = s+t
for i in ans:
print(i)
#D
def D():
h,w,k = LI()
dp = [[0 for i in range(w)] for j in range(h+1)]
dp[0][0] = 1
p = [1 for i in range(w+1)]
for i in range(w):
p[i+1] = p[i]*2
l = [i for i in range(p[w-1])]
i = 0
while i < len(l):
a = l[i]
for j in range(w):
if a&p[j] and a&p[j+1]:
l.pop(i)
i -= 1
break
i += 1
d = [[0 for i in range(3)] for j in range(w)]
for j in range(w):
for s in l:
if 0 < j < w-1:
if p[j]&s:
d[j][2] += 1
elif p[j-1]&s:
d[j][0] += 1
else:
d[j][1] += 1
elif j == 0:
if p[j]&s:
d[j][2] += 1
else:
d[j][1] += 1
else:
if p[j-1]&s:
d[j][0] += 1
else:
d[j][1] += 1
for i in range(h):
for j in range(w):
dp[i+1][j] += d[j][1]*dp[i][j]
dp[i+1][j] %= mod
if j > 0:
dp[i+1][j-1] += d[j][0]*dp[i][j]
dp[i+1][j-1] %= mod
if j < w-1:
dp[i+1][j+1] += d[j][2]*dp[i][j]
dp[i+1][j+1] %= mod
print((dp[h][k-1]))
#E
def E():
return
#F
def F():
return
#G
def G():
return
#H
def H():
return
#Solve
if __name__ == "__main__":
D()
| #!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
res = list(sys.stdin.readline())
if res[-1] == "\n":
return res[:-1]
return res
def IR(n):
return [I() for i in range(n)]
def LIR(n):
return [LI() for i in range(n)]
def SR(n):
return [S() for i in range(n)]
def LSR(n):
return [LS() for i in range(n)]
sys.setrecursionlimit(1000000)
mod = 1000000007
def solve():
h,w,k = LI()
dp = [[0]*w for _ in range(h+1)]
dp[0][0] = 1
k -= 1
f = [1,1]
for i in range(w):
f.append(f[-1]+f[-2])
for i in range(h):
ni = i+1
for j in range(w):
dpj = dp[i][j]
nj = j+1
if nj < w:
l = f[j]
r = f[w-1-nj]
dp[ni][nj] += l*r*dpj%mod
l = f[j]
r = f[w-1-j]
dp[ni][j] += l*r*dpj%mod
nj = j-1
if nj >= 0:
l = f[nj]
r = f[w-1-j]
dp[ni][nj] += l*r*dpj%mod
print((dp[h][k]%mod))
return
#Solve
if __name__ == "__main__":
solve()
| p03222 |
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
H, W, K = lr()
MOD = 10 ** 9 + 7
dp = [[0] * W for _ in range(H+1)]
dp[0][0] = 1
ladder = [[0] * 2 for _ in range(15)] #あえて多めに用意
ladder[1][0] = 1
for i in range(2, 9):
ladder[i][0] = ladder[i-1][0] + ladder[i-1][1]
ladder[i][1] = ladder[i-1][0]
ladder = [max(1, x+y) for x, y in ladder]
for i in range(1, H+1):
for j in range(W):
dp[i][j] += dp[i-1][j] * ladder[W-j-1] * ladder[j]
if j > 0:
dp[i][j] += dp[i-1][j-1] * ladder[W-j-1] * ladder[j-1]
if j < W-1:
dp[i][j] += dp[i-1][j+1] * ladder[W-j-2] * ladder[j]
dp[i][j] %= MOD
print((dp[H][K-1] % MOD))
# 52 | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
MOD = 10 ** 9 + 7
H, W, K = lr()
cases = [1] * 10 # 縦棒i本で何通りの横棒の書き方があるか(0本含む)
cases[-1] = 0
for i in range(2, 9):
cases[i] = cases[i-2] + cases[i-1]
dp = [0] * W
dp[0] = 1
for i in range(H):
prev = dp[:]
for j in range(W):
left = j; right = W-(j+1)
dp[j] *= cases[left] * cases[right]
if j > 0:
dp[j] += prev[j-1] * cases[left-1] * cases[right]
if j < W-1:
dp[j] += prev[j+1] * cases[left] * cases[right-1]
dp[j] %= MOD
answer = dp[K-1] % MOD
print(answer)
# 19 | p03222 |
a,b,c=list(map(int,input().split()))
e=0
f=[[1,1]]
k=[[1,1,1],[2,1,1,1,2],[3,2,2,1,2,2,3],[5,3,3,2,4,2,3,3,5],[8,5,5,3,6,4,6,3,5,5,8],[12,8,8,5,10,6,9,6,10,5,8,8,12],[21,13,13,8,16,10,15,9,15,10,16,8,13,13,21]]
if b==1:
print((1))
else:
d=k[b-2]
for i in range(0,a):
l=len(f)
for j in range(0,l):
f.append([f[j][0],f[j][1]*d[2*(f[j][0]-1)]])
if f[j][0]-1>0 and f[j][0]-1>=c-(a-i):
f.append([f[j][0]-1,f[j][1]*d[1+2*(f[j][0]-2)]])
if f[j][0]+1<=b and f[j][0]+1<=c+(a-i):
f.append([f[j][0]+1,f[j][1]*d[2*(f[j][0]-1)+1]])
j+=1
else:
del f[:l]
else:
for i in range(0,len(f)):
if f[i][0]==c:
e+=f[i][1]
print((e%(10**9+7))) | a,b,c=list(map(int,input().split()))
s=[[0]*b for i in range(a+1)]
s[0][0]=1
k=[[1,1,1],[2,1,1,1,2],[3,2,2,1,2,2,3],[5,3,3,2,4,2,3,3,5],[8,5,5,3,6,4,6,3,5,5,8],[13,8,8,5,10,6,9,6,10,5,8,8,13],[21,13,13,8,16,10,15,9,15,10,16,8,13,13,21]]
if b==1:
print((1))
elif c-a>=2:
print((0))
else:
d=k[b-2]
for i in range(1,a+1):
s[i][b-1]=s[i-1][b-1]*d[2*(b-1)]+s[i-1][b-2]*d[2*(b-1)-1]
for j in range(0,b-1):
if j==0:
s[i][0]=s[i-1][0]*d[0]+s[i-1][1]*d[1]
else:
s[i][j]=s[i-1][j-1]*d[2*j-1]+s[i-1][j]*d[2*j]+s[i-1][j+1]*d[2*j+1]
print((s[a][c-1]%(10**9+7))) | p03222 |
# ABC 113 D
MOD = 7 + 10**9
H, W, K = list(map(int,input().split()))
dp = [[0 for k in range(W)] for l in range(H+1)]
dp[0][0] = 1
for i in range(H):
for j in range(W):
for k in range(1<<(W-1)):
f = 1
for l in range(W-2):
if (k>>l)&1 and (k>>(l+1))&1:
f = 0
if f:
if 0<j and (k>>(j-1))&1:
dp[i+1][j-1] += dp[i][j]
dp[i+1][j-1] %= MOD
elif j <= W-2 and (k>>j)&1:
dp[i+1][j+1] += dp[i][j]
dp[i+1][j+1] %= MOD
else:
dp[i+1][j] += dp[i][j]
dp[i+1][j] %= MOD
print((dp[H][K-1]))
| MOD = 10**9 + 7
H, W, K = list(map(int,input().split()))
dp = [[0 for k in range(W)] for l in range(H+1)]
dp[0][0] = 1
A = [] # ありうる横棒のリスト
for b in range(2**(W-1)):
if "11" not in bin(b):
A.append(bin(b)[2:].zfill(W-1))
for k in range(H):
for e in A:
for i in range(W):
if i < W-1 and e[i] == "1": # 右に行くパターン
dp[k+1][i+1] += dp[k][i]
dp[k+1][i+1] %= MOD
elif i >= 1 and e[i-1] == "1": # 左に行くパターン
dp[k+1][i-1] += dp[k][i]
dp[k+1][i-1] %= MOD
else:
dp[k+1][i] += dp[k][i]
dp[k+1][i] %= MOD
print((dp[H][K-1]))
| p03222 |
from collections import defaultdict
A = [1, 2, 3, 5, 8, 13, 21, 34]
MOD = 10**9 + 7
H, W, K = list(map(int, input().split()))
K -= 1
if W == 0:
print((1))
exit()
dp = [[0] * W for _ in range(H + 1)]
dp[0][0] = 1
for i in range(1, H + 1):
for j in range(i + 1):
for k in [-1, 0, 1]:
if not 0 <= j + k < W: continue
if not 0 <= j < W: continue
if k == -1:
left = max(0, j - 1 - 1)
right = max(0, W - j - 2)
elif k == 0:
left = max(0, j - 1)
right = max(0, W - j - 2)
elif k == 1:
left = max(0, j - 1)
right = max(0, W - j - 2 - 1)
dp[i][j] += dp[i - 1][j + k] * A[left] * A[right]
print((dp[H][K] % MOD)) | A = [1, 2, 3, 5, 8, 13, 21]
MOD = 10**9 + 7
H, W, K = list(map(int, input().split()))
if W == 0:
print((1))
exit()
dp = [[0] * W for _ in range(H + 1)]
dp[0][0] = 1
for i in range(1, H + 1):
for j in range(i + 1):
for k in [-1, 0, 1]:
if not 0 <= j + k < W: continue
if not 0 <= j < W: continue
if k == -1:
left = max(0, j - 1 - 1)
right = max(0, W - j - 2)
elif k == 0:
left = max(0, j - 1)
right = max(0, W - j - 2)
elif k == 1:
left = max(0, j - 1)
right = max(0, W - j - 2 - 1)
dp[i][j] += dp[i - 1][j + k] * A[left] * A[right]
dp[i][j] %= MOD
print((dp[H][K - 1])) | p03222 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
h,w,k = li()
MOD = 10**9+7
cnt = [[0 for _ in range(w)] for _ in range(h+1)]
cnt[0][0] = 1
nex_list = []
for i in range(1<<(w-1)):
if not "11" in bin(i)[2:]:
nex_list.append(i)
for hi in range(1,h+1):
for bit in nex_list:
changed = [0]*w
for i, b in enumerate(bin(bit)[2:].zfill(w-1)):
if b == "1":
cnt[hi][i] += cnt[hi-1][i+1]
cnt[hi][i+1] += cnt[hi-1][i]
changed[i] = 1
changed[i+1] = 1
for j,c in enumerate(changed):
if c == 0:
cnt[hi][j] += cnt[hi-1][j]
for wj in range(w):
cnt[hi][wj] %= MOD
print((cnt[h][k-1]))
| import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
h,w,k = li()
k -= 1
MOD = 10**9 + 7
# 遷移行列
if w > 1:
matrix = [[0]*w for _ in range(w)]
for num in range(1 << (w-1)):
if "11" in bin(num):
continue
ex = False
for i, bit in enumerate(bin(num)[2:].zfill(w-1)):
if bit == "1":
ex = True
matrix[i][i+1] += 1
matrix[i+1][i] += 1
elif ex:
ex = False
else:
matrix[i][i] += 1
if not ex:
matrix[w-1][w-1] += 1
# 適用
dp = [1] + [0]*(w-1)
for hi in range(h):
nex = [0]*w
for wj in range(w):
for wk in range(w):
nex[wj] += matrix[wj][wk] * dp[wk]
nex[wj] %= MOD
dp = nex
print((dp[k]))
else:
print((1)) | p03222 |
h, w, K = list(map(int, input().split()))
mod = 10**9+7
dp = [[0] * w for _ in range(h+1)]
dp[0][0] = 1
for i in range(1, h+1):
for j in range(w):
left, center, right = 0, 0, 0
for k in range(2**(w-1)):
invalid = False
for l in range(1, w-1):
if k >> l & 1 and k >> (l-1) & 1:
invalid = True
if invalid:
continue
no_line = True
if j > 0:
if k >> (j-1) & 1:
left += 1
no_line = False
if j < w-1:
if k >> j & 1:
right += 1
no_line = False
if no_line:
center += 1
if j > 0:
dp[i][j] += dp[i-1][j-1] * left
if j < w-1:
dp[i][j] += dp[i-1][j+1] * right
dp[i][j] += dp[i-1][j] * center
dp[i][j] %= mod
print((dp[h][K-1]))
| H, W, K = list(map(int, input().split()))
mod = 10**9 + 7
dp = [[0] * W for _ in range(H + 1)]
dp[0][0] = 1
def fib(n):
if n <= 1:
return 1
return fib(n-1) + fib(n-2)
for i in range(1, H+1):
for j in range(W):
left = j
right = W - j - 1
dp[i][j] = dp[i-1][j] * fib(left) * fib(right)
if j > 0:
dp[i][j] += dp[i-1][j-1] * fib(left-1) * fib(right)
if j < W-1:
dp[i][j] += dp[i-1][j+1] * fib(left) * fib(right - 1)
dp[i][j] %= mod
print((dp[-1][K-1])) | p03222 |
h,w,k=list(map(int,input().split()));p=[sum(('11'in str(bin(j)))^1for j in range(1<<i))for i in range(8)];d=[w*[0]for _ in[0]*-~h];d[0][0]=1
for i in range(h):
b=d[i]
for j in range(w):
t=u=D=0
if j:t=p[max(0,j-2)]*p[max(0,w-j-2)];D=b[j-1]*t
if j<w-1:u=p[max(0,j-1)]*p[max(0,w-j-3)];D+=b[j+1]*u
d[i+1][j]=(b[j]*(p[w-1]-t-u)+D)%(10**9+7)
print((d[-1][k-1])) | h,w,k=list(map(int,input().split()))
p=[sum(('11'in str(bin(j)))^1for j in range(1<<i))for i in range(8)]
dp=[w*[0]for _ in[0]*-~h]
dp[0][0]=1
for i in range(1,h+1):
for j in range(w):
t=u=0
if j:
t=p[max(0,j-2)]*p[max(0,w-j-2)]
dp[i][j]+=dp[i-1][j-1]*t
if j<w-1:
u=p[max(0,j-1)]*p[max(0,w-j-3)]
dp[i][j]+=dp[i-1][j+1]*u
dp[i][j]=(dp[i][j]+dp[i-1][j]*(p[w-1]-t-u))%(10**9+7)
print((dp[-1][k-1])) | p03222 |
H,W,K = list(map(int,input().split()))
K -= 1
MOD = 10**9+7
dp = [[0]*W for i in range(H+1)]
dp[0][0] = 1
for i in range(H):
for b in range(2**(W-1)):
if '11' in bin(b): continue
b *= 2
for j in range(W):
if b&(1<<j):
dp[i+1][j-1] += dp[i][j]
dp[i+1][j-1] %= MOD
elif b&(1<<(j+1)):
dp[i+1][j+1] += dp[i][j]
dp[i+1][j+1] %= MOD
else:
dp[i+1][j] += dp[i][j]
dp[i+1][j] %= MOD
print((dp[-1][K]))
| H,W,K = list(map(int,input().split()))
MOD = 10**9+7
if W == 1:
print((1))
exit()
dp = [[0]*W for i in range(H+1)]
dp[0][0] = 1
for i in range(H):
for b in range(2**(W-1)):
if '11' in bin(b): continue
b *= 2
for j in range(W):
if b&(1<<j):
dp[i+1][j-1] += dp[i][j]
elif b&(1<<(j+1)):
dp[i+1][j+1] += dp[i][j]
else:
dp[i+1][j] += dp[i][j]
print((dp[-1][K-1] % MOD)) | p03222 |
H,W,K = list(map(int,input().split()))
amida = [0 for i in range(8)]
amida[0]=1
amida[1]=2
amida[2]=3
amida[3]=5
amida[4]=8
amida[5]=13
amida[6]=21
amida[7]=34
def amida_num(k,l):
return amida[max(k,0)]*amida[max(l,0)]
dp=[[0 for i in range(W)] for j in range(H+1)]
dp[0][0] = 1
if W!=1:
for i in range(1,H+1):
for j in range(W):
if j==0:
dp[i][j]=dp[i-1][j+1]*amida_num(0,W-3) + dp[i-1][j]* amida_num(0,W-2)
elif j==W-1:
dp[i][j]=dp[i-1][j-1]*amida_num(0,W-3) + dp[i-1][j]* amida_num(0,W-2)
else:
dp[i][j]=dp[i-1][j-1]*amida_num(j-2,W-j-2) + dp[i-1][j]*amida_num(j-1,W-j-2) + dp[i-1][j+1]*amida_num(j-1,W-j-3)
print((dp[H][K-1]%(10**9+7)))
else:
print((1)) | H,W,K=list(map(int,input().split()))
r = 10**9 + 7
dp=[[0 for i in range(W)] for j in range(H+1)]
dp[0][0]=1
num = [1,1,2,3,5,8,13,21]
if W!=1:
for i in range(H):
for j in range(W):
if j==0:
dp[i+1][j]=(num[W-1]*dp[i][j]+num[W-2]*dp[i][j+1])%r
elif j==W-1:
dp[i+1][j]=(num[W-1]*dp[i][j]+num[W-2]*dp[i][j-1])%r
else:
dp[i+1][j]=(num[j]*num[W-j-1]*dp[i][j]+num[j-1]*num[W-j-1]*dp[i][j-1]+num[j]*num[W-j-2]*dp[i][j+1])%r
print((dp[H][K-1]))
else:
print((1))
| p03222 |
import itertools
def amida_counter(H_i_amida_list):
counter = 0
for amida_bin in range(2**len(H_i_amida_list)):
if (("11" in format(amida_bin, "b")) == False):
counter += 1
return counter
def amida_number(left_amida, right_amida):
left_counter = amida_counter(left_amida) if(len(left_amida) > 0) else 1
right_counter = amida_counter(right_amida) if(len(right_amida) > 0) else 1
return (left_counter * right_counter)
def X_amida_number(W, W_i):
x_amida = "0" * (W - 1)
left_x_amida = x_amida[:(W_i-2)] if(W_i-2 >= 0) else ""
right_x_amida = x_amida[(W_i+1):]
return amida_number(left_x_amida, right_x_amida)
def Y_amida_number(W, W_i):
y_amida = "0" * (W - 1)
left_y_amida = y_amida[:W_i-1] if(W_i-1 >= 0) else ""
right_y_amida = y_amida[W_i+1:]
return amida_number(left_y_amida, right_y_amida)
def Z_amida_number(W, W_i):
z_amida = "0" * (W - 1)
left_z_amida = z_amida[:W_i-1] if(W_i-1 >= 0) else ""
right_z_amida = z_amida[W_i+2:]
return amida_number(left_z_amida, right_z_amida)
H, W, K = list(map(int, input().split()))
seed_dp_array = [0 for i in range(W)]
dp_array = [list(seed_dp_array) for i in range(H + 1)]
dp_array[0][0] = 1
for H_i, W_i in itertools.product(list(range(1, H + 1)), list(range(W))):
if (W_i == 0):
if(W == 1):
dp_array[H_i][0] = dp_array[H_i - 1][W_i] * Y_amida_number(W, W_i)
else:
dp_array[H_i][0] = dp_array[H_i - 1][W_i] * Y_amida_number(W, W_i) + dp_array[H_i - 1][W_i + 1] * Z_amida_number(W, W_i)
elif (W_i == (W - 1)):
dp_array[H_i][W - 1] = dp_array[H_i - 1][W_i - 1] * X_amida_number(W, W_i) + dp_array[H_i - 1][W_i] * Y_amida_number(W, W_i)
else:
dp_array[H_i][W_i] = dp_array[H_i - 1][W_i - 1] * X_amida_number(W, W_i) + dp_array[H_i - 1][W_i] * Y_amida_number(W, W_i) + dp_array[H_i - 1][W_i + 1] * Z_amida_number(W, W_i)
print((dp_array[H][K - 1] % 1000000007)) | import itertools
def amida_counter(H_i_amida_list):
counter = 0
for amida_bin in range(2**len(H_i_amida_list)):
if (("11" in format(amida_bin, "b")) == False):
counter += 1
return counter
def amida_number(left_amida, right_amida):
left_counter = amida_counter(left_amida) if(len(left_amida) > 0) else 1
right_counter = amida_counter(right_amida) if(len(right_amida) > 0) else 1
return (left_counter * right_counter)
def X_amida_number(W, W_i):
x_amida = "0" * (W - 1)
left_x_amida = x_amida[:(W_i-2)] if(W_i-2 >= 0) else ""
right_x_amida = x_amida[(W_i+1):]
return amida_number(left_x_amida, right_x_amida)
def Y_amida_number(W, W_i):
y_amida = "0" * (W - 1)
left_y_amida = y_amida[:W_i-1] if(W_i-1 >= 0) else ""
right_y_amida = y_amida[W_i+1:]
return amida_number(left_y_amida, right_y_amida)
def Z_amida_number(W, W_i):
z_amida = "0" * (W - 1)
left_z_amida = z_amida[:W_i-1] if(W_i-1 >= 0) else ""
right_z_amida = z_amida[W_i+2:]
return amida_number(left_z_amida, right_z_amida)
def amida_all(amida_list, W):
for i, j in itertools.product(list(range(W)), list(range(3))):
if(j == 0):
amida_list[i][j] = X_amida_number(W, i)
elif(j == 1):
amida_list[i][j] = Y_amida_number(W, i)
else:
amida_list[i][j] = Z_amida_number(W, i)
return amida_list
H, W, K = list(map(int, input().split()))
amida_list = [[0]*3 for i in range(W)]
amida_list = amida_all(amida_list, W)
seed_dp_array = [0 for i in range(W)]
dp_array = [list(seed_dp_array) for i in range(H + 1)]
dp_array[0][0] = 1
for H_i, W_i in itertools.product(list(range(1, H + 1)), list(range(W))):
if (W_i == 0):
if(W == 1):
dp_array[H_i][0] = dp_array[H_i - 1][W_i] * amida_list[W_i][1]
else:
dp_array[H_i][0] = dp_array[H_i - 1][W_i] * amida_list[W_i][1] + dp_array[H_i - 1][W_i + 1] * amida_list[W_i][2]
elif (W_i == (W - 1)):
dp_array[H_i][W - 1] = dp_array[H_i - 1][W_i - 1] * amida_list[W_i][0] + dp_array[H_i - 1][W_i] * amida_list[W_i][1]
else:
dp_array[H_i][W_i] = dp_array[H_i - 1][W_i - 1] * amida_list[W_i][0] + dp_array[H_i - 1][W_i] * amida_list[W_i][1] + dp_array[H_i - 1][W_i + 1] * amida_list[W_i][2]
print((dp_array[H][K - 1] % 1000000007)) | p03222 |
h,w,k = list(map(int,input().split()))
honsu=w
a = 0
def amida(h,w):
global a
if h == 0 and w == k:
return 1
if h ==0:
return 0
if not(1<=w<=honsu):
return 0
com1 = fib(honsu-w+1)*fib(w-1)*amida(h-1,w-1)
com2 = fib(honsu-w+1)*fib(w)*amida(h-1,w)
com3 = fib(honsu-w)*fib(w)*amida(h-1,w+1)
return com1+com2+com3
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]
print((amida(h,1)%1000000007)) | h,w,k = list(map(int,input().split()))
a=[[0]*w for i in range(h+1)]
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]
for j in range(w):
a[0][j]=0
a[0][0]=1
for i in range(1,h+1):
for j in range(w):
if w==1:
a[i][j]=a[i-1][j]
elif j==0:
a[i][j]=a[i-1][j]*fib(w)+a[i-1][j+1]*fib(w-1)
elif 1<=j<w-1:
a[i][j]=a[i-1][j-1]*fib(w-j)*fib(j)+a[i-1][j]*fib(w-j)*fib(j+1)+a[i-1][j+1]*fib(w-j-1)*fib(j+1)
elif j==w-1:
a[i][j]=a[i-1][j]*fib(w)+a[i-1][j-1]*fib(w-1)
print((a[h][k-1]%1000000007)) | p03222 |
H, W, K = [int(_) for _ in input().split()]
MOD = 1000000007
P = [""]
for i in range(W - 1):
Q = []
for p in P:
Q.append(p + "0")
if len(p) == 0 or p[-1] == "0":
Q.append(p + "1")
P = Q
rs = [1] + [0] * (W - 1)
for j in range(H):
nrs = [0] * W
for p in P:
drs = rs[:]
for i, c in enumerate(p):
if c == "1":
drs[i], drs[i + 1] = drs[i + 1], drs[i]
for i in range(W):
nrs[i] = (nrs[i] + drs[i]) % MOD
rs = nrs
print((rs[K - 1]))
| H, W, K = [int(_) for _ in input().split()]
MOD = 1000000007
pats = [[0]]
for i in range(1, W):
pats = [p + [i] for p in pats] + [p[:-1] + [i, i - 1] for p in pats if p[-1] == i - 1]
rs = [1] + [0] * (W - 1)
for j in range(H):
rs = [sum(rs[p[i]] for p in pats) % MOD for i in range(W)]
print((rs[K - 1]))
| p03222 |
h, w, k = list(map(int, input().split()))
dp = [1] + [0] * (w - 1)
mod = 1000000007
for _ in range(h):
newdp = [0] * w
for b in range(1 << (w - 1)):
valid = True
for i in range(w - 1):
if (b >> i) & 3 == 3:
valid = False
if valid:
for i in range(w):
if (b >> i) & 1 != 0:
newdp[i + 1] = (newdp[i + 1] + dp[i]) % mod
elif i > 0 and (b >> (i - 1)) & 1 != 0:
newdp[i - 1] = (newdp[i - 1] + dp[i]) % mod
else:
newdp[i ] = (newdp[i ] + dp[i]) % mod
dp = newdp
print((dp[k - 1]))
| h, w, k = list(map(int, input().split()))
dp = [1] + [0] * (w - 1)
mod = 1000000007
def mul(a, b):
newmatrix = [[0] * w for _ in range(w)]
for i in range(w):
for j in range(w):
newmatrix[i][j] = sum(a[i][k] * b[k][j] for k in range(w)) % mod
return newmatrix
matrix = [[0] * w for _ in range(w)]
for b in range(1 << (w - 1)):
valid = True
for i in range(w - 1):
if (b >> i) & 3 == 3:
valid = False
if valid:
for i in range(w):
if (b >> i) & 1 != 0:
matrix[i][i + 1] += 1
elif i > 0 and (b >> (i - 1)) & 1 != 0:
matrix[i][i - 1] += 1
else:
matrix[i][i] += 1
ret = [[1 if i == j else 0 for i in range(w)] for j in range(w)]
while h > 0:
if h & 1 == 1:
ret = mul(ret, matrix)
matrix = mul(matrix, matrix)
h //= 2
print((ret[0][k - 1]))
| p03222 |
h, w, k = list(map(int, input().split()))
dp = [0] * w
mod = 10 ** 9 + 7
dp[0] = 1
for i in range(h):
next = [0] * w
for bit in range(1 << w - 1):
ok = True
for j in range(w - 2):
if bit >> j & 1 and bit >> j + 1 & 1:
ok = False
if ok:
moved = [False] * w
for j in range(w):
if bit >> j & 1:
next[j + 1] += dp[j]
next[j] += dp[j + 1]
moved[j] = moved[j + 1] = True
elif not moved[j]:
next[j] += dp[j]
dp = next
print((dp[k - 1] % mod))
| h, w, k = list(map(int, input().split()))
dp = [0] * w
mod = 10 ** 9 + 7
comb = []
for bit in range(1 << w - 1):
ok = True
for j in range(w - 2):
if bit >> j & 1 and bit >> j + 1 & 1:
ok = False
if ok:
comb.append(bit)
dp[0] = 1
for i in range(h):
next = [0] * w
for bit in comb:
moved = [False] * w
for j in range(w):
if bit >> j & 1:
next[j + 1] += dp[j]
next[j] += dp[j + 1]
moved[j] = moved[j + 1] = True
elif not moved[j]:
next[j] += dp[j]
dp = next
print((dp[k - 1] % mod))
| p03222 |
h,w,k = list(map(int, input().split()))
# (上から, 左右から)の通り数
memo = [[0]*w for i in range(h+1)]
for i in range(0, w):
memo[0][i] = 0
memo[0][0] = 1
# print(memo)
for i in range(1, h+1):
for j in range(0, 1 << (w-1)):
skip = False
for l in range(w-2):
skip = skip or ((j >> l) & 1 and (j >> (l+1)) & 1)
# print(skip)
if not skip:
for l in range(w):
if l-1 >= 0 and (j >> (l-1)) & 1:
memo[i][l] += memo[i-1][l-1]
elif l+1 < w and (j >> l) & 1:
memo[i][l] += memo[i-1][l+1]
else:
memo[i][l] += memo[i-1][l]
memo[i][l] = memo[i][l] % 1000000007
# print(memo)
print((memo[h][k-1]))
| h,w,k = list(map(int, input().split()))
memo = [[0]*w for i in range(h+1)]
for i in range(0, w):
memo[0][i] = 0
memo[0][0] = 1
for i in range(1, h+1):
for j in range(0, 1 << (w-1)):
skip = False
for l in range(w-2):
skip = skip or ((j >> l) & 1 and (j >> (l+1)) & 1)
if not skip:
for l in range(w):
if l-1 >= 0 and (j >> (l-1)) & 1:
memo[i][l] += memo[i-1][l-1]
elif l+1 < w and (j >> l) & 1:
memo[i][l] += memo[i-1][l+1]
else:
memo[i][l] += memo[i-1][l]
memo[i][l] = memo[i][l] % 1000000007
print((memo[h][k-1]))
| p03222 |
MOD=10**9+7
H,W,K=list(map(int,input().split()))
dp=[[0]*W for i in range(H+1)]
dp[0][0]=1
for i in range(1,H+1):
for k in range(W):
l,c,r=0,0,0
for bit in range(2**(W-1)):
ok=True
for t in range(W-2):
if (bit>>t&1) and (bit>>(t+1)&1):
ok=False
break
if not ok:
continue
if ((k>0 and not(bit>>(k-1)&1)) or k==0) and ((k<W-1 and not(bit>>k&1))or k==W-1):
c+=1
if (k>0):
if ((k>1 and not(bit>>(k-2)&1)) or k==1) and ((k<W-1 and not(bit>>k&1))or k==W-1) and (bit>>(k-1)&1):
l+=1
if (k<W-1):
if ((k>0 and not(bit>>(k-1)&1)) or k==0) and ((k<W-2 and not (bit>>(k+1)&1))or k==W-2) and (bit>>k&1):
r+=1
dp[i][k]=(dp[i][k]+dp[i-1][k]*c)%MOD
if k>0:
dp[i][k]=(dp[i][k]+dp[i-1][k-1]*l)%MOD
if k<W-1:
dp[i][k]=(dp[i][k]+dp[i-1][k+1]*r)%MOD
print((dp[H][K-1])) | MOD=10**9+7
def isvalid(bit):
for t in range(W-2):
if (bit>>t&1) and (bit>>(t+1)&1):
return False
return True
H,W,K=list(map(int,input().split()))
dp=[[0]*W for i in range(H+1)]
dp[0][0]=1
for i in range(1,H+1):
for k in range(W):
l,c,r=0,0,0
for bit in range(2**(W-1)):
if not isvalid(bit):
continue
if ((k>0 and not(bit>>(k-1)&1)) or k==0) and ((k<W-1 and not(bit>>k&1))or k==W-1):
c+=1
if (k>0) and (bit>>(k-1)&1):
l+=1
if (k<W-1) and (bit>>k&1):
r+=1
dp[i][k]=(dp[i][k]+dp[i-1][k]*c)%MOD
if k>0:
dp[i][k]=(dp[i][k]+dp[i-1][k-1]*l)%MOD
if k<W-1:
dp[i][k]=(dp[i][k]+dp[i-1][k+1]*r)%MOD
print((dp[H][K-1])) | p03222 |
import sys
mod = pow(10, 9) + 7
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
NNN = (10**5) * 2
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, NNN + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def erabu(aW):
r = 0
for i in range(aW // 2 + 1 + 1):
sp = aW - (2*i -1)
r += cmb(sp+i+1-1, sp, mod)
return r
N, W, K = [int(x) for x in input().strip().split(" ")]
hasi = 0
cc = []
if W == 1:
if K == 1:
print((1))
else:
print((0))
sys.exit()
elif W == 2:
cccl = [1, 1]
cc = [1, 1]
elif W == 3:
cccl = [1, 1, 1]
cc = [2, 1, 2]
elif W >= 4:
aW = W - 1
hW = aW - 2
nhW = aW - 3
cc = []
cccl = []
for w in range(W):
nn = max(W - 1 - w - 1, 0)
nnn = max((W - 1) - nn - 2, 0)
if w == W -1:
nnn += 1
cc.append(erabu(nn) * erabu(nnn))
cccl.append(erabu(nn) * erabu(nnn-1))
cccl[0] = 0
cccr = cccl[::-1]
d = [1] + [0 for x in range(W-1)]
for i in range(N):
newd = []
for j in range(W):
newd.append(0)
if j != 0:
newd[j] = (newd[j] + (d[j-1] * cccl[j]) )% mod
if j != W-1:
newd[j] = (newd[j] + (d[j+1] * cccr[j])) % mod
newd[j] = (newd[j] + (d[j] * cc[j])) % mod
d = newd[:]
print((d[K-1]))
| import sys
mod = pow(10, 9) + 7
def mul(a, b):
return ((a % mod) * (b % mod)) % mod
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min(r, n-r)
return g1[n] * g2[r] * g2[n-r] % mod
NNN = (10**2)
g1 = [1, 1]
g2 = [1, 1]
inverse = [0, 1]
for i in range( 2, NNN + 1 ):
g1.append( ( g1[-1] * i ) % mod )
inverse.append( ( -inverse[mod % i] * (mod//i) ) % mod )
g2.append( (g2[-1] * inverse[-1]) % mod )
def erabu(aW):
r = 0
for i in range(aW // 2 + 1 + 1):
sp = aW - (2*i -1)
r += cmb(sp+i+1-1, sp, mod)
return r
N, W, K = [int(x) for x in input().strip().split(" ")]
hasi = 0
cc = []
if W == 1:
if K == 1:
print((1))
else:
print((0))
sys.exit()
elif W == 2:
cccl = [1, 1]
cc = [1, 1]
elif W == 3:
cccl = [1, 1, 1]
cc = [2, 1, 2]
elif W >= 4:
aW = W - 1
hW = aW - 2
nhW = aW - 3
cc = []
cccl = []
for w in range(W):
nn = max(W - 1 - w - 1, 0)
nnn = max((W - 1) - nn - 2, 0)
if w == W -1:
nnn += 1
cc.append(erabu(nn) * erabu(nnn))
cccl.append(erabu(nn) * erabu(nnn-1))
cccl[0] = 0
cccr = cccl[::-1]
d = [1] + [0 for x in range(W-1)]
for i in range(N):
newd = []
for j in range(W):
newd.append(0)
if j != 0:
newd[j] = (newd[j] + (d[j-1] * cccl[j]) )% mod
if j != W-1:
newd[j] = (newd[j] + (d[j+1] * cccr[j])) % mod
newd[j] = (newd[j] + (d[j] * cc[j])) % mod
d = newd[:]
print((d[K-1]))
| p03222 |
# 解説と下記を参考に作成
# https://atcoder.jp/contests/abc113/submissions/15821617
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(H, W, K):
mod = 10 ** 9 + 7
dp = [[0] * W for _ in range(H + 1)]
dp[0][0] = 1
for h in range(H):
for w in range(W):
if dp[h][w] == 0:
continue
for i in range(3):
new_w = w - 1 + i
if not 0 <= new_w < W:
continue
def cnt_tmp(n, r, l, flg):
re = 0
if n >= W - 2:
if r <= n <= l:
return 1
if flg:
return 1
else:
return 2
if r <= n <= l:
return cnt_tmp(n + 1, r, l, False)
re += cnt_tmp(n + 1, r, l, False)
re += cnt_tmp(n + 1, r, l, True) if not flg else 0
return re
tmp = cnt_tmp(0, min(w, new_w) - 1, max(w, new_w), False)
dp[h + 1][new_w] += dp[h][w] * tmp
dp[h + 1][new_w] %= mod
# for dpi in dp:
# print(dpi)
print((dp[-1][K - 1]))
if __name__ == '__main__':
H, W, K = list(map(int, input().split()))
solve(H, W, K)
# # test
# from random import randint
# from func import random_str
# solve()
| # 解説と下記を参考に作成
# https://atcoder.jp/contests/abc113/submissions/15821617
# import sys
# sys.setrecursionlimit(10 ** 6)
# import bisect
# from collections import deque
# from decorator import stop_watch
#
#
# @stop_watch
def solve(H, W, K):
mod = 10 ** 9 + 7
dp = [[0] * W for _ in range(H + 1)]
dp[0][0] = 1
fibo = [1, 2, 3, 5, 8, 13, 21]
for h in range(H):
for w in range(W):
if dp[h][w] == 0:
continue
for i in range(3):
new_w = w - 1 + i
if not 0 <= new_w < W:
continue
l, r = min(w, new_w), max(w, new_w)
tmp = fibo[max(l - 1, 0)] * fibo[max(W - 1 - (r + 1), 0)]
dp[h + 1][new_w] += dp[h][w] * tmp
dp[h + 1][new_w] %= mod
print((dp[-1][K - 1]))
if __name__ == '__main__':
H, W, K = list(map(int, input().split()))
solve(H, W, K)
# # test
# from random import randint
# from func import random_str
# solve()
| p03222 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
H, W, K = list(map(int, readline().split()))
dp = [0] * W
dp[0] = 1
for _ in range(H):
dp, dp_prev = [0] * W, dp
for mask in range(1 << (W - 1)):
ok = True
for i in range(W - 2):
if mask & (1 << i) and mask & (1 << (i + 1)):
ok = False
if not ok:
continue
for i in range(W):
if i > 0 and mask & (1 << (i - 1)):
dp[i - 1] = (dp[i - 1] + dp_prev[i]) % MOD
elif i < W - 1 and mask & (1 << i):
dp[i + 1] = (dp[i + 1] + dp_prev[i]) % MOD
else:
dp[i] = (dp[i] + dp_prev[i]) % MOD
print((dp[K - 1]))
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
H, W, K = list(map(int, readline().split()))
dp = [0] * W
dp[0] = 1
for _ in range(H):
dp, dp_prev = [0] * W, dp
for mask in range(1 << (W - 1)):
ok = True
for i in range(W - 2):
if mask & (1 << i) and mask & (1 << (i + 1)):
ok = False
break
if not ok:
continue
for i in range(W):
if i > 0 and mask & (1 << (i - 1)):
dp[i - 1] = (dp[i - 1] + dp_prev[i]) % MOD
elif i < W - 1 and mask & (1 << i):
dp[i + 1] = (dp[i + 1] + dp_prev[i]) % MOD
else:
dp[i] = (dp[i] + dp_prev[i]) % MOD
print((dp[K - 1]))
return
if __name__ == '__main__':
main()
| p03222 |
K, S = list(map(int, input().split()))
ans = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if z >= 0 and z <= K:
ans += 1
print(ans)
| K, S = list(map(int, input().split()))
cnt = 0
for i in range(K+1):
for j in range(K+1):
x = S - i - j
if 0 <= x <= K:
cnt += 1
print(cnt)
| p03835 |
K, S = list(map(int, input().split()))
count = 0
for X in range(K + 1):
if X > S:
break
for Y in range(min(K, S - X) + 1):
if Y < 0:
continue
if X + Y > S:
break
Z = S - X - Y
if X <= K and Y <= K and Z <= K:
count += 1
print(count)
| K, S = list(map(int, input().split()))
count = 0
for X in range(min(S + 1, K + 1)):
for Y in range(min(S - X + 1, K + 1)):
if S - X - Y <= K:
count += 1
print(count)
| p03835 |
K,S = list(map(int,input().split()))
g = 0
for x in range(0,K+1):
for y in range(x,K+1):
for z in range(y,K+1):
if x+y+z == S:
if x == y == z:g += 1
elif x == y or y == z:g += 3
else:g += 6
print(g) | K,S = list(map(int,input().split()))
t = 0
#c = 0
for x in range(max(0,S-2*K),min(S//3+1,K+1)):
if S-x > 2 * K:
pass
else:
for y in range(max(x,S-x-K),min((S-x)//2+1,K+1)):
#c += 1
z = S - x - y
if z < y:
#print('pass')
pass
else:
#print(x,y,z)
if x == y == z:
t += 1
elif x == y or y == z:
t += 3
else:
t += 6
print(t) | p03835 |
k, s = list(map(int, input().split()))
count = 0
sz_list = []
for i in range(k+1):
sz_list.append(s-i)
for x in range(k+1):
for y in range(k+1):
s = x +y
if s in sz_list:
count+=1
print(count) | k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
z = s - x - y
if z >= 0 and z <= k:
count+=1
print(count)
| p03835 |
#入力
K, S = list(map(int, input().split()))
#問題文よりX, Y, Zの最大値はKである
X = list(range(K+1))
Y = list(range(K+1))
Z = list(range(K+1))
#フラグ設定
flag = 0
#全探索
for x in X:
for y in Y:
for z in Z:
#条件
if x+y+z==S:
flag += 1
#出力
print(flag) | #入力
K, S = list(map(int, input().split()))
#問題文よりX, Y, Zの最大値はKであるため、各値の最大値はKである
X = list(range(K+1))
Y = list(range(K+1))
#フラグ設定
flag = 0
#全探索
for x in X:
for y in Y:
#条件に合うzの値を算出
z = S - x - y
if z<=K and z>=0: #上で求めたzの値に問題文からFilterを掛ける
flag += 1
#出力
print(flag) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
for m in range(k+1):
if i + j + m == s:
ans += 1
print(ans)
| k, s = list(map(int, input().split()))
ans = 0
for i in range(k+1):
for j in range(k+1):
if (i + j <= s) and (s - i - j <= k):
ans += 1
print(ans) | p03835 |
count=0
k,s=list(map(int,input().split()))
for i in range(k+1):
for j in range(k+1):
for m in range(k+1):
if i+j+m==s:
count+=1
print(count) | count=0
k,s=list(map(int,input().split()))
for i in range(k+1):
for j in range(k+1):
if s-k<=i+j<=s:
count+=1
print(count) | p03835 |
K,S=list(map(int,input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z == S:
count+=1
print(count) | K,S=list(map(int,input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
z=S-x-y
if z>=0 and z<=K:
count+=1
print(count) | p03835 |
import sys
def input(): return sys.stdin.readline().strip()
k,s=list(map(int,input().split()))
c=0
for x in range(k+1):
if x + 2 * k < s:
continue
for y in range(k+1):
if x + y > s:
continue
if x + y + k < s:
continue
c += 1
print(c) | import sys
def input(): return sys.stdin.readline().strip()
k,s=list(map(int,input().split()))
c=0
for x in range(max(0,s-2*k),k+1):
for y in range(max(0,s-x-k),min(k,s-x)+1):
c += 1
print(c) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
for z in range(k + 1):
if (x + y + z == s):
ans += 1
print(ans)
| k, s = list(map(int, input().split()))
ans = 0
for x in range(k + 1):
for y in range(k + 1):
if (x + y <= s and s - (x + y) <= k):
ans += 1
print(ans)
| p03835 |
K,S=list(map(int,input().split()))
count=0
for i in range(K+1):
for j in range(K+1):
for m in range(K+1):
if i+j+m==S:
count+=1
print(count) | K,S=list(map(int,input().split()))
count=0
for i in range(K+1):
for j in range(K+1):
if 0 <= S-i-j <= K:
count += 1
print(count) | p03835 |
K,S=list(map(int,input().split()))
count=0
for i in range(K+1):
for j in range(K+1):
if 0 <= S-i-j <= K:
count += 1
print(count) | k,s=list(map(int,input().split()));count=0
for i in range(0,k+1):
for j in range(0,k+1):
if 0<=s-(i+j)<=k: count+=1
print(count) | p03835 |
n,k=list(map(int,input().split()))
ans=0
for i in range(n+1):
for j in range(n+1):
for l in range(n+1):
if i+j+l==k:
ans+=1
print(ans)
| n,k=list(map(int,input().split()))
ans=0
for i in range(n+1):
for j in range(n+1):
if 0<=k-i-j<=n:
ans+=1
print(ans)
| p03835 |
K , S = list(map(int, input().split()))
x , y , z , cnt = 0 , 0 , 0 , 0
A = K + 1
if K * 3 == S:
cnt = 1
else :
for i in range(A):
x = i
for j in range(A):
y = j
for k2 in range(A) :
z = k2
if x + y + z == S:
cnt += 1
print(cnt)
| K , S = list(map(int, input().split()))
x , y , z , cnt = 0 , 0 , 0 , 0
A = K + 1
if K * 3 == S:
cnt = 1
else :
for i in range(A):
for j in range(A):
if S - (i + j) <= K :
if 0 <= S - (i + j):
cnt += 1
print(cnt)
| p03835 |
K,S=list(map(int,input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x+y+z==S:
count+=1
print(count) | K,S=list(map(int,input().split()))
count=0
for x in range(K+1):
for y in range(K+1):
if 0<=S-x-y<=K:
count+=1
print(count) | p03835 |
[K,S] = list(map(int,input().split()))
count=0
for X in range(K+1):
for Y in range(K+1):
for Z in range(K+1):
if X+Y+Z==S:
count+=1
print(count) | [K,S] = list(map(int,input().split()))
count=0
for X in range(K+1):
for Y in range(K+1):
Z = S - X - Y
if Z in range(K+1):
count+=1
print(count) | p03835 |
from sys import stdin
n = input().split(' ')
c = 0
K = int(n[0])
S = int(n[1])
for i in range(int(K)+1):
for j in range(int(K)+1):
if(S-(i+j) <= K and S>=i+j):
c+=1
print(c) | k, s = list(map(int, input().split()))
ans = 0
for i in range(k + 1):
for j in range(k + 1):
if 0 <= s - i - j <= k:
ans +=1
print(ans) | p03835 |
# -*- coding: utf-8 -*-
K, S = list(map(int, input().split()))
cnt = 0
for X in range(0, K+1):
for Y in range(0, K+1):
if 0<=S-X-Y and S-X-Y<=K:
cnt += 1
print(cnt) | # -*- coding: utf-8 -*-
k, s = list(map(int,input().split()))
cnt = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if (0 <= z <= k):
cnt += 1
print(cnt) | p03835 |
K, S = list(map(int, input().rstrip().split()))
n = 0
for x in range(K + 1):
for y in range(K + 1):
if x + y > S:
break
for z in range(K + 1):
if x + y + z > S:
break
if (x + y + z) == S:
n += 1
print(n)
| K, S = list(map(int, input().rstrip().split()))
n = 0
for x in range(K + 1):
for y in range(K + 1):
z = S - x - y
if 0 <= z and z <= K:
n += 1
print(n)
| p03835 |
k, s = list(map(int, input().split()))
r = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z <= k and z + x + y == s:
r += 1
print(r)
| k, s = list(map(int, input().split()))
r = 0
for x in range(k + 1):
for y in range(0, min(s - x + 1, k + 1)):
z = s - x - y
if 0 <= z <= k and z + x + y == s:
r += 1
print(r)
| p03835 |
k,s=list(map(int,input().split()))
ans=0
if s<=k:
print(((s+1)*(s+2)//2))
exit()
for i in range(k+1):
for j in range(i,k+1):
for l in range(j,k+1):
if i+j+l==s:
if i==j and j==l:
ans+=1
elif i==j or j==l or l==i:
ans+=3
else:
ans+=6
print(ans)
| k,s=list(map(int,input().split()))
ans=0
if s<=k:
print(((s+1)*(s+2)//2))
exit()
for i in range(k+1):
for j in range(k+1):
if 0<=s-i-j<=k:
ans+=1
print(ans)
| p03835 |
k,s=list(map(int,input().split()))
t=0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l==s:
t+=1
print(t)
| k,s=list(map(int,input().split()))
t=0
for i in range(k+1):
for j in range(k+1):
l=s-i-j
if 0<=l<=k:
t+=1
print(t)
| p03835 |
k,s = list(map(int,input().split()))
cnt = 0
for x in range(s + 1):
for y in range(s + 1 - x):
if x <= k and y <= k and s - x - y <= k:
cnt += 1
print(cnt)
| k,s = list(map(int,input().split()))
cnt = 0
M = min(s + 1,k + 1)
for x in range(M):
for y in range(min(s + 1 - x,k + 1)):
if s - x - y <= k:
cnt += 1
print(cnt)
| p03835 |
k,s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z == s:
cnt += 1
print(cnt) | k,s = list(map(int, input().split()))
cnt = 0
for x in range(k+1):
for y in range(k+1):
z = s - x -y
if 0 <= z <= k:
cnt += 1
print(cnt) | p03835 |
K, S = list(map(int, input().strip().split(' ')))
cnt = 0
for X in range(0, K+1):
for Y in range(0, K+1):
for Z in range(0, K+1):
if X+Y+Z == S:
cnt += 1
print(cnt) | K, S = list(map(int, input().strip().split(' ')))
cnt = 0
if S < K:
for X in range(0, S+1):
cnt += (S-X+1)
else:
for X in range(0, K+1):
if (S-X) <= (2*K):
if (S-X) < K:
cnt += (S-X+1)
elif (S-X) > K:
Z = S-X-K
cnt += (K-Z+1)
else:
cnt += (K+1)
print(cnt) | p03835 |
#全探索(多分TLE)
K, S = list(map(int, input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k == S:
ans += 1
print(ans) | K, S = list(map(int, input().split()))
ans = 0
for x in range(K+1):
for y in range(K+1):
if S >= x+y and S-(x+y) <= K:
ans += 1
print(ans) | p03835 |
k, s = list(map(int, input().split()))
count = 0
for y in range(k+1):
for x in range(k+1):
z = s - x - y
if 0 <= z <= k:
count += 1
print(count) | k, s = list(map(int, input().split()))
count = 0
for x in range(k+1):
for y in range(k+1):
z = s-x-y
if 0 <= z <= k:
count += 1
print(count) | p03835 |
# Me
def resolve(k, s):
c = 0
for x in range(0, k+1):
for y in range(0, k+1):
for z in range(0, k+1):
if x + y + z == s:
c += 1
return c
k, s = list(map(int, input().split()))
print((resolve(k, s)))
| # Me
def resolve(k, s):
c = 0
for x in range(0, k+1):
for y in range(0, k+1):
if 0 <= s - (x + y) <= k:
c += 1
return c
k, s = list(map(int, input().split()))
print((resolve(k, s)))
| p03835 |
import sys
from pprint import pprint
k, s = list(map(int, sys.stdin.readline().strip().split(" ")))
ans = 0
for x in range(k+1):
for y in range(k+1):
if 0 <= s - x - y <= k:
ans += 1
# print(x, y, s - x - y)
print(ans) | import sys
K, S = list(map(int, sys.stdin.readline().strip().split()))
N_MAX = min(K, S)
ans = 0
for i in range(N_MAX+1):
for j in range(N_MAX+1):
if 0 <= S - (i + j) <= K:
ans += 1
print(ans) | p03835 |
k,s=list(map(int,input().split()))
a=0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l==s:
a+=1
print(a) | k,s=list(map(int,input().split()))
a=0
for i in range(k+1):
for j in range(k+1):
if 0<=s-i-j<k+1:
a+=1
print(a) | p03835 |
k, s = list(map(int,input().split(' ')))
count = 0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x + y + z == s:
count += 1
print(count) | k, s = list(map(int,input().split(' ')))
count = 0
for x in range(k+1):
for y in range(k+1):
z = s - (x+y)
if 0 <= z and z <= k:
count += 1
print(count) | p03835 |
K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
for z in range(K+1):
if x + y + z == S:
count += 1
print(count) | K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0<=z and z<=K:
count += 1
print(count) | p03835 |
k,s=list(map(int,input().split()))
counter=0
for x in range(k+1):
for y in range(k+1):
for z in range(k+1):
if x+y+z==s:
counter+=1
print(counter)
| k,s=list(map(int,input().split()))
counter=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
counter+=1
print(counter)
| p03835 |
k, s = list(map(int, input().split()))
cnt = 0
for x in range(k + 1):
for y in range(k + 1):
z = s - x - y
if 0 <= z and z <= k:
cnt += 1
print(cnt) | k, s = list(map(int, input().split()))
cnt = 0
for x in range(k + 1):
for y in range(min(k + 1, s + 1 - x)):
z = s - x - y
if 0 <= z and z <= k:
cnt += 1
print(cnt) | p03835 |
K, S = [int(x) for x in input().split()]
dic = {}
for i in range(K + 1):
for j in range (K + 1):
r = S - i - j
if r in list(dic.keys()):
dic[r].append((i, j))
else:
dic[r] = [(i, j)]
ans = 0
for k in range(K + 1):
if k in list(dic.keys()):
ans += len(dic[k])
print(ans) | K, S = [int(x) for x in input().split()]
ans = 0
for i in range(K + 1):
for j in range (K + 1):
r = S - i - j
if r <= K and r >= 0:
ans += 1
print(ans) | p03835 |
K, S = list(map(int, input().split(" ")))
count = 0
for x in range(K + 1):
for y in range(K + 1):
for z in range(K + 1):
ans = x + y + z
if S == ans:
count += 1
print(count) | K, S = list(map(int, input().split(" ")))
count = 0
for x in range(K + 1):
for y in range(K + 1):
if S - x - y >= 0 and S - x - y <= K:
count += 1
print(count) | p03835 |
#https://atcoder.jp/contests/abc051/tasks/abc051_b
# -*- coding: utf-8 -*-
K,S = list(map(int,input().split()))
ans = 0
for i in range(K+1):
for j in range(K+1):
for k in range(K+1):
if i+j+k == S: ans +=1
print(ans) | #https://atcoder.jp/contests/abc051/tasks/abc051_b
# -*- coding: utf-8 -*-
K,S = list(map(int,input().split()))
ans = 0
for i in range(0,K+1):
for j in range(0,K+1):
z = S-i-j
if 0 <= z <= K: ans +=1
print(ans) | p03835 |
K, S = list(map(int, input().split()))
count = 0
K += 1
for x in range(K):
for y in range(K):
for z in range(K):
if S == x + y + z:
count += 1
print(count) | K, S = list(map(int, input().split()))
count = 0
for x in range(K+1):
for y in range(K+1):
z = S - x - y
if 0 <= z <= K:
count += 1
print(count)
| p03835 |
k,s = list(map(int,input().split()))
c = 0
for i in range(k+1):
for j in range(k+1):
for l in range(k+1):
if i+j+l == s:
c += 1
print(c) | k,s = list(map(int,input().split()))
c = 0
for y in range(k+1):
for z in range(k+1):
if 0 <= s-(y+z) <= k:
c += 1
print(c) | p03835 |
k, s = list(map(int, input().split()))
ans = 0
for x in range(s + 1):
for y in range(s - x + 1):
z = s - x - y
if x <= k and y <= k and z <= k:
ans += 1
print(ans) | k, s = list(map(int, input().split()))
ans = 0
for x in range(k+1):
for y in range(k+1):
z = (s-(x+y))
if 0 <= z and z <= k:
ans += 1
print(ans) | p03835 |
# -*- coding utf-8 -*-
k,s=list(map(int,input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
ans+=1
print(ans)
| k,s=list(map(int,input().split()))
ans=0
for x in range(k+1):
for y in range(k+1):
if 0<=s-x-y<=k:
ans+=1
print(ans)
| p03835 |
n,s=list(map(int,input().split()))
ans=0
for i in range(n+1):
for j in range(n+1):
if s-i-j>-1 and s-i-j<n+1:
ans+=1
print(ans)
| n,s=list(map(int,input().split()))
ans=0
for i in range(n+1):
if s-i>n*2 or s-i<0:
continue
for j in range(n+1):
if -1<s-i-j<n+1:
ans+=1
print(ans)
| p03835 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.