input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, M = (list(map(int, input().split())))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = 1
A.sort(reverse=True)
B.sort(reverse=True)
aloop = 0
bloop = 0
if len(set(A)) != len(A) or len(set(B)) != len(B):
C = 0
else:
for k in range(N * M, 0, -1):
if C == 0:... | N, M = (list(map(int, input().split())))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
C = 1
A.sort(reverse=True)
B.sort(reverse=True)
aloop = 0
bloop = 0
if len(set(A)) != len(A) or len(set(B)) != len(B):
C = 0
else:
for k in range(N * M, 0, -1):
if aloop <... | p03152 |
N,M=list(map(int,input().split()))
Y=[0]*N*M
X=[0]*N*M
z=1
for a in map(int,input().split()):
if Y[-a]:z=0
Y[-a]=1
for b in map(int,input().split()):
if X[-b]:z=0
X[-b]=1
h=w=0
MD=10**9+7
for i in range(N*M):
z*=[h*w-i,h,w,1][Y[i]*2+X[i]]
z%=MD
h+=Y[i]
w+=X[i]
print(z)
| s,a,b=[set(map(int,input().split()))for j in[0]*3];c=1;N=M=0;k=x=max(a)
while k:A=k in a;B=k in b;N+=A;M+=B;c*=[M*N-x+k,N,M,1][A*2+B];c%=10**9+7;k-=1
print(c) | p03152 |
N,M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mod = 10**9+7
a = 0
b = 0
ans = 1
for i in range(N*M,0,-1):
#print(i,a,b,ans)
if i in A and i in B:
ans = ans
a += 1
b += 1
elif i in A: # i not in B
ans *= b
ans ... | N,M = list(map(int, input().split()))
A = set(list(map(int, input().split())))
B = set(list(map(int, input().split())))
mod = 10**9+7
a = 0
b = 0
ans = 1
for i in range(N*M,0,-1):
#print(i,a,b,ans)
if i in A and i in B:
ans = ans
a += 1
b += 1
elif i in A: # i not in B
ans *= b... | p03152 |
def double_landscape(N: int, M: int, A: list, B: list) -> int:
if not (is_unique(A) and is_unique(B)):
return 0
count = 1
for x in range(N * M + 1, 0, -1):
availables = 0
if x in A and x in B:
availables = 1
elif x in A:
availables = sum(b >... | def double_landscape(N: int, M: int, A: list, B: list) -> int:
if not (is_unique(A) and is_unique(B)):
return 0
A = sorted(A, reverse=True)
B = sorted(B, reverse=True)
i_a, i_b = 0, 0
count = 1
NM = N*M
for x in range(NM, 0, -1):
availables = 0
if i_a < ... | p03152 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03152 |
N, M = list(map(int, input().split()))
a_list = tuple(map(int, input().split()))
b_list = tuple(map(int, input().split()))
mod = 10 ** 9 + 7
a_list = sorted(a_list, reverse=True)
b_list = sorted(b_list, reverse=True)
a_list.append(-1)
b_list.append(-1)
ans = 1
a_i = 0
b_i = 0
for i in range(N*M, 0, -1):
... | N, M = list(map(int, input().split()))
a_list = tuple(map(int, input().split()))
b_list = tuple(map(int, input().split()))
mod = 10 ** 9 + 7
a_list = sorted(a_list, reverse=True)
b_list = sorted(b_list, reverse=True)
a_list.append(-1)
b_list.append(-1)
ans = 1
a_i = 0
b_i = 0
for i in range(N*M, 0, -1):
... | p03152 |
import sys
from bisect import bisect_left
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if len(A) != len(set(A)... | import sys
from bisect import bisect_left
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n, m = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
if len(A) != len(set(A)... | p03152 |
from collections import Counter
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())),reverse=True)
B = sorted(list(map(int,input().split())),reverse=True)
mod = pow(10,9)+7
n,m = 0,0
ans = 1
def istwo(L):
if len(list([x for x in list(Counter(L).values()) if x>1]))>0:
... | from collections import Counter
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())),reverse=True)
B = sorted(list(map(int,input().split())),reverse=True)
mod = pow(10,9)+7
n,m = 0,0
ans = 1
def istwo(L):
if len(list([x for x in list(Counter(L).values()) if x>1]))>0:
... | p03152 |
import bisect
MOD = 10**9+7
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
B = sorted(list(map(int,input().split())))
a = set(A)
b = set(B)
check = True
if len(a) != N or len(b) != M:
check = False
ans = 1
for num in range(N*M,0,-1):
tmp = 0
if num in A and num ... | import bisect
MOD = 10**9+7
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
B = sorted(list(map(int,input().split())))
a = set(A)
b = set(B)
check = True
if len(a) != N or len(b) != M:
check = False
ans = 1
for num in range(N*M,0,-1):
tmp = 0
if num in a and num ... | p03152 |
N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0 for i in range(N*M+1)]
b = [0 for i in range(N*M+1)]
da = [0 for i in range(N*M+1)]
db = [0 for i in range(N*M+1)]
mod = 10**9+7
for i in range(N):
a[A[i]] += 1
if da[A[i]] == 1:
... | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
a = [0 for i in range(N*M+1)]
b = [0 for i in range(N*M+1)]
da = [0 for i in range(N*M+1)]
db = [0 for i in range(N*M+1)]
mod = 10**9+7
for i in range(N):
a[A[i]] += 1
if da[A[i]] == 1:
... | p03152 |
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = 1
cnta = 0
cntb = 0
mod = 10**9+7
for num in range(n*m,0,-1):
if num in a and num in b:
cnta += 1
cntb += 1
cnta%=mod
cntb%=mod
elif num in a:
... | n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
A=set(a);B=set(b)
ans = 1
cnta = 0
cntb = 0
mod = 10**9+7
for num in range(n*m,0,-1):
if num in A and num in B:
cnta += 1
cntb += 1
elif num in A:
ans *= cntb
... | p03152 |
import sys
# %%
n, m = list(map(int, sys.stdin.readline().split()))
ary = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
bry = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
mod = 10 ** 9 + 7
# %%
if len(set(ary)) != len(ary) or len(set(bry)) != len(bry):
prin... | import sys
# %%
n, m = list(map(int, sys.stdin.readline().split()))
ary = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
bry = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
mod = 10 ** 9 + 7
# %%
if len(set(ary)) != len(ary) or len(set(bry)) != len(bry):
prin... | p03152 |
import sys
# %%
n, m = list(map(int, sys.stdin.readline().split()))
ary = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
bry = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
mod = 10 ** 9 + 7
# %%
if len(set(ary)) != len(ary) or len(set(bry)) != len(bry):
prin... | import sys
# %%
n, m = list(map(int, sys.stdin.readline().split()))
ary = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
bry = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)
mod = 10 ** 9 + 7
# %%
if len(set(ary)) != len(ary) or len(set(bry)) != len(bry):
prin... | p03152 |
# -*- coding: utf-8 -*-
"""
参考：https://img.atcoder.jp/keyence2019/editorial.pdf
"""
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from he... | # -*- coding: utf-8 -*-
import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5: from math import gcd
else: from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect i... | p03152 |
H,W=list(map(int,input().split()))
hlen = list(map(int,input().split()))
wlen = list(map(int,input().split()))
hlen.sort(reverse=True)
wlen.sort(reverse=True)
hhlen =[0 for _ in range(H*W+1)]
wwlen =[0 for _ in range(H*W+1)]
for x,xx in zip([hlen,wlen],[hhlen,wwlen]):
c = 1
for y in x:
if xx[y] != 0:
... | H,W=list(map(int,input().split()))
hlen = list(map(int,input().split()))
wlen = list(map(int,input().split()))
hlen.sort(reverse=True)
wlen.sort(reverse=True)
hlen.append(0)
wlen.append(0)
m = H*W
count = 1
h=0
w=0
for num in range(1,H*W+1)[::-1]:
if hlen[h] == num and wlen[w] == num:
count *= 1
h ... | p03152 |
N, M = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
ret = 1
MOD = 10 ** 9 + 7
from collections import Counter
import sys
ca = Counter(A)
cb = Counter(B)
if ca.most_common(1)[0][1] >= 2 or cb.most_common(1)[0][1] >= 2:
print((0))
... | N, M = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
B = [int(x) for x in input().split()]
ret = 1
MOD = 10 ** 9 + 7
A.sort(reverse=True)
B.sort(reverse=True)
aidx = bidx = 0
for n in range(N * M, 0, -1):
# 両方みつけた
if aidx < N and bidx < M and n == A[aidx] and n == B... | p03152 |
import math
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mod = 10 ** 9 + 7
ans = 1
a.sort(reverse = True)
b.sort(reverse = True)
counta = 0
countb = 0
count = 0
for i in range(n*m,0,-1):
if a and b:
if a[0] == i and b[0] ==... | import math
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
mod = 10 ** 9 + 7
ans = 1
a.sort(reverse = True)
b.sort(reverse = True)
counta = 0
countb = 0
count = 0
for i in range(n*m,0,-1):
if a and b:
if a[0] == i and b[0] ==... | p03152 |
from bisect import bisect
n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
a.sort()
b.sort()
ia = 0
ib = 0
cnt = 1
for i in range(1,n*m+1)[::-1]:
if i in a:
if i in b:
cnt *= 1
ia += 1
ib +=... | from bisect import bisect
n, m = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
b = [int(i) for i in input().split()]
a.append(0)
b.append(0)
a.sort()
b.sort()
ia = 0
ib = 0
cnt = 1
for i in range(1,n*m+1)[::-1]:
if i == a[-1]:
if i == b[-1]:
cnt *= 1
... | p03152 |
from collections import Counter
def solve():
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
c = Counter()
MOD = 10**9+7
used = set()
for i in range(N):
for j in range(M):
if A[i]==B[j]:
... | from collections import Counter
import sys
input=sys.stdin.readline
def solve():
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
c = Counter()
MOD = 10**9+7
used = set()
for i in range(N):
for j in ra... | p03152 |
from collections import Counter
import sys
input=sys.stdin.readline
def solve():
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
c = Counter()
MOD = 10**9+7
used = set()
for i in range(N):
for j in ra... | from collections import Counter
import sys
input=sys.stdin.readline
def solve():
N, M = list(map(int, input().split()))
*A, = list(map(int, input().split()))
*B, = list(map(int, input().split()))
c = Counter()
MOD = 10**9+7
used = set()
for i in A:
for j in B:
... | p03152 |
# coding:utf-8
import sys
import bisect
# from collections import Counter, defaultdict
INF = float('inf')
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return eval(inpu... | # coding:utf-8
import sys
INF = float('inf')
MOD = 10 ** 9 + 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 LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return eval(i... | p03152 |
import bisect
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
B = sorted(list(map(int,input().split())))
sa = set(A)
sb = set(B)
MOD = 10**9+7
if len(sa) != N or len(sb) != M:
print((0))
exit()
ans = 1
for n in range(N*M, 0, -1):
if n in sa and n in sb: contin... | N,M = list(map(int,input().split()))
A = list(map(int,input().split()))
B = list(map(int,input().split()))
A.sort()
B.sort()
sa = set(A)
sb = set(B)
if len(sa)!=N or len(sb)!=M:
print((0))
exit()
MOD = 10**9+7
ans = 1
w = h = 0
for v in range(N*M,0,-1):
if v in sa and v in sb:
w += ... | p03152 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mod = 10 ** 9 + 7
def main():
result = 1
i = -1
j = -1
used_area = 0
A.sort(reverse=True)
B.sort(reverse=True)
for x in range(N * M, 0, -1):
while i < N-1:... | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
mod = 10 ** 9 + 7
def main():
result = 1
i = -1
j = -1
used_area = 0
A.sort(reverse=True)
B.sort(reverse=True)
for x in range(N * M, 0, -1):
expanded_row =... | p03152 |
def solve():
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
A = set(map(int, input().split()))
B = set(map(int, input().split()))
row, columun = 0, 0
ans = 1
for i in range(N * M, 0, -1):
in_A = i in A
in_B = i in B
if in_A and in_B:
... | def solve():
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
A = set(map(int, input().split()))
B = set(map(int, input().split()))
row, columun = 0, 0
ans = 1
for i in range(N * M, 0, -1):
in_A = i in A
in_B = i in B
if in_A and in_B:
... | p03152 |
from collections import defaultdict
def main():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = defaultdict(list)
t = defaultdict(list)
for i, x in enumerate(a):
s[x].append(i)
for i, x in enumerate(b):
... | from collections import defaultdict
def main():
n, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
s = defaultdict(list)
t = defaultdict(list)
for i, x in enumerate(a):
s[x].append(i)
for i, x in enumerate(b):
... | p03152 |
def d_double_landxcape(N, M, A, B):
"""
N行M列のグリッドに1からNMまでの整数を重複なく書き込む。このとき、以下の条件を満たす。
・i行目に書き込まれている値のうち、最大の値はA_i
・j行目に書き込まれている値のうち、最大の値はA_j
書き込み方の総数を10**9+7で割った余りを求めよ。
"""
# Aの各要素、またはBの各要素の中で、同じ値があるならば解は0
# (異なる行/列に同じ数字を書き込むことは不可能)。
# グリッドの中のxが書かれうる場所について、xが大きな順に考える。
... | def d_double_landxcape(N, M, A, B):
"""
N行M列のグリッドに1からNMまでの整数を重複なく書き込む。このとき、以下の条件を満たす。
・i行目に書き込まれている値のうち、最大の値はA_i
・j行目に書き込まれている値のうち、最大の値はA_j
書き込み方の総数を10**9+7で割った余りを求めよ。
"""
# Aの各要素、またはBの各要素の中で、同じ値があるならば解は0
# (異なる行/列に同じ数字を書き込むことは不可能)。
# グリッドの中のxが書かれうる場所について、xが大きな順に考える。
... | p03152 |
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# A.sort(reverse=True)
# B.sort(reverse=True)
rowrange = 0
colrange = 0
ans = 1
for i in reversed(list(range(1, N * M + 1))):
r = i in A
c = i in B
if r is True and c is True:
... | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
B = list(map(int, input().split()))
# A.sort(reverse=True)
# B.sort(reverse=True)
rowrange = 0
colrange = 0
ans = 1
for i in reversed(list(range(1, N * M + 1))):
r = i in A
c = i in B
if r is True and c is True:
... | p03152 |
from math import ceil
def main():
l = [int(eval(input())) for _ in range(6)]
n, a, b, c, d, e = l
group = ceil(n / min(a, b, c, d, e))
print((4 + group))
if __name__ == '__main__':
main()
| from math import ceil
def main():
n = int(eval(input()))
required_times = [int(eval(input())) for _ in range(5)]
groups = ceil(n / min(required_times))
print((groups + 4))
if __name__ == '__main__':
main()
| p03077 |
n = int(eval(input()))
move = [int(eval(input())) for i in range(5)]
div,mod = divmod(n,min(move))
if mod == 0:
print((div + 4))
else:print((div + 5)) | import math
n = int(eval(input()))
move = [int(eval(input())) for i in range(5)]
print((math.ceil(n / min(move)) + 4)) | p03077 |
import math
N=int(eval(input()))
A=[int(eval(input())) for _ in range(5)]
n=min(A)
for i in range(5):
if n==A[i]:
p=i
break
k=math.ceil(N/n)
print((k+4)) | import math
N=int(eval(input()))
A=[int(eval(input())) for _ in range(5)]
print((math.ceil(N/min(A))+4))
| p03077 |
N = int(eval(input()))
A = [int(eval(input())) for i in range(5)] #A[i]:amount of people able to be carried at once from i to i+1
B = [0] * 6 #B[i]:amount of people at i now
cnt = 0
#max people able to be transported in m minutes
P = [0] * 9
B[0] = 10**15
for m in range(9):
for i in range(5,0,-1):
... | import math
N = int(eval(input()))
A = [int(eval(input())) for i in range(5)]
print((math.ceil(N/min(A))+4)) | p03077 |
n = int(eval(input()))
L = [int(eval(input())) for i in range(5)]
ans = 5
max_ = -1
for l in L:
if n <= l:
continue
else:
q, r = divmod(n, l)
if r == 0:
max_ = max(max_, q-1)
else:
max_ = max(max_, q)
if max_ != -1:
ans += max_
print(a... | n = int(eval(input()))
L = [int(eval(input())) for _ in range(5)]
ans = 5
if n%min(L) == 0:
ans += n//min(L)-1
else:
ans += n//min(L)+1-1
print(ans)
| p03077 |
#!/usr/bin/env python3
import re
n = int(eval(input()))
p = []
min = 1000000000000000
for i in range(5):
x = int(eval(input()))
p.append(x)
if(min > x):
min = x
if(n%min == 0):
print((int(n/min) + 4))
else:
print((int(n/min) + 5))
| #!/usr/bin/env python3
#ABC123 C
import math
L = [int(eval(input())) for _ in range(6)]
N = L[0]
L.remove(L[0])
L.sort()
min = L[0]
print((math.ceil(N/L[0]) + 4)) | p03077 |
n,*a=list(map(int,open(0).read().split()));a=min(a);print((4+(n+a-1)//a)) | n, *a = list(map(int, open(0).read().split()))
b = min(a)
print((4 + (n+b-1)//b)) | p03077 |
import math
n = int(eval(input()))
l = [int(eval(input())) for i in range(5)]
print((math.ceil(n/min(l))+4))
| import math
n = int(eval(input()))
ls = [int(eval(input())) for _ in range(5)]
print((math.ceil(n/min(ls))+4))
| p03077 |
from math import ceil
n = int(eval(input()))
A = [int(eval(input())) for i in range(5)]
print((ceil(n/min(A))+4))
| from math import ceil
n = int(eval(input()))
t = [int(eval(input())) for i in range(5)]
print((4+ceil(n/min(t)))) | p03077 |
import math
n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
time = min(a, b, c, d, e)
if n < time:
print((5))
else:
print((math.ceil(n / time) + 4))
| import math
N = int(eval(input()))
carry = [int(eval(input())) for _ in range(5)]
print((math.ceil(N / min(carry))+4)) | p03077 |
def main():
N = int(eval(input()))
T = [int(eval(input())) for i in range(5)]
minT = min(T)
bo = (N + minT - 1)//minT
print((4+bo))
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
A = [int(eval(input())) for i in range(5)]
print((0--N//min(A) + 4))
if __name__ == '__main__':
main()
| p03077 |
def ii2ss(n):
ss = []
for i in range(n):
ss.append(eval(input()))
return ss
def sp2nn(sp, sep=' '):
return [int(s) for s in sp.split(sep)]
def ss2nn(ss):
return [int(s) for s in list(ss)]
import math
def main(ss):
N, A, B, C, D, E = ss2nn(ss)
m = min(A, B, C, D, E)
... | # AtCoder Beginner Contest 123
# https://atcoder.jp/contests/abc123
import sys
s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(... | p03077 |
import sys
import math
ns = [int(i) for i in sys.stdin.read().strip().split('\n')]
n = ns[0]
ns = ns[1:]
m = min(ns)
ans = math.ceil(n / m) + 4
print(ans)
| import math
import sys
n, *ns = [int(i) for i in sys.stdin.read().strip().split('\n')]
m = min(ns)
ans = math.ceil(n / m) + 4
print(ans)
| p03077 |
import math
N = int(eval(input()))
d = [int(eval(input())) for i in range(5)]
mi = d[0]
Ans = math.ceil(N / mi)
for i in d[1:]:
Ans += 1
if i < mi:
x = math.ceil(N / i) - math.ceil(N / mi)
Ans += x
mi = i
print(Ans) | N = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
x = min(A, B, C, D, E)
ans = 4 + N // x
if N % x != 0:
ans += 1
print(ans) | p03077 |
N = int(eval(input()))
L = [0 for i in range(5)]
for i in range(5):
L[i] = int(eval(input()))
time = [0 for i in range(5)]
time[0] = (N-1)//L[0] + 1
for i in range(4):
if L[i] <= L[i+1]:
time[i+1] = time[i]
else:
time[i+1] = (N-1)//L[i+1] + 1
ans = max(time) + 4
... | N = int(eval(input()))
L = [int(eval(input())) for _ in range(5)]
n = min(L)
ans = (N+n-1) // n + 4
print(ans) | p03077 |
n=int(eval(input()))
m=10**15+1
mi=0
for i in range(5):
a=int(eval(input()))
if a<m:
m=a
mi=i
print(((n-1)//m+1+5-1)) | n=int(eval(input()))
m=10**15+1
a=[int(eval(input())) for _ in range(5)]
print(((n-1)//min(a)+5)) | p03077 |
import sys
import math
stdin = sys.stdin
mod = 10**9 + 7
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
sa = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]
n = ni()
a = []
for _ in range(5):
a.append(ni())
p... | import sys
stdin = sys.stdin
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
n = ni()
a = []
for _ in range(5):
a.append(ni())
amin = min(a)
ans = (n-1)//min(a) + 1 + 4
print(ans)
| p03077 |
n=int(eval(input()))
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
m = min(a,b,c,d,e)
cnt = (n-1)//m + 1
print((cnt+4)) | n = int(eval(input()))
m = min([int(eval(input())) for _ in range(5)])
cnt = (n-1)//m + 1
print((cnt + 4))
| p03077 |
N = int(eval(input()))
MIN = float("inf")
for _ in range(5):
MIN = min(MIN, int(eval(input())))
from math import ceil
print((ceil(N / MIN) + 4)) | N = int(eval(input()))
MIN = float("inf")
for _ in range(5):
MIN = min(MIN, int(eval(input())))
print(((N + MIN - 1) // MIN + 4)) | p03077 |
from math import ceil
N = int(eval(input()))
v = [int(eval(input())) for _ in range(5)]
print((ceil(N / min(v)) + 4)) | from math import ceil
n = int(eval(input()))
a = [int(eval(input())) for _ in range(5)]
print((ceil(n / min(a)) + 4))
| p03077 |
#coding: utf-8
from math import ceil
N = int(eval(input()))
l = []
for i in range(5):
l.append(int(eval(input())))
print((ceil(N / min(l) + 4))) | #coding: utf-8
N = int(eval(input()))
l = []
for i in range(5):
l.append(int(eval(input())))
if N % min(l) != 0:
print((N // min(l) + 5))
else:
print((N // min(l) + 4)) | p03077 |
N = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
dp = [0] * 6
dp[0] = N
T = [A,B,C,D,E]
ans = 0
ans = -(-N//min(T)) + 4
# while dp[5] < N:
# for i in range(4, -1, -1):
# if dp[i] == 0:
# co... | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
A = [0] * 5
for i in range(5):
A[i] = ir()
mi = min(A)
plus = -(-N//mi)
answer = 4 + plus
print(answer)
| p03077 |
import math
N = int(eval(input()))
A = [0] * 5
human_in_city = [0]*6
human_in_city[0] = N
moving_human = [0]*5
for i in range(5):
A[i] = int(eval(input()))
# count = 0
# while human_in_city[-1] != N:
# count += 1
# for i in range(5):
# if human_in_city[i] >= A[i]:
# ... | N = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
min_p = min(A, B, C, D, E)
import math
min_p = math.ceil(N / min_p)
print((min_p+4)) | p03077 |
from math import ceil
N = int(eval(input()))
L = [int(eval(input())) for k in range(5)]
ans = 5
for k in range(5):
ans = max(ans,4+ceil(N/L[k]))
print(ans)
| from math import ceil
N = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
L = [A,B,C,D,E]
m = min(L)
print((4+ceil(N/m)))
| p03077 |
N = int(eval(input()))
A = [int(eval(input())) for _ in range(5)]
a = min(A)
n = N//a
k = N%a
ans = 0
if n>0:
ans = 5+(n-1)
if k>0:
ans += 1
else:
if k>0:
ans = 5
print(ans) | N = int(eval(input()))
A = [int(eval(input())) for _ in range(5)]
a = min(A)
n = N//a
b = N%a
if b==0:
print((5+n-1))
else:
print((5+n)) | p03077 |
n = int(eval(input()))
lis = [int(eval(input())) for i in range(5)]
key = 0
if n % min(lis) == 0:key = 1
print((5 + n//min(lis)-key)) | n = int(eval(input()))
nu = min([int(eval(input())) for i in range(5)])
print((4 + bool(n%nu) + n//nu)) | p03077 |
import itertools
import math
import fractions
import functools
import copy
n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
original = [a,b,c,d,e]
print((math.ceil(n / min(original))+4)) | import math
def main():
n = int(eval(input()))
# n, m = map(int, input().split())
# a = list(map(int, input().split()))
# s = input()
# h = [int(input()) for _ in rane(n)]
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
... | p03077 |
import copy
N = int(eval(input()))
A, B, C, D, E = [int(eval(input())) for i in range(5)]
Xs = [N, 0, 0, 0, 0, 0]
Fs = [A, B, C, D, E]
Fmin = min(Fs)
c = 0
while True:
#print(Xs)
nXs = copy.copy(Xs)
for i in range(len(Fs)):
if Xs[i] - Fs[i] > 0:
nXs[i] -= Fs[i]
... | N = int(eval(input()))
min_ = min([int(eval(input())) for i in range(5)])
suf = 1 if N%min_ != 0 else 0
print((N//min_+4+suf)) | p03077 |
import math
n = int(eval(input()))
m = 10 ** 15 + 1
for _ in range(5):
m = min(m, int(eval(input())))
print((math.ceil(n / m) + 5 - 1)) | import math
n = int(eval(input()))
m = min([int(eval(input())) for _ in range(5)])
print((math.ceil(n/m) + 4)) | p03077 |
n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
dic ={0:n,1:0,2:0,3:0,4:0,5:0}
time =0
if n == 10000000007:
print((5000000008))
exit()
while sum(dic)>0:
if dic[5] == n:
print(time)
exit()
... | n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
time =0
amin = min(a,b,c,d,e)
time=(n//amin+1 if n%amin != 0 else n/amin)+4
print((int(time))) | p03077 |
import math
N = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
X = min([A,B,C,D,E])
t=math.ceil(N/X)
print((t+4)) | N = int(eval(input()))
ls = [int(eval(input())) for _ in range(5)]
X = min(ls)
print(((N+X-1)//X+4)) | p03077 |
import math
N = int(eval(input()))
A = int(eval(input()))
B = int(eval(input()))
C = int(eval(input()))
D = int(eval(input()))
E = int(eval(input()))
bottleneck = min([A, B, C, D, E])
n_addition = math.ceil(N / bottleneck) - 1
print((5 + n_addition))
| import math
n_paths = 5
N = int(eval(input()))
ABCDE = [int(eval(input())) for _ in range(n_paths)]
bottleneck = min(ABCDE)
n_addition = math.ceil(N / bottleneck) - 1
print((n_paths + n_addition))
| p03077 |
n = int(eval(input()))
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
ans = 0 - -n//min(a, b, c, d, e) + 4
print(ans) | n = int(eval(input()))
l = [int(eval(input())) for _ in range(5)]
ans = 0 - -n//min(l) + 4
print(ans) | p03077 |
import sys
f = sys.stdin
board = [[0 for i in range(11)] for j in range(11)]
for i, line in enumerate(f):
for j, c in enumerate(line.strip()):
board[i + 1][1 + (i + 1) % 2 + j * 2] = int(c)
step = {(-1, 0 ):'L',(0, -1 ):'U',(1, 0 ):'R',(0, 1):'D'}
start = pre_loc = 1 + 1j
loc = 3 +... | import sys
f = sys.stdin
board = [[0 for i in range(11)] for j in range(11)]
for i, line in enumerate(f):
for j, c in enumerate(line.strip()):
board[i + 1][1 + (i + 1) % 2 + j * 2] = int(c)
step = {(-1, 0 ):'L',(0, -1 ):'U',(1, 0 ):'R',(0, 1):'D'}
start = pre_loc = 1 + 1j
loc = 3 + 1... | p00037 |
wx=[]
wy=[]
def readdata():
z=[]
try:
while True:
z.append(input())
except: return z
def nextpath(p, dir0):
for e in [3,0,1,2]:
dp = ispath(p, (dir0+e)%4)
if dp!=[]: break
return dp
def ispath(p, dir1):
y,x = p
dp = []
if dir1==... | wx=[]
wy=[]
def readdata():
z=[]
try:
while True:
z.append(input())
except: return z
def nextpath(p,dir0):
for e in [3,0,1,2]:
d = (dir0+e)%4
if ispath(p,d): return d
return None
def ispath(p,d):
y,x = p
f=""
try:
if d=... | p00037 |
D, L = list(map(int, input().split()))
print((sum(divmod(D, L)))) | D, L = list(map(int, input().split()))
print((D//L + D%L)) | p00312 |
l=list(map(int,input().split()))
c=0
if 1 in l:c+=1
if 9 in l:c+=1
if 7 in l:c+=1
if 4 in l:c+=1
if c==4:print('YES')
else:print('NO') | l=list(map(int,input().split()))
if 1 in l and 9 in l and 7 in l and 4 in l:print('YES')
else:print('NO') | p03149 |
def resolve():
l=list(map(int, input().split()))
a=l.count(1)
b=l.count(9)
c=l.count(7)
d=l.count(4)
if a==b==c==d==1:
print('YES')
else:
print('NO')
resolve() | def resolve():
l=list(map(int, input().split()))
l.sort()
if l==[1,4,7,9]:
print('YES')
else:
print('NO')
resolve()
| p03149 |
l = set([int(e) for e in input().split()])
set_1974 = set([1,9,7,4])
if l == set_1974:
print("YES")
else:
print("NO") | l = {int(e) for e in input().split()}
set_1974 = {1,9,7,4}
if l == set_1974:
print("YES")
else:
print("NO") | p03149 |
N = [int(_) for _ in input().split()]
if 1 in N and 9 in N and 7 in N and 4 in N:
print("YES")
else:
print("NO") | N = [int(_) for _ in input().split()]
N.sort()
if N == [1, 4, 7, 9]:
print("YES")
else:
print("NO")
| p03149 |
def slove():
import sys
input = sys.stdin.readline
a = list(map(str, str(input().rstrip('\n')).split()))
a.sort()
print(("YES" if "".join(a) == "1479" else "NO"))
if __name__ == '__main__':
slove()
| import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = sorted(list(map(str, readline().rstrip().decode('utf-8').split())))
print(("YES" if n == sorted("1974") else "NO"))
if __name__ == '__main__':
solve()
| p03149 |
n = list(map(int,input().split()))
n.sort()
if(n[0]==1 and n[1]==4 and n[2]==7 and n[3]==9):
print("YES")
else:
print("NO") | li = list(map(int,input().split()))
if 1 in li and 4 in li and 7 in li and 9 in li:
print("YES")
else:
print("NO") | p03149 |
n = list(map(int,input().split()))
n.sort()
if n == [1,4,7,9]:
print("YES")
else:
print("NO") | print(("YES" if sorted(map(int,input().split())) == [1,4,7,9] else "NO")) | p03149 |
#!/usr/bin/python
import sys
def solve(s):
count = 0
len_s = len(s)
l = len_s // 2
for i in range(l):
if s[i] != s[len_s -1 -i]:
count += 1
print(count)
if __name__ == '__main__':
s = sys.stdin.readline().strip()
solve(s) | import sys
S = sys.stdin.readline().strip()
ls = len(S)
ans = 0
h = ls // 2
for i in range(h):
if S[i] != S[ls - 1 - i]:
ans += 1
print(ans) | p02836 |
import sys
import math
def resolve():
S=list(input().rstrip())
c=0
for i in range(math.floor(len(S)/2)):
if(S[i]!=S[len(S)-i-1]):
c+=1
print(c)
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
... |
import sys
import math
def resolve():
S=input().rstrip()
c=0
for i in range((len(S)//2)):
if(S[i]!=S[-i-1]):
c+=1
print(c)
from io import StringIO
import unittest
class TestClass(unittest.TestCase):
def assertIO(self, input, output):
stdout, stdin = sys... | p02836 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(S: str):
sl = list(S)
rs = sl[::-1]
from math import ceil
print((ceil([sl[i] != rs[i] for i in range(len(S))].count(True)/2)))
return
def main():
def iterate_tokens():
for ... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(S: str):
print(([S[i] != S[::-1][i] for i in range(len(S))].count(True)//2))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
... | p02836 |
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
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... | p02836 |
#参考
#https://atcoder.jp/contests/aising2019/submissions/3995168
import bisect
N,Q=list(map(int,input().split()))
A=list(map(int,input().split()))
Asum=[0]*N
Asum2=[0]*N
total=0
for i in range(N):
total+=A[i]
Asum[i]=total
if i>1:
Asum2[i]=A[i]+Asum2[i-2]
else:
Asum2[i]=A[i]
X=[]... | #参考
#https://atcoder.jp/contests/aising2019/submissions/3995168
import bisect
N,Q=list(map(int,input().split()))
A=list(map(int,input().split()))
Asum=[0]*N
Asum2=[0]*N
total=0
for i in range(N):
total+=A[i]
Asum[i]=total
if i>1:
Asum2[i]=A[i]+Asum2[i-2]
else:
Asum2[i]=A[i]
... | p03158 |
import sys
input = sys.stdin.readline
from collections import *
from bisect import *
def judge(x):
tak = N-x
aoki = x-bisect_left(A, 2*X-A[x])+1
return tak<=aoki
def binary_search():
l, r = mark, N-1
while l<=r:
m = (l+r)//2
if judge(m):
... | import sys
input = sys.stdin.readline
from collections import *
from bisect import *
def judge(x):
aoki = N-x-bisect_left(A, 2*X-A[N-x])+1
return x<=aoki
def binary_search():
l, r = 1, N-bisect_left(A, X)
while l<=r:
m = (l+r)//2
if judge(m):
... | p03158 |
import bisect
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
sum_odd[i+1] = sum_odd[i] + a[i]
... | import bisect
import sys
input = sys.stdin.readline
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
... | p03158 |
import bisect
import sys
input = sys.stdin.readline
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
... | import bisect
import sys
input = sys.stdin.readline
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
... | p03158 |
import bisect
import sys
input = sys.stdin.readline
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
... | import bisect
import sys
input = sys.stdin.readline
INF = 10**12
n, q = [int(item) for item in input().split()]
a = [int(item) for item in input().split()]
# Calc cumrative sum
sum_even = [0] * (n + 1)
sum_odd = [0] * (n + 1)
sum_all = [0] * (n + 1)
for i, item in enumerate(a):
if i % 2 == 0:
... | p03158 |
from bisect import *
n,q = list(map(int,input().split()))
A = list(map(int,input().split()))
every2 = [[0]*(n//2 + 2) for _ in range(2)]
right = [0]*(n+1)
for i in range(n):
odd = i&1
every2[odd][i//2 + 1] = every2[odd][i//2] + A[i]
right[i+1] = right[i] + A[-i-1]
# ans = [0]*q
def ok(y,x):
... | from bisect import *
import sys
input = sys.stdin.readline
n,q = list(map(int,input().split()))
A = list(map(int,input().split()))
every2 = [[0]*(n//2 + 2) for _ in range(2)]
right = [0]*(n+1)
for i in range(n):
odd = i&1
every2[odd][i//2 + 1] = every2[odd][i//2] + A[i]
right[i+1] = right[i] + A... | p03158 |
from itertools import accumulate,zip_longest
from functools import reduce
import bisect
import sys
input = sys.stdin.readline
N,Q = list(map(int,input().split()))
A = list(map(int,input().split()))
X = [int(eval(input())) for i in range(Q)]
B = [2*a+1 for a in A] # right
A = [2*a for a in A] # left
X = [2... | from itertools import accumulate,zip_longest
from functools import reduce
import bisect
import sys
input = sys.stdin.readline
N,Q = list(map(int,input().split()))
A = list(map(int,input().split()))
X = [int(eval(input())) for i in range(Q)]
B = [2*a+1 for a in A] # right
A = [2*a for a in A] # left
X = [2... | p03158 |
import bisect
n,q = list(map(int, input().split()))
aList = list(map(int, input().split()))
sumList=[]
sep2SumList=[]
for i in range(n):
if i==0:
sumList.append(aList[i])
else:
sumList.append(sumList[-1]+aList[i])
if n%2==0:
if i%2==1:
if i==1:
... | import bisect
n,q = list(map(int, input().split()))
aList = list(map(int, input().split()))
sumList=[]
sep2SumList=[]
for i in range(n):
if i==0:
sumList.append(aList[i])
else:
sumList.append(sumList[-1]+aList[i])
if n%2==0:
if i%2==1:
if i==1:
... | p03158 |
import itertools
def inpl(): return [int(i) for i in input().split()]
def f(y):
return abs(x-A[y])
N, Q = inpl()
A = inpl()
SA = list(itertools.accumulate(A))
if N%2 :
B = [v for i, v in enumerate(A) if not i%2]
B = [0] + list(itertools.accumulate(B))
else:
B = [v for i, v in enumerate(A) if ... | import itertools
import sys
def input(): return sys.stdin.readline()
def inpl(): return [int(i) for i in input().split()]
def f(y):
return abs(x-A[y])
N, Q = inpl()
A = inpl()
SA = list(itertools.accumulate(A))
if N%2 :
B = [v for i, v in enumerate(A) if not i%2]
B = [0] + list(itertools.accumula... | p03158 |
import bisect
n,q = list(map(int,input().split()))
A = list(map(int,input().split()))
dic = {}
w = [A[0]]
for i in range(1,n):
w.append(w[-1]+A[i])
w1 = [A[0],0]
w2 = [0,A[1]]
for i in range(2,n):
if i%2 == 0:
w1.append(w1[-2]+A[i])
w2.append(0)
else:
w2.append(w2... | n,q = list(map(int,input().split()))
A = list(map(int,input().split()))
w = [A[0]]
for i in range(1,n):
w.append(w[-1]+A[i])
w1 = [0]*n
for i in range(n):
if (n-1-i)%2 == 0:
w1[i] = A[i]
if i > 0:
w1[i] += w1[i-1]
def solve(x):
l = 0
r = n+1
while r-l > 1:
... | p03158 |
n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
x = [int(eval(input())) for _ in range(q)]
sort_x = sorted(x)
ans = {}
if n%2== 1:
small_position = 0
border_position = int((n-1)/2)
sum_all = sum(a[border_position:])
a.append(1000000000)
a.append(1000000000)
... | n, q = list(map(int, input().split()))
a = list(map(int, input().split()))
x = [int(eval(input())) for _ in range(q)]
sort_x = sorted(x)
ans = {}
if n%2== 1:
small_position = 0
border_position = int((n-1)/2)
else:
small_position = 1
border_position = int(n/2)
sum_all = sum(a[border_position:]... | p03158 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from bisect import bisect_left as bl, bisect_right as br
n,q = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
def sub(x, i):
# i番目... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from bisect import bisect_left as bl, bisect_right as br
n,q = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
def sub(x, i):
# i番目... | p03158 |
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from bisect import bisect_left as bl, bisect_right as br
n,q = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
def sub(x, i):
# i番目... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
from bisect import bisect_left as bl, bisect_right as br
n,q = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
def sub(x, i):
# i番目... | p03158 |
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.se... | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.se... | p03158 |
from math import ceil
N, Q = list(map(int, input().split()))
A = [int(a) for a in input().split()]
AltTake = [0 for a in range(N)]
GetAll = [0 for a in range(N)]
AltTake[0], AltTake[1] = A[0], A[1]
GetAll[-1] = A[-1]
BlockList = [0 for i in range(ceil(N/2))]
maxBlock = ceil(N/2)
for i in range(2, N):
Al... | import sys
from bisect import bisect_left
def solve():
input = sys.stdin.readline
N, Q = map(int, input().split())
A = [int(a) for a in input().split()]
X = [int(input()) for _ in range(Q)]
cont = [0] * N
cont[N-1] = A[N-1]
for i in reversed(range(N-1)): cont[i] = cont[i+1] + A[i]... | p03158 |
import copy
N,Q = list(map(int,input().split()))
A = list(map(int,input().split()))
X = [0]*Q
for i in range(Q):
X[i] = int(eval(input()))
#初期値
j= -1
Takahashi = 0
Aoki = 0
B = copy.deepcopy(A)
flag =0
for k in range(N):
if flag == 0: #高橋くんの行動
Takahashi += B[-1]
... | n,q = list(map(int,input().split()))
a = list(map(int,input().split()))
query = [int(eval(input())) for i in range(q)]
a = sorted(a)
ruiseki = [0]*(n+1)
for i in range(n):
ruiseki[i+1] = ruiseki[i] + a[i]
ruiseki2 = [0]*(n+1)
if n % 2 == 1:
for i in range(n):
if i % 2 == 0:
... | p03158 |
read = input
n,k = list(map(int, read().split()))
a = read()
a = '1' + a + '1'
# -1 if use 0, -1 if use len(a) -1
pstart = 0
pcnt = 0
ptype = '1'
b = []
# (start, end, cnt)
for tp in enumerate(a):
i, c = tp
if ptype == c:
pcnt = pcnt + 1
else :
b.append((pstart, i-1, pcnt))
... | read = input
n,k = list(map(int, read().split()))
a = read()
a = '1' + a + '1'
# -1 if use 0, -1 if use len(a) -1
pstart = 0
pcnt = 0
ptype = '1'
b = []
# (start, end, cnt)
for tp in enumerate(a):
i, c = tp
if ptype == c:
pcnt = pcnt + 1
else :
b.append((pstart, i-1, pcnt))
... | p03074 |
import sys
input=sys.stdin.readline
n,k= list(map(int, input().split()))
s = input().strip()
s.strip()
p = [0]
for i in range(n):
if s[i] != s[p[-1]]:
p.append(i)
p.append(n)
X = []
for i in range(len(p)-1):
if s[p[i]] == "1":
li = i
ri = i + 2 * k + 1
if ri ... | import sys
input=sys.stdin.readline
n,k= list(map(int, input().split()))
s = input().strip()
s.strip()
p = [0]
for i in range(n):
if s[i] != s[p[-1]]:
p.append(i)
X = []
for i in range(len(p)):
if s[p[i]] == "1":
li = i
ri = i + 2 * k + 1
else:
li = i-1
... | p03074 |
import sys
# import bisect
# import math
# import itertools
# import numpy as np
# import collections
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: int
... | import sys
# import bisect
# import math
# import itertools
# import numpy as np
# import collections
"""Template"""
class IP:
"""
入力を取得するクラス
"""
def __init__(self):
self.input = sys.stdin.readline
def I(self):
"""
1文字の取得に使います
:return: int
... | p03074 |
#!/usr/bin/env python3
import sys
try:
from typing import List
except ImportError:
pass
def solve(N: int, K: int, S: str):
d = [] # type: List[int]
i = 0
while True:
r = 0
while i < N and S[i] == "1":
r += 1
i += 1
d.append(r)
... | #!/usr/bin/env python3
import sys
try:
from typing import List
except ImportError:
pass
def solve(N: int, K: int, S: str):
d = [] # type: List[int]
i = 0
while True:
r = 0
while i < N and S[i] == "1":
r += 1
i += 1
d.append(r)
... | p03074 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03074 |
import copy
def main():
n, k = list(map(int, input().rstrip().split(' ')))
s = [c == '1' for c in input().rstrip()]
candidates = []
windows = Windows()
current_window = None
for i, c in enumerate(s):
if not c:
if current_window == None:
current_wi... | import copy
def main():
n, k = list(map(int, input().rstrip().split(' ')))
s = [c == '1' for c in input().rstrip()]
windows = []
current_window = None
for i, c in enumerate(s):
if not c:
if current_window == None:
current_window = Window(False)
... | p03074 |
import sys,re,copy
input = sys.stdin.readline
N,K=[int(x) for x in input().strip().split()]
S=input().strip()
Z=[len(x) for x in re.split(r'1+',S)]
O=[len(x) for x in re.split(r'0+',S)]
m=0
i=0
if S[0]=='1':
Z.pop(0)
l1=len(O)
l0=len(Z)
while True:
c=sum(O[i:i+K+1])+sum(Z[i:i+K])
if c > m:... | import sys,re,copy
input = sys.stdin.readline
N,K=[int(x) for x in input().strip().split()]
f=1
cnt=0
S=[]
r=0
for s in input().strip():
s=int(s)
if s==f:
cnt+=1
else:
r+=cnt
S.append(r)
cnt=1
f=1-f
else:
r+=cnt
S.append(r)
if len(S)%2==... | p03074 |
import sys
def main():
if 'get_ipython' not in globals():
# For Subsession
N,K = list(map(int, input().split()))
S = sys.stdin.readline()
else:
# For Test
# N = 5
# K = 1
# S = "00010"
N = 14
K = 2
S = "11101010110011"
# N = 1
# K = 1
# S = "1"
... | import sys
def main():
if 'get_ipython' not in globals():
# For Subsession
N,K = list(map(int, input().split()))
S = sys.stdin.readline()
else:
# For Test
# N = 5
# K = 1
# S = "00010"
# N = 14
# K = 2
# S = "11101010110011"
# N = 1
# K = 1
# S =... | p03074 |
n, k = list(map(int, input().split()))
k += 1
s = "01" + input().rstrip()
n += 2
ans = 0
i = 0
left = 2
right = 1
while i < n:
if k > 0:
pos = s.find('01', i)
if pos == -1:
i = n
right = n - 1
else:
pos = s.find('10', pos + 1)
i... | n, k = list(map(int, input().split()))
s = input().rstrip()
ans = 1
i = 0
left = 0
right = 1
while i < n:
if k > 0:
pos = s.find('01', i)
if pos == -1:
i = n
right = n - 1
else:
pos = s.find('10', pos + 1)
if pos == -1:
... | p03074 |
from itertools import accumulate
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(... |
from itertools import accumulate
def resolve():
N, K = map(int, input().split())
S = input()
# even:1
# odd:0
# 1-0-1-0-1 の配列にする. 両端は1にする
L = []
pre = "1"
cnt = 0
for i in range(N):
if pre == S[i]:
cnt += 1
else:
L.append(... | p03074 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.