input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
MOD = 10**9+7
n = int(eval(input()))
T = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
T[a].append(b)
T[b].append(a)
C = [[] for _ in range(n)]
seen = [False]*n
dp = [0]*n
def... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
def main():
MOD = 10**9+7
n = int(eval(input()))
T = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
a -= 1
b -= 1
T[a].append(b)
T[b].append(a)
C = [[] for _ in range(n)]
... | p02822 |
import sys
readline = sys.stdin.buffer.readline
N = int(readline())
graph = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b = list(map(int, readline().split()))
lb = 1 << i
graph[a].append(b)
graph[b].append(a)
root = 1
parent = [0] * (N + 1)
order = []
stack = [root]
while stack... | import sys
readline = sys.stdin.readline
N = int(readline())
graph = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
parent = [0] * (N + 1)
order = []
stack = [1]
while stack:
x = stack.pop()
order.app... | p02822 |
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
readline = sys.stdin.readline
N = int(readline())
adj = [[] for i in range(N)]
for i in range(N - 1):
A, B = list(map(int, readline().split()))
A -= 1
B -= 1
adj[A].append(B)
adj[B].append(A)
mod = 10 ** 9 + ... | import sys
sys.setrecursionlimit(1000000)
readline = sys.stdin.readline
N = int(readline())
adj = [[] for i in range(N)]
for i in range(N - 1):
A, B = list(map(int, readline().split()))
A -= 1
B -= 1
adj[A].append(B)
adj[B].append(A)
mod = 10 ** 9 + 7
pow2 = [1] * (N + 1)
for i, j... | p02822 |
import sys
sys.setrecursionlimit(1000000)
readline = sys.stdin.readline
N = int(readline())
adj = [[] for i in range(N)]
for i in range(N - 1):
A, B = list(map(int, readline().split()))
A -= 1
B -= 1
adj[A].append(B)
adj[B].append(A)
mod = 10 ** 9 + 7
pow2 = [1] * (N + 1)
for i, j... | import sys
readline = sys.stdin.readline
N = int(readline())
graph = [[] for _ in range(N + 1)]
for i in range(N - 1):
a, b = list(map(int, readline().split()))
graph[a].append(b)
graph[b].append(a)
parent = [0] * (N + 1)
order = []
stack = [1]
while stack:
x = stack.pop()
order.app... | p02822 |
# Surrounded Nodes
from collections import deque
import sys
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
N = int(eval(input()))
G = [[] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
S = -1
for i in range(1, N+1):
if len(G[i]) ... | # Surrounded Nodes
import sys
sys.setrecursionlimit(10**8)
mod = 10**9 + 7
N = int(eval(input()))
G = [[] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
G[a].append(b)
G[b].append(a)
S = -1
for i in range(1, N+1):
if len(G[i]) == 1:
S = i
b... | p02822 |
N=int(eval(input()))
E=[[] for _ in range(N)]
for _ in range(N-1):
A,B=list(map(int,input().split()))
E[A-1].append(B-1)
E[B-1].append(A-1)
MOD=10**9+7
#dp=子ノードの数+1(自分)
dp=[1]*N
root=0
parent=[0]*N
order=[]
def dfs():
parent[root]=root
stack=[root]
while stack:
node=s... | N=int(eval(input()))
E=[[] for _ in range(N)]
for _ in range(N-1):
A,B=list(map(int,input().split()))
E[A-1].append(B-1)
E[B-1].append(A-1)
MOD=10**9+7
#dp=子ノードの数+1(自分)
dp=[1]*N
root=0
parent=[0]*N
order=[]
def dfs():
parent[root]=root
stack=[root]
while stack:
node=s... | p02822 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 %mod
for _ in range(n-1):
a,b = list(map(int, input().split()))
g[a-1].... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 % mod
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1... | p02822 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1].append(b-1)
g[b-1].append(a-1)
par = [-1]*n
depth = [-1]*n
sizesub = [1 for _ in range(n... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 % mod
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1... | p02822 |
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 % mod
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1... | import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline
mod = 10**9+7
n = int(eval(input()))
g = [[] for _ in range(n)]
pow2 = [0 for _ in range(n+1)]
pow2[0] = 1
for i in range(n):
pow2[i+1] = pow2[i]*2 % mod
for _ in range(n-1):
a, b = list(map(int, input().split()))
g[a-1... | p02822 |
import sys
sys.setrecursionlimit(10**9)
N = int(eval(input()))
MOD = 10**9 + 7
tree = [[] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
# 頂点1をルートにして各頂点より下にある部分木の頂点数を求めていく
root, par = 1, 0
sizes = [0] * (N+1)
order = [[root, par... | import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
MOD = 10**9 + 7
tree = [[] for i in range(N+1)]
for i in range(N-1):
a, b = list(map(int, input().split()))
tree[a].append(b)
tree[b].append(a)
# 頂点1をルートにして各頂点より下にある部分木の頂点数を求めていく
root, par = 1, 0
sizes = [0] ... | p02822 |
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
mod = 10**9 + 7
def factorial(N,MOD,r=True):
fact = [1]*(N+1)
rfact = [1]*(N+1)
r = 1
for i in range(1,N+1):
fact[i] = r = r * i % MOD
rfact[N] = r = pow(fact[N],MOD-2,MOD)
for i in range(N, 0, -1):
... | n = int(eval(input()))
G = [[] for _ in range(n)]
mod = 10**9 + 7
for _ in range(n-1):
a, b = [int(x)-1 for x in input().split()]
G[a-1].append(b-1)
G[b-1].append(a-1)
stack = [0]
depth = [-1] * n
depth[0] = 0
while stack:
v = stack.pop()
d = depth[v]
for nv in G[v]:
if... | p02822 |
import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else : return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
return ((a % mod) *... | import sys
mod = pow(10, 9) + 7
sys.setrecursionlimit(pow(10, 8))
def power(x, y):
if y == 0 : return 1
elif y == 1 : return x % mod
elif y % 2 == 0 : return power(x, y//2)**2 % mod
else : return power(x, (y-1)//2)**2 * x % mod
def mul(a, b):
return ((a % mod) *... | p02822 |
from sys import stdin, setrecursionlimit
from functools import lru_cache
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
... | from sys import stdin, setrecursionlimit
from functools import lru_cache
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
MOD = 1000000007
N = int(eval(input()))
G = [[] for _ in range(N)]
for _ in range(N - 1):
a, b = list(map(int, input().split()))
... | p02822 |
import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
MOD = 1000000007
N, *AB = list(map(int, read().split()))
G = [[] for _ in range(N)]
for a, b in zip(AB[::... | import sys
from collections import deque
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def main():
MOD = 1000000007
N, *AB = list(map(int, read().split()))
G = [[] for _ in range(N)]
for a, b in zip(AB[::... | p02822 |
import sys
input=lambda: sys.stdin.readline().rstrip()
mod=10**9+7
n=int(eval(input()))
edge=[[] for i in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
inf=10**6
Par=[inf]*n
Par[0]=-1
Deg=[0]*n
Deg[0]=0
Chk=[0]
while Chk:
c=Chk.pop(... | import sys
input=lambda: sys.stdin.readline().rstrip()
mod=10**9+7
n=int(eval(input()))
edge=[[] for i in range(n)]
for i in range(n-1):
a,b=list(map(int,input().split()))
edge[a-1].append(b-1)
edge[b-1].append(a-1)
inf=10**6
Par=[inf]*n
Par[0]=-1
Deg=[0]*n
Deg[0]=0
Chk=[0]
while Chk:
c=Chk.pop(... | p02822 |
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
mod = 10 ** 9 + 7
N = int(eval(input()))
edge = [[] for _ in range(N + 1)]
for _ in range(N - 1):
x, y = list(map(int, input().split()))
edge[x].append(y)
edge[y].append(x)
# 頂点iから伸びてる枝それぞれのサイズ
memo = [[] for _ in ran... | import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 7)
mod = 10 ** 9 + 7
N = int(eval(input()))
edge = [[] for _ in range(N + 1)]
for _ in range(N - 1):
x, y = list(map(int, input().split()))
edge[x].append(y)
edge[y].append(x)
# 頂点iから伸びてる枝それぞれのサイズ
memo = [[] for _ in ran... | p02822 |
h,w,*a=open(0).read().split();b=a.index("snuke");print(([chr(i)for i in range(65,91)][b%int(w)]+str(b//int(w)+1))) | h,w,*a=open(0).read().split();b=a.index("snuke");print((chr(b%int(w)+65)+str(b//int(w)+1))) | p03919 |
import sys
import itertools
def one_step(lo,lis):
nu = [ e for e in lis ]
for j in range(len(nu)):
if lo[0][j] == 1:
nu[j],nu[j+1] = nu[j+1],nu[j]
return lo[1:],nu
def solve(lo,lis):
if len(lo) == 0:
return lis
nu = [ e for e in lis]
lo2,nu2 = one_step... | import sys
import itertools
def one_step(lo,lis):
nu = [ e for e in lis ]
for j in range(len(nu)):
if lo[0][j] == 1:
nu[j],nu[j+1] = nu[j+1],nu[j]
return lo[1:],nu
def solve(lo,lis):
if len(lo) == 0:
return lis
nu = [ e for e in lis]
lo2,nu2 = one_step... | p00069 |
import math
n=int(eval(input()))
a=[int(eval(input())) for _ in range(n)]
if n==1:
print((a[0]))
elif n==2:
print((a[0]*a[1]//math.gcd(a[0],a[1])))
else:
r=a[0]*a[1]//math.gcd(a[0],a[1])
for i in a:
r=r*i//math.gcd(r,i)
print(r) | import math
n=int(eval(input()))
a=[int(eval(input())) for _ in range(n)]
r=a[0]
for i in a:
r=r*i//math.gcd(r,i)
print(r) | p03633 |
import math
a=[int(eval(input())) for _ in range(int(eval(input())))]
r=a[0]
for i in range(len(a)):
r=r*a[i]//math.gcd(r,a[i])
print(r) | import math
n=int(eval(input()));a=[int(eval(input())) for _ in range(n)];r=a[0]
for i in a: r=r*i//math.gcd(r,i)
print(r) | p03633 |
N=int(eval(input()))
s=[int(eval(input())) for i in range(N)]
i=0
while i>=0 :
i+=1
for j in range(N):
if (max(s)*i)%s[j]!=0:
break
else:
print((max(s)*i))
exit() | def f(a,b):
x,y=a,b
while b>0:
a,b=b,a%b
return (x//a)*y
s=1
N=int(eval(input()))
for i in range(N):
a=s
b=int(eval(input()))
s=f(a,b)
print(s)
| p03633 |
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
from math import gcd
ans = 1
for i in range(N):
t = int(eval(input()))
g = gcd(ans, t)
ans = ans*t//g
print(ans) | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return list(map(int, input().split()))
sys.setrecursionlimit(10**9)
N = int(eval(input()))
from math import gcd
g = 0
ans = 1
for _ in range(N):
t = int(eval(input()))
g = gcd(t, ans)
ans = t*ans//g
print(ans) | p03633 |
n = int(eval(input()))
t = []
for i in range(n):
t.append(int(eval(input())))
t = sorted(t)[::-1]
biggest = t[0]
for i in range(biggest, 10**18+1, biggest):
ok = True
for j in t[1:]:
if i%j != 0:
ok = False
break
if ok == True:
break
print(i)... | n = int(eval(input()))
t = []
for i in range(n):
t.append(int(eval(input())))
def gcd(a, b):
if b == 0:
return a
return gcd(b, a%b)
def lcm(a, b):
return a*b//gcd(a, b)
result = 1
for i in range(n):
result = lcm(result, t[i])
print(result)
| p03633 |
def lcm(a, b):
ax = a
bx = b
c = 0
if a<b:
ax, bx = (bx, ax)
while True:
if ax%bx == 0:
gcd = bx
break
else:
c = bx
bx = ax%bx
ax = c
return a*b // gcd
n = int(eval(input()))
Mx = int(eval(input... | def lcm(a, b):
ax = a
bx = b
if a<b:
ax, bx = (bx, ax)
while True:
if ax%bx == 0:
gcd = bx
break
else:
c = bx
bx = ax%bx
ax = c
return a*b // gcd
n = int(eval(input()))
lst = []
lst2 = []
for i in ... | p03633 |
def gcd(a, b):
if a == 0:
return b
return gcd(b % a, a)
n = int(eval(input()))
res = int(eval(input()))
while n > 1:
x = int(eval(input()))
res = (res * x) // gcd(res, x);
n -= 1
print(res) | def gcd(a,b):
while b > 0:
a, b = b, a % b
return a
n = int(eval(input()))
s = 1
for i in range(n):
x = int(eval(input()))
s = s // gcd(s, x) * x
print((int(s))) | p03633 |
def gcd(a,b):
if b==0:
return a
return (gcd(b,a%b))
def lcm(a,b):
return a*b//gcd(a,b)
n=int(eval(input()))
if n==1:
print((int(eval(input()))))
exit()
ans=1
for i in range(n):
ans=lcm(ans,int(eval(input())))
print((int(ans))) | def gcd(a,b):
if b==0:
return a
return (gcd(b,a%b))
def lcm(a,b):
return a*b//gcd(a,b)
n=int(eval(input()))
t=[int(eval(input())) for i in range(n)]
if n==1:
print((t[0]))
exit()
ans=1
for i in t:
ans=lcm(ans,i)
print((int(ans))) | p03633 |
import math
from functools import reduce
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
n = int(eval(input()))
l = []
for i in range(n):
t = int(eval(input()))
l.append(t)
print((lcm_list(l)))
| def gcd(m, n):
if m < n:
m, n = n, m
while True:
r = m % n
if r == 0:
return n
else:
m, n = n, r
def lcm(m, n):
return m*n // gcd(m, n)
n = int(eval(input()))
l = []
ans = 1
for i in range(n):
t = int(eval(input()))
an... | p03633 |
n = int(eval(input()))
T = [int(eval(input())) for _ in range(n)]
main_t = max(T)
cur = main_t
flag = True
while 1:
for t in T:
if cur%t != 0:
flag = False
break
if flag:
ans = cur
break
cur += main_t
flag = True
# print(cur)
print(ans) | def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
n = int(eval(input()))
T = [int(eval(input())) for _ in range(n)]
ans = 1
for t in T:
ans = ans*t//gcd(ans,t)
print(ans) | p03633 |
n = int(eval(input()))
t = []
for i in range(n):
t.append(int(eval(input())))
i = 0
while True:
i+=1
flag = True
for j in range(n):
if (i*max(t))%t[j] != 0:
break
if j == n-1:
flag = False
if flag == False:
break
print((i*max(t))) | def gcd(a, b):
while b:
a, b = b, a%b
return a
N = int(eval(input()))
ans = 1
for i in range(0,N):
t = int(eval(input()))
ans = t * ans // gcd(ans, t)
print(ans)
| p03633 |
from math import gcd
def lcm(X, Y): # 最小公倍数
return (X * Y) // gcd(X, Y)
n = int(eval(input()))
t = [int(eval(input())) for _ in range(n)]
ans = 1
for i in t:
ans = lcm(ans, i)
print(ans)
| from math import gcd
def lcm(X, Y):
return (X * Y) // gcd(X, Y)
n = int(eval(input()))
t = [int(eval(input())) for _ in range(n)]
ans = 1
for i in t:
ans = lcm(ans, i)
print(ans)
| p03633 |
import sys
from functools import reduce
def gcd(a, b):
while b:
a, b = b, a % b
return abs(a)
def lcm(a, b):
return abs(a // gcd(a, b) * b)
n, *t = list(map(int, sys.stdin.read().split()))
def main():
return reduce(lcm, t)
if __name__ == '__main__':
ans = main()
pr... | import sys
def gcd(a, b): return gcd(b, a % b) if b else abs(a)
def lcm(a, b): return abs(a // gcd(a, b) * b)
n, *t = list(map(int, sys.stdin.read().split()))
def main():
res = 1
for x in t:
res = lcm(res, x)
print(res)
if __name__ == '__main__':
main() | p03633 |
from functools import reduce
n = int(eval(input()))
t = [int(eval(input())) for _ in range(n)]
def gcd(x, y):
while y != 0:
x, y = y, x % y
return x
def lcm(x, y):
return x * y // gcd(x, y)
def lcmm(l):
return reduce(lcm, l)
print((lcmm(t)))
| from functools import reduce
n = int(eval(input()))
t = [int(eval(input())) for _ in range(n)]
def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
def lcm(x, y):
return x * y // gcd(x, y)
def lcmm(l):
return reduce(lcm, l)
print((lcmm(t)))
| p03633 |
def f(x,y):
if x<y: x,y = y,x
if y==0: return x
else: return f(y, x%y)
N = int(eval(input()))
ans = 1
for _ in range(N):
T = int(eval(input()))
ans = ans*T//f(ans,T)
print(ans) | N = int(eval(input()))
T = [int(eval(input())) for i in range(N)]
def gcd(x,y):
if x<y:x,y = y,x
if y==0:return x
return gcd(y,x%y)
S = T[0]
for i in range(1,N):
S = S*T[i]//gcd(S,T[i])
print(S) | p03633 |
n = int(eval(input()))
T=[int(eval(input())) for i in range(n)]
T = sorted(T,reverse=True)
a = T[0]
i =1
while True:
if sum([T[0]%x for x in T]) !=0:
T[0] += a
else:
print((T[0]))
exit()
i += 1 | n = int(eval(input()))
T=[int(eval(input())) for i in range(n)]
def euclid(a,b):
r = a % b
return euclid(b,r) if r else b
def lcm(a,b):
return a * b //euclid(a,b)
num = T[0]
for i in range(1,n):
num = lcm(num, T[i])
print(num) | p03633 |
from collections import deque
N = int(eval(input()))
T = sorted(list(set([int(eval(input())) for _ in range(N)])), reverse=True)
ret = 1
while len(T) > 1:
C = int(max(T) ** 0.5)
f = False
for c in range(2, C + 1):
T_ = deque([])
for i, t in enumerate(T):
if t % c == 0:
T_.append(t... | from collections import deque
N = int(eval(input()))
T = list(set([int(eval(input())) for _ in range(N)]))
ret = T[0]
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
for t in T[1:]:
ret = ret * t // gcd(ret, t)
print(ret) | p03633 |
from collections import deque
N = int(eval(input()))
T = list(set([int(eval(input())) for _ in range(N)]))
ret = T[0]
def gcd(a, b):
if b == 0:
return a
else:
return gcd(b, a % b)
for t in T[1:]:
ret = ret * t // gcd(ret, t)
print(ret) | import sys
input = sys.stdin.readline
N = int(eval(input()))
def gcd(x, y):
if y == 0:
return x
return gcd(y, x % y)
def lcm(x, y):
return x * y // gcd(x, y)
T = int(eval(input()))
for i in range(N-1):
T_ = int(eval(input()))
T = lcm(T, T_)
print(T) | p03633 |
N = int(eval(input()))
L = [ int(eval(input())) for i in range(N)]
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
x = L[0]
for i in range(len(L)-1):
y = lcm(x, L[i+1])
x = y
print(x) | #a,bの最大公約数
def gcd(a, b):
while b:
a, b = b, a % b
return a
#a,bの最小公倍数
def lcm(a, b):
return a * b // gcd (a, b)
N = int(eval(input()))
L = [int(eval(input())) for _ in range(N)]
tmp = L[0]
for i in range(1, N):
tmp = lcm(tmp, L[i])
print(tmp)
| p03633 |
def p(n):
ans = 0
v = n
while True:
if n % 10:
v = n
break
ans += 1
n /= 10
return ans
def vp(n):
v = n
while True:
if n % 10:
v = n
break
n //= 10
return v
def lcm(x, y):
if x > y:
d = p(x)
z = vp(x)
else:
d = p(y)
z = vp(x)
x = vp(x)
y = vp(y)
a... | def gcd(a, b):
"""Compute the greatest common divisor of a and b"""
while b > 0:
a, b = b, a % b
return a
def lcm(a, b):
"""Compute the lowest common multiple of a and b"""
return a * b // gcd(a, b)
def resolve():
n = int(eval(input()))
T = []
for _ in range(n):
T.append(int(eval(input())))
... | p03633 |
def gcd(a, b):
"""Compute the greatest common divisor of a and b"""
while b > 0:
a, b = b, a % b
return a
def lcm(a, b):
"""Compute the lowest common multiple of a and b"""
return a * b // gcd(a, b)
def resolve():
n = int(eval(input()))
T = []
for _ in range(n):
T.append(int(eval(input())))
... | def gcd(a, b):
"""Compute the greatest common divisor of a and b"""
while b > 0:
a, b = b, a % b
return a
def lcm(a, b):
"""Compute the lowest common multiple of a and b"""
return a * b // gcd(a, b)
def resolve():
n = int(eval(input()))
ans = int(eval(input()))
for _ in range(n-1):
ans = lcm... | p03633 |
N = int(eval(input()))
def gcd(a, b):
tmp_a, tmp_b = a, b
a = max(tmp_a, tmp_b)
b = min(tmp_a, tmp_b)
r = a % b
while r > 0:
a = b
b = r
r = a % b
return b
def lcm(a, b):
return a*b//gcd(a, b)
tmp = 1
for i in range(N):
T = int(eval(... | N = int(eval(input()))
def gcd(a, b):
r = a % b
while r > 0:
a = b
b = r
r = a % b
return b
def lcm(a, b):
return a*b//gcd(a, b)
tmp = 1
for i in range(N):
T = int(eval(input()))
ans = lcm(T, tmp)
tmp = ans
print(ans)
| p03633 |
N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
Amax = max(A)
i = 1
while i * Amax <= 1e18:
fl = False
for a in A:
if i * Amax % a != 0:
fl = True
break
if fl:
i += 1
continue
else:
break
print((i*Amax)) | N = int(eval(input()))
A = []
for i in range(N):
A.append(int(eval(input())))
def GCD(a,b):
if a < b:
a, b = b, a
while b > 0:
a, b = b, a%b
return a
def LCM(a,b):
return a*b // GCD(a,b)
lcm = A[0]
for i in range(1,N):
lcm = LCM(lcm, A[i])
print(lcm) | p03633 |
N = int(eval(input()))
T = sorted([int(eval(input())) for i in range(N)])
def gcd(a, b):
while b != 0:
a, b = b,a%b
return a
if N == 1:
print((T[0]))
else:
ans = T[0]
for i in range(1, N):
ans = (ans*T[i])//(gcd(ans, T[i]))
print(ans) | def gcd(a, b):
while b != 0:
a, b = b, a%b
return a
N = int(eval(input()))
A = [int(eval(input())) for i in range(N)]
ans = A[0]
for i in A:
ans = (ans*i)//gcd(ans, i)
print(ans) | p03633 |
N = int(eval(input()))
a = [int(eval(input())) for x in range(N)]
ans = max(a)
mx = max(a)
iteration = 1
while (ans <= 1000000000000000000):
flag = True
for item in a:
if not (ans%item == 0):
flag = False
if flag:
print(ans)
break
else:
iterat... | def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a,b)
N = int(eval(input()))
Ts = []
c = 1
for i in range(N):
c = lcm(c, int(eval(input())))
print((int(c)))
| p03633 |
# -*- coding: utf-8 -*-
N = int(input().strip())
T_list = [int(input().strip()) for _ in range(N)]
#-----
def gcd(a,b):
x = max(a,b)
y = min(a,b)
while y != 0:
r = x % y
x = y
y = r
return x
def lcm(a, b):
return (a * b) // gcd(a, b)
... | # -*- coding: utf-8 -*-
N = int(input().strip())
T_list = [int(input().strip()) for _ in range(N)]
#-----
def gcd(a,b):
if b == 0:
return a
return gcd(b, a % b)
def lcm(a, b):
return (a * b) // gcd(a, b)
ans = T_list[0]
for i in T_list[1:]:
ans = lcm(ans, i)
print(ans)
| p03633 |
def gcd(n, m):
# 最大公約数
a = max(n,m)
b = min(n,m)
while b:
a, b = b, a % b
return a
lcd = 1
N = int(eval(input()))
ts = [int(eval(input())) for i in range(N)]
for t in ts:
lcd = (lcd*t)//gcd(lcd,t)
print(lcd) |
N = int(eval(input()))
ts = [int(eval(input())) for i in range(N)]
def lcd(n, m):
# 最小公倍数
a = max(n,m)
b = min(n,m)
while b:
a, b = b, a % b
return n*m//a
ans = 1
for t in ts:
ans = lcd(ans,t)
print(ans) | p03633 |
# 入力 : 自然数 ex) 12
# 出力 : 約数リスト ex) [2, 2, 3]
def factorization(n):
R = int(n)
s = 0
L = []
div = 2
first = True
while s == 0:
for i in range(div, R + 1):
if n % i == 0:
n = n / i
if i == div and not first:
a... | def gcd(a, b):
while b > 0:
tmp = a
a = b
b = tmp % b
return a
def lcm(a, b):
tmp = gcd(a, b)
return (a//tmp) * b
n = int(eval(input()))
t = [0 for i in range(n)]
for i in range(n):
t[i] = int(eval(input()))
t = sorted(t)
_sum = t[0]
for i in range(1, n... | p03633 |
def lcmm(l,m):
low,high = 1,1
if(l==m):return l
elif(l>m):
if(l % m ==0):return l
high = l
low = m
else:
if(m % l ==0):return m
high = m
low = l
lcm = high
while(lcm%low != 0):
lcm += high
return lcm
n... | def gcd(a,b):
if(a == 0):
return b
else:
return gcd(b % a, a)
def lcmm(l,m):
prod = l * m
gcD = gcd(l,m)
return (prod // gcD)
n = int(input().strip())
lcm = 1
for i in range(n):
num = int(input().strip())
lcm = lcmm(lcm,num)
#print(lcm)
pr... | p03633 |
import math
from functools import reduce
def lcm_base(x, y):
return (x*y)//math.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lcm_list(umbers):
return reduce(lcm_base, numbers, 1)
n = int(eval(input()))
t = []
for i in range(n):
t_ = int(eval(input()))
t.append(t_)
... | import math
n=int(eval(input()))
t=[int(eval(input())) for i in range(n)]
res=t[0]
for i in range(1,n):
res=res*t[i]//math.gcd(res,t[i])
print(res) | p03633 |
N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
pnmax = {}
def pn(A):
a = A
for n in range(2, A + 1):
if a == 1:
return
c = 0
while not a % n:
c += 1
a //= n
if 0 < c:
if not n in pnmax:
pnmax[n] = c
else:
pnmax[n] = max(pnmax[n], c)
for t in T:
... | N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
def gcd(a, b):
if not a % b:
return b
else:
return gcd(b, a % b)
l = T[0]
for n in range(1, N):
l = l * T[n] // gcd(l, T[n])
print(l)
| p03633 |
N = int(eval(input()))
T = [int(eval(input())) for k in range(N)]
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
# aとbの最小公倍数
# a*b = lcm(a,b)*gcd(a,b) より
def lcm(a,b):
return a*b//gcd(a,b)
ans = 1
for e in T:
ans = lcm(e,ans)
print(ans)
| N = int(eval(input()))
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
def lcm(a,b):
return a*b//gcd(a,b)
T = [int(eval(input())) for _ in range(N)]
ans = T[0]
for e in T:
ans = lcm(e,ans)
print(ans)
| p03633 |
N = int(eval(input()))
T = []
for i in range(N):
T.append(int(eval(input())))
m = max(T)
mm = m
while True:
flg =False
for j in range(N):
if m % T[j] != 0:
flg = True
break
if flg == True:
m += mm
else:
print(m)
exit()
| def gcd(a,b):
while b:
a,b = b,a%b
return a
def lcm(a,b):
return (a*b) // gcd(a,b)
N = int(eval(input()))
T = []
for i in range(N):
T.append(int(eval(input())))
t = T[0]
for i in range(N - 1):
t = lcm(t,T[i+1])
print(t) | p03633 |
def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
a = T[0]
for i in range(1,N):
b = T[i]
c = gcd(a,b)
a = a*(b//c)
print(a) | def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
ans = T[0]
for i in range(1,N):
a = gcd(ans,T[i])
ans = (ans//a)*T[i]
print(ans) | p03633 |
def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
ans = T[0]
for i in range(1,N):
a = gcd(ans,T[i])
ans = (ans//a)*T[i]
print(ans) | def gcd(x,y):
while y>0:
x,y = y,x%y
return x
N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
a = T[0]
for i in range(1,N):
b = T[i]
c = gcd(a,b)
a = (a//c)*b
print(a) | p03633 |
N = int(eval(input()))
T = [int(eval(input())) for i in range(N)]
T.sort()
T.reverse()
result = T[0]
for i in range(1, N):
a = 1
while True:
if (result * a) % T[i] == 0:
result *= a
break
a += 1
print(result)
| N = int(eval(input()))
T = [int(eval(input())) for i in range(N)]
result = T[0]
for i in range(1, N):
n = T[i]
m = result
while n % m != 0:
m, n = n%m, m
result = (result * T[i]) // m
print(result)
| p03633 |
from functools import reduce
#def gcd(a, b):
# while b:
# a, b = b, a % b
# return a
def gcd(m, n):
r = m % n
return gcd(n, r) if r else n
def lcm(a, b):
return a * b // gcd(a,b)
N = int(eval(input()))
Ts = []
c = 1
for i in range(N):
c = lcm(c, int(eval(input())))
... | def gcd(a, b):
while b:
a, b = b, a % b
return a
#def gcd(m, n):
# r = m % n
# return gcd(n, r) if r else n
def lcm(a, b):
return a * b // gcd(a,b)
N = int(eval(input()))
Ts = []
c = 1
for i in range(N):
c = lcm(c, int(eval(input())))
print((int(c)))
| p03633 |
N = int(eval(input()))
T = [int(eval(input())) for _ in range(N)]
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
def lc... | N = int(eval(input()))
T = []
for i in range(N):
T.append(int(eval(input())))
def gcd(a,b):
if b == 0:
return a
else:
return gcd(b,a%b)
from functools import reduce
def lcm_base(x, y):
return (x * y) // gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base,... | p03633 |
import sys
import fractions
sys.setrecursionlimit(200000000)
N = int(eval(input()))
NUMS = [int(eval(input())) for _ in range(N)]
NUMS = list(set(NUMS))
def gcd(num1, num2):
if num2 == 0:
return num1
else:
return gcd(num2, num1 % num2)
res = NUMS[0]
for num in NUMS[1:]:
... | import sys
sys.setrecursionlimit(200000000)
N = int(eval(input()))
NUMS = [int(eval(input())) for _ in range(N)]
NUMS = list(set(NUMS))
def gcd(num1, num2):
if num2 == 0:
return num1
else:
return gcd(num2, num1 % num2)
res = NUMS[0]
for num in NUMS[1:]:
res = res * num //... | p03633 |
n=int(eval(input()))
if n==1:
print((eval(input())))
quit()
def gcd(a,b):
if b==0:return a
return gcd(b,a%b)
def lcm(a,b):
return a*b//gcd(a,b)
ans = int(eval(input()))
for i in range(n-1):
tmp = int(eval(input()))
ans = lcm(tmp,ans)
print(ans)
| n=int(eval(input()))
'''
if n==1:
print(input())
quit()
'''
def gcd(a,b):
if b==0:return a
return gcd(b,a%b)
def lcm(a,b):
return a*b//gcd(a,b)
ans = int(eval(input()))
for i in range(n-1):
tmp = int(eval(input()))
ans = lcm(tmp,ans)
print(ans)
| p03633 |
#!/usr/bin/env python
from functools import reduce
import math
# GCD and LCM are not in math module. They are in gmpy, but these are simple enough:
def gcd(a,b):
"""Compute the greatest common divisor of a and b"""
while b > 0:
a, b = b, a % b
return a
def lcm(a, b):
"""Co... | #!/usr/bin/env python
from functools import reduce
# GCD and LCM are not in math module. They are in gmpy, but these are simple enough:
def gcd(a,b):
"""Compute the greatest common divisor of a and b"""
while b > 0:
a, b = b, a % b
return a
def lcm(a, b):
"""Compute the low... | p03633 |
N = int(eval(input()))
Tn = [int(eval(input())) for i in range(N)]
def gcd(a, b):
result = a
k = 0
n = b
while True:
k = result % n
result = n
n = k
if k == 0:
break
return result
def gcd_n(numbers):
l = numbers[0]
for ... | N = int(eval(input()))
def gcd(a, b):
result = a
k = 0
n = b
while True:
k = result % n
result = n
n = k
if k == 0:
break
return result
def lcm(a, b):
g = gcd(a, b)
return a * (b // g)
def main():
ans = 1
... | p03633 |
N = int(eval(input()))
T = [int(eval(input())) for i in range(N)]
T.sort()
while True:
flag = False
for i in range(N-1):
if T[-1]%T[i]!=0:
T[-1] += T[-1]
flag = True
break
if flag == False:
print((T[-1]))
break
| N = int(eval(input()))
T = [int(eval(input())) for i in range(N)]
ans = 1
def gcd(a,b):
if b==0:
return a
return gcd(b,a%b)
for i in range(N):
ans = (ans*T[i])//gcd(ans,T[i])
print(ans) | p03633 |
n = int(eval(input()))
t = [int(eval(input())) for _ in range(n)]
f, ans, x = 0, 1, 2
while x<=max(t):
for i in range(n):
if t[i]%x==0:
t[i] //= x
f = 1
if f:
ans *= x
f = 0
else:
x += 1
for i in t:
ans *= i
print(ans) | n = int(eval(input()))
t = [int(eval(input())) for _ in range(n)]
#a>b
def gcd(a, b):
if b:
return gcd(b, a%b)
else:
return a
def lcm(a, b):
if a>b:
g = gcd(a, b)
return a*b//g
else:
g = gcd(b, a)
return a*b//g
ans = 1
for i in rang... | p03633 |
def gcd(a, b):
if b == 1:
return 1
# a > b を仮定
r = a % b
if r == 0:
return b
else:
return gcd(b, r)
#def lcm(A, n):
# if n == 2:
# return A[0]*A[1] // gcd(A[0], A[1])
# #lcm(A, n)はA[0]-A[n-1]までの最小公倍数を求める
# a = lcm(A, n-1)
# return a* A[n-1] ... | import sys
sys.setrecursionlimit(10000)
def gcd(a, b):
if b == 1:
return 1
r = a % b
if r == 0:
return b
else:
return gcd(b, r)
def lcm(A, n):
if n == 2:
return A[0]* (A[1] // gcd(A[0], A[1]))
#lcm(A, n)はA[0]-A[n-1]までの最小公倍数を求める
rec = lcm(A, n... | p03633 |
import sys
N = int(eval(input()))
T = []
for i in range(N):
T.append(int(eval(input())))
T = sorted(T, reverse=True)
for i in range(1, 10**18//T[0] + 1):
f = True
for n in T[1:]:
if i*T[0] % n != 0:
f = False
break
if f:
print((i*T[0]))
sys.e... | def gcd(a, b):
"""最大公約数(Greatest Common divisor)を求める.
ユークリッドの互除法の実装.
ああああ
Parameters
----------
a : int
自然数.
b : int
自然数.
Returns
-------
int
最大公約数
"""
while b:
a, b = b, a % b
return a
def lcm(a, b):
"""最... | p03633 |
n=int(eval(input()))
l=list(set([int(eval(input())) for d in range(n)]))
a=l[0]
sd=0
for i in l[1:]:
for h in range(min(i,a)+1)[:0:-1]:
if (a%h,i%h)==(0,0):
sd=h
break
a=a*i//sd
print(a) | n=int(eval(input()))
l=list(set([int(eval(input())) for d in range(n)]))
a=l[0]
def gcd(a,s):
a,s=min(a,s),max(a,s)
if a==0:return s
else:return gcd(s%a,a)
for i in l[1:]:
a=a*i//gcd(a,i)
print(a) | p03633 |
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
de... | import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy
sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for... | p03633 |
# code-festival-2017-qualcC - Inserting 'x'
from collections import deque
def main():
S = deque(list(input().rstrip()))
ans = 0
while len(S) >= 2:
l, r = S[0], S[-1]
if l == r:
S.popleft(), S.pop()
else:
ans += 1
if l == "x":
... | # code-festival-2017-qualcC - Inserting 'x'
def main():
S = input().rstrip()
ans, l, r = 0, 0, len(S) - 1
while l < r:
if S[l] == S[r]:
l += 1
r -= 1
else:
ans += 1
if S[l] == "x":
l += 1
elif S[r] == "x"... | p03569 |
# 2019-11-21 01:26:03(JST)
import sys
import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r, insort_left as in_l
# import itertools
# from functools import reduce
# import operator as op
# import re
# impor... | # 2019-11-21 01:26:03(JST)
import sys
import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r, insort_left as in_l
# import itertools
# from functools import reduce
# import operator as op
# import re
# impor... | p03569 |
import sys
S=list(input())
cnt=0
while len(S)>1:
#print S,cnt
if S[0]==S[-1]:
S.pop(0)
S.pop()
elif S[0]!=S[-1] and S[0]=="x":
cnt+=1
S.append("x")
elif S[0]!=S[-1] and S[-1]=="x":
cnt+=1
S.insert(0,"x")
else:
print("-1")
sys.exit()
print(cnt) | import sys
S=input()
cnt=0
while len(S)>1:
#print S,cnt
if S[0]==S[-1]:
S=S[1:-1]
elif S[0]!=S[-1] and S[0]=="x":
cnt+=1
S=S+"x"
elif S[0]!=S[-1] and S[-1]=="x":
S="x"+S
cnt+=1
else:
print("-1")
sys.exit()
print(cnt) | p03569 |
import sys
stdin = sys.stdin
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x) - 1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.r... | p03569 |
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI... | from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate
import sys
import bisect
import string
import math
import time
def I(): return int(input())
def S(): return input()
def MI... | p03569 |
N, K = list(map(int, input().split()))
arr = [list(map(int, input().split())) for i in range(N)]
arr.sort()
n = 0
for i in range(N):
n += arr[i][1]
if n >= K:
print((arr[i][0]))
break | n,k = list(map(int,input().split()))
li = [list(map(int, input().split())) for i in range(n)]
li.sort()
cnt=0
for i in range(n):
cnt+=li[i][1]
if cnt>=k:
print((li[i][0]))
break | p03721 |
def main():
N, K = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append([a, b])
AB.sort(key=lambda x: x[0])
c = 0
for a, b in AB:
if c <= K <= c + b:
ans = a
break
c += b
... | def main():
N, K = list(map(int, input().split()))
AB = []
for i in range(N):
a, b = list(map(int, input().split()))
AB.append([a, b])
AB.sort(key=lambda x: x[0])
c = 0
for a, b in AB:
if K <= c + b:
ans = a
break
c += b
... | p03721 |
from collections import deque
n, k = list(map(int, input().split()))
d = deque()
for _ in range(n):
a, b = list(map(int, input().split()))
d.append([a, b])
x = sorted(list(d))
for i in range(n):
k -= x[i][1]
if k < 1:
print((x[i][0]))
break
| n, k = list(map(int, input().split()))
x = []
for _ in range(n):
a, b = list(map(int, input().split()))
x.append([a, b])
x = sorted(x)
for i in range(n):
k -= x[i][1]
if k < 1:
print((x[i][0]))
break
| p03721 |
n,k=list(map(int,input().split()))
s=[]
for i in range(n):
a,b=list(map(int,input().split()))
s.extend([a for _ in range(b)])
s.sort()
print((s[k-1])) | import bisect
n,k=list(map(int,input().split()))
s=[0 for _ in range((10**5)+1)]
maxa=0
for i in range(n):
a,b=list(map(int,input().split()))
s[a]+=b
maxa=max(maxa,a)
s=s[:maxa]
#print(s)
for i in range(1,len(s)):
s[i]+=s[i-1]
#print(s)
print((bisect.bisect_left(s, k))) | p03721 |
N, K = list(map(int, input().split()))
d = []
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(b):
d.append(a)
d.sort()
print((d[K-1])) | import bisect
N, K = list(map(int, input().split()))
d = []
for i in range(N):
a, b = list(map(int, input().split()))
d.append([a,b])
d.sort()
l = [0] * N
l[0] = d[0][1]
for i in range(1, N):
l[i] = d[i][1]+ l[i-1]
pos = bisect.bisect_left(l, K)
print((d[pos][0])) | p03721 |
import bisect
N, K = list(map(int, input().split()))
d = []
for i in range(N):
a, b = list(map(int, input().split()))
d.append([a,b])
d.sort()
l = [0] * N
l[0] = d[0][1]
for i in range(1, N):
l[i] = d[i][1]+ l[i-1]
pos = bisect.bisect_left(l, K)
print((d[pos][0])) | import sys
import bisect
N, K = list(map(int, sys.stdin.readline().split()))
d = []
for i in range(N):
a, b = list(map(int, sys.stdin.readline().split()))
d.append([a,b])
d.sort()
l = [0] * N
l[0] = d[0][1]
for i in range(1, N):
l[i] = d[i][1]+ l[i-1]
pos = bisect.bisect_left(l, K)... | p03721 |
import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
d... | p03721 |
#!/usr/bin/env python3
import sys
import itertools
def solve(N: int, K: int, a: "List[int]", b: "List[int]"):
big_array = []
for i in range(N):
big_array += [a[i]]*b[i]
big_array.sort()
print((big_array[K-1]))
return
def main():
def iterate_tokens():
for line in... | #!/usr/bin/env python3
import sys
import itertools
def solve(N: int, K: int, a: "List[int]", b: "List[int]"):
ab = list(zip(a,b))
ab.sort(key=lambda x: x[0])
sumb =0
123334
for i in range(N):
sumb+=ab[i][1]
if sumb>=K:
print((ab[i][0]))
return
... | p03721 |
# coding: utf-8
def add_list(_n):
_l = []
for _ in range(_n):
a, b = list(map(int, input().split()))
_l.append([a for _ in range(b)])
return [j for i in _l for j in i]
n, k = list(map(int, input().split()))
l = add_list(n)
l.sort()
print(l[k-1])
| # coding: utf-8
l = 10 ** 5
num = [0] * (l + 1)
n, k = list(map(int, input().split()))
for _ in range(n):
a, b = list(map(int, input().split()))
num[a] += b
for i in range(1, l+1):
k -= num[i]
if k <= 0:
print(i)
break
| p03721 |
n,k=list(map(int,input().split()))
a,b=[],[]
for i in range(n):
A,B=list(map(int,input().split()))
b=[A]*B
a=a+b
a.sort()
print((a[k-1])) | n,k=list(map(int,input().split()))
a=[]
for i in range(n):
A=list(map(int,input().split()))
a.append(A)
a = sorted(a, key=lambda x: x[0])
b=0
for i in range(n):
b+=a[i][1]
if b>=k:
print((a[i][0]))
exit() | p03721 |
N, K = [int(i) for i in input().split()]
L = []
for i in range(N):
a, b = [int(j) for j in input().split()]
l = [a]*b
L.extend(l)
L.sort()
print((L[K-1])) | N, K = [int(i) for i in input().split()]
L = []
for i in range(N):
a, b = [int(j) for j in input().split()]
L.append([a, b])
L.sort(key=lambda x: x[0])
#print(L)
cnt = 0
for x, y in L:
cnt += y
if cnt >= K:
ans = x
break
print(ans) | p03721 |
N, K = [int(x) for x in input().split()]
Array = list()
a = 0
b = 0
for i in range(N):
a, b = [int(x) for x in input().split()]
Array.extend([a]*b)
if len(Array) > K:
Array.sort()
Array = Array[:K]
print((Array[K - 1])) | from operator import itemgetter
N, K = [int(x) for x in input().split()]
Array = list()
A = list()
count = 0
ans = 0
for i in range(N):
A.append([int(x) for x in input().split()])
A.sort(key=itemgetter(0))
for i in range(N):
count += A[i][1]
if count >= K:
ans = A[i][0]
break
print(ans) | p03721 |
N,K=list(map(int,input().split()))
Array=[]
for n in range(0,N):
a,b=input().split()
Array+=((a+" ")*int(b)).split()
Array.sort()
print((int(Array[K-1])))
| N,K=list(map(int,input().split()))
Array={}
for n in range(0,N):
a,b=list(map(int,input().split()))
if a in Array:
Array[a]+=b
else:
Array[a]=b
numbers=sorted(list(Array.keys()))
n=0
k=0
while True:
k+=Array[numbers[n]]
if k>=K:
break
n+=1
print((numbers[n... | p03721 |
N, K = list(map(int, input().split()))
seq = []
for i in range(N):
a, b = list(map(int, input().split()))
for j in range(b):
seq.append(a)
seq.sort()
print((seq[K-1]))
| from collections import defaultdict
N, K = list(map(int, input().split()))
seq = defaultdict(lambda: 0)
for i in range(N):
a, b = list(map(int, input().split()))
seq[a] += b
values = list(seq.keys())
values.sort()
ans = 0
for i in range(len(values)):
K -= seq[values[i]]
if(K<=0):
... | p03721 |
if __name__ == '__main__':
#入力
N, K = list(map(int,input().split()))
lst = []
for i in range(0,N):
a, b = list(map(int,input().split()))
lst.append([a,b])
ans_lst = []
for i in range(0,N):
a = lst[i][0]
b = lst[i][1]
for j in range(0,b):
ans_lst.append(a)
ans_lst.sort()
print((... | if __name__ == '__main__':
#入力
N, K = list(map(int,input().split()))
lst = []
for i in range(0,N):
a, b = list(map(int,input().split()))
lst.append([a,b])
lst.sort()
indx = 0
for i in range(0,N):
indx += lst[i][1]
if indx >= K:
ans = lst[i][0]
break
print(ans) | p03721 |
N, K = (int(i) for i in input().split())
L = []
for i in range(N):
a, b = (int(i) for i in input().split())
L = L + [a]*b
if len(L) > K:
L.sort()
L = L[:K]
if L[-1] == 1:
print((1))
break
else:
print((L[-1])) | N, K = (int(i) for i in input().split())
D = {}
count = 0
for i in range(N):
a, b = (int(i) for i in input().split())
if a in D:
D[a] += b
else:
D[a] = b
else:
aL = [a for a in list(D.keys())]
aL.sort()
for a in aL:
count += D[a]
if count >= K:
... | p03721 |
N, K = list(map(int, input().split()))
lis = []
for i in range(N):
a, b = list(map(int, input().split()))
lis = lis + [a]*b
lis.sort()
print((lis[K-1])) | N, K = list(map(int, input().split()))
from itertools import accumulate
from bisect import bisect_left
lis = []
lis = [tuple(map(int, input().split())) for i in range(N)]
lis.sort()
Bs = [y for x, y in lis]
cB = list(accumulate(Bs))
print((lis[bisect_left(cB, K)][0]))
| p03721 |
n,k=list(map(int,input().split()))
h=[]
for i in range(n):
a,b=list(map(int,input().split()))
for j in range(b):
h.append(a)
h=sorted(h)
print((h[k-1]))
| n,k = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]
a.sort()
now = 0
for i in a:
now += i[1]
if now >= k:
print((i[0]))
break | p03721 |
N,K = list(map(int,input().split()))
temp = []
c,t = K,-1
for i in range(N):
temp.append(list(map(int,input().split())))
temp.sort()
while c>0:
t += 1
c -= temp[t][1]
print((temp[t][0])) | N,K = list(map(int,input().split()))
temp = []
c,t = K,-1
for i in range(N):
temp.append(list(map(int,input().split())))
temp.sort()
while c>0:
t += 1
c -= temp[t][1]
print((temp[t][0])) | p03721 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,k=list(map(int, input().split()))
l=[]
for i in range(n):
a,b=list(map(int, input().split()))
for j in range(b):
l.append(a)
l.sort()
print((l[k-1]))
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n,k=list(map(int, input().split()))
l=[list(map(int,input().split())) for i in range(n)]
l.sort(key=lambda x:x[0])
kosu=0
for i in range(n):
kosu+=l[i][1]
if kosu>=k:
print((l[i][0]))
... | p03721 |
n, k = list(map(int, input().split()))
array = []
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
array.append(a)
array.sort()
print((array[k-1]))
| n, k = list(map(int, input().split()))
number = [[0,0] for i in range(n)]
for i in range(n):
number[i] = list(map(int, input().split()))
number.sort(key=lambda x:(x[0],x[1]))
count = 0
result = 0
for el in number:
count += el[1]
if count >= k:
result = el[0]
break
print(result) | p03721 |
from bisect import bisect_left,bisect_right
N,K=list(map(int,input().split()))
table=[]
for i in range(N):
a,b=list(map(int,input().split()))
table.append([a,b])
table.sort()
cou=[0]*N
cou[0]=table[0][1]
for i in range(1,N):
cou[i]=cou[i-1]+table[i][1]
s = bisect_left(cou,K)
print((table[s][0])) | N,K=list(map(int,input().split()))
table=[]
for i in range(N):
a,b=list(map(int,input().split()))
table.append([a,b])
table.sort()
ans = 0
for x,y in table:
ans += y
if ans >=K:
print(x)
break | p03721 |
NK = list(map(int,input().split()))
AB = []
for _ in range(NK[0]):
I = list(map(int, input().split()))
for _ in range(I[1]):
AB.append(I[0])
print((sorted(AB)[NK[1]-1])) | from operator import itemgetter, attrgetter
NK = list(map(int,input().split()))
AB = sorted([tuple(map(int, input().split())) for _ in range(NK[0])],key = itemgetter(0))
for i,j in AB:
NK[1] = NK[1] - j
if NK[1]<=0:
print(i)
break | p03721 |
n,k=list(map(int, input().split()))
a=[list(map(int, input().split())) for i in range(n)]
a.sort()
#print(a)
b=[]
for i,j in a:
b=b+[i]*j
if len(b)>k:break
print((b[k-1])) | n,k=list(map(int, input().split()))
a=[list(map(int, input().split())) for i in range(n)]
a.sort()
#print(a)
b=[]
c=0
for i,j in a:
k-=j
c=i
if k<=0: break
print(c) | p03721 |
# ABC061C - Big Array
import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().rstrip().split()))
arr = sorted([list(map(int, input().rstrip().split())) for _ in range(n)])
cur, cnt, ans = 0, 0, 0
while cnt < k:
cnt += arr[cur][1]
ans = arr[cur][0]
... | # ABC061C - Big Array
import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().rstrip().split()))
arr = sorted([list(map(int, input().rstrip().split())) for _ in range(n)])
cur, cnt, ans = 0, 0, 0
for i, j in arr:
ans = i
cnt += j
if cnt >= k:
... | p03721 |
# ABC061C - Big Array
import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().rstrip().split()))
arr = [list(map(int, input().rstrip().split())) for _ in range(n)]
memo = [0] * (10 ** 5 + 1)
for i, j in arr:
memo[i] += j
cnt = 0
for i, j in enumerate(me... | # ABC061C - Big Array
import sys
input = sys.stdin.readline
def main():
n, k = list(map(int, input().rstrip().split()))
memo = [0] * (10 ** 5 + 1)
for _ in range(n):
i, j = list(map(int, input().rstrip().split()))
memo[i] += j
cnt = 0
for i, j in enumerate(memo):
... | p03721 |
n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
l = []
for x in ab:
l += [x[0]] * x[1]
print((sorted(l)[k-1])) | n, k = list(map(int, input().split()))
ab = [list(map(int, input().split())) for _ in range(n)]
length = 0
for x in sorted(ab, key=lambda x: x[0]):
length += x[1]
if length >= k:
print((x[0]))
break | p03721 |
n, k = list(map(int, input().split()))
lst = []
for i in range(n):
a, b = list(map(int, input().split()))
for j in range(b):
lst.extend([a])
lst.sort()
print((lst[k-1])) | n, k = list(map(int, input().split()))
dic = {}
lst = []
ans = 0
for i in range(n):
a, b = list(map(int, input().split()))
if (a in dic)==False:
dic[a] = b
lst.append(a)
else:
dic[a] += b
lst.sort()
for i in range(len(dic)):
if k > (dic[lst[i]] + ans):
ans... | p03721 |
n, k = list(map(int, input().split()))
nums = []
for _ in range(n):
a, b = list(map(int, input().split()))
nums.extend([a]*b)
sn = sorted(nums)
print((sn[k-1]))
| n, k = list(map(int, input().split()))
nums = []
for _ in range(n):
ab = list(map(int, input().split()))
nums.append(ab)
sn = sorted(nums)
i = 0
while k > 0:
if sn[i][1] < k:
k -= sn[i][1]
else:
print((sn[i][0]))
break
i += 1
| p03721 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.