input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
A, B = list(map(int, input().split(' ')))
for i in range(1, 1010):
if i * 8 // 100 == A and i * 10 // 100 == B:
print(i)
break
else:
print((-1)) | A, B = list(map(int, input().split(' ')))
for i in range(1, 1500):
if i * 8 // 100 == A and i * 10 // 100 == B:
print(i)
break
else:
print((-1)) | p02755 |
import math
a, b = list(map(int, input().split()))
for i in range(b+1,1001):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
ans = i
break
else:
ans = -1
print(ans) | a, b = list(map(int,input().split()))
if b * 10 <= (a * 25 + 24) // 2 and -(-a * 25 // 2) < (b + 1) * 10:
print((max(-(-a*25//2), b * 10)))
else:
print((-1)) | p02755 |
from math import floor
def main():
a, b = list(map(int, input().split()))
ans = -1
for i in range(10000):
if floor(i * 0.08) == a and floor(i * 0.1) == b:
ans = i
break
print(ans)
if __name__ == "__main__":
main() | from math import floor
def main():
a, b = list(map(int, input().split()))
ans = -1
for i in range(1, 1001):
if floor(i * 0.08) == a and floor(i * 0.1) == b:
ans = i
break
print(ans)
if __name__ == "__main__":
main() | p02755 |
import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
a,b=MI()
ans=-1
for i in range(10000):
aa=int(i*0.08)
bb=i//10
if a==... | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
ans=-1
A,B=MI()
for i in range(10000):
a=int(i*0.08)
b=int(i*0.1)
... | p02755 |
def main():
A, B = list(map(int, input().split()))
for x in range(10000):
if int(x * 0.08) == A and int(x * 0.1) == B:
print(x)
return
print((-1))
if __name__ == '__main__':
main()
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdi... | def main():
from math import ceil
A, B = list(map(int, input().split()))
la, ra = ceil(A * 12.5), ceil((A + 1) * 12.5)
lb, rb = B * 10, (B + 1) * 10
L, R = max(la, lb), min(ra, rb) # [L,R)
if L >= R:
print((-1))
return
print(L)
if __name__ == '__main_... | p02755 |
# -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))
n = 0
while n<11000:
n+=1
x1 = int(n * .08)
x2 = int(n * .1)
if A == x1 and B == x2:
print(n)
break
else:
print((-1)) | import math
A, B = list(map(int, input().split()))
n = 0
while n<11000:
n+=1
if A == math.floor(n*.08) and B == math.floor(n*.1):
print(n)
break
else:
print((-1)) | p02755 |
a, b = list(map(int, input().split()))
import math
aS = math.ceil(a / 0.08)
al = math.floor((a + 1) / 0.08)
bs = math.ceil(b / 0.10)
bl = math.floor((b + 1) / 0.10)
flag = True
for i in range(10000):
if aS <= i < al and bs <= i < bl:
print(i)
flag = False
break
if flag:
... | a, b = list(map(int, input().split()))
import math
flag = True
for i in range(1009):
if math.floor(i * 0.08) == a and math.floor(i * 0.10) == b:
print(i)
flag = False
break
if flag:
print((-1))
| p02755 |
import sys
import math
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
A, B = lr()
answer = -1
for x in range(1001):
if math.floor(x * 0.08) == A and math.floor(x * 0.1) == B:
answer = x
break
print(answer)
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
A, B = lr()
for x in range(1, 10001):
if x * 8 // 100 == A and x * 10 // 100 == B:
print(x); exit()
print((-1)) | p02755 |
# coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
A, B = lr()
for x in range(1, 10001):
if x * 8 // 100 == A and x * 10 // 100 == B:
print(x); exit()
print((-1)) | # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
A, B = lr()
mi8 = -(-A*25//2)
ma8 = -(-(A+1)*25//2)
mi10 = -(-B*10)
ma10 = -(-(B+1)*10)
mi = max(mi8, mi10)
ma = min(ma8, ma10)
if mi >= ma:
answer = -1
else:
... | p02755 |
a, b = list(map(int, input().split()))
ans = -1
for i in range(1300):
if int(i*0.08) == a and int(i*0.1) == b:
ans = i
break
print(ans) | a, b = list(map(int, input().split()))
ans = -1
for i in range(13,1250):
if int(i*0.08) == a and int(i*0.1) == b:
ans = i
break
print(ans) | p02755 |
A, B = list(map(int, input().split()))
for i in range(1,1001):
a = int(i*0.08)
b = int(i*0.1)
if A==a and B==b:
print(i)
break
else:
print((-1)) | A, B = list(map(int, input().split()))
for i in range(1,1001):
if A== int(i*0.08) and B== int(i*0.1):
print(i)
break
else:
print((-1)) | p02755 |
import math
A, B = list(map(int, input().split()))
for i in range(1,1010):
a, b = i*0.08, i*0.1
if math.floor(a) == A and math.floor(b) == B:
print(i)
break
if i == 1009:
print((-1)) | import math
A, B = list(map(int, input().split()))
b1 = B*10
b2 = b1 + 10
for i in range(b1, b2):
if math.floor(i*0.08) == A:
print(i)
break
if i == b2-1:
print((-1)) | p02755 |
from math import floor
A, B = list(map(int,input().split()))
for k in range(1,20000):
if floor(k*0.08) == A and floor(k*0.1) == B:
print(k)
exit(0)
print((-1))
| A, B = list(map(int,input().split()))
for k in range(1,20000):
if int(k*1.08) == A+k and int(k*1.10) == B+k:
print(k)
exit(0)
print((-1))
| p02755 |
import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buff... | import sys
import os
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buff... | p02755 |
A,B = list(map(int,input().split()))
x = -1
for i in range(1,20000):
if int(i*1.08)-i==A and int(i*1.1)-i==B:
x = i
break
print(x) | A,B = list(map(int,input().split()))
a1 = A/0.08
if a1!=int(A/0.08):
a1 = int(A/0.08)+1
else:
a1 = int(A/0.08)
a2 = (A+1)/0.08
if a2!=int((A+1)/0.08):
a2 = int((A+1)/0.08)+1
else:
a2 = int((A+1)/0.08)
b1 = B/0.1
if b1!=int(B/0.1):
b1 = int(B/0.1)+1
else:
b1 = int(B/0.1)
b2 = (B+1... | p02755 |
A,B = list(map(int,input().split()))
a1 = A/0.08
a2 = (A+1)/0.08
X = []
for i in range(13,1263):
if a1<=i<a2:
X.append(i)
b1 = B/0.1
b2 = (B+1)/0.1
x = -1
for y in X:
if b1<=y<b2:
x = y
break
print(x) | A,B = list(map(int,input().split()))
flag = 0
for i in range(1,1001):
if int(i*0.08)==A and int(i*0.1)==B:
ans = i
flag = 1
break
if flag==0:
print((-1))
else:
print(ans) | p02755 |
A,B=list(map(int,input().split()))
for i in range(20000):
if ((i*8)+0.000005)//100==A and ((i*10)+0.000005)//100==B:
print(i)
exit()
else:
pass
print((-1)) | A,B=list(map(int,input().split()))
for i in range(20000):
if (i*8)//100==A and (i*10)//100==B:
print(i)
exit()
else:
pass
print((-1)) | p02755 |
a,b = list(map(int,input().split()))
v = 1
while True:
if (v*0.08)//1 == a and (v*0.1)//1 == b:
ans = v
break
v += 1
if v > 10100:
ans = -1
break
print(ans)
| a,b = list(map(int,input().split()))
v = 1
for v in range(1,1010):
if (v*0.08)//1 == a and (v*0.1)//1 == b:
ans = v
break
else:
ans = -1
print(ans) | p02755 |
import math
A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 10001):
tax_8 = math.floor(i * 0.08)
tax_10 = math.floor(i * 0.10)
if tax_8 == A and tax_10 == B:
ans = i
break
print(ans) | A, B = list(map(int, input().split()))
for i in range(1, 10001):
if int(i * 1.08) - i == A and int(i * 1.1) - i == B:
print(i)
exit()
print((-1)) | p02755 |
A, B = list(map(int, input().split()))
for i in range(500000):
if int(i * 0.08) == A and int(i*0.10) == B:
print(i)
exit()
print((-1))
| A, B = list(map(int, input().split()))
for i in range(100000):
if int(i*0.08) == A and int(i*0.10) == B:
print(i)
exit()
print((-1))
| p02755 |
a,b=list(map(int,input().split()));print((([i for i in range(10**6)if(i//12.5==a)*i//10==b]+[-1])[0])) | a,b=list(map(int,input().split()));l=max(0--a*25//2,b*10);print((l*(-~a*25//2>l<-~b*10)or-1)) | p02755 |
a,b=list(map(int,input().split()));l=max(0--a*25//2,b*10);print((l*(-~a*25//2>l<-~b*10)or-1)) | a,b=list(map(int,input().split()));l=max(0--a*25//2,b*10);print((l*(~a*25//2<-l>~b*10)or-1)) | p02755 |
a,b=list(map(int,input().split()));l=max(0--a*25//2,b*10);print((l*(~a*25//2<-l>~b*10)or-1)) | a,b=list(map(int,input().split()));l=max(a*25+1>>1,b*10);print((l*(~a*25//2<-l>~b*10)or-1)) | p02755 |
A, B = list(map(int, input().split()))
for i in range(20000):
if int(i*0.08) == A and int(i * 0.1) == B:
print(i)
exit()
print((-1))
| A,B=list(map(int,input().split()))
for i in range(2000):
if A==i*8//100 and B==i*10//100:
print(i)
break
else:
print((-1))
| p02755 |
A, B = list(map(int, input().split()))
ans = -1
for i in range(10000):
if i * 8 // 100 == A:
if i * 10 // 100 == B:
ans = i
break
print(ans) | A, B = list(map(int, input().split()))
x = max((A*100+7)//8, B*100//10)
y = min((A+1)*100/8, (B+1)*100/10)
if x < y:
ans = x
else:
ans = -1
print(ans) | p02755 |
import math
a, b = list(map(int, input().split()))
for i in range(1001):
if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
print(i)
exit(0)
print((-1))
| import math
a, b = list(map(int, input().split()))
for i in range(1001):
if int(i*0.08) == a and int(i*0.1) == b:
print(i)
exit(0)
print((-1))
| p02755 |
a,b = list(map(int,input().split()))
c = -1
for i in range(20000):
if int(i*0.08) == a and int(i*0.1) == b :
c = i
break
print(c) | a,b = list(map(int,input().split()))
c = -1
for i in range(10000):
if int(i*0.08) == a and int(i*0.1) == b :
c = i
break
print(c) | p02755 |
A,B = list(map(int,input().split()))
for i in range(100000):
if int(i*0.08) == A and int(i*0.1) == B:
break
print((i if i != 99999 else -1))
| A,B = list(map(int,input().split()))
for i in range(10000):
if int(i*0.08) == A and int(i*0.1) == B:
print(i)
exit()
print((-1))
| p02755 |
import math
a,b = list(map(int,input().split()))
i = math.floor(a/0.08)
while i < 10001:
if math.floor(i*0.08) == a and math.floor(i*0.1) ==b:
print(i)
break
i += 1
else:
print((-1))
| a,b = list(map(int,input().split()))
for price in range(10000):
if price * 8 // 100 == a and price * 10//100 ==b:
print(price)
exit()
else:
print((-1)) | p02755 |
A, B = list(map(int, input().split()))
for i in range(100000):
if int(i*0.08)==A and int(i*0.1)==B:
print(i)
break
else:
print((-1)) | A, B = list(map(int, input().split()))
for i in range(10**4+100):
if int(i*0.08)==A and int(i*0.1)==B:
print(i)
break
else:
print((-1))
| p02755 |
#python3
from math import floor
def main():
a, b = list(map(int, input().split()))
for i in range(1, 1200):
x1 = floor(i*0.08)
x2 = floor(i*0.1)
if x1 == a and x2 == b:
print(i)
return
print('-1')
main()
| #python3
from math import ceil
def main():
a, b = list(map(int, input().split()))
a1 = 12.5*a
a2 = 12.5*(a+1)
b1 = 10*b
b2 = 10*(b+1)
if a2 <= b1:
print('-1')
return
if b2 <= a1:
print('-1')
return
ans = max(ceil(a1), b1)
print(ans)
ma... | p02755 |
def resolve():
a, b = list(map(int, input().split()))
j=-1
for i in range(1263):
c = i*0.08//1
d = i*0.1//1
if c==a and d==b:
j=i
break
print(j)
resolve() | def resolve():
a, b = list(map(int, input().split()))
for i in range(1300):
if int(i*0.08) == a and int(i*0.1) == b:
print(i)
exit()
print((-1))
resolve() | p02755 |
from math import floor
a, b = list(map(int, input().split()))
for i in range(1, 1000000):
if floor(i * 0.08) == a and floor(i * 0.1) == b:
print(i)
exit()
print((-1)) | # C - Tax Increase
# https://atcoder.jp/contests/abc158/tasks/abc158_c
a, b = list(map(int, input().split()))
for x in range(1, 100000):
if int(x * 0.08) == a and int(x * 0.1) == b:
print(x)
exit()
print((-1)) | p02755 |
# C - Tax Increase
# https://atcoder.jp/contests/abc158/tasks/abc158_c
a, b = list(map(int, input().split()))
for x in range(1, 100000):
if int(x * 0.08) == a and int(x * 0.1) == b:
print(x)
exit()
print((-1)) | a, b = list(map(int, input().split()))
for i in range(10001):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
exit()
print((-1)) | p02755 |
A, B = list(map(int, input().split()))
ans = -1
for x in range(10001):
if int(x*0.08) == A and int(x*0.1) == B:
ans = x
break
print(ans)
| A, B = list(map(int, input().split()))
ans = -1
for x in range(1010):
if int(x*0.08) == A and int(x*0.1) == B:
ans = x
break
print(ans)
| p02755 |
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# from fractions import Fraction
mod = int(1e9+7)
INF = 1<<29
def main():
a,b = list(map(int,input().split()))
ans = []
x = int(min(a//0.08,b//0.1))
y = int(max((a+... | import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# from fractions import Fraction
mod = int(1e9+7)
INF = 1<<29
def main():
a,b = list(map(int,input().split()))
ans = []
x = int(min(a//0.08,b//0.1))
y = int(max((a+... | p02755 |
import sys
# import math
# import decimal
# import queue
# import bisect
# import heapq
# import time
# import itertools
# from fractions import Fraction
mod = int(1e9+7)
INF = 1<<29
def main():
a,b = list(map(int,input().split()))
ans = []
x = int(min(a//0.08,b//0.1))
y = int(max((a+... | import sys
a,b = list(map(int,input().split()))
low = int(min(a//0.08,b//0.1))
high = int(max((a+1)//0.08,(b+1)//0.1))
for i in range(low,high+1):
if int(i*0.08)==a and int(i*0.1)==b:
print(i)
sys.exit()
print((-1)) | p02755 |
import math
A, B = list(map(int,input().split()))
cnt = 0
for i in range(1,100000):
X = math.floor(i * 0.08)
Y = math.floor(i * 0.1)
if A == X and B == Y:
print(i)
cnt += 1
break
if cnt == 0:
print((-1)) | A,B = list(map(int,input().split()))
import math
ans = -1
for i in range(10000):
if math.floor(i*0.08) == A and math.floor(i*0.1) == B:
ans=i
break
print(ans) | p02755 |
import math
def main():
A, B = list(map(int, input().split()))
# 条件を満たす可能性のある最小の正数を計算
x_min = max(math.ceil(A / 0.08), math.ceil(B / 0.1))
# 条件を満たす可能性のある最大の正数を計算
x_max = min((math.ceil((A + 1) / 0.08), math.ceil((B + 1) / 0.1)))
# 候補の正数を順番にチェックし、満たすものがあればそれを出力して終了
for x in rang... | from math import floor
# 入力値の取得
A, B = list(map(int, input().split()))
# 問題の制約から、答えの候補としてあり得る範囲をチェック
# for _ in range(1010)で０〜１００９までのループが使える
for price in range(1010):
if (floor(price * 0.08) == A) and (floor(price * 0.1) == B):
# 条件を満たしたのでその金額を表示して終了
# （小さい金額から順番にみていくので、最初に条件を満たしたものが、
... | p02755 |
import math
a, b= list(map(int, input().split()))
for n in range(1, 20000):
if math.floor(n*0.08) == a and math.floor(n*0.1) == b:
break
if n != 19999:
print(n)
else:
print((-1)) | import math
a, b= list(map(int, input().split()))
for n in range(1, 1010):
aa, bb = math.floor(n*0.08), math.floor(n*0.1)
if aa == a and bb == b:
print(n)
exit()
print((-1)) | p02755 |
import math
a,b = [int(x) for x in input().split()]
hati_s = a/0.08
hati_l = (a+1)/0.08
ten_s = b/0.1
ten_l = (b+1)/0.1
#print(hati_s,hati_l,ten_s,ten_l)
def intersec(a_min,a_max,b_min,b_max):
if a_min < b_min:
if a_max < b_min:
return [0,0]
else:
if... | import math
a,b = [int(x) for x in input().split()]
hati_s = a/0.08
hati_l = (a+1)/0.08
ten_s = b/0.1
ten_l = (b+1)/0.1
#print(hati_s,hati_l,ten_s,ten_l)
def intersec(a_min,a_max,b_min,b_max):
if a_min < b_min:
if a_max < b_min:
return [0,0]
else:
if... | p02755 |
#!/usr/bin/env python3
a, b = list(map(int, input().split()))
for i in range(10 ** 5):
if i * 8 // 100 == a and i // 10 == b:
print(i)
exit()
print((-1))
| #!/usr/bin/env python3
a, b = list(map(int, input().split()))
mn = max(100 * a, 80 * b)
mx = min(100 * a + 99, 80 * b + 72)
print(((mn + 7) // 8 if mn <= mx else -1))
| p02755 |
A,B=input().split()
A=int(A)
B=int(B)
price1_min=A/0.08
price1_max=(A+1)/0.08
price2_min=B/0.1
price2_max=(B+1)/0.1
if price2_min>=price1_max or price1_min>=price2_max:
print((-1))
else:
price=max(price1_min,price2_min)
if price==int(price):
print((int(price)))
else:
pr... | def tax(a, b):
for i in range(1,1010):
if int(i*0.08) == a and int(i*0.1) == b:
print(i)
return
print((-1))
return
a, b = list(map(int, input().strip().split()))
tax(a,b) | p02755 |
import math
A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 1000000):
if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
ans = i
break
print(ans) | import math
A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 100000):
if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
ans = i
break
print(ans) | p02755 |
A, B = list(map(int, input().split()))
for i in range(1, 10001):
if int(i*0.08) == A and int(i*0.1) == B:
print(i)
break
else:
print((-1)) | import sys
A,B = list(map(int,input().split()))
for i in range(1,1251):
C_8 = int(i*0.08)
C_10 = int(i*0.1)
if C_8 == A and C_10 == B:
print(i)
sys.exit()
print((-1)) | p02755 |
import math
A, B = list(map(int, input().split()))
minV = math.ceil(A / 0.08)
maxV = int((A + 1) / 0.08)
for i in range(minV, maxV):
if int(i * 0.1) == B:
print(i)
exit()
print((-1)) | import math
A, B = list(map(int, input().split()))
max = 1001 # これ以上の値は絶対に条件Bを満たさない。
for i in range(1, max):
if int(i * 0.08) == A and int(i * 0.1) == B:
print(i)
exit()
print((-1)) | p02755 |
A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 20001):
a = int(i * 1.08) - i
b = int(i * 1.1) - i
if A == a and B == b:
ans = i
break
print(ans)
| A, B= list(map(int, input().split()))
for i in range(1,1010):
if int(i*0.08)==A and int(i*0.1)==B:
print(i)
break
else:
print('-1')
| p02755 |
def main():
a, b = list(map(int, input().split()))
eight = [i for i in range(0, 2000) if a == int(i * 0.08)]
ten = [i for i in range(0, 2000) if b == int(i * 0.1)]
for i in eight:
for j in ten:
if i == j:
print(i)
return
print((-1))
i... | def main():
a, b = list(map(int, input().split()))
al = int(a / 0.08 + 0.5)
bl = int(b / 0.1)
au = al + 12 - a % 2
bu = bl + 9
if bu < al or au < bl:
print((-1))
else:
print((max(al, bl)))
if __name__ == '__main__':
main()
| p02755 |
import math
from decimal import *
A,B = list(map(int, input().split()))
ans = -1
for x in range(1, 50000):
a = math.floor(x * Decimal(0.08))
b = math.floor(x * Decimal(0.1))
if a == A and b == B:
ans = x
break
print(ans) | import math
from decimal import *
A,B = list(map(int, input().split()))
ans = -1
for x in range(1, 10001):
a = math.floor(x * Decimal(0.08))
b = math.floor(x * Decimal(0.1))
if a == A and b == B:
ans = x
break
print(ans) | p02755 |
def c_tax_increase():
A, B = [int(i) for i in input().split()]
for k in range(1, 10**6):
t1 = 8 * k // 100
t2 = k // 10
if t1 > 0 and t2 > 0 and t1 == A and t2 == B:
return k
return -1
print((c_tax_increase())) | def c_tax_increase():
from math import floor, ceil
A, B = [int(i) for i in input().split()]
lower = ceil(max(25 * A / 2, 10 * B))
upper = floor(min(25 * (A + 1) / 2, 10 * (B + 1)))
return lower if lower < upper else -1
print((c_tax_increase())) | p02755 |
# ABC158 C
a,b=list(map(int,input().split()))
# x=a*(100/8)
# y=b*(100/10)
# print(x,y)
# print(int(x),int(y))
# sx=x*((108-8)/100)
# sy=y*((110-10)/100)
# print(int(sx),int(sy))
for i in range(200000):
x,y=0.0,0.0
x=i*0.08
y=i*0.10
if a==int(x) and b==int(y):
print(i)
... | a,b=list(map(int,input().split()))
for i in range(1,10001):
tax_a=int(i*0.08)
tax_b=int(i*0.10)
if tax_a==a and tax_b==b:
print(i)
exit(0)
print((-1)) | p02755 |
import math
a, b = list(map(int, input().split()))
for i in range(1000000):
if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
print(i)
exit(0)
print((-1)) | import math
a, b = list(map(int, input().split()))
for i in range(1001):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
print(i)
exit(0)
print((-1)) | p02755 |
A, B = list(map(int,input().split()))
for i in range(10 ** 6 + 1):
if i * 8 // 100 == A and i // 10 == B:
print(i)
exit()
print("-1") | A, B = list(map(int, input().split()))
for ans in range(1, 1001):
tmp_A = ans * 8 // 100
tmp_B = ans // 10
if tmp_A == A and tmp_B == B:
print(ans)
exit()
print('-1') | p02755 |
a, b = list(map(int, input().split()))
pa = 0 - -a//0.08
pb = b/0.1
ref = max(pa, pb)
refmin = min(pa, pb)
ta = int(ref*0.08)
tb = int(ref*0.1)
flag = 0
for i in range(2000):
if i == 1999:
print((-1))
elif ta != a or tb != b and flag == 0:
ref -= 1
ta = int(ref*0.0... | a, b = list(map(int, input().split()))
for i in range(1100):
if i//12.5 == a and i//10 == b:
print(i)
exit()
print((-1)) | p02755 |
A, B = list(map(int, input().split()))
ans = -1
for x in range(100000):
a = int(x * 0.08)
b = int(x * 0.1)
if a == A and b == B:
ans = x
break
print(ans)
| A, B = list(map(int, input().split()))
for x in range(10000):
a = int(x * 0.08)
b = int(x * 0.1)
if a == A and b == B:
print(x)
exit()
print((-1)) | p02755 |
n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
l.sort(reverse=True)
x=0
for i in range(k):
x=x+l[i]
print(x)
| n,k=list(map(int,input().split()))
l=list(map(int,input().split()))
l=sorted(l,reverse=True)
print((sum(l[0:k])))
| p03658 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a=sorted(a)
b=sum(a)
for i in range(n-k):
b-=a[i]
print(b) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
a=sorted(a,reverse=True)
print((sum(a[:k]))) | p03658 |
N,K = list(map(int,input().split()))
l = list(map(int,input().split()))
k = sorted(l)
ans = 0
for i in range(K):
ans += k.pop()
print(ans)
|
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
l.sort(reverse = True)
ans = 0
for i in range(k):
ans += l[i]
print(ans)
| p03658 |
N,K = list(map(int, input().split()))
L = list(map(int, input().split()))
L.sort(reverse=True)
ans = 0
for i in range(K):
ans += L[i]
print(ans) | N, K = list(map(int, input().split()))
L = sorted(list(map(int, input().split())), reverse=True)
ans = 0
for i in range(K):
ans += L[i]
print(ans) | p03658 |
n,k=input().split()
print((sum(sorted(list(map(int,input().split())))[:-int(k)-1:-1]))) | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A = sorted(A, reverse = True)
ans = 0
for i in range(K):
ans += A[i]
print(ans) | p03658 |
N,K=list(map(int,input().split()))
l=list(map(int,input().split()))
from itertools import combinations
ans=0
for c in combinations(list(range(N)),K):
ans=max(ans,sum([l[i] for i in c]))
print(ans) | N,K=list(map(int,input().split()))
l=sorted(list(map(int,input().split())),reverse=True)
print((sum(l[:K]))) | p03658 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
print((sum(A[0:k])))
| n, k = list(map(int, input().split()))
L = list(map(int, input().split()))
L.sort(reverse=True)
print((sum(L[0:k])))
| p03658 |
# _*_ coding:utf-8 _*_
# Atcoder_Beginners_Contest067-B
# TODO https://atcoder.jp/contests/abc067/tasks/abc067_b
import time
from contextlib import contextmanager
# from time import sleep
@contextmanager
def timer(title):
t0 = time.time()
yield
print(("{} - done in {:.0f}s".format(title,time.time()-t0) )... | # Problem: https://atcoder.jp/contests/abc067/tasks/abc067_b
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): retu... | p03658 |
# Problem:
# Python 2nd Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): return list(map(int, sys.stdin.readline().split()))
... | # Problem: https://atcoder.jp/contests/abc067/tasks/abc067_b
# Python 3rd Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def LI(): retu... | p03658 |
N, K = list(map(int, input().split()))
l = [int(x) for x in input().split()]
l.sort(reverse=True)
print((sum(l[:K]))) | N, K = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort()
print((sum(l[-K:]))) | p03658 |
N, K = list(map(int, input().split()))
l = list(map(int, input().split()))
l = sorted(l)[::-1]
print((sum(l[0:K]))) | N, K =list(map(int, input().split()))
l = list(map(int, input().split()))
l = sorted(l)[::-1]
ans = 0
for i in range(K):
ans += l[i]
print(ans) | p03658 |
n, k = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort(reverse = True)
print((sum(l[:k]))) | n,k = list(map(int, input().split()))
ll = list(map(int, input().split()))
ll.sort()
print((sum(ll[len(ll)-k:]))) | p03658 |
N, K = list(map(int, input().split()))
L = list(map(int, input().split()))
L.sort(reverse=True)
print((sum(L[:K])))
| N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
print((sum(A[:K]))) | p03658 |
n,k = list(map(int, input().split()))
l = [int(i) for i in input().split()]
l.sort(reverse = True)
ans =0
for j in range(k):
ans += l[j]
print(ans) | n,k = list(map(int,input().split()))
l = [int(_) for _ in input().split()]
l.sort(reverse=True)
print((sum(l[:k]))) | p03658 |
# ABC 067 B - Snake Toy
n_k = list(map(int,input().split()))
li = list(map(int,input().split()))
n=n_k[0]
k=n_k[1]
toy = 0
li.sort(reverse=True)
for i in range(k):
toy += li[0]
li.pop(0)
print(toy)
| # 067 B
N,K= list(map(int,input().split()))
L=[int(j) for j in input().split()]
L.sort(reverse=True)
print((sum(L[0:K]))) | p03658 |
n,k = list(map(int,input().split()))
l = sorted(list(map(int,input().split())),reverse = True)
print((sum(l[:k]))) | n,k = list(map(int,input().split()))
print((sum(sorted(map(int,input().split()))[::-1][:k]))) | p03658 |
n,k=list(map(int,input().split()))
l=sorted([int(_) for _ in input().split()])[::-1]
print((sum(l[i] for i in range(0,k)))) | n,k=list(map(int,input().split()))
l=sorted([int(_) for _ in input().split()])
print((sum(l[-k:]))) | p03658 |
from itertools import groupby, accumulate, product, permutations, combinations
def solve():
N, K = list(map(int, input().split()))
L = list(map(int, input().split()))
ans = 0
for com in combinations(L,K):
cnt = 0
for c in com:
cnt += c
ans = max(ans,cnt)
return ans
print((solve())... | from itertools import groupby, accumulate, product, permutations, combinations
def solve():
N, K = list(map(int, input().split()))
L = list(map(int, input().split()))
L.sort(reverse=True)
ans = sum(L[:K])
return ans
print((solve())) | p03658 |
_,k,*l=list(map(int,open(0).read().split()));print((sum(sorted(l)[-k:]))) | t,l=open(0);print((sum(sorted(map(int,l.split()))[-int(t[2:]):]))) | p03658 |
N,K =list(map(int,input().split()))
l = sorted(list(map(int,input().split())))
print((sum(l[-1:-K-1:-1]))) | N,K =list(map(int,input().split()))
l = sorted(list(map(int,input().split())))
print((sum(l[N-K:]))) | p03658 |
n, k = list(map(int, input().split()))
print(( sum(sorted([ int(x) for x in input().split()], reverse = True)[:k]) )) | _, K = list(map(int, input().split()))
L = list(map(int, input().split()))
print((sum(sorted(L, reverse=True)[:K]))) | p03658 |
n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
l.sort(reverse = True)
sum = 0
for i in range(k):
sum+=l[i]
print(sum) | n,k = list(map(int,input().split()))
l = list(map(int,input().split()))
l.sort(reverse = True)
ans = sum(l[:k])
print(ans) | p03658 |
from itertools import permutations,combinations
N, K = list(map(int, input().split()))
L = list(map(int, input().split()))
P = list(combinations(L, K))
maximum = 0
for p in P:
maximum = max(maximum, sum(p))
print(maximum)
| N, K = list(map(int, input().split()))
L = sorted(list(map(int, input().split())), reverse=True)
print((sum(L[:K])))
| p03658 |
N, K = [int(i) for i in input().split()]
L = [int(i) for i in input().split()]
LL = sorted(L, reverse=True)
LL_max = sum([LL[i] for i in range(0, K)])
print(LL_max) | N, K = [int(i) for i in input().split()]
L = sorted([int(i) for i in input().split()], reverse=True)
print((sum([L[i] for i in range(K)]))) | p03658 |
from itertools import combinations
N, K = list(map(int, input().split()))
L = list(map(int, input().split()))
ans = max([sum(combi) for combi in combinations(L, K)])
print(ans)
| from itertools import combinations
N, K = list(map(int, input().split()))
L = sorted(list(map(int, input().split())), reverse=True)
ans = sum(L[:K])
print(ans)
| p03658 |
def Q2(x):
N, K = x[0][0], x[0][1]
lst = x[1][:]
lst = sorted(lst)[::-1]
return sum(lst[:K])
l = [int(i) for i in input().split()]
m = [int(i) for i in input().split()]
n = [l,m]
print((Q2(n))) | N, K = [int(i) for i in input().split()]
L = [int(i) for i in input().split()]
print((sum(sorted(L)[N - K:]))) | p03658 |
n, k = list(map(int, input().split()))
L = sorted([int(i) for i in input().split()])
print((sum(L[-k:]))) | n, k = list(map(int, input().split()))
L = sorted([int(i) for i in input().split()], reverse = True)
print((sum(L[: k]))) | p03658 |
# -*- coding: utf-8 -*-
n, k = list(map(int,input().split()))
l = [int(i) for i in input().split()]
l.sort()
tmp = 0
for i in range(n - k):
tmp += l[i]
ans = sum(l) - tmp
print(ans)
| # -*- coding: utf-8 -*-
n, k = list(map(int,input().split()))
l = [int(i) for i in input().split()]
l.sort(reverse = True)
ans = 0
for i in range(k):
ans += l[i]
print(ans)
| p03658 |
N, K = list(map(int, input().split()))
l = list(map(int, input().split()))
l.sort(reverse=True)
print((sum(l[:K]))) | N, K = list(map(int, input().split()))
L = list(map(int, input().split()))
L.sort(reverse=True)
print((sum(L[:K]))) | p03658 |
# import bisect
# import copy
# import fractions
# import math
# import numpy as np
# from collections import Counter, deque
# from itertools import accumulate,permutations, combinations,combinations_with_replacement,product
def resolve():
N,K=list(map(int,input().split()))
L=sorted(list(map(int,in... | def resolve():
N,K=list(map(int,input().split()))
L=sorted(list(map(int,input().split())),reverse=True)
print((sum(L[:K])))
resolve() | p03658 |
import itertools
N,K=list(map(int, input().split()))
l=[int(x) for x in input().split()]
max=-3
for i in list(itertools.combinations(l,K)):
if sum(i)>=max:
max=sum(i)
print(max) | N,K=list(map(int, input().split()))
l=[int(x) for x in input().split()]
buf=sorted(l,reverse=True)
result=0
for i in range(K):
result+=buf[i]
print(result) | p03658 |
import bisect
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
#print(A)
# Aの累積和を求めておく。
csum = [A[0] for _ in range(N+1)]
for i in range(1,N):
csum[i] = csum[i-1]+A[i]
# M回以上握手できるとなる最小の幸福度を求める。
# r:M回以上握手ができる最小の幸福度。
# l:M回以上握手が出来ない最大の幸福度。
l = 0
r = 10**6
while (l+1 < ... | import bisect
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
#print(A)
# Aの累積和を求めておく。
csum = [A[0] for _ in range(N+1)]
for i in range(1,N):
csum[i] = csum[i-1]+A[i]
# M回以上握手できるとなる最小の幸福度を求める。
# l:M回以上握手ができる最小の幸福度。
l = 0
r = 10**6
while (l+1 < r):
m = (l+r)//2
p... | p02821 |
import bisect
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
#print(A)
# Aの累積和を求めておく。
csum = [A[0] for _ in range(N+1)]
for i in range(1,N):
csum[i] = csum[i-1]+A[i]
# M回以上握手できるとなる最小の幸福度を求める。
# l:M回以上握手ができる最小の幸福度。
l = 0
r = 10**6
while (l+1 < r):
m = (l+r)//2
p... | import bisect
N,M = list(map(int,input().split()))
A = sorted(list(map(int,input().split())))
#print(A)
# Aの累積和を求めておく。
csum = [A[0] for _ in range(N+1)]
for i in range(1,N):
csum[i] = csum[i-1]+A[i]
# M回以上握手できるとなる最小の幸福度を求める。
# l:幸福度l以上となる握手がMパターン以上存在する。
# r:幸福度r以上となる握手がMパターン以上存在しない。
l = 0
r = 10**6
... | p02821 |
import bisect
from itertools import accumulate
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
ruiseki = list(accumulate(A[::-1]))
# 自分以上の数の個数がM個以上になる値のうち最大のもの
ok = 0
ng = 10 ** 15
while ok + 1 < ng:
mid = (ok + ng) // 2
cnt = 0
ans = 0
for a in A:
... | from itertools import accumulate
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
ruiseki = list(accumulate(A[::-1]))
def syakutori(mid):
x = 0
cnt = 0
ans = 0
for i in range(N)[::-1]: # 大きい方から
while x < N:
if A[i] + A[x] >= mid:
... | p02821 |
import itertools
N,M = list(map(int,input().split()))
A = sorted(map(int,input().split()))[::-1]
I = M
for i in range(N):
if i*i > M:
I = i
A = A[:I]
print((
sum(
sorted(
map(sum,itertools.product(A, repeat=2))
)[::-1][:M]
)
))
| import itertools
N,M = list(map(int,input().split()))
A = sorted(map(int,input().split()))[::-1]
print((sum(sorted([sum(i) for i in itertools.product(A, repeat=2)])[::-1][:M])))
| p02821 |
import sys
input = sys.stdin.readline
from bisect import bisect_left
n,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = [0]*(n+1)
a.sort()
for i in range(n):
b[i+1] = b[i]+a[i]
def is_ok(arg):
c = 0
f = False
for i in a:
if c >= m:
break
c +=... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from bisect import bisect_left
n,m = list(map(int,readline().split()))
a = list(map(int,readline().split()))
b = [0]*(n+1)
a.sort()
for i in range(n):
b[i+1] = b[i]+a[i]
def is_ok(arg):... | p02821 |
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort(reverse=True)
def binary_search(y):
left_index=-1
right_index=len(A)
while(left_index<right_index-1):
i=(left_index+right_index)//2
if A[i] >= y:
left_index=i
else:
right_index=i
re... | N, M = list(map(int, input().split()))
a = [10**18] + sorted(map(int, input().split()), reverse=True)
def solve(x):
count = 0
j = N
for i in range(1, N+1):
while a[i] + a[j] < x:
j -= 1
count += j
return count
left, right = 0, 10**18
while left < right - 1:
m... | p02821 |
N, M = list(map(int, input().split()))
a = [10**18] + sorted(map(int, input().split()), reverse=True)
def solve(x):
count = 0
j = N
for i in range(1, N+1):
while a[i] + a[j] < x:
j -= 1
count += j
return count
left, right = 0, 10**18
while left < right - 1:
m... | N, M = list(map(int, input().split()))
a = [2*10**5+1] + sorted(map(int, input().split()), reverse=True)
def solve(x):
count = 0
j = N
for i in range(1, N+1):
while a[i] + a[j] < x:
j -= 1
count += j
return count
left, right = 0, 2*10**5+1
while left < right - 1:
... | p02821 |
import sys
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)[:M]
item = []
for i in A:
for j in A:
item.append(i+j)
item.sort(reverse = True)
print((sum(item[:M])))
| import sys
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)[:M]
item = []
for i in A:
for j in A:
k = i + j
if len(item) >= M:
if min(item) < k:
item.append(k)
item.remove(min(item))
... | p02821 |
from bisect import bisect_left as BL
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
#border以上の幸福度を返す握手の組の数が、M以上であるか
def isok(border):
res=0
for i in range(N):
res+=N-BL(A,border-A[i])
return res>=M
ok=0
ng=A[-1]*2+1
mid=(ok+ng)//2
#幸福度h以上の握手がM組以上存在するような最... | from bisect import bisect_left as BL
N,M=list(map(int,input().split()))
A=list(map(int,input().split()))
A.sort()
#border以上の幸福度を返す握手の組の数が、M以上であるか
def isok(border):
res=0
for i in range(N):
res+=N-BL(A,border-A[i])
return res>=M
ok=0
ng=A[-1]*2+1
mid=(ok+ng)//2
#幸福度h以上の握手がM組以上存在するような最... | p02821 |
def resolve():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, M = list(map(int, S().split()))
A = LI()
A.sort()
from bisect import bisect_left
low = 2
high... | def resolve():
import sys
def LI():
return list(map(int, sys.stdin.readline().rstrip().split())) # 空白あり
def S():
return sys.stdin.readline().rstrip()
N, M = list(map(int, S().split()))
A = LI()
A.sort()
def f(n,x): # A[n]+A[i]>=x となる i の最小値
left = ... | p02821 |
import heapq
n, m = list(map(int, input().split()))
a = list([-int(x) for x in input().split()])
a.sort()
hq = [(a[0] + a[0], 0, 0)]
s = set()
ans = 0
for _ in range(m):
x, i, j = heapq.heappop(hq)
ans += x
if i < n - 1 and (i + 1) * n + j not in s:
heapq.heappush(hq, (a[i + 1] + a[j], i ... | from bisect import bisect_left
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
a.sort()
l, r = 0, 10000000000
while r - l > 1:
m = (l + r) // 2
res = 0
for x in a:
res += n - bisect_left(a, m - x)
if res >= k:
l = m
else:
r = m
b = [0]... | p02821 |
from heapq import heappush, heappop
N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())), reverse=True)
ans = 0
heap = []
heappush(heap, (-A[0]*2, 0, 0))
checked = set()
checked.add((0, 0))
for i in range(M):
power, x, y = heappop(heap)
ans -= power
if x+1 < N and (... | from itertools import accumulate
import sys
input = sys.stdin.readline
N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort(reverse=True)
lb = 0
ub = 2*10**5+1
while ub - lb > 1:
m = (lb + ub) // 2
cnt = 0
s, t = 0, N-1
while t >= 0:
while s < N and A[... | p02821 |
import sys
def f(x):
p=0
cnt=0
for i in range(n-1,-1,-1):
while p<n and a[i]+a[p]<x:
p+=1
cnt+=n-p
return cnt
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
l,r=a[0]*2,a[n-1]*2
while r-l>0:
if r-l<=1:
if f(r)==m... | import sys
def f(x):
p=0
cnt=0
for i in range(n-1,-1,-1):
while p<n and a[i]+a[p]<x:
p+=1
cnt+=n-p
return cnt
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
l,r=a[0]*2,a[n-1]*2
md=(r+l)//2
while r-l>0:
if r-l<=1:
... | p02821 |
import sys
def f(x):
p=0
cnt=0
for i in range(n-1,-1,-1):
while p<n and a[i]+a[p]<x:
p+=1
cnt+=n-p
return cnt
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
l,r=a[0]*2,a[n-1]*2
md=(r+l)//2
while r-l>0:
if r-l<=1:
... | import sys
def f(x):
p=0
cnt=0
for i in range(n-1,-1,-1):
while p<n and a[i]+a[p]<x:
p+=1
cnt+=n-p
return cnt
n,m=list(map(int,input().split()))
a=list(map(int,input().split()))
a.sort()
l,r=a[0]*2,a[n-1]*2
while True:
if r-l<=1:
if f(r)==m: m... | p02821 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.