input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import time
from array import array
def solve(i, m):
if m == 0:
return True
if i >= n:
return False
return solve(i+1, m) or solve(i+1, m-A[i])
if __name__ == '__main__':
n = int(input())
A = array('I', list(map(int, input().split())))
q = int(input())
m = arra... | import time
def sequence(A, n):
dic = {}
def solve(i, m):
if (i, m) in dic:
return dic[(i, m)]
if m == 0:
dic[(i, m)] = True
elif i >= n:
dic[(i, m)] = False
elif solve(i+1, m):
dic[(i, m)] = True
elif so... | p02271 |
import itertools
numA = int(input().rstrip())
listA = list(map(int,input().rstrip().split(" ")))
numQ = int(input().rstrip())
listQ = list(map(int,input().rstrip().split(" ")))
sumA = []
cnt = 0
for i in range(1,numA+1):
tmpComb = list(itertools.combinations(listA, i))
for nums in tmpComb:
... | import itertools
numA = int(input().rstrip())
listA = list(map(int,input().rstrip().split(" ")))
numQ = int(input().rstrip())
listQ = list(map(int,input().rstrip().split(" ")))
sumA = set([])
cnt = 0
for i in range(1,numA+1):
tmpComb = list(itertools.combinations(listA, i))
for nums in tmpC... | p02271 |
# coding: utf-8
N = int(eval(input()))
A = [int(i) for i in input().split()]
q = int(eval(input()))
m = [int(i) for i in input().split()]
MAX_LENGTH = len(A)
#i番目以降の値を使ってmを作ればTrueを返す
def fullSearch(i, m):
#終了条件
if m == 0:
return True
elif i >= MAX_LENGTH:
return False
else:
... | # coding: utf-8
N = int(eval(input()))
A = [int(i) for i in input().split()]
q = int(eval(input()))
m = [int(i) for i in input().split()]
MAX_LENGTH = len(A)
dp = [[-1 for i in range(max(m) + 1)] for j in range(MAX_LENGTH + 1)]
# i番目以降の値を使ってmを作ればTrueを返す
def fullSearch(i, m):
# 終了条件
if m < 0:
... | p02271 |
import itertools as it
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
m = list(map(int, input().split()))
s = set()
for i in range(n):
li= list(it.combinations(A, i+1))
for j in range(len(li)):
s.add(sum(li[j]))
for k in range(q):
print(('yes... | from itertools import combinations
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
m = list(map(int, input().split()))
l = set(sum(t) for i in range(n) for t in combinations(A, i+1))
for j in m:
print(('yes' if j in l else 'no'))
| p02271 |
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n:
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for m in M:
if solve(0, m):
... | n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = list(map(int, input().split()))
memo = {}
def solve(i, m):
if m == 0:
return True
if i >= n:
return False
if memo.get((i, m), None) == None:
memo[(i, m)] = solve(i + 1, m) or solve(i + ... | p02271 |
# coding=utf-8
def solve(i, m):
global A
if m == 0:
ever_calc[i][m] = True
return True
elif m < 0:
ever_calc[i][m] = False
return False
elif i == n:
ever_calc[i][m] = False
return False
else:
result = (solve(i+1, m) or solve(i+1,... | # coding=utf-8
def solve(i, m):
global A
if ever_calc[i][m] != None:
return ever_calc[i][m]
if m == 0:
ever_calc[i][m] = True
return True
elif m < 0:
ever_calc[i][m] = False
return False
elif i == n:
ever_calc[i][m] = False
retur... | p02271 |
import sys
def exhaustiveSearch(A, m):
for i in range(len(A)):
if m == A[i]:
return True
elif m > A[i]:
if exhaustiveSearch(A[:i] + A[i + 1:], m - A[i]):
return True
return False
if __name__ == "__main__":
lines = sys.stdin.readlines()
... | import sys
def exhaustiveSearch(A, m):
if len(A) == 1 and A[0] != m:
return False
elif A[0] == m:
return True
return exhaustiveSearch(A[1:], m) or exhaustiveSearch(A[1:], m - A[0])
if __name__ == "__main__":
lines = sys.stdin.readlines()
A = list(map(int, lines[1].split(... | p02271 |
import sys
def exhaustiveSearch(A, m):
if len(A) == 1 and A[0] != m or m < 0:
return False
elif A[0] == m:
return True
return exhaustiveSearch(A[1:], m) or exhaustiveSearch(A[1:], m - A[0])
if __name__ == "__main__":
lines = sys.stdin.readlines()
A = list(map(int, lines[... | import sys
def exhaustiveSearch(A, m, i):
if A[i] == m:
return True
elif i == len(A) - 1:
return False
return exhaustiveSearch(A, m, i + 1) or exhaustiveSearch(A, m - A[i], i + 1)
if __name__ == "__main__":
lines = sys.stdin.readlines()
A = list(map(int, lines[1].split... | p02271 |
import sys
def exhaustiveSearch(A, m, i):
if A[i] == m:
return True
elif i == len(A) - 1 or m < 0:
return False
return exhaustiveSearch(A, m, i + 1) or exhaustiveSearch(A, m - A[i], i + 1)
if __name__ == "__main__":
lines = sys.stdin.readlines()
A = list(map(int, lines... | import sys
def exhaustiveSearch(A, m, i, s):
if A[i] == m:
return True
elif i == len(A) - 1 or m < 0 or m > s:
return False
return exhaustiveSearch(A, m, i + 1, s) or exhaustiveSearch(A, m - A[i], i + 1, s)
if __name__ == "__main__":
lines = sys.stdin.readlines()
A = l... | p02271 |
n= int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
Mi = list(map(int, input().split()))
def solve(i,m):
if m == 0:
return True
if i >= n:
return False
res = solve(i+1, m) or solve(i + 1, m - A[i])
return res
for m in Mi:
if solve(0, m):
print("yes")
else:
p... | n= int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
Mi = list(map(int, input().split()))
PS={}
def solve(i,m):
if m == 0:
return True
if (i,m) in PS:
return PS[(i,m)]
if i >= n:
return False
res = solve(i+1, m) or solve(i + 1, m - A[i])
PS[(i,m)] = res
return res
... | p02271 |
isExist = [False]*2001
n = int( eval(input()) )
A = [ int( val ) for val in input().rstrip().split( ' ' ) ]
for i in A:
for j in range( 2000-i, 0, -1 ):
if isExist[j]:
isExist[ i+j ] = True
isExist[i] = True
q = int( eval(input()) )
M = [ int( val ) for val in input().rstrip().split( ' ' ) ]
for i i... | isExist = [False]*2001
n = int( input() )
A = [ int( val ) for val in input().rstrip().split( ' ' ) ]
for i in A:
for j in range( 2000-i, 0, -1 ):
if isExist[j]:
isExist[ i+j ] = True
isExist[i] = True
q = int( input() )
M = [ int( val ) for val in input().rstrip().split( ' ' ) ]
for i in range( 0, ... | p02271 |
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
mi = list(map(int, input().split()))
def solve(i, m):
if (m == 0):
return True
if (i >= n):
return False
res = solve(i + 1, m) or solve(i + 1, m - A[i])
return res
for j in mi:
if solve(... | n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
mi = list(map(int, input().split()))
t = {}
def solve(i, m):
if (m == 0):
return True
if (i >= n):
return False
if (i,m) in t:
return t[(i,m)]
res = solve(i + 1, m) or solve(i + 1, m -... | p02271 |
def solve(Mi,i):
if Mi == 0: return True
if i < n and Mi > 0:
r1 = solve(Mi-A[i],i+1)
r2 = solve(Mi,i+1)
if r1: return r1
if r2: return r2
n = eval(input())
A = list(map(int,input().split()))
q = eval(input())
M = list(map(int,input().split()))
for Mi in M:
print("yes" if solve(Mi,0) else "no") | def solve(Mi,i):
if Mi == 0: return True
if i < n and min(A[i:]) <= Mi <= sum(A[i:]):
r1 = solve(Mi-A[i],i+1)
r2 = solve(Mi,i+1)
if r1: return r1
if r2: return r2
n = eval(input())
A = list(map(int,input().split()))
q = eval(input())
M = list(map(int,input().split()))
for Mi in M:
print("yes" if ... | p02271 |
n1 = eval(input())
A = list(map(int, input().split()))
n2 = eval(input())
q = list(map(int, input().split()))
list = set()
def solve(i,m):
if m == 0:
return True
if i >= n1:
return False
res = solve(i+1,m) or solve(i+1,m-A[i])
return res
for m in q:
if solve(0,m):
print("yes")
else:
... | n1 = eval(input())
A = list(map(int, input().split()))
n2 = eval(input())
q = list(map(int, input().split()))
list = set()
def solve(i,m):
if m == 0:
return True
if i >= n1 or m > sum(A):
return False
res = solve(i+1,m) or solve(i+1,m-A[i])
return res
for m in q:
if solve(0,m):
print("y... | p02271 |
def solve(arr, m):
dict = {}
return solve_rec(0, arr, m, dict)
def solve_rec(i, arr, m, dict):
key = str(i) + '-' + str(m)
res = False
if key in dict:
res = dict[key]
elif m == 0:
res = True
elif i >= len(arr):
res = False
else:
res1 = solve_rec(i + 1, arr, m, dict)
res2 = solve_rec(... |
def solve(a, m):
dict = {}
return solve_(a, 0, m, dict)
def solve_(a, i, m, dict):
res = False
key = str(i) + '-' + str(m)
if key in dict:
res = dict[key]
elif m == 0:
res = True
elif i >= len(a):
res = False
else:
res1 = solve_(a, i + 1, m, dict)
res2 = solve_(a, i + 1, m - a[i], di... | p02271 |
def subset_sum(s, a):
dict = {}
return subset_rec(0, s, a, dict)
def subset_rec(i, s, a, dict):
key = str(i) + '-' + str(s)
ret = False
if key in dict:
ret = dict[key]
elif s == 0:
ret = True
elif i >= len(a):
ret = False
else:
ret = subset_rec(i+1, s-a[i], a, dict) or subset_rec(i+1, s... | def subset_sum(s, a):
dict = {}
return subset_rec(0, s, a, dict)
def subset_rec(i, s, a, dict):
key = str(i) + '-' + str(s)
if key in dict:
ret = dict[key]
elif s == 0:
ret = True
elif i >= len(a):
ret = False
else:
ret = subset_rec(i+1, s-a[i], a, dict) or subset_rec(i+1, s, a, dict)
d... | p02271 |
def subset_sum(s, a):
dict = {}
return subset_rec(0, s, a, dict)
def subset_rec(i, s, a, dict):
key = str(i) + '-' + str(s)
if key in dict:
ret = dict[key]
elif s == 0:
ret = True
elif i >= len(a):
ret = False
else:
ret = subset_rec(i+1, s-a[i], a, dict) or subset_rec(i+1, s, a, dict)
d... | def subset_sum(s, a):
n = len(a)
dp = [[False for x in range(s+1)] for x in range(n+1)]
for i in range(n):
v = a[i]
for j in range(s+1):
if v == j:
dp[i+1][j] = True
elif v > j:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = dp[i][j] or dp[i][j-v]
return dp[n][s]
n = int(eval(input... | p02271 |
def subset_sum(n, s, a):
dp = [[0 for x in range(s+1)] for x in range(n+1)]
for i in range(n):
v = a[i]
for j in range(s+1):
if v==j or (v<j and dp[i][j-v]>0):
dp[i+1][j] = dp[i][j] + 1
else:
dp[i+1][j] = dp[i][j]
return dp[n][s] > 0
n = int(eval(input()))
a = list(map(int, input().spl... | def subset_sum(n, s, a):
dp = [[0 for x in range(s+1)] for x in range(n+1)]
dp[0][0]=1
for i in range(n):
v = a[i]
for j in range(s+1):
if v > j:
dp[i+1][j] = dp[i][j]
else:
dp[i+1][j] = dp[i][j]+dp[i][j-v]
return dp[n][s] > 0
n = int(eval(input()))
a = list(map(int, input().split())... | p02271 |
n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = list(map(int, input().split()))
def rec(i, m):
if m == 0:
return True
if i >= n:
return False
res = rec(i + 1, m)
if m - A[i] >= 0:
res |= rec(i + 1, m - A[i])
return res
for m ... | n = int(eval(input()))
A = list(map(int, input().split()))
q = int(eval(input()))
M = list(map(int, input().split()))
bits = 1
for a in A:
bits |= bits << a
for m in M:
print(('yes' if (bits >> m) & 1 else 'no'))
| p02271 |
n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
def solve(i,m):
if m == 0:
return True
if i >= n:
return False
res = solve(i+1,m) or solve(i+1, m - A[i])
return res
for m in M:
if solve(0, m):
print('yes')
else:
... | n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
min = min(A)
sum = sum(A)
def solve(i,m):
if sum < m:
return False
if m == 0:
return True
if i >= n:
return False
res = solve(i+1,m) or solve(i+1, m - A[i])
return res
... | p02271 |
from itertools import combinations
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = list(map(int, input().split()))
s = set()
for i in range(1, n):
for j in combinations(a, i):
s.add(sum(j))
for ans in m:
print(('yes' if ans in s else 'no')) | from itertools import combinations
n = int(eval(input()))
a = list(map(int, input().split()))
q = int(eval(input()))
m = list(map(int, input().split()))
s = set()
for i in range(1, n + 1):
for j in combinations(a, i):
s.add(sum(j))
for ans in m:
print(('yes' if ans in s else 'no')) | p02271 |
from collections import deque
class MyClass():
def load(self):
self.n = eval(input())
self.A = list(map(int,input().split()))
self.q = eval(input())
self.M = list(map(int,input().split()))
def main(self):
self.load()
W = list(map(self.solve,self.M... | from collections import deque
class MyClass():
def load(self):
self.n = eval(input())
self.A = list(map(int,input().split()))
self.q = eval(input())
self.M = list(map(int,input().split()))
def main(self):
self.load()
W = list(map(self.solve,self.M... | p02271 |
class MyClass():
def main(self):
self.n = eval(input())
self.A = list(map(int,input().split()))
self.q = eval(input())
self.M = list(map(int,input().split()))
W = list(map(self.solve,self.M))
for w in W:
print(w)
def solve(self,m):... | class MyClass():
def main(self):
self.n = eval(input())
self.A = list(map(int,input().split()))
self.q = eval(input())
self.M = list(map(int,input().split()))
W = list(map(self.solve,self.M))
for w in W:
print(w)
def solve(self,m):... | p02271 |
from itertools import combinations
n, a, q, ms = int(eval(input())), list(map(int, input().split())), eval(input()), list(map(int, input().split()))
cache = {}
def sum_a(tmp, t):
global a, cache
if t in cache:
return tmp + cache[t]
elif len(t) == 1:
return tmp + a[t[0]]
... | from itertools import combinations
n, a, q, ms, cache = int(eval(input())), list(map(int, input().split())), eval(input()), list(map(int, input().split())), {}
def sum_a(tmp, t):
global a, cache
if t in cache:
return tmp + cache[t]
elif len(t) == 1:
return tmp + a[t[0]]
els... | p02271 |
from itertools import combinations
n, a, q, ms, cache = int(eval(input())), list(map(int, input().split())), eval(input()), list(map(int, input().split())), {}
l = set(sum(t) for i in range(n) for t in combinations(a, i + 1))
for m in ms:
print(('yes' if m in l else 'no')) | from itertools import combinations
n, a, q = int(eval(input())), list(map(int, input().split())), eval(input())
l = set(sum(t) for i in range(n) for t in combinations(a, i + 1))
for m in map(int, input().split()):
print(('yes' if m in l else 'no')) | p02271 |
a_len = int(eval(input()))
a_ar = sorted([int(n) for n in input().split(" ")])
b_len = int(eval(input()))
b_ar = [int(n) for n in input().split(" ")]
dp = [0 for n in range(2001)]
for a in a_ar:
new_dp = dp[:]
new_dp[a] = 1
for i,d in enumerate(dp):
if d and i + a <= 2000:
new_... | a_len = int(eval(input()))
a_ar = sorted([int(n) for n in input().split(" ")])
b_len = int(eval(input()))
b_ar = [int(n) for n in input().split(" ")]
max_b = max(b_ar)
dp = [0 for n in range(max_b + 1)]
for a in a_ar:
new_dp = dp[:]
new_dp[a] = 1
for i,d in enumerate(dp):
if d and i + a <=... | p02271 |
eval(input())
A = list(map(int,input().split()))
eval(input())
M = list(map(int,input().split()))
def solve(i,m):
a = 0
if a ==m:
return True
if i >= len(A):
return False
res = solve(i+1,m) or solve(i+1,m-A[i])
return res
for k in M:
print(("yes" if solve(... | eval(input())
A = list(map(int,input().split()))
eval(input())
M = list(map(int,input().split()))
d = {}
def solve(i,s):
if i == len(A):
d[s] = 0
return s
solve(i+1,s)
solve(i+1,s+A[i])
return 1
solve(0,0)
for a in M:
if a in d:
print("yes")
... | p02271 |
n = int(input())
A = list(map(int, input().strip().split(' ')))
q = int(input())
M = list(map(int, input().strip().split(' ')))
memo = []
for i in range(len(A)+1):
memo.append([None]*2000)
def solve(i,m):
if memo[i][m] != None: return memo[i][m]
if m == 0:
memo[i][m] = True
re... | n = int(input())
A = list(map(int, input().strip().split(' ')))
q = int(input())
M = list(map(int, input().strip().split(' ')))
memo = []
for i in range(len(A)+1):
memo.append([None]*2000)
def solve(i,m):
if memo[i][m] != None: return memo[i][m]
if m == 0:
memo[i][m] = True
re... | p02271 |
# -*- coding:utf-8 -*-
import sys
def exhaustive(n, target, lst):
if n == target:
return True
if n > target or lst == []:
return False
else:
for i, val in enumerate(lst, 1):
if exhaustive(n + val, target, lst[i:]):
return True
return Fal... | # -*- coding:utf-8 -*-
import sys
def exhaustive(lst, size):
result = []
for i in range(0, 1 << size):
total = 0
for j in range(0, size):
if (i & 0x01) == 1:
total += lst[j]
i = i >> 1
result.append(total)
return result
if _... | p02271 |
n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n:
return False
res = solve(i+1, m) or solve(i+1, m - A[i])
return res
for m in M:
if solve(0,m):
print... | n = eval(input())
A = list(map(int, input().split()))
q = eval(input())
M = list(map(int, input().split()))
def solve(i, m):
if m == 0:
return True
if i >= n or m > sum(A):
return False
res = solve(i+1, m) or solve(i+1, m - A[i])
return res
for m in M:
if solve(0,m)... | p02271 |
#!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(s: str, x: int, y: int):
LENS = len(s)
s_list = list(map(len,s.split("T")))
x_s_list = s_list[0::2]
y_s_list = s_list[1::2]
x_dp = [[False]*(2*LENS+1) for _ in range(len(x_s_list))]
## ans... | #!/usr/bin/env python3
import sys
YES = "Yes" # type: str
NO = "No" # type: str
def solve(s: str, x: int, y: int):
s_list = list(map(len,s.split("T")))
x_s_list = s_list[0::2]
y_s_list = s_list[1::2]
x_dp = [set() for _ in range(len(x_s_list))]
for index,count in enumerate(x_s_list)... | p03488 |
s=[len(c) for c in list(input().split("T"))]
x,y=list(map(int,input().split()))
XX=s[::2]
YY=s[1::2]
X=[XX[0]]
Y=[0]
XXX=[]
for i in range(1,len(XX)):
for j in X:
XXX.append(j+XX[i])
XXX.append(j-XX[i])
X=XXX
XXX=[]
YYY=[]
for i in range(len(YY)):
for j in Y:
YY... | s=[len(c) for c in list(input().split("T"))]
x,y=list(map(int,input().split()))
XX=s[::2]
YY=s[1::2]
X=set([XX[0]])
Y=set([0])
XXX=[]
for i in range(1,len(XX)):
for j in X:
XXX.append(j+XX[i])
XXX.append(j-XX[i])
X=set(XXX)
XXX=[]
YYY=[]
for i in range(len(YY)):
for j in... | p03488 |
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
order_F = []
order_F = input().rstrip().split('T')
x, y = list(map(int, input().split()))
vert_DP = [False] * 8001
side_DP = [False] * 8001
vert_DP[0] = True
side_DP[0] = True
vert_sum = 0
... | import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
order_F = []
order_F = input().rstrip().split('T')
x, y = list(map(int, input().split()))
vert_DP = [False] * 8001
side_DP = [False] * 8001
vert_DP[0] = True
side_DP[0] = True
vert_sum = 0
... | p03488 |
import sys
sys.setrecursionlimit(10**6)
input = sys.stdin.readline
def main():
order_F = []
order_F = input().rstrip().split('T')
x, y = list(map(int, input().split()))
distance = [len(i) for i in order_F]
x -= distance[0]
side = []
vert = []
sum_s = 0
sum_v = 0
... | def main():
order = [len(el) for el in list(map(str, input().rstrip().split("T")))]
x_points = {order[0]}
y_points = {0}
for val in order[2::2]:
plus_val = {x + val for x in list(x_points)}
minus_val = {x - val for x in list(x_points)}
x_points = plus_val | minus_val
... | p03488 |
from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
... | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(eval(input()))
inl = lambda: list(map(int, input().split()))
inm = lambda: list(map(int, input().split()))
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
... | p03488 |
from collections import defaultdict
s = input().split('T')
dx = list(map(len, s[0::2]))
dy = list(map(len, s[1::2]))
lx = sum(dx)
ly = sum(dy)
x, y = list(map(int, input().split()))
dp = [defaultdict(bool) for _ in range(len(dx))]
dp[0][dx[0]] = True
for i in range(1, len(dx)):
for j in range(-lx, lx ... | s = input().split('T')
dx = list(map(len, s[0::2]))
dy = list(map(len, s[1::2]))
x, y = list(map(int, input().split()))
def check(start, ds, goal):
cands = {start}
for d in ds:
new_cands = set()
for c in cands:
new_cands.add(c - d)
new_cands.add(c + d)
... | p03488 |
import sys
s = sys.stdin.readline().rstrip()
x, y = list(map(int, sys.stdin.readline().split()))
def reachable(deltas, goal):
if not deltas:
if goal == 0:
return True
else:
return False
s = sum(deltas)
if goal < -s or s < goal:
return Fals... | import sys
s = sys.stdin.readline().rstrip()
x, y = list(map(int, sys.stdin.readline().split()))
def reachable(deltas, goal):
if not deltas:
if goal == 0:
return True
else:
return False
s = sum(deltas)
if goal < -s or s < goal:
return Fa... | p03488 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, perm... | p03488 |
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
s = input().rstrip()
gx, gy = list(map(int, input().split()))
rx, ry = 0, 0
head, inst = 0, []
while head < len(s) and s[head] == "F":
head += 1
rx += 1
while head < len(s):
tcnt = 0
while head < len(s) and s[head] == "T"... | """Knapsack"""
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
s = input().rstrip()
gx, gy = list(map(int, input().split()))
rx, ry = 0, 0
head, inst = 0, []
while head < len(s) and s[head] == "F":
head += 1
rx += 1
xlist, ylist = [], []
heading_x = True
while head < len(s)... | p03488 |
s=list(map(len,input().split("T")))
x,y=list(map(int,input().split()))
def f(t,w):
for i in range(1<<len(t)):
z=0
for j in range(len(t)):
z+=[1,-1][i>>j&1]*t[j]
if z==w:
return True
return False
print(("Yes"if f(s[2::2],x-s[0]) and f(s[1::2],y) else "No"... | s=list(map(len,input().split("T")))
x,y=list(map(int,input().split()))
def f(t,w):
m=[{} for i in range(len(t)+1)]
m[0][0]=1
for i in range(len(t)):
for z in m[i]:
m[i+1][z+t[i]]=1
m[i+1][z-t[i]]=1
return w in m[len(t)]
print((["No","Yes"][f(s[2::2],x-s[0]) and ... | p03488 |
# -*- coding: utf-8 -*-
nF = list(map(str, input().split('T')))
finalx, finaly = list(map(int, input().split()))
x = []
y = []
for i in range(len(nF)):
if i % 2 == 0:
x.append(len(nF[i]))
else:
y.append(len(nF[i]))
posy = [0]
if len(x) == 0:
posx = [0]
elif len(x) == 1:
... | # -*- coding: utf-8 -*-
nF = list(map(str, input().split('T')))
finalx, finaly = list(map(int, input().split()))
x = []
y = []
for i in range(len(nF)):
if i % 2 == 0:
x.append(len(nF[i]))
else:
y.append(len(nF[i]))
posy = [0]
if len(x) == 0:
posx = [0]
elif len(x) == 1:
... | p03488 |
# -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | # -*- coding: utf-8 -*-
#############
# Libraries #
#############
import sys
input = sys.stdin.readline
import math
#from math import gcd
import bisect
import heapq
from collections import defaultdict
from collections import deque
from collections import Counter
from functools import lru_cache
###... | p03488 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
from pprint import pprint
from copy import deepcopy
import string
from bisect import bisect_... | p03488 |
from copy import deepcopy as dc
S=list(map(len,input().split("T")))
x,y=list(map(int,input().split()))
x=abs(x-S[0])
y=abs(y)
L=S[2::2]
R=S[1::2]
sumL=sum(L)
sumR=sum(R)
flag=0
if sumL>=x and sumR>=y and (sumL-x)%2==0 and (sumR-y)%2==0 and flag==0:
setL={0}
setR={0}
setL1={0}
setR1={0}... | from itertools import accumulate
S=list(map(len,input().split("T")))
x,y=list(map(int,input().split()))
x=abs(x-S[0])
y=abs(y)
L=S[2::2]
R=S[1::2]
La=list(accumulate(L))
Ra=list(accumulate(R))
sumL=sum(L)
sumR=sum(R)
flag=0
if sumL>=x and sumR>=y and (sumL-x)%2==0 and (sumR-y)%2==0 and flag==0:
setL1={... | p03488 |
from itertools import accumulate
S=list(map(len,input().split("T")))
x,y=list(map(int,input().split()))
x=abs(x-S[0])
y=abs(y)
L=S[2::2]
R=S[1::2]
La=list(accumulate(L))
Ra=list(accumulate(R))
sumL=sum(L)
sumR=sum(R)
flag=0
if sumL>=x and sumR>=y and (sumL-x)%2==0 and (sumR-y)%2==0 and flag==0:
setL1={... | S=list(map(len,input().split("T")))
x,y=list(map(int,input().split()))
x=abs(x-S[0])
y=abs(y)
L=S[2::2]
R=S[1::2]
sumL=sum(L)
sumR=sum(R)
flag=0
if sumL>=x and sumR>=y and (sumL-x)%2==0 and (sumR-y)%2==0 and flag==0:
setL1={0}
setR1={0}
gL=(sumL-x)//2
gR=(sumR-y)//2
if gL==0:
... | p03488 |
def check(a, numlist):
goal = a+sum(numlist)
if goal %2 == 1:
return False
goal /=2
oklist =[0]
for x in numlist:
addlist = [ok+x for ok in oklist]
oklist += addlist
return goal in oklist
s = [len(x) for x in input().split('T')]
x,y = [int(i) for i in input().split()]
x = x-s[0]
sx = s[2:... | def check(a, numlist):
goal = a+sum(numlist)
if goal %2 == 1:
return False
goal /=2
okset ={0}
for x in numlist:
addset = {ok+x for ok in okset}
okset |= addset
return goal in okset
s = [len(x) for x in input().split('T')]
x,y = [int(i) for i in input().split()]
x = x-s[0]
sx = s[2::2]
sy = ... | p03488 |
st = input().split("T")
x, y = list(map(int, input().split()))
XL = []; YL = []; t = 0
for i in range(len(st)):
if i % 2 == 0:
XL.append(len(st[i]))
else:
YL.append(len(st[i]))
t += len(st[i])
T = max([x, y, t])
xx = [[False for j in range(2*T+1)] for i in range(len(XL)+1)]
yy =... | st = input().split("T")
x, y = list(map(int, input().split()))
XL = []; YL = []; t = 0
for i in range(len(st)):
if i % 2 == 0:
XL.append(len(st[i]))
else:
YL.append(len(st[i]))
t += len(st[i])
if abs(x) + abs(y) > t:
print("No")
else:
T = max([abs(x), abs(y), t])
xx ... | p03488 |
st = input().split("T")
x, y = list(map(int, input().split()))
XL = []; YL = []; t = 0
for i in range(len(st)):
if i % 2 == 0:
XL.append(len(st[i]))
else:
YL.append(len(st[i]))
t += len(st[i])
if abs(x) + abs(y) > t:
print("No")
else:
T = max([abs(x), abs(y), t])
xx ... | s=input().split("T")
x,y=list(map(int,input().split()))
A=[]
B=[]
for i,j in enumerate(s):
if i%2==0:
A.append(len(j))
else:
B.append(len(j))
T=max([sum(A),sum(B),abs(x),abs(y)])
X=len(A)
Y=len(B)
if abs(x)+abs(y)>sum(A)+sum(B):
print("No")
exit()
dpx=[[False for i in rang... | p03488 |
# D - FT Robot
# coding: utf-8
def check(d, to_d):
meu = [0]
for i in to_d:
hoge = []
for j in meu:
hoge.append(j+i), hoge.append(j-i)
meu = hoge
return d in meu
S = [ len(F) for F in input().split('T') ]
x, y = list(map(int, input().split()))
to_x, to_y = S[2::2], S[1::2]
pri... | # D - FT Robot
# coding: utf-8
def check(d, to_d):
meu = [0]
for i in to_d:
hoge = []
for j in meu:
if not j+i in hoge : hoge.append(j+i)
if not j-i in hoge : hoge.append(j-i)
meu = hoge
return d in meu
S = list(map(len, input().split('T')))
x, y = list(map(int, input().sp... | p03488 |
# D - FT Robot
# coding: utf-8
def check(d, to_d):
meu = [0]
for i in to_d:
hoge = []
for j in meu:
if not j+i in hoge : hoge.append(j+i)
if not j-i in hoge : hoge.append(j-i)
meu = hoge
return d in meu
# S = map(len, raw_input().split('T'))
a = input()
S = list(map(len, ... | # D - FT Robot
# coding: utf-8
def check(d, to_d):
meu = set([0])
for i in to_d:
hoge = set([])
for j in meu: hoge.add(j+i), hoge.add(j-i)
meu = hoge
return d in meu
S = list(map(len, input().split('T')))
x, y = list(map(int, input().split()))
to_x, to_y = S[2::2], S[1::2]
print("Yes... | p03488 |
s=list(input().split("T"))
#print s
x,y=list(map(int,input().split()))
cx,cy=len(s[0]),0
lx=[len(_) for _ in s[2::2]]
ly=[len(_) for _ in s[1::2]]
#print lx
#print ly
memo_x=[set((cx,))]
for ind_i,i in enumerate(lx):
next_memo_x = set()
for j in memo_x[ind_i]:
next_memo_x.add(j+i)
next_memo_x.add... | s=list(input().split("T"))
x,y=list(map(int,input().split()))
lx=[len(_) for _ in s[2::2]]
ly=[len(_) for _ in s[1::2]]
dpx=set()
dpx.add(len(s[0]))
for i in lx:
tmp=set()
for j in dpx:
tmp.add(j+i)
tmp.add(j-i)
dpx=tmp
dpy=set()
dpy.add(0)
for i in ly:
tmp=set()
for j in dpy:
tmp.add(... | p03488 |
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list([x-1 for x in MII()])
## dp ##
def DD2(d1,d2,init=0): return [[init]*d2 for _ in range(d1)]
def DD3(d1,d2,d3,init=0): return [DD2(d2,d3,init) for _... | p03488 |
s=input().split('T')
x,y=list(map(int,input().split()))
dx,dy={0},{0}
for i,a in enumerate(map(len,s[::2])):
if i:dx=set(t+a for t in dx)|set(t-a for t in dx)
else:dx={a}
for b in map(len,s[1::2]):dy=set(t+b for t in dy)|set(t-b for t in dy)
if x in dx and y in dy:print('Yes')
else:print('No') | t,*s=input().split('T')
x,y=list(map(int,input().split()))
dx,dy={len(t)},{0}
for a in map(len,s[1::2]):dx=set(t+a for t in dx)|set(t-a for t in dx)
for b in map(len,s[::2]):dy=set(t+b for t in dy)|set(t-b for t in dy)
if x in dx and y in dy:print('Yes')
else:print('No') | p03488 |
s = [len(i) for i in input().split("T")]
x,y = (int(i) for i in input().split())
xl,yl,flag = [],[],False
for i in range(len(s)):
if i%2==0: xl.append(s[i])
else: yl.append(s[i])
x,y,xl = abs(x-xl[0]),abs(y),xl[1:]
xs,ys,lenx,leny,xl2,yl2 = sum(xl),sum(yl),len(xl),len(yl),[0],[0]
a,b = [[0 for i in range(xs+... | s = [len(i) for i in input().split("T")]
x,y = (int(i) for i in input().split())
xl,yl,flag = [],[],False
for i in range(len(s)):
if i%2==0: xl.append(s[i])
else: yl.append(s[i])
x,y,xl = abs(x-xl[0]),abs(y),xl[1:]
xs,ys,lenx,leny,xl2,yl2 = sum(xl),sum(yl),len(xl),len(yl),[0],[0]
a,b = [[0 for i in range(xs+... | p03488 |
S = input().split('T')
N = len(S)
X = []
Y = []
for i in range(N):
if i%2:
Y.append(len(S[i]))
else:
X.append(len(S[i]))
Xsum = sum(X)
Ysum = sum(Y)
from collections import defaultdict,deque
dpx = defaultdict(int)# 初期値を0にした辞書
dpy = defaultdict(int)# 初期値を0にした辞書
dpx[Xsum]... | S = input().split('T')
S = [len(s) for s in S]
X = S[::2]
Y = S[1::2]
from collections import defaultdict,deque
dpx = defaultdict(int)# 初期値を0にした辞書
dpy = defaultdict(int)# 初期値を0にした辞書
dpx[sum(X)] = 1
dpy[sum(Y)] = 1
que = deque()
for i,x in enumerate(X):
if i == 0:
continue
for k,v in l... | p03488 |
import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | import sys
sys.setrecursionlimit(10**7)
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdi... | p03488 |
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisec... | def main():
import sys
input = sys.stdin.readline
s = input().rstrip()
x,y = list(map(int, input().split()))
f = s.split('T')
dx_list = list(map(len, f[::2]))
dy_list = list(map(len, f[1::2]))
nx = dx_list.pop(0)
ny = 0
dx_list.sort(reverse=True)
dy_list.... | p03488 |
s = list(map(len, input().split("T")))
*x, = list(map(int,input().split()))
x[0] -= s[0]
s = s[1:]
ans = True
for j in range(2):
dp = [False]*(8000*2+1)
dp[8000] = True
MAX, MIN = 8000, 8000
for i in range(j, len(s), 2):
dp_new = [False]*(8000*2+1)
MIN_ = 8000*2+1
M... | s = list(map(len, input().split("T")))
*x, = list(map(int,input().split()))
x[0] -= s[0]
s = s[1:]
moveX, moveY = [], []
for i in range(len(s)):
if i%2 == 0:
moveY.append(s[i])
else:
moveX.append(s[i])
X = [x[0]]
Y = [x[1]]
for x in moveX:
X_ = []
for cx in X:
X_... | p03488 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
base = 8000
dp = [[False] * 16001 for _ in range(len(vec) + 1)]
dp[0][init_pos + base] = True
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
base = 8000
dp = [False] * 16001
dp[init_pos + base] = True
for i in range(len(vec)):
... | p03488 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
base = 8000
dp = [False] * 16001
dp[init_pos + base] = True
for i in range(len(vec)):
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
base = 8000
dp = [False] * 16001
dp[init_pos + base] = True
for i in range(len(vec)):
... | p03488 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
base = 8000
dp = [False] * 16001
dp[init_pos + base] = True
for i in range(len(vec)):
... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.a... | p03488 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.a... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.a... | p03488 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
dp_next = set()
for v in dp:
dp_next.a... | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def check(vec, init_pos, target_pos):
dp = {init_pos}
for nv in vec:
if nv == 0:
continue
dp_next = set()
... | p03488 |
#!/usr/bin/env python3
import sys, heapq
sys.setrecursionlimit(300000)
YES = "Yes" # type: str
NO = "No" # type: str
def solve(N: int, S: "List[str]"):
tmp = []
for i in range(N):
cur = 0
mn = 0
for c in S[i]:
if c == '(':
cur += 1
... | #!/usr/bin/env python3
import sys, heapq
sys.setrecursionlimit(300000)
YES = "Yes" # type: str
NO = "No" # type: str
def solve(N: int, S: "List[str]"):
tmp = []
for i in range(N):
cur = 0
mn = 0
for c in S[i]:
if c == '(':
cur += 1
... | p02686 |
N = int(eval(input()))
D, E = [], []
t,l = 0, 0
res = 0
for _ in range(N):
S = input().rstrip()
x,y = 0,0
for s in S:
if s=="(": x+=1
else: x=max(x-1,0)
for s in reversed(S):
if s==")": y+=1
else: y=max(y-1,0)
D.append((x,y))
D.sort(key=lambda x:x[1])
t... | import sys
input = sys.stdin.readline
N = int(eval(input()))
D, E = [], []
t,l = 0, 0
res = 0
for _ in range(N):
S = input().rstrip()
x,y = 0,0
for s in S:
if s=="(": x+=1
else: x=max(x-1,0)
for s in reversed(S):
if s==")": y+=1
else: y=max(y-1,0)
D.app... | p02686 |
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)
from heapq import heappush, heappop
def input():
return sys.stdin.readline().strip()
# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
return [ int(s) for s in input().split(" ")]
# 改行... | import sys
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline().strip()
def log(*args):
print("DEBUG:", *args, file=sys.stderr)
n = int(input())
S = [ input() for _ in range(n)]
left = 0
right = 0
LMR = [0] * n
MIN_LMR = [0] * n
for i,s in enumerate(S):
l = 0
r... | p02686 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, ... | p02686 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, ... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor, acos, ... | p02686 |
# -*- coding: utf-8 -*-
N = int(input().strip())
S_list = [input().strip() for _ in range(N)]
#-----
def count_brackets(brackets):
cnt = 0
min_cnt = float("inf")
for i in range(len(brackets)):
if brackets[i] == "(":
cnt += 1
else: # brackets[i] == ")"
... | # -*- coding: utf-8 -*-
N = int(input().strip())
S_list = [input().strip() for _ in range(N)]
#-----
def count_brackets(brackets):
cnt = 0
min_cnt = 0
for i in range(len(brackets)):
if brackets[i] == "(":
cnt += 1
else: # brackets[i] == ")"
cnt -... | p02686 |
import heapq
import sys
input = sys.stdin.readline
n = int(eval(input()))
sss = [input()[:-1] for _ in range(n)]
a = []
b = []
ss = 0
ii = 0
for i in sss:
mi = 0
ma = 0
s = 0
for j in i:
if j == "(":
s += 1
else:
s -= 1
mi = min(mi, s)
... | import heapq
import sys
input = sys.stdin.readline
n = int(eval(input()))
sss = [input()[:-1] for _ in range(n)]
a = []
b = []
ss = 0
ii = 0
for i in sss:
mi = 0
ma = 0
s = 0
for j in i:
if j == "(":
s += 1
else:
s -= 1
mi = min(mi, s)
... | p02686 |
n = int(input())
def gb(s):
bal,m = 0,0
for l in s:
bal += 1 if l == '(' else -1
m = min(m, bal)
return (bal,m)
rs = [gb(input()) for _ in range(n)]
rs.sort(key = lambda x: (0,-x[1], x[0]) if x[0]>=0 else (1,x[1] - x[0], -x[0]))
def f(rs):
s = 0
for aa,bb in rs:
if s + bb < 0: return False... | n = int(input())
def gb(s):
bal,m = 0,0
for l in s:
bal += 1 if l == '(' else -1
m = min(m, bal)
return (bal,m)
-1 -1 -1 -3 -5 -11 -23
-23 -11 -5 -3 -1 -1 -1
rs = [gb(input()) for _ in range(n)]
rs.sort(key = lambda x: (0, -x[1]) if x[0]>=0 else (1,x[1] - x[0], x[0]))
def f(rs):
s = 0
for ... | p02686 |
from sys import exit
from itertools import accumulate,chain
n,*s=open(0).read().split()
t=list([2*x.count("(")-len(x) for x in s])
if sum(t)!=0:
print("No")
exit()
#pypyではinitialだめ
st=[[t_,min(accumulate(s_,lambda a,b: a+(1 if b=="(" else -1),initial=0))] for s_,t_ in zip(s,t)]
now=sum([x[0] for x in... | from sys import exit
from itertools import accumulate,chain
n,*s=open(0).read().split()
t=[2*(i.count("("))-len(i) for i in s]
if sum(t)!=0:
print("No");exit()
#pypyではinitialだめ
st=[[t_,min(accumulate(s_,lambda a,b: a+(1 if b=="(" else -1),initial=0))] for s_,t_ in zip(s,t)]
now=0
v=list([x for x in st if... | p02686 |
N,L=map(int,input().split());print(*(sorted([input() for _ in range(N)])),sep='')
| n,l=map(int,input().split());print(*sorted([input() for _ in range(n)]),sep='')
| p04044 |
# _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest042-B
# TODO https://atcoder.jp/contests/abc042/tasks/abc042_b
import time
from contextlib import contextmanager
# from time import sleep
@contextmanager
def timer(title):
t0 = time.time()
yield
print(("{} - done in {:.0f}s".format(title,time.time()-t0) )... | # Problem: https://atcoder.jp/contests/abc042/tasks/abc042_b
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): retu... | p04044 |
N,L=map(int,input().split())
S=[]
for i in range (N):
S.append(input())
K=sorted(S)
for i in range (N):
print(K[i],end="")
print()
| N,L=map(int,input().split())
S=[]
for i in range(N):
S.append(input())
M=sorted(S)
for i in range(N):
print(M[i],end="")
print()
| p04044 |
#!usr/bin/env python3
from collections import defaultdict
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()))... | #!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.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS... | p04044 |
n, l = map(int, input().split())
s = sorted([input() for _ in range(n)])
print(*s, sep='')
| n, l = map(int, input().split())
print(*sorted([input() for _ in range(n)]), sep='')
| p04044 |
import sys
input = sys.stdin.readline
N, L = [int(x) for x in input().split()]
S = []
for _ in range(N):
S.append(input().rstrip())
S.sort()
print(("".join(S))) | import sys
input = sys.stdin.readline
n, l = [int(x) for x in input().split()]
s = [input().rstrip() for _ in range(n)]
s.sort()
print(("".join(s))) | p04044 |
N, L = map(int, input().split())
s = [input() for i in range(N)]
s.sort()
print(*s, sep="")
| N, L = map(int, input().split())
s = sorted([input() for i in range(N)])
print(*s, sep="")
| p04044 |
N,L = map(int,input().split())
S = sorted([input() for n in range(N)])
print(*S,sep="")
| N,L = map(int,input().split())
print(*sorted([input() for n in range(N)]),sep="")
| p04044 |
n, l = map(int, input().split())
print(*sorted([input() for i in range(n)]), sep="")
| n,l = map(int, input().split())
s = []
for _ in range(n):
s.append(input())
print(*sorted(s), sep='')
| p04044 |
from itertools import permutations
N, L = map(int, input().split())
S = [input() for _ in range(N)]
p = list(permutations(S))
print(*sorted(p)[0], sep='')
| N, L = map(int, input().split())
S = sorted(list(input() for _ in range(N)))
print(*S, sep='')
| p04044 |
# -*- coding: utf-8 -*-
n,l = map(int,input().split())
s = [input() for i in range(n)]
s = sorted(s)
print(*s,sep="")
| n,l = map(int,input().split())
s = sorted([input() for i in range(n)])
print(*s,sep="")
| p04044 |
import math
n,x = list(map(int,input().split()))
xl = list(map(int,input().split()))
dis = []
ans = 0
for i in range(n):
dis.append(abs(x-xl[i]))
for i in range(n):
ans = math.gcd(ans,dis[i])
print(ans) | N,X = list(map(int,input().split()))
x = list(map(int,input().split()))
ans = 0
from math import gcd
for i in range(N):
ans = gcd(ans,abs(X-x[i]))
print(ans) | p03262 |
import math
n,x=list(map(int,input().split()));l=[abs(x-i) for i in list(map(int,input().split()))]
if len(l)>1:
r=math.gcd(l[0],l[1])
for i in range(1,len(l)):
r=math.gcd(r,l[i])
else:
print((l[0]))
exit()
print(r) | import math
n,x=list(map(int,input().split()));l=[abs(x-i) for i in list(map(int,input().split()))];r=0
for i in range(len(l)): r=math.gcd(r,l[i])
print(r) | p03262 |
def solve(X, xs):
divs = list(range(1, int(10 ** 4.5) + 1))
def divisors(X, smaller_only=False):
fwd, bwd = [], []
for p in divs:
if X % p == 0:
fwd.append(p)
if not smaller_only and X // p != p:
bwd.append(X // p)
... | try:
from math import gcd # >=Python 3.5
except:
from fractions import gcd # <Python 3.5 (AtCoder : 3.4)
def solve(X, xs):
xs = list(xs) + [X]
xs.sort()
zs = [x - xs[0] for x in xs]
for z in zs:
if z == 0:
D = z
else:
D = gcd(D, z)
ret... | p03262 |
from math import gcd
from functools import reduce
_, X = list(map(int, input().split()))
x = set(map(int, input().split()))
x.add(X)
x = sorted(x)
print((reduce(gcd, (j - i for i, j in zip(x[:-1], x[1:]))))) | from math import gcd
from functools import reduce
_, X = list(map(int, input().split()))
print((reduce(gcd, (abs(i - X) for i in set(map(int, input().split())))))) | p03262 |
import math
def main():
n, s = list(map(int, input().split()))
xs = sorted(list(map(int, input().split())))
for i in range(n):
xs[i] = abs(xs[i] - s)
for i in range(1, n):
xs[i] = math.gcd(xs[i], xs[i-1])
print((xs[n-1]))
if __name__ == "__main__":
main()
| from math import gcd
def main():
n, x = list(map(int, input().split()))
xs = list(map(int, input().split()))
xs.append(x)
xs.sort()
diff = []
for i in range(1, n+1):
diff.append(xs[i] - xs[i-1])
ans = diff[0]
for i in range(1, n):
ans = gcd(ans, diff[i])
... | p03262 |
N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
def gcd(m, n):
x = max(m, n)
y = min(m, n)
if x%y:
while x%y:
z = x%y
x, y = y, x
else:
return z
else:
return y
x.append(X)
x.sort()
# print(x)
# d... | N, X = list(map(int, input().split()))
x = list(map(int, input().split()))
def gcd(m, n):
x = max(m, n)
y = min(m, n)
# if x%y:
# while x%y:
# z = x%y
# x, y = y, x
# else:
# return z
# else:
# return y
if y == 0:
re... | p03262 |
import math
# 最大公約数を求める問題
N, X = list(map(int, input().split()))
x = [int(_) for _ in input().split()]
if N == 1:
print((abs(x[0]-X)))
exit()
x.sort()
# N > 1と仮定
for i in range(N-1):
if x[i] < X and x[i+1] > X:
x = x[:i+1] + [X] + x[i+1:]
break
elif x[i] >= X:
x... | import math
# 最大公約数を求める問題
N, X = list(map(int, input().split()))
x = [int(_) for _ in input().split()]
if N == 1:
print((abs(x[0]-X)))
exit()
x.sort()
# N > 1と仮定
for i in range(N-1):
if x[i] < X and x[i+1] > X:
x = x[:i+1] + [X] + x[i+1:]
break
elif x[i] >= X:
x... | p03262 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def main():
N, X = list(map(int, input().split()))
x = list(map(int, input().split... | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
def main():
N, X = list(map(int, input().split()))
x = list(map(int, input().split... | p03262 |
f=lambda:[*list(map(int,input().split()))]
n,x=f()
l=f()
d=[l[i+1]-l[i] for i in range(n-1)]
a=abs(x-l[0])
from math import *
for i in d:
a=gcd(a,i)
print(a) | f=lambda:[*list(map(int,input().split()))]
n,x=f()
d=[abs(i-x) for i in f()]
a=d.pop()
from math import *
for i in d:
a=gcd(a,i)
print(a) | p03262 |
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
if n == 1:
print((abs(x-a[0])))
exit()
else:
a.sort()
box = [a[i+1]-a[i] for i in range(n-1)]
b = min(box)
for i in range(1,b+1):
for j in range(n-1):
if box[j]%i:
break
... | n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
if n == 1:
print((abs(x-a[0])))
exit()
else:
a.append(x)
a.sort()
box = [a[i+1]-a[i] for i in range(n)]
b = min(box)
for i in range(1,b+1):
for j in range(n-1):
if box[j]%i:
... | p03262 |
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
N,A = list(map(int,input().split()))
X = sorted(map(int,input().split()))
Y = []
for x in X:
Y.append(abs(A-x))
ans = max(Y)
for y in Y:
ans = gcd(y,ans)
print(ans) | N,S = list(map(int,input().split()))
X = list(map(int,input().split()))
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
new_X = []
for x in X:
new_X.append(abs(S-x))
ans = new_X[0]
for x in new_X:
ans = min(ans,gcd(ans,x))
print(ans) | p03262 |
n,m = list(map(int,input().split()))
aa = list(map(int,input().split()))
bb = [abs(a-m) for a in aa]
def gcd(a,b):
while b:
a, b = b, a % b
return a
if len(aa) == 1:
print((abs(aa[0]-m)))
else:
while len(bb) > 1:
a, b = bb.pop(), bb.pop()
bb.append(gcd(a,b)... | n,m = list(map(int,input().split()))
aa = list(map(int,input().split()))
bb = [abs(a-m) for a in aa]
def gcd(a,b):
while b:
a, b = b, a % b
return a
ans = bb[0]
if len(aa) == 1:
print((abs(aa[0]-m)))
else:
for b in bb:
ans = gcd(ans,b)
print(ans) | p03262 |
from math import gcd
n,m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(m)
x = sorted(x)
dis = [0]*n
for i in range(n): dis[i] = x[i+1] - x[i]
ans = dis[0]
for i in range(1,n): ans = gcd(ans,dis[i])
print(ans) | from math import gcd
n,m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(m)
x = sorted(x)
l = [0]*n
for i in range(n): l[i] = x[i+1] - x[i]
ans = l[0]
for i in range(1,n): ans = gcd(ans,l[i])
print(ans) | p03262 |
from math import gcd
n,m = list(map(int, input().split()))
x = list(map(int, input().split()))
x.append(m)
x = sorted(x)
l = [0]*n
for i in range(n): l[i] = x[i+1] - x[i]
ans = l[0]
for i in range(1,n): ans = gcd(ans,l[i])
print(ans) | from math import gcd
n,x = list(map(int, input().split()))
l = sorted([x]+list(map(int, input().split())))
nums = [0]*n
for i in range(n): nums[i] = l[i+1] - l[i]
ans = nums[0]
for i in range(1,n):
ans = gcd(ans,nums[i])
print(ans) | p03262 |
N, X = [int(i) for i in input().split()]
x_ls = [int(i) for i in input().split()]
x_ls = [abs(x - X) for x in x_ls]
while True:
if all([x % min(x_ls) == 0 for x in x_ls]):
break
else:
x_ls = [x % min(x_ls) for x in x_ls]
x_ls = [x for x in x_ls if x != 0]
print((min(x_ls))) | N, X = [int(i) for i in input().split()]
x_ls = [int(i) for i in input().split()]
x_ls = [abs(x - X) for x in x_ls]
while True:
min_x = min(x_ls)
x_ls = [x % min_x for x in x_ls]
if not any(x_ls):
break
x_ls = [x for x in x_ls if x != 0]
print(min_x) | p03262 |
n,x=list(map(int,input().split()))
X=list(map(int,input().split()))
X.append(x)
X.sort()
dif=[]
for i in range(n):
dif.append(X[i+1]-X[i])
for j in range(max(dif),0,-1):
if all(x%j==0 for x in dif):
print(j)
break | n,x=list(map(int,input().split()))
X=list(map(int,input().split()))
dif=[]
for i in range(n):
dif.append(abs(X[i]-x))
def gcd(a,b):
a,b=max(a,b),min(a,b)
if b>0:
return gcd(b,a%b)
else:
return a
ans=dif[0]
for i in range(1,n):
ans=gcd(ans,dif[i])
p... | p03262 |
from functools import reduce
from collections import Counter
N, X = list(map(int, input().split()))
loc = list(map(int, input().split()))
mem = {}
def prime_factors(n):
if mem.get(n) is not None:
return mem[n]
else:
i = 2
factors = []
while i*i <= n:
i... | from functools import reduce
N, X = list(map(int, input().split()))
loc = list(map(int, input().split()))
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b, a%b)
print((reduce(gcd, [abs(l-X) for l in loc]))) | p03262 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.