input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N = int(eval(input()))
D = list(map(int, input().split()))
res = 0
for i in range(N):
res += sum(D[i + 1:])*D[i]
print(res) | N = int(eval(input()))
D = list(map(int, input().split()))
s = sum(D)
sq = 0
for i in range(N):
sq += D[i]**2
print(((s**2 - sq)//2)) | p02886 |
n = int(eval(input()))
d = list(map(int, input().split()))
sum = 0
for i in range(n):
for j in range(i+1):
if(i != j):
sum += d[i] * d[j]
print(sum)
| n = int(eval(input()))
d = list(map(int, input().split()))
sum = 0
for i in range(n):
for j in range(i):
sum += d[i] * d[j]
print(sum)
| p02886 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
# input=lambda :sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
D=list(map(int,input().split()))
ans=0
for i in range(n):
for j in range(i+1,n):
ans+=D[i]*D[j]
print(ans)
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
A=list(map(int,input().split()))
s=sum(A)
t=sum(a**2 for a in A)
print(((s**2-t)//2))
resolve() | p02886 |
import itertools
n = int(eval(input()))
D = list(map(int, input().split()))
l1 = [x for x in range(n)]
l2 = [x for x in range(n)]
ans = 0
sub = 0
for v1, v2 in itertools.product(l1, l2):
ans += D[v1] * D[v2]
for i in range(n):
sub += D[i]*D[i]
print(((ans-sub)//2)) | n = int(eval(input()))
D = list(map(int, input().split()))
ans = 0
for i in range(n-1):
for j in range(i+1, n):
ans += D[i]*D[j]
print(ans) | p02886 |
n = int(eval(input()))
d = list(map(int, input().split()))
s = 0
for i in range(n):
for j in range(n):
if i != j:
s += d[i]*d[j]
s //= 2
print(s)
| n = int(eval(input()))
d = list(map(int, input().split()))
s = 0
for i in range(n-1):
for j in range(i+1, n):
s += d[i]*d[j]
print(s)
| p02886 |
import itertools
N=int(eval(input()))
d_list=[int(i) for i in input().split()]
comb = list(itertools.combinations(d_list, 2))
sum_heal = 0
for i,j in comb:
sum_heal += i*j
print(sum_heal) | N=int(eval(input()))
d_list=[int(i) for i in input().split()]
sum_heal = 0
for i in range(N):
for j in range(i+1, N):
sum_heal += d_list[i]*d_list[j]
print(sum_heal) | p02886 |
import itertools
n=int(eval(input()))
takoyaki=list(map(int,input().split()))
combs=list(itertools.combinations(takoyaki,2))
recovery=list(c[0]*c[1] for c in combs)
print((sum(recovery))) | n=int(eval(input()))
d=list(map(int,input().split()))
tot=sum(d)**2
for i in range(n):
tot-=d[i]**2
print((tot//2))
| p02886 |
n=int(eval(input()))
d=list(map(int,input().split()))
sm=0
for i in range(len(d)-1):
for j in range(i+1,len(d)):
sm+=d[i]*d[j]
print(sm) | n=int(eval(input()))
d=list(map(int,input().split()))
d2=[m**2 for m in d]
print(((sum(d)**2-sum(d2))//2)) | p02886 |
n = int(eval(input()))
l=list(map(int,input().split()))
sum = 0
for i in range(len(l)):
for j in range(i+1,len(l)):
sum += l[i]*l[j]
print(sum) | n = int(eval(input()))
list = list(map(int,input().split()))
sum = 0
for i in range(len(list)):
for j in range(i+1,len(list)):
sum +=list[i]*list[j]
print(sum) | p02886 |
N=int(eval(input()))
d=[int(i) for i in input().split()]
X=sum([i*i for i in d])
print(((sum(d)**2-X)//2))
| N=int(eval(input()))
d=[int(i) for i in input().split()]
ans=0
for i in range(N):
for j in range(i+1,N):
ans+=d[i]*d[j]
print(ans)
| p02886 |
N=int(eval(input()))
d=[int(i) for i in input().split()]
ans=0
for i in range(N):
for j in range(i+1,N):
ans+=d[i]*d[j]
print(ans)
| N=int(eval(input()))
d=[int(i) for i in input().split()]
X=sum([i*i for i in d])
print(((sum(d)**2-X)//2))
| p02886 |
#!/usr/bin/env python
def main():
N = int(eval(input()))
D = list(map(int, input().split()))
ans = 0
for i in range(N-1):
d1 = D[i]
for d2 in D[i+1:]:
ans += d1 * d2
print(ans)
if __name__ == '__main__':
main()
| #!/usr/bin/env python
def main():
N = int(eval(input()))
d = list(map(int, input().split()))
cumSum = [0] * N
cumSum[0] = d[0]
for i in range(1, N):
cumSum[i] = cumSum[i-1] + d[i]
ans = 0
for i in range(N-1):
ans += d[i] * (cumSum[N-1] - cumSum[i])
print(ans)
if __name__ == '__main__':
main() | p02886 |
N=int(eval(input()))
d=list(map(int,input().split()))
print((sum(d[x]*d[y] for x in range(N) for y in range(x+1,N)))) | import itertools
N=int(eval(input()))
D=list(map(int,input().split()))
print((sum(d*cumulate for d,cumulate in zip(D[1:],itertools.accumulate(D))))) | p02886 |
eval(input())
*l,=list(map(int,input().split()))
ans=0
for i in l:
for j in l:
ans+=i*j
print(((ans-sum([x*y for (x, y) in zip(l,l)]))//2)) | eval(input())
*l,=list(map(int,input().split()))
ans=0
for i in l:
for j in l:
ans+=i*j
print(((ans-sum([pow(x,2) for x in l]))//2)) | p02886 |
eval(input())
*l,=list(map(int,input().split()))
ans=0
for i in l:
for j in l:
ans+=i*j
print(((ans-sum([pow(x,2) for x in l]))//2)) | eval(input())
*l,=list(map(int,input().split()))
print(((pow(sum(l),2)-sum([pow(x,2) for x in l]))//2)) | p02886 |
import itertools
n = int(eval(input()))
d = list(map(int, input().split()))
recovery = 0
for i in itertools.combinations(list(range(n)), 2):
recovery += d[i[0]] * d[i[1]]
print(recovery) | n = int(eval(input()))
d = list(map(int, input().split()))
sum_mul = sum(d)
recovery = 0
for i in range(n):
sum_mul -= d[i]
recovery += d[i] * sum_mul
print(recovery)
| p02886 |
N,*D = list(map(int,open(0).read().split()))
import itertools
print((sum(a * b for a,b in itertools.combinations(D,2)))) | N,*D = list(map(int,open(0).read().split()))
cum = 0
ans = 0
for i in range(1,len(D)):
cum += D[i - 1]
ans += D[i] * cum
print(ans)
| p02886 |
n = int(eval(input()))
ds = [int(x) for x in input().split()]
ds2 = [x*x for x in ds]
s = sum(ds)
print((int((sum(ds * s) - sum(ds2)) / 2 ))) | n = int(eval(input()))
ds = [int(x) for x in input().split()]
ds2 = [x*x for x in ds]
s = 0
s2 = 0
for i in range(n):
s += ds[i]
s2 += ds2[i]
ss = 0
for i in range(n):
ss += ds[i] * s
print(((ss - s2) // 2)) | p02886 |
n = int(eval(input()))
d = list(map(int, input().split()))
a = []
for i1 in range(n):
for i2 in range(n):
if i1 != i2:
a.append(d[i1] * d[i2])
print((int(sum(a) / 2))) | n = int(eval(input()))
d = list(map(int, input().split()))
a = 0
for i in range(n):
for j in range(i + 1, n):
a = a + (d[i] * d[j])
print(a) | p02886 |
N = int(eval(input()))
d = list(map(int, input().split()))
ans = 0
for i in range(N):
for j in range(i + 1, N):
ans += d[i] * d[j]
print(ans)
| N = int(eval(input()))
d = list(map(int, input().split()))
D = sum(d)
ans = 0
for i in range(N):
D -= d[i]
ans += d[i] * D
print(ans)
| p02886 |
import sys
import itertools
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
d = list(map(int, input().rstrip('\n').split()))
t = 0
for v in itertools.combinations(d, 2):
t += (v[0] * v[1])
print(t)
if __name__ == '__main__':
solve()
| import sys
import itertools
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
a = list(map(int, readline().split()))
t = 0
for v in itertools.combinations(a, 2):
t += v[0] * v[1]
print(t)
if __name__ == '__main__':
solve()
| p02886 |
import itertools
n = int(eval(input()))
d = list(map(int, input().split()))
c = list(itertools.combinations(d, 2))
ans = 0
for i in c:
ans += i[0]*i[1]
print(ans) | n = int(eval(input()))
d = list(map(int, input().split()))
print((sum([d[i]*d[j]for i in range(n-1) for j in range(i+1, n)]))) | p02886 |
N = int(eval(input()))
D = list(map(int, input().split()))
res = 0
for i in range(N):
for j in range(i + 1, N):
if i == j:
continue
res += D[i] * D[j]
print(res)
| import itertools
N = int(eval(input()))
D = list(map(int, input().split()))
res = 0
for x, y in itertools.combinations(D, 2):
res += x * y
print(res)
| p02886 |
N = int(eval(input()))
D = list(map(int, input().split()))
from itertools import accumulate
print((sum(list(d*c for d, c in zip(D[1:], accumulate(D))))))
| N = int(eval(input()))
D = list(map(int, input().split()))
from itertools import combinations
ans = 0
for i , j in combinations(D,2):
ans += i*j
print(ans) | p02886 |
N = int(eval(input()))
D = list(map(int, input().split()))
from itertools import combinations
ans = 0
for i , j in combinations(D,2):
ans += i*j
print(ans) | N=int(eval(input()))
D=list(map(int,input().split()))
print(((sum(D)**2-sum(d*d for d in D))//2)) | p02886 |
n = int(eval(input()))
num = list(map(int,input().split()))
a = 0
b = 0
for i in range(n):
for j in range(n):
a = a + num[i] * num[j]
for i in range(n):
b = b + num[i] * num[i]
print(((a - b) // 2))
| n = int(eval(input()))
num = list(map(int,input().split()))
a = 0
for i in range(n):
for j in range(i + 1,n):
a += num[i] * num[j]
print(a) | p02886 |
import itertools
n=int(eval(input()))
d=list(map(int,input().split()))
sum=0
for v in itertools.combinations(d,2):
sum+=v[0]*v[1]
print(sum) | n=int(eval(input()))
takoyaki=list(map(int,input().split()))
ans=0
while len(takoyaki)>1:
s=takoyaki.pop()
for x in takoyaki:
ans+=s*x
print(ans) | p02886 |
import itertools
N = int(eval(input()))
D = list(input().split())
a = itertools.combinations(D,2)
sum= 0
for i,j in a:
sum += eval("{} * {}".format(i,j))
print(sum) | N = int(eval(input()))
D = list(map(int,input().split()))
print(((sum(D)**2-sum(list([x**2 for x in D])))//2)) | p02886 |
n=int(eval(input()))
listd=list(map(int,input().split()))
count=0
for i in range(1,n):
for j in range(i+1,n+1):
count+=listd[i-1]*listd[j-1]
print(count) | n=int(eval(input()))
l=list(map(int,input().split()))
ans=[]
for i in range(n-1):
for j in range(i+1,n):
a=l[i]*l[j]
ans.append(a)
print((sum(ans))) | p02886 |
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *D = list(map(int, read().split()))
ans = 0
for i in range(N):
for j in range(i + 1, N):
ans += D[i] * D[j]
print(ans)
return
if __name__ == '__main__':
main()
| import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *D = list(map(int, read().split()))
csum = accumulate(D)
ans = sum(s * d for s, d in zip(csum, D[1:]))
print(ans)
return
if __name__ == '__main__':
main()
| p02886 |
N = int(eval(input()))
d = list(map(int, input().split()))
S = [d[0]]
for i in range(N-1):
S.append(S[i] + d[i+1])
ans = 0
for j in range(N-1):
ans += d[j+1] * S[j]
print(ans) | N = int(eval(input()))
d = list(map(int, input().split()))
S = [0]
for i in range(N):
S.append(S[i] + d[i])
ans = 0
for j in range(N):
ans += d[-j-1] * S[-j-2]
print(ans) | p02886 |
[ a, b ] = list(map ( int, input ( ).split ( ) ))
print(( "%s %s" % ( a * b, 2 * ( a + b ) ) )) | x = input().split()
a, b = int(x[0]), int(x[1])
print(("%d %d" % (a * b, 2 * (a + b))))
| p02389 |
i = input()
a = i.split()
totalLength = 0
for length in a:
totalLength += int(length) * 2
menseki = int(a[0])* int(a[1])
print(str(menseki)+" "+str(totalLength)) | a,b = list(map(int,input().split()))
print(a*b,2*(a+b)) | p02389 |
a, b=list(map(int,input().split()))
print(a*b, 2*a+2*b) | a, b = list(map(int, input().split()))
print(a*b, 2*(a+b)) | p02389 |
import sys
from functools import reduce
for line in sys.stdin:
nums = list([int(x) for x in line.split()])
menseki = reduce(lambda x, y: x * y, nums)
syuu = reduce(lambda x, y: x + y, nums) * 2
print((str(menseki) + " " + str(syuu)))
| import sys
import operator
for line in sys.stdin:
nums = list(map(int, line.split()))
strings = list(map(str, [operator.mul(*nums),
operator.add(*nums) * 2]))
print((" ".join(strings)))
| p02389 |
import sys
if __name__ == '__main__':
import doctest
doctest.testmod()
a, b = list(map(int, sys.stdin.read().split()))
print(a * b, 2 * (a + b))
| #!/usr/bin/env python
#-*- coding: utf-8 -*-
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_C
if __name__ == '__main__':
a, b = list(map(int, input().split()))
print(a * b, 2 * (a + b))
| p02389 |
a = int(eval(input()))
_ = int(eval(input()))
_ = int(eval(input()))
_ = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print("Yay!")
else:
print(":(")
| a = int(eval(input()))
d = int(eval(input()))
f = int(eval(input()))
h = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print("Yay!")
else:
print(":(")
| p03075 |
import sys
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
target = [a,b,c,d,e]
gap = [abs(a-e),abs(b-e),abs(c-e),abs(d-e)]
for i in range(len(gap)):
if gap[i] > k:
print(':(')
sys.exit()
print('Yay!') | import sys
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
gap = [abs(a-e),abs(b-e),abs(c-e),abs(d-e)]
for i in range(len(gap)):
if gap[i] > k:
print(':(')
sys.exit()
print('Yay!') | p03075 |
anntena = [int(input()) for i in range(5)]
k = int(input())
print("Yay!") if anntena[4] - anntena[0] <= k else print(":(")
| anntena = [int(input()) for i in range(5)]
k = int(input())
print(":(") if anntena[4] - anntena[0] > k else print("Yay!")
| p03075 |
# coding: utf-8
# Your code here!
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
if e-a<=k:
print("Yay!")
else:
print(":(") | # coding: utf-8
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
if e-a>k:
print(":(")
else:
print("Yay!")
| p03075 |
#!/usr/bin/env python3
import re
a = []
for i in range(6):
b = int(eval(input()))
a.append(b)
count = 0
for i in range(5):
for j in range(i+1,5):
if(a[j] - a[i] > a[5]):
count += 1
else:
pass
if(count == 0):
print("Yay!")
else:
print(":(")
| #!/usr/bin/env python3
#ABC123 A
LI = [int(eval(input())) for _ in range(6)]
K = LI[-1]
for i in range(1,5):
for j in range(i):
if LI[i] - LI[j] > K:
print(':(')
exit()
print('Yay!')
| p03075 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
ant = [a, b, c, d, e]
f = False
for i in range(0, 5):
for ii in range(i + 1, 5):
sa = ant[i] - ant[ii]
if -sa <= k:
continue
else:
print(":(")
f = True
break
break
if f is False:
print("Yay!")
| a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e-a > k:
print(":(")
else:
print("Yay!") | p03075 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
ab = b - a
ac = c - a
ad = d - a
ae = e - a
bc = c - b
bd = d - b
be = e - b
cd = d - c
ce = e - c
de = e - d
if ab <= k and ac <= k and ad <= k and ae <= k and bc <= k and bd <= k and be <= k and cd <= k and ce <= k and de <= k:
print('Yay!')
else:
print(':(') | N = 5
a2e = [int(eval(input())) for _ in range(N)]
k = int(eval(input()))
for i in range(N):
for j in range(N):
if k < abs(a2e[i] - a2e[j]):
print(':(')
exit()
print('Yay!')
| p03075 |
import itertools
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
combs = itertools.combinations([a, b, c, d, e], 2)
can_connects = [abs(x[0] - x[1]) <= k for x in combs]
if all(can_connects):
print('Yay!')
else:
print(':(')
| import itertools
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
# a<b<c<d<e を利用
max_distance = e - a
if max_distance <= k:
print('Yay!')
else:
print(':(')
# 全組み合わせの探索
# combs = itertools.combinations([a, b, c, d, e], 2)
#
# can_connects = [abs(x[0] - x[1]) <= k for x in combs]
#
# if all(can_connects):
# print('Yay!')
# else:
# print(':(')
| p03075 |
a = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
if max(a)-min(a) > k:
print(':(')
else:
print('Yay!') | IN = [int(eval(input())) for _ in range(6)]
if IN[4] - IN[0] > IN[5]:
print(':(')
else:
print('Yay!')
| p03075 |
v = []
e = ''
for i in range(6):
v.append(int(eval(input())))
for i in range(len(v)) :
for j in range(i+1, len(v)):
if(abs(v[i] - v[j]) > v[-1]):
e = ':('
if e != '':
print(e)
else:
print('Yay!')
| a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
sub=[]
sub.append(b-a)
sub.append(c-a)
sub.append(d-a)
sub.append(e-a)
sub.append(c-b)
sub.append(d-b)
sub.append(e-b)
sub.append(d-c)
sub.append(e-c)
sub.append(e-d)
max=max(sub)
if max<=k:
print('Yay!')
else:
print(':(') | p03075 |
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
print(("Yay!" if e-a<=k else ":(")) | a = [int(eval(input())) for i in range(6)]
print(('Yay!' if a[4]-a[0] <= a[5] else ":(")) | p03075 |
# -*- coding: utf-8 -*-
l = []
for i in range(5):
b = int(eval(input()))
l.append(b)
k = int(eval(input()))
a = []
for i in range(4):
for j in range(i+1,5):
ans = l[j]-l[i]
a.append(ans)
b = 0
for i in range(10):
if a[i]>k:
b = 1
break
if b == 1:
print(':(')
elif b == 0:
print('Yay!') | # -*- coding: utf-8 -*-
L = []
for i in range(5):
a = int(eval(input()))
L.append(a)
K = int(eval(input()))
if L[4]-L[0]<=K:
ans = 'Yay!'
else:
ans = ':('
print(ans) | p03075 |
antenna = [int(eval(input())) for i in range(5)]
k = int(eval(input()))
judge = ''
i,j = 1,1
for i in range(5):
for j in range(i+1,5):
if abs(antenna[i]-antenna[j]) > k:
judge = ':('
break
if judge==':(':
print(':(')
else:
print('Yay!') | antenna = []
for i in range(5):
antenna.append(int(eval(input())))
K = int(eval(input()))
d = True
for i in range(5):
if d:
for j in range(i,5):
if antenna[j]-antenna[i] > K:
print(':(')
d = False
break
if d:
print('Yay!') | p03075 |
e = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
bl = True
for ee1 in e:
for ee2 in e:
if abs(ee1 - ee2) > k:
bl = False
break
if not bl:
break
print(('Yay!' if bl else ':('))
| v = [int(eval(input())) for _ in range(5)]
k = int(eval(input()))
bl = max(v) - min(v) <= k
print(('Yay!' if bl else ':('))
| p03075 |
num_a = 5
antennas = [int(eval(input())) for _ in range(num_a)]
k = int(eval(input()))
exist = False
for q in range(num_a - 1, 0, -1):
for p in range(q - 1, -1, -1):
if antennas[q] - antennas[p] > k:
exist = True
break
if exist:
print(":(")
else:
print("Yay!")
| N = 5
inputs = [int(eval(input())) for _ in range(N)]
k = int(eval(input()))
print((":(" if inputs[N-1] - inputs[0] > k else "Yay!"))
| p03075 |
*A, k = [int(eval(input())) for _ in range(6)]
for ai in A:
for aj in A:
if abs(aj - ai) > k:
print(":(")
quit()
print("Yay!") | *A, k = [int(eval(input())) for _ in range(6)]
if abs(A[0] - A[-1]) > k:
print(":(")
else:
print("Yay!")
| p03075 |
import itertools
import math
import fractions
import functools
import copy
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if b-a > k or c-a > k or d-a > k or e-a > k or c-b > k or d-b > k or e-b > k or d-c > k or e-c > k or e-d > k:
print(":(")
else:
print("Yay!")
| def main():
# n = int(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()))
e = int(eval(input()))
k = int(eval(input()))
if abs(a-b)>k or abs(a-c)>k or abs(a-d)>k or abs(a-e)>k or abs(b-c)>k or abs(b-d)>k or abs(b-e)>k or abs(c-d)>k or abs(c-e)>k or abs(d-e)>k:
print(":(")
else:
print("Yay!")
if __name__ == '__main__':
main()
| p03075 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
li = [a, b, c, d, e]
for i in range(5):
for j in range(5):
if i == j:
continue
if abs(li[j] - li[i]) > k:
print(":(")
exit()
print("Yay!")
| *a, k = list(map(int, open(0).read().split()))
for i in range(5):
for j in range(5):
if i == j:
continue
if abs(a[j] - a[i]) > k:
print(":(")
exit()
print("Yay!")
| p03075 |
import sys
args = [int(eval(input())) for i in range(6)]
for arg1 in args[:5]:
for arg2 in args[1:5]:
if (arg2 - arg1) > args[5]:
print(":(")
sys.exit()
print("Yay!") | import sys
args = [int(eval(input())) for i in range(6)]
if (args[4] - args[0]) > args[5]:
print(":(")
sys.exit()
print("Yay!") | p03075 |
input0 = int(eval(input()))
input1 = int(eval(input()))
input2 = int(eval(input()))
input3 = int(eval(input()))
input4 = int(eval(input()))
K = int(eval(input()))
list = (input0,input1,input2,input3,input4)
max = max(list)
min = min(list)
fig = max - min
if fig <= K :
print ("Yay!")
else :
print (":(") | a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
x =[a,b,c,d,e]
x.sort()
if x[4] - x[0] <= k:
print("Yay!")
else:
print(":(")
| p03075 |
l = [int(eval(input())) for i in range(6)]
if l[4]-l[0]>l[5]:
print(":(")
else:
print("Yay!") | l = [int(eval(input())) for i in range(5)]
k = int(eval(input()))
if l[4] - l[0] > k:
print(":(")
else:
print("Yay!") | p03075 |
a = int(eval(input()))
b = int(eval(input()))
c = int(eval(input()))
d = int(eval(input()))
e = int(eval(input()))
k = int(eval(input()))
if e - a <= k:
print('Yay!')
else:
print(':(')
| p = -1
q = 124
for _ in range(5):
a = int(eval(input()))
p = max(p, a)
q = min(q, a)
k = int(eval(input()))
if p - q <= k:
print('Yay!')
else:
print(':(') | p03075 |
a = [int(eval(input()))for i in range(5)]
k = int(eval(input()))
cnt = 0
for i in a:
for j in a:
if abs(i-j) > k:
print(':(')
cnt += 1
break
else:
continue
break
if cnt == 0:
print('Yay!') | a = [int(eval(input()))for i in range(5)]
k = int(eval(input()))
if a[-1] - a[0] > k:
print(':(')
else:
print('Yay!') | p03075 |
a=int(eval(input()))
b=int(eval(input()))
c=int(eval(input()))
d=int(eval(input()))
e=int(eval(input()))
k=int(eval(input()))
if k< b-a:
print(":(")
elif k< c-a:
print(":(")
elif k< d-a:
print(":(")
elif k< e-a:
print(":(")
elif k< c-b:
print(":(")
elif k< d-b:
print(":(")
elif k< e-b:
print(":(")
elif k< d-c:
print(":(")
elif k< e-c:
print(":(")
elif k< e-d:
print(":(")
else:
print("Yay!") | a=[int(eval(input())) for _ in range(5)];k=int(eval(input()));print((':(' if max(a)-min(a)>k else 'Yay!')) | p03075 |
mod=10**9+7
def mul(a,b):
x,y=a,b
return (x*y)%mod
H,W,K=list(map(int,input().split()))
mod=10**9+7
ans=0
const=1
for i in range(H+W-1,H+W-K,-1):
const=(const*i)%mod
inv=pow(H+W-1,mod-2,mod)
for i in range(K):
#ans+=(K-i)*(((H+W)*const)%mod)+(((K-i)*i*const)%mod)*((inv*2*H*W)%mod)
#ans%=mod
temp1=mul(mul(H+W,const),K-i)
ans=(ans+temp1)%mod
temp2=mul(inv,mul(2*H*W,mul(K-i,mul(i,const))))
ans=(ans+temp2)%mod
ans+=mul(K,mul(H+W,const))
ans%=mod
print(ans)
| mod=10**9+7
def mul(a,b):
x,y=a,b
return (x*y)%mod
H,W,K=list(map(int,input().split()))
mod=10**9+7
ans=0
const=1
for i in range(H+W-1,H+W-K,-1):
const=(const*i)%mod
inv=pow(H+W-1,mod-2,mod)
temp1=mul(H+W,mul((K*(K+1)//2)%mod,const))
const=mul(const,inv)
u=(K*(K**2-1))//6
u%=mod
temp2=mul(2*H*W,mul(u,const))
ans=(temp1+temp2)%mod
const=mul(const,H+W-1)
ans+=mul(K,mul(H+W,const))
ans%=mod
print(ans)
| p03154 |
mod=10**9+7
def mul(a,b):
x,y=a,b
return (x*y)%mod
H,W,K=list(map(int,input().split()))
mod=10**9+7
ans=0
const=1
for i in range(H+W-1,H+W-K,-1):
const=(const*i)%mod
inv=pow(H+W-1,mod-2,mod)
temp1=mul(H+W,mul((K*(K+1)//2)%mod,const))
const=mul(const,inv)
u=(K*(K**2-1))//6
u%=mod
temp2=mul(2*H*W,mul(u,const))
ans=(temp1+temp2)%mod
const=mul(const,H+W-1)
ans+=mul(K,mul(H+W,const))
ans%=mod
print(ans)
| H,W,K=list(map(int,input().split()));m=10**9+7;a,c=0,1;H+=W;mul=lambda x,y:(x*y)%m
for i in range(H-1,H-K,-1): c=c*i %m;
v=pow(H-1,m-2,m);temp1=mul(H,mul((K*(K+1)//2)%m,c));c=mul(c,v);u=((K*(K**2-1))//6)%m;temp2=mul(2*(H-W)*W,mul(u,c));c=mul(c,H-1);ans=mul(K,mul(H,c));ans=(ans+temp1+temp2)%m;print(ans) | p03154 |
R, G = (int(eval(input())) for i in range(2))
R += (G - R) * 2
print(R) | print((-int(eval(input())) + int(eval(input())) * 2)) | p03563 |
import sys
r, g = (int(x) for x in sys.stdin.read().split())
ans = g * 2 - r
print(ans) | import sys
r, g = list(map(int, sys.stdin.read().split()))
def main():
return g * 2 - r
if __name__ == '__main__':
ans = main()
print(ans) | p03563 |
r = int(eval(input()))
g = int(eval(input()))
print((2*g - r)) | def main():
R = int(eval(input()))
G = int(eval(input()))
print((2*G - R))
if __name__ == '__main__':
main()
| p03563 |
print((-int(eval(input())) + int(eval(input())) * 2))
| current_rating = int(eval(input()))
final_rating = int(eval(input()))
performance = final_rating * 2 - current_rating
print(performance) | p03563 |
print((-int(eval(input()))+2*int(eval(input())))) | r=int(eval(input()))
g=int(eval(input()))
print((2*g-r)) | p03563 |
r = int(eval(input()))
g = int(eval(input()))
print((g*2 - r)) | r, g = list(map(int, [eval(input()) for _ in range(2)]))
print((g*2 - r)) | p03563 |
r = int(eval(input()))
g = int(eval(input()))
print((g * 2 - r)) | r = int(eval(input()))
g = int(eval(input()))
print((2 * g - r)) | p03563 |
#A:
R = int(eval(input()))
G = int(eval(input()))
print((2*G-R))
| R = int(eval(input()))
G = int(eval(input()))
print((G*2 - R)) | p03563 |
import sys
for s in sys.stdin:
n,w,h=list(map(float, s.split(",")))
bmi=w/h/h
if bmi>=25: print(int(n)) | import sys
for s in sys.stdin:
n,w,h=s.split(",")
n,w,h=int(n),float(w),float(h)
bmi=w/h/h
if bmi>=25: print(n) | p00075 |
import sys
import math
N = int(sys.stdin.readline().strip())
ratios = []
for _ in range(N):
t, a = list(map(int, sys.stdin.readline().strip().split()))
ratios.append((t, a))
ans = 0
for i in range(N-1):
t1, a1 = ratios[i]
t2, a2 = ratios[i+1]
# math.ceilが直球だが、精度が悪い？
# rate = max(math.ceil(t1 / t2), math.ceil(a1 / a2))
rate = max((t1 - 1) // t2, (a1 - 1) // a2) + 1
ratios[i+1] = (t2 * rate, a2 * rate)
print((sum(ratios[N-1]))) | import sys
input = sys.stdin.readline
N = int(eval(input()))
rates = []
for _ in range(N):
t, a = list(map(int, input().split()))
rates.append((t, a))
ans = 0
for i in range(N-1):
t1, a1 = rates[i]
t2, a2 = rates[i+1]
rate = max((t1 - 1) // t2, (a1 - 1) // a2) + 1
rates[i+1] = (t2 * rate, a2 * rate)
print((sum(rates[N-1]))) | p03966 |
from fractions import Fraction
import math
N = int(eval(input()))
TA = [tuple(map(int, input().split())) for _ in range(N)]
"""
・Ti, Ai を i回目の二人の得票数の比
・Pti, Pai をi回目の二人の得票数とすると、
Pti : Pai = Ti : Ai なので、 Pti = M * Ti, Pai = M * Ai (M=1,2,3,...)と表せる。
とあらわせる。ここで、
Pti-1 <= Pti
Pai-1 <= Pai
なので、Mは
M >= Pti-1 / Ti
M >= Pai-1 / Ai
の両方を満たすものになり、得票数を最小に保つにはMもなるべく小さくとる
"""
t,a = 0,0
for i in range(N):
if i == 0:
t,a = TA[i][0], TA[i][1]
else:
M = math.ceil(max(Fraction(t , TA[i][0]), Fraction(a , TA[i][1])))
t = M * TA[i][0]
a = M * TA[i][1]
print((t+a)) |
from fractions import Fraction
import math
N = int(eval(input()))
TA = [tuple(map(int, input().split())) for _ in range(N)]
"""
Ti : Ai = t : a の時、整数xを使って、i回目のそれぞれの得票数を、t * x, a * x と表せる。
なので、一回前のそれぞれの得票数がわかっている場合、xの範囲がわかるので、xが最小になるように更新していく
"""
T = 0
A = 0
for i,(t,a) in enumerate(TA):
if i == 0:
T = t
A = a
else:
x = math.ceil(max(Fraction(T, t), Fraction(A, a)))
T = t * x
A = a * x
print((T+A)) | p03966 |
N = int(eval(input()))
A = 1
B = 1
for _ in range(N):
a, b = list(map(int, input().split()))
if a == b:
A = max(A, B)
B = max(A, B)
elif a < b:
if A%a == 0:
pass
else:
A = (A//a+1)*a
while (A//a)*b < B:
A += a
B = (A//a)*b
else:
if B%b == 0:
pass
else:
B = (B//b+1)*b
while (B//b)*a < A:
B += b
A = (B//b)*a
print((A+B))
| N = int(eval(input()))
A = 1
B = 1
for _ in range(N):
a, b = list(map(int, input().split()))
if a == b:
A = max(A, B)
B = max(A, B)
else:
if A%a == 0:
aa = A//a
else:
aa = A//a + 1
if B%b == 0:
bb = B//b
else:
bb = B//b + 1
tmp = max(aa, bb)
A = tmp*a
B = tmp*b
print((A+B))
| p03966 |
# -*- coding: utf-8 -*-
import math
N=int(input())
a_num = 1
b_num = 1
for i in range(N):
ratio_a, ratio_b = list(map(int,input().split()))
base_n = min(math.floor(a_num / ratio_a), math.floor(b_num / ratio_b))
while a_num > ratio_a * base_n or b_num > ratio_b * base_n:
base_n += 1
a_num = ratio_a * base_n
b_num = ratio_b * base_n
print(int(a_num + b_num)) | # -*- coding: utf-8 -*-
N=int(input())
a_num = 1
b_num = 1
for i in range(N):
ratio_a, ratio_b = list(map(int,input().split()))
base_n = max( (a_num - 1) // ratio_a + 1 , (b_num - 1 ) // ratio_b + 1)
a_num = ratio_a * base_n
b_num = ratio_b * base_n
print(int(a_num + b_num)) | p03966 |
N = int(eval(input()))
T = []
A = []
for i in range(N):
t, a = list(map(int, input().split()))
T.append(t)
A.append(a)
v1 = T[0]
v2 = A[0]
for i in range(1, N):
n = 1
if v1<=T[i] and v2<=A[i]:
v1 = T[i]
v2 = A[i]
else:
while v1>n*T[i] or v2>n*A[i]:
n += 1
v1 = T[i]*n
v2 = A[i]*n
print((v1+v2)) | N = int(eval(input()))
T = []
A = []
for i in range(N):
t, a = list(map(int, input().split()))
T.append(t)
A.append(a)
v1 = 1
v2 = 1
for i in range(N):
n = max((v1+T[i]-1)//T[i],(v2+A[i]-1)//A[i])
v1 = T[i]*n
v2 = A[i]*n
print((v1+v2))
| p03966 |
n = int(eval(input()))
t,a = list(map(int,input().split()))
nowt = t
nowa = a
for i in range(n-1):
t , a = list(map(int,input().split()))
kou = 1
while True:
if t*kou >= nowt and a*kou >= nowa:
break
else:
kou += 1
nowt = t*kou
nowa = a*kou
print((nowt+nowa)) | n = int(eval(input()))
t,a = list(map(int,input().split()))
nowt = t
nowa = a
for i in range(n-1):
t , a = list(map(int,input().split()))
kou = max(nowt//t,nowa//a)
while True:
if t*kou >= nowt and a*kou >= nowa:
break
else:
kou += 1
nowt = t*kou
nowa = a*kou
print((nowt+nowa)) | p03966 |
N = int(eval(input()))
T = [0]*N
A = [0]*N
for i in range(N):
T[i],A[i] = list(map(int,input().split()))
def aa(a,t,na,nt):
c = 1
while not(a<=na*c and t<=nt*c):
c += 1
return (na*c,nt*c)
t = T[0]
a = A[0]
for i in range(N):
a,t = aa(a,t,A[i],T[i])
print((t+a))
| N = int(eval(input()))
T = [0]*N
A = [0]*N
for i in range(N):
T[i],A[i] = list(map(int,input().split()))
def aa(a,t,na,nt):
c = max( (1+(a-1)//na,1+(t-1)//nt) )
return (na*c,nt*c)
t = T[0]
a = A[0]
for i in range(N):
a,t = aa(a,t,A[i],T[i])
print((t+a))
| p03966 |
n=int(eval(input()))
ta=[]
t=0
a=0
ans=[[0,0]]
for i in range(n):
p=[int(j) for j in input().split()]
t=max(t,p[0])
a=max(a,p[1])
i,j=1,1
while True:
if p[0]*i>=t and p[1]*j>=a and p[0]*i>=ans[-1][0] and p[1]*j>=ans[-1][1]:
ans.append([p[0]*i,p[1]*j])
break
i+=1
j+=1
print((sum(ans[-1]))) | n=int(eval(input()))
ta=[]
t=0
a=0
ans=[[1,1]]
for i in range(n):
p=[int(j) for j in input().split()]
i=max(ans[-1][0]//p[0],ans[-1][1]//p[1])
while True:
if p[0]*i>=ans[-1][0] and p[1]*i>=ans[-1][1]:
ans.append([p[0]*i,p[1]*i])
break
i+=1
print((sum(ans[-1]))) | p03966 |
#!/usr/bin/env python3
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
ta = [list(map(int, input().split())) for _ in range(n)]
ans = sum(ta[0])
for i in range(1, n):
si1 = sum(ta[i - 1])
si = sum(ta[i])
tmp = si
while tmp * ta[i][0] // si < ans * ta[i - 1][0] // si1 or tmp * ta[i][1] // si < ans * ta[i - 1][1] // si1:
tmp += si
ans = tmp
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| #!/usr/bin/env python3
from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
ta = [list(map(int, input().split())) for _ in range(n)]
ans = sum(ta[0])
for i in range(1, n):
si1 = sum(ta[i - 1])
si = sum(ta[i])
cand1 = (ans * ta[i - 1][0] // si1) // ta[i][0] if (ans * ta[i - 1][0] // si1) % ta[i][0] == 0 else (ans * ta[i - 1][0] // si1) // ta[i][0] + 1
cand2 = (ans * ta[i - 1][1] // si1) // ta[i][1] if (ans * ta[i - 1][1] // si1) % ta[i][1] == 0 else (ans * ta[i - 1][1] // si1) // ta[i][1] + 1
ans = si * max([cand1, cand2])
print(ans)
if __name__ == "__main__":
setrecursionlimit(10000)
main()
| p03966 |
N = int(eval(input()))
tNow = 1
aNow = 1
for i in range(N) :
t, a = list(map(int, input().split()))
n = 1
while n * t < tNow or n * a < aNow :
n += 1
tNow = n * t
aNow = n * a
print((tNow + aNow)) | N = int(eval(input()))
tNow = 1
aNow = 1
for i in range(N) :
t, a = list(map(int, input().split()))
n = max(-(-tNow // t), -(-aNow // a))
tNow = n * t
aNow = n * a
print((tNow + aNow)) | p03966 |
N = int(eval(input()))
T = []
A = []
for _ in range(N):
t, a = list(map(int,input().split()))
T.append(t)
A.append(a)
ct = T[0]
ca = A[0]
for i in range(1, N):
t = T[i]
a = A[i]
m = 1
while (t + a) * m < (ct + ca) or m * t < ct or m * a < ca:
m += 1
ct = m * t
ca = m * a
print((ct+ca))
| N = int(eval(input()))
T = []
A = []
for _ in range(N):
t, a = list(map(int,input().split()))
T.append(t)
A.append(a)
ans = 1
ct = 1
ca = 1
for t, a in zip(T, A):
n = max((ct + t - 1) // t, (ca + a - 1) // a)
ct = n * t
ca = n * a
print((ct+ca))
| p03966 |
n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
x = ab[0][0]
y = ab[0][1]
j = 1
flg = True
for i in range(1,n):
xx = ab[i][0]
yy = ab[i][1]
while flg:
if x> j*xx or y > j*yy:
j +=1
else:
x = xx *j
y = yy *j
break
j = 1
print((x+y)) | n = int(eval(input()))
ab = [list(map(int, input().split())) for _ in range(n)]
x = ab[0][0]
y = ab[0][1]
j = 1
flg = True
for i in range(1,n):
xx = ab[i][0]
yy = ab[i][1]
j = max(x//xx,y//yy)
while flg:
if x> j*xx or y > j*yy:
j +=1
else:
x = xx *j
y = yy *j
break
print((x+y)) | p03966 |
a = int(eval(input()))
b = [list(map(int, input().split()))for _ in range(a)]
c = []
for i in range(len(b)):
c.append(b[i].copy())
if len(c) != 1:
while True:
if c[i][0] < c[i-1][0] or c[i][1] < c[i-1][1]:
c[i][0] = c[i][0] + b[i][0]
c[i][1] = c[i][1] + b[i][1]
else:
break
print((c[len(c)-1][0] + c[len(c)-1][1]))
| a = int(eval(input()))
b = [list(map(int, input().split()))for _ in range(a)]
c = []
for i in range(len(b)):
c.append(b[i].copy())
if len(c) != 1:
while True:
if c[i][0] < c[i-1][0] or c[i][1] < c[i-1][1]:
c[i][0] = b[i][0] * max((c[i-1][0] + b[i][0] - 1) // b[i][0], (c[i-1][1] + b[i][1] - 1) // b[i][1])
c[i][1] = b[i][1] * max((c[i-1][0] + b[i][0] - 1) // b[i][0], (c[i-1][1] + b[i][1] - 1) // b[i][1])
else:
break
print((c[len(c)-1][0] + c[len(c)-1][1]))
| p03966 |
a = int(eval(input()))
d = e = 0
for i in range(a):
b, c = list(map(int, input().split()))
if i == 0:
d = b
e = c
else:
f = b
g = c
while True:
if d <= f and e <= g:
d = f
e = g
break
else:
f += b
g += c
print((d + e))
| a = int(eval(input()))
d = e = 0
for i in range(a):
b, c = list(map(int, input().split()))
if i == 0:
d = b
e = c
else:
if d <= b and e <= c:
d = b
e = c
else:
h = max((b + d - 1) // b, (c + e - 1) // c)
d = b * h
e = c * h
print((d + e))
| p03966 |
n=int(eval(input()))
l =1
r=1
for _ in range(n):
t,a=list(map(int,input().split()))
l = (l+t-1)//t*t
r = (r+a-1)//a*a
l = max(l,r//a*t)
r = max(r,l//t*a)
print((r+l)) | l,r=1,1
for _ in range(int(eval(input()))):
k,t=list(map(int,input().split()))
gen = max((l+k-1)//k,(r+t-1)//t)
l,r=gen*k,gen*t
print((l+r)) | p03966 |
#!usr/bin/env python3
from collections import defaultdict
import math
def LI(): return list(map(int, input().split()))
def II(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007
#A
"""
a,b = LS()
c = int(a+b)
for i in range(1,1000):
if i * i == c:
print("Yes")
quit()
print("No")
"""
#B
"""
a,b = LI()
if a*b <= 0:
print("Zero")
else:
if b < 0:
if (a-b) %2 == 1:
print("Positive")
else:
print("Negative")
else:
print("Positive")
"""
#C
"""
n = II()
s = SR(n)
march = [[] for i in range(5)]
ch = list("MARCH")
for i in s:
for j in range(5):
if i[0] == ch[j]:
march[j].append(i)
ans = 0
for i in range(5):
for j in range(i):
for k in range(j):
if len(march[i])*len(march[j])*len(march[k]) == 0:
break
ans += len(march[i])*len(march[j])*len(march[k])
print(ans)
"""
#D
"""
n = II()
d = LIR(n)
q = II()
p = IIR(q)
d.insert(0,[0 for i in range(n+1)])
for i in range(n):
d[i+1].insert(0,0)
for i in range(n):
for j in range(n):
d[i+1][j+1] += d[i+1][j]+d[i][j+1]-d[i][j]
ans = [0 for i in range(n**2+1)]
for a in range(n+1):
for b in range(n+1):
for c in range(a):
for e in range(b):
ans[(a-c)*(b-e)] = max(ans[(a-c)*(b-e)],d[a][b]-d[c][b]-d[a][e]+d[c][e])
for i in p:
an = 0
for a in range(i+1):
an = max(an, ans[a])
print(an)
"""
#E
"""
s = list(S())
ans = -1
s.insert(0,0)
d = 0
for i in range(1,len(s)):
if s[i] != d:
d = s[i]
ans += 1
print(ans)
"""
#F
n = II()
x,y = LI()
for _ in range(n-1):
a,b = LI()
if a == b:
x = max(x,y)
y = x
else:
i = min(x//a,y//b)
while 1:
if a*i >= x and b*i >= y:break
i += 1
x = a*i
y = b*i
print((x+y))
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| #!usr/bin/env python3
from collections import defaultdict
import math
def LI(): return list(map(int, input().split()))
def II(): return int(eval(input()))
def LS(): return input().split()
def S(): return eval(input())
def IIR(n): return [II() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
mod = 1000000007
#A
"""
a,b = LS()
c = int(a+b)
for i in range(1,1000):
if i * i == c:
print("Yes")
quit()
print("No")
"""
#B
"""
a,b = LI()
if a*b <= 0:
print("Zero")
else:
if b < 0:
if (a-b) %2 == 1:
print("Positive")
else:
print("Negative")
else:
print("Positive")
"""
#C
"""
n = II()
s = SR(n)
march = [[] for i in range(5)]
ch = list("MARCH")
for i in s:
for j in range(5):
if i[0] == ch[j]:
march[j].append(i)
ans = 0
for i in range(5):
for j in range(i):
for k in range(j):
if len(march[i])*len(march[j])*len(march[k]) == 0:
break
ans += len(march[i])*len(march[j])*len(march[k])
print(ans)
"""
#D
"""
n = II()
d = LIR(n)
q = II()
p = IIR(q)
d.insert(0,[0 for i in range(n+1)])
for i in range(n):
d[i+1].insert(0,0)
for i in range(n):
for j in range(n):
d[i+1][j+1] += d[i+1][j]+d[i][j+1]-d[i][j]
ans = [0 for i in range(n**2+1)]
for a in range(n+1):
for b in range(n+1):
for c in range(a):
for e in range(b):
ans[(a-c)*(b-e)] = max(ans[(a-c)*(b-e)],d[a][b]-d[c][b]-d[a][e]+d[c][e])
for i in p:
an = 0
for a in range(i+1):
an = max(an, ans[a])
print(an)
"""
#E
"""
s = list(S())
ans = -1
s.insert(0,0)
d = 0
for i in range(1,len(s)):
if s[i] != d:
d = s[i]
ans += 1
print(ans)
"""
#F
n = II()
x,y = LI()
for _ in range(n-1):
a,b = LI()
if a == b:
x = max(x,y)
y = x
else:
i = max(x//a,y//b)
while 1:
if a*i >= x and b*i >= y:break
i += 1
x = a*i
y = b*i
print((x+y))
#G
#H
#I
#J
#K
#L
#M
#N
#O
#P
#Q
#R
#S
#T
| p03966 |
taka, aoki = 1, 1
for _ in range(int(eval(input()))):
a, b = list(map(int, input().split()))
ratio = max(taka//a + [0, 1][taka%a != 0], aoki//b + [0, 1][aoki%b != 0])
taka = a * ratio
aoki = b * ratio
print((taka + aoki)) | taka, aoki = 1, 1
for _ in range(int(eval(input()))):
a, b = list(map(int, input().split()))
ratio = max(-(-taka//a), -(-aoki//b))
taka = ratio * a
aoki = ratio * b
print((taka + aoki)) | p03966 |
T,A=1,1
for _ in range(int(eval(input()))):
a,b=list(map(int,input().split()))
r=max(-(-T//a),-(-A//b))
T,A=r*a,r*b
print((T+A)) | T,A=1,1
for _ in range(int(eval(input()))):
a,b=list(map(int,input().split()))
r=max(-(-T//a),-(-A//b))
T=r*a
A=r*b
print((T+A)) | p03966 |
import math
N = int(eval(input()))
T,A = list(map(int, input().split()))
rlt = T+A
for _ in range(N-1):
t,a = list(map(int, input().split()))
i = math.ceil(rlt/(t+a))
while i*t < T or i*a < A:
i += 1
T = i*t
A = i*a
print((T+A)) | import math
N = int(eval(input()))
T,A = list(map(int, input().split()))
for _ in range(N-1):
t,a = list(map(int, input().split()))
if T % t == 0:
i = T // t
else:
i = T // t + 1
if A % a == 0:
j = A // a
else:
j = A // a + 1
k = max(i,j)
T = k*t
A = k*a
print((T+A)) | p03966 |
import math
N = int(eval(input()))
T,A = 1,1
for _ in range(N):
t,a = list(map(int,input().split()))
k1 = T//t
if T%t>0:
k1 += 1
k2 = A//a
if A%a>0:
k2 += 1
k = max(k1,k2)
T = k*t
A = k*a
print((T+A)) | N = int(eval(input()))
T,A = 1,1
for _ in range(N):
t,a = list(map(int,input().split()))
k1 = (T+t-1)//t
k2 = (A+a-1)//a
k = max(k1,k2)
T = k*t
A = k*a
print((T+A)) | p03966 |
n=int(eval(input()))
x,y=1,1
for _ in range(n):
t,a=list(map(int,input().split()))
if t>a:
for i in range(x-x%t,x*1000+1,t):
if i>=x and i//t*a>=y:break
x,y=i,i//t*a
else:
for i in range(y-y%a,y*1000+1,a):
if i>=y and i//a*t>=x:break
x,y=i//a*t,i
print((x+y)) | n=int(eval(input()))
x,y=1,1
for _ in range(n):
t,a=list(map(int,input().split()))
m=max((x+t-1)//t,(y+a-1)//a)
x,y=m*t,m*a
print((x+y)) | p03966 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
tt = ta = 0
for i in range(n):
t, a = list(map(int, input().rstrip('\n').split()))
if i == 0:
tt = t
ta = a
else:
r = max((tt + t - 1) // t, (ta + a - 1) // a)
tt = t * r
ta = a * r
print((tt + ta))
if __name__ == '__main__':
solve()
| import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
ta = tb = 1
for i in range(n):
a, b = list(map(int, input().rstrip('\n').split()))
r = max((a + ta - 1) // a, (b + tb - 1) // b)
ta = a * r
tb = b * r
print((ta + tb))
if __name__ == '__main__':
solve()
| p03966 |
n = int(eval(input()))
T = A = 1
for _ in range(n):
t, a = list(map(int, input().split()))
total = T+A
x = -(-total//(a+t))
x = max(x, -(-T//t))
x = max(x, -(-A//a))
T = t*x
A = a*x
print((T+A)) | n = int(eval(input()))
T = A = 1
for _ in range(n):
t, a = list(map(int, input().split()))
x = max(-(-T//t), -(-A//a))
T = t*x
A = a*x
print((T+A))
| p03966 |
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
N=int(eval(input()))
def gcd(a,b):
while b > 0:
a, b = b, a % b
return a
def lcm(a, b):
return a * b / gcd(a, b)
def func1(x, xi):
if x % xi == 0:
return x
else:
return xi * (x // xi) + xi
for i in range(N):
ti,ai = list(map(int,input().split()))
if i == 0:
t,a = ti,ai
else:
t,a = func1(t, ti),func1(a, ai)
# a is short
if ti / ai < t / a:
a = t // ti * ai
else:
t = a // ai * ti
# print("t,a=",t,a)
print((a+t))
| #!/usr/bin/env python3
# -*- coding: utf-8 -*-
# 解説に従い実装
N=int(eval(input()))
for i in range(N):
ti,ai = list(map(int,input().split()))
if i == 0:
t,a = ti,ai
else:
# t <= n * ti and a <= n * ai を満たす最小のnを求める
n = max((t + ti - 1) // ti, (a + ai - 1) // ai)
t = n * ti
a = n * ai
print((a+t))
| p03966 |
n = int(eval(input()))
ta = [list(map(int, input().split())) for x in range(n)]
def fit(a, b):
for i in range(1000, 1, -1):
if a%i == b%i == 0:
return a // i, b // i
return a, b
def to(a, b, limit):
cnt = 1
while True:
ac = a * cnt
bc = b * cnt
if limit[0] <= ac and limit[1] <= bc:
return ac, bc
cnt += 1
now = [1, 1]
for t, a in ta:
t, a = fit(t, a)
now = to(t, a, now)
print((sum(now)))
| n = int(eval(input()))
ta = [list(map(int, input().split())) for x in range(n)]
def fit(a, b):
for i in range(1000, 1, -1):
if a%i == b%i == 0:
return a // i, b // i
return a, b
def to(a, b, limit):
cnt = (limit[0] + a - 1) // a
ac = a * cnt
bc = b * cnt
if limit[0] <= ac and limit[1] <= bc:
return ac, bc
cnt = (limit[1] + b - 1) // b
ac = a * cnt
bc = b * cnt
if limit[0] <= ac and limit[1] <= bc:
return ac, bc
now = [1, 1]
for t, a in ta:
t, a = fit(t, a)
now = to(t, a, now)
print((sum(now)))
| p03966 |
N = int(eval(input()))
t = a = 0
for i in range(N):
T,A = list(map(int, input().split()))
for n in range(1,10**18):
if t <= T*n and a <= A*n:
t = T*n
a = A*n
break
print((t+a)) | N = int(eval(input()))
t = a = 1
for i in range(N):
T, A = list(map(int, input().split()))
tb = (t + T - 1) // T
ab = (a + A - 1) // A
b = max(tb, ab)
t = T * b
a = A * b
print((t+a)) | p03966 |
n=int(eval(input()))
th,ah=1,1
for i in range(n):
t,a=list(map(int,input().split()))
while 1:
if th*a>ah*t:ah+=1
elif th*a<ah*t:th+=1
elif th*a==ah*t:break
print((th+ah)) | n=int(eval(input()))
th,ah=1,1
for i in range(n):
t,a=list(map(int,input().split()))
n=max((th+t-1)//t,(ah+a-1)//a)
th,ah=n*t,n*a
print((th+ah)) | p03966 |
n = int(eval(input()))
ans_t, ans_a = list(map(int,input().split()))
for i in range(n-1):
t, a = list(map(int,input().split()))
now_t, now_a = t, a
q = True
while q:
if ans_t <= now_t and ans_a <= now_a:
q = False
ans_t = now_t
ans_a = now_a
else:
now_t += t
now_a += a
print((ans_a + ans_t)) | n = int(eval(input()))
ans_t, ans_a = list(map(int,input().split()))
for i in range(n-1):
t, a = list(map(int,input().split()))
if ans_t % t == 0:
p = ans_t//t
else:
p = ans_t//t + 1
if ans_a % a == 0:
q = ans_a // a
else:
q = ans_a// a + 1
r = max(p, q)
ans_a = a * r
ans_t = t * r
print((ans_a + ans_t)) | p03966 |
N = int(eval(input()))
TA = [[int(x) for x in input().split()]for _ in range(N)]
t = 1
a = 1
for i in TA:
j = 1
while(t>i[0]*j or a>i[1]*j):
j+=1
t = i[0]*j
a = i[1]*j
print((t+a))
| N = int(eval(input()))
TA = [[int(x) for x in input().split()]for _ in range(N)]
t = 1
a = 1
for i in TA:
j = max(t//i[0],a//i[1])
if(t>i[0]*j or a>i[1]*j):
j+=1
t = i[0]*j
a = i[1]*j
print((t+a))
| p03966 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.