s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s308733817 | p03599 | u919633157 | 1565192975 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 908 | # 2019/08/07
a,b,c,d,e,f=map(int,input().split())
max_a=f//100*a
max_b=f//100*b
min_ab=min(a,b)*100
max_c=(f-min_ab)//c
max_d=(f-min_ab)//d
def solve():
cnt=0
ans=0
for i in range(max_a):
if i*a>f:break
for j in range(max_b):
if i==j==0:continue
if (i*a+j*b)... |
s436860815 | p03599 | u919633157 | 1565192845 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 874 | # 2019/08/07
a,b,c,d,e,f=map(int,input().split())
max_a=f//100*a
max_b=f//100*b
min_ab=min(a,b)*100
max_c=(f-min_ab)//c
max_d=(f-min_ab)//d
def solve():
cnt=0
ans=0
for i in range(max_a):
if i*a>f:return ans
for j in range(max_b):
if i==j==0:continue
if (i*a... |
s444201902 | p03599 | u948524308 | 1564797813 | Python | Python (3.4.3) | py | Runtime Error | 2305 | 3064 | 782 | A,B,C,D,E,F =map(int,input().split())
amax = F//(100*A)
bmax = F//(100*B)
cmax = F//C
dmax = F//D
concmx =0
for a in range(amax,-1,-1):
for b in range(bmax,-1,-1):
cmax = (F-100*A*a-100*B*b)//C
dmax = (F-100*A*a-100*B*b)//D
for c in range(cmax,-1,-1):
for d in range(dmax,-1,-1)... |
s217698446 | p03599 | u626337957 | 1564586574 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 519 | A, B, C, D, E, F = map(int, input().split())
sugar = 0
s_water = 0
for a in range(F//(100*A)+1):
for b in range((F-100*A*a)//(100*B)+1):
f = F - 100*(a+b)
max_s = min((a+b)*E, f)
sugar_temp = 0
s_water_temp = 0
print(max_s)
if max_s%C >= max_s%D:
sugar_temp = max_s-max_s%D
else:
... |
s831080348 | p03599 | u285443936 | 1564545281 | Python | Python (3.4.3) | py | Runtime Error | 1502 | 3064 | 545 | A, B, C, D, E, F = map(int, input().split())
M = 0
Concmax = 0
for i in range(F//100//A+1):
WA = i*100*A
for k in range((F-WA)//100//B+1):
WB = k*100*B
W = WA+WB
if W <= F:
for j in range((F-W)//C+1):
SC = j*C
for l in range((F-W-C)//D+1):
SD = l*D
S = SC+SD
... |
s154562754 | p03599 | u285443936 | 1563451565 | Python | Python (3.4.3) | py | Runtime Error | 93 | 3316 | 610 | A, B, C, D, E, F = map(int, input().split())
ans = 0
W = set()
S = set()
for i in range(F):
x1 = 100 * A * i
if x1 > F:
break
for j in range(F):
x2 = x1 + 100 * B * j
if x2 > F or x2 == 0:
break
W.add(x2)
for i in range(F):
y1 = C * i
if y1 > F:
break
for j in range(F):
y2 = y... |
s824051561 | p03599 | u723590269 | 1563279707 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 1573 | a,b,c,d,e,f = map(int,input().split())
'''
1.ビーカーに用意できる水の量のパターンを計算する
2.そこに砂糖を溶かせるだけ溶かす
3.全量がびーかの容量以下で濃度が100%以下であるものを採用する
'''
#1.作れる水の量をリストに入れる
#容量の入れもの +100は余裕分
l = [0 for i in range(31)]
#aの作業で実現できる水
for i in range(0,len(l),a):
l[i] = i*100
#bも使っていい場合
for i in range(1,len(l),b):
#bだけで実現できる
if (i/b).is_i... |
s760240314 | p03599 | u633914031 | 1562047043 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 661 | cnt_A=0
cnt_B=0
cnt_C=0
cnt_D=0
max_noudo=0
water=0
sugar=0
while cnt_A*100*A <= F:
cnt_B=0
while cnt_B*100*B <= F-cnt_A*100*A:
cnt_C=0
while cnt_C*C <= F-cnt_A*100*A-cnt_B*100*B:
cnt_D=0
while cnt_D*D <= F-cnt_A*100*A-cnt_B*100*B-cnt_C*C:
if (cnt_A*A+cnt_B*B)*E >= cnt_C*C+cnt_D*D >0:
... |
s375324313 | p03599 | u504562455 | 1561141914 | Python | Python (3.4.3) | py | Runtime Error | 96 | 3064 | 637 | a, b, c, d, e, f = [int(i) for i in input().split()]
max_density = 0
#water = 0
#sugar = 0
for i_1 in range(f//(a*100)+1):
for i_2 in range((f-100*a)//(b*100)+1):
for i_3 in range(((i_1*a+i_2*b)*e)//c+1):
i_4 = min((((i_1*a+i_2*b)*e)-i_3*c)//d , (f-(i_1*100*a+i_2*100*b+i_3*c))//d)
if... |
s735881493 | p03599 | u504562455 | 1561141157 | Python | Python (3.4.3) | py | Runtime Error | 60 | 3064 | 652 | a, b, c, d, e, f = [int(i) for i in input().split()]
max_density = 0
for i_1 in range(f//(a*100)+1):
for i_2 in range((f-100*a)//(b*100)+1):
for i_3 in range(((i_1*a+i_2*b)*e)//c+1):
i_4 = (((i_1*a+i_2*b)*e)-i_3*c)//d
if i_1 == 0 and i_2 == 0:
break
if i_1... |
s507086193 | p03599 | u102461423 | 1561128396 | Python | Python (3.4.3) | py | Runtime Error | 30 | 3316 | 686 | import itertools
A,B,C,D,E,F = map(int,input().split())
WF = F//100+1
water = [False] * (WF+1+30)
sugar = [False] * (F+1+30)
water[0] = True
sugar[0] = True
for n in range(WF):
if water[n]:
water[n+A] = True
water[n+B] = True
for n in range(F):
if sugar[n]:
sugar[n+C] = True
sugar[n+D] = True
... |
s538327283 | p03599 | u360116509 | 1560825248 | Python | PyPy3 (2.4.0) | py | Runtime Error | 285 | 39920 | 644 | def main():
A, B, C, D, E, F = map(int, input().split())
xl = []
yl = []
for i in range(F):
for j in range(F):
x = 100 * A * i + 100 * B * j
if F >= x and x not in xl:
xl.append(x)
for i in range(F):
for j in range(F):
y = C * i + D... |
s283952549 | p03599 | u145889196 | 1560820632 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 728 | #C
A,B,C,D,E,F=map(int,input().split())
density=0
Ans1=0
Ans2=0
water=set() #setを使うと重複がなくなる
sugar=set()
bm=F//(100*B)
for i in range(bm+1):
rw=F-100*i*B
am=rw//(100*A)
for j in range(am+1):
water.add(100*i*B+100*j*A)
dm=F//D
for i in range(dm+1):
rs=F-i*D
cm=rs//C
for j in range(cm+1):... |
s802690725 | p03599 | u145889196 | 1560820553 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 727 | #C
A,B,C,D,E,F=map(int,input().split())
density=0
Ans1=0
Ans2=0
water=set() #setを使うと重複がなくなる
sugar=set()
bm=F//(100*B)
for i in range(bm+1):
rw=F-100*i*B
am=rw//(100*A)
for j in range(am+1):
water.add(100*i*B+100*j*A)
dm=F//D
for i in range(dm+1):
rs=F-i*D
cm=rs//C
for j in range(cm+1):... |
s391455180 | p03599 | u263830634 | 1560199205 | Python | PyPy3 (2.4.0) | py | Runtime Error | 169 | 38384 | 1108 | import sys
A, B, C, D, E, F = map(int, input().split())
def concentration(water, suger):
if water * E/100 < suger or water + suger == 0:
return 0
return (100 * suger/(water + suger))
lst_w = []
limit_w = (F+A*100-1)//(A*100)
for i in range(limit_w):
for j in range(limit_w):
if 100 * (A * ... |
s423020628 | p03599 | u263830634 | 1560198455 | Python | Python (3.4.3) | py | Runtime Error | 310 | 12456 | 924 | A, B, C, D, E, F = map(int, input().split())
def concentration(water, suger):
if water * E/100 < suger or water + suger == 0:
return 0
return (100 * suger/(water + suger))
lst_w = []
limit_w = (F+A*100-1)//(A*100)
for i in range(limit_w):
for j in range(limit_w):
if 100 * (A * i + B * j) ... |
s058573577 | p03599 | u722535636 | 1560067424 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 336 | A,B,C,D,E,F=map(int,input().split())
ans=(0,0,0)
F+=1
E=100*E/(100+E)
for a in range(0,F,A*100):
for b in range(0,F-a,B*100):
for c in range(0,F-a-b,C):
if a==0 and b==0:break
for d in range(0,F-a-b-c,D):
s=a+b+c+d
e=100*(c+d)/s
if ans[2]< e <= E:
ans=(s,c+d,e)
elif e>E:break
print... |
s945717668 | p03599 | u200785298 | 1559873248 | Python | Python (3.4.3) | py | Runtime Error | 1078 | 3064 | 1111 | #!/usr/bin/env python3
import sys
def solve(A: int, B: int, C: int, D: int, E: int, F: int):
mn = 0
ret = None
for a in range((F // 100) // A + 1):
for b in range(((F // 100) - a * A) // B + 1):
w = a * A + b * B
if w < 1:
continue
for c in range... |
s606937330 | p03599 | u665038048 | 1559767910 | Python | Python (3.4.3) | py | Runtime Error | 197 | 13384 | 773 | A, B, C, D, E, F = map(int, input().split())
A *= 100
B *= 100
water = []
sugar = []
for i in range(1+F//A):
for j in range(1+F//B):
if i * A + j * B <= F:
water.append(i * A + j * B)
for i in range(1+F//C):
for j in range(1+F//D):
if i * C + j * D <= F:
sugar.append(i * ... |
s514367024 | p03599 | u777923818 | 1559598712 | Python | PyPy3 (2.4.0) | py | Runtime Error | 281 | 125044 | 909 | import sys
#input = sys.stdin.readline
def inpl(): return list(map(int, input().split()))
A, B, C, D, E, F = inpl()
waters = [100*A*a + 100*B*b for a in range(30//A + 1) for b in range((30-A*a)//B + 1)]
sugars = [C*c + D*d for c in range(3000//C + 1) for d in range((3000-C*c)//D + 1)]
waters = sorted(set(waters))[1:]... |
s329265590 | p03599 | u543954314 | 1559147863 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 318 | a,b,c,d,e,f = map(int, input().split())
ans = 0
for i in range(f//(a*100)+1):
for j in range((f-a*100*i)//(b*100)+1):
for k in range((f-a*i*100-b*j*100)//c+1):
for l in range((f-a*i*100-b*j*100-c*k)//d+1):
w = i+j
s = k+l
if w*e >= k:
ans = max(ans,s/(w*100+s))
print(ans) |
s984910268 | p03599 | u923712635 | 1558579736 | Python | Python (3.4.3) | py | Runtime Error | 2632 | 3064 | 698 | import sys
sys.setrecursionlimit(100000000)
A,B,C,D,E,F = [int(x) for x in input().split()]
x = []
y = []
ans_max = 0
ans = []
for i in range(F//(100*A)+1):
for j in range((F-100*A*i)//(100*B)+1):
water = 100*(A*i+B*j)
if(water<=F and not water in x):
x.append(water)
for i in range(F)... |
s407372757 | p03599 | u923712635 | 1558579414 | Python | Python (3.4.3) | py | Runtime Error | 2694 | 3064 | 693 | import sys
sys.setrecursionlimit(1000000)
A,B,C,D,E,F = [int(x) for x in input().split()]
x = []
y = []
ans_max = 0
ans = []
for i in range(F//(100*A)+1):
for j in range((F-100*A*i)//(100*B)+1):
water = 100*(A*i+B*j)
if(water<=F and not water in x):
x.append(water)
for i in range(F):
... |
s354486610 | p03599 | u923712635 | 1558579299 | Python | Python (3.4.3) | py | Runtime Error | 2726 | 3064 | 653 | A,B,C,D,E,F = [int(x) for x in input().split()]
#%%
x = []
y = []
ans_max = 0
ans = []
for i in range(F//(100*A)+1):
for j in range((F-100*A*i)//(100*B)+1):
water = 100*(A*i+B*j)
if(water<=F and not water in x):
x.append(water)
for i in range(F):
for j in range(F):
salt = C... |
s715959282 | p03599 | u271469978 | 1558492424 | Python | Python (3.4.3) | py | Runtime Error | 629 | 3064 | 908 | a, b, c, d, e, f = map(int, input().split())
density = 0
for water_a in range(0,3001,a * 100):
for water_b in range(0,3001,b * 100):
if water_a + water_b > f:
break
for suger_c in range(0,3001,c):
if water_a + water_b + suger_c > f:
break
for suger... |
s719258396 | p03599 | u767664985 | 1558071863 | Python | Python (3.4.3) | py | Runtime Error | 533 | 3064 | 400 | A, B, C, D, E, F = map(int, input().split())
M = 0
for i in range(F // 100 // A + 1):
for j in range((F - 100 * A * i) // 100 // B + 1):
w = 100 * A * i + 100 * B * j
if w == 0:
break
for k in range((F - w) // C + 1):
for l in range((F - w - C * k) // D + 1):
s = C * k + D * l
if E >= 100 * s / w ... |
s638098577 | p03599 | u620945921 | 1558060476 | Python | PyPy3 (2.4.0) | py | Runtime Error | 197 | 40560 | 504 | A, B, C, D, E, F= (int(i) for i in input().split())
dens=0
for a in range(30+1):
for b in range(30+1):
waterA=100*a*A
waterAB=waterA+100*b*B
if waterA<= F and 0 < waterAB <= F:
for c in range(100+1):
for d in range(100+1):
if waterAB+c*C+d*D <= F:
if c*C+d*D <= (a*A+b... |
s163466339 | p03599 | u620945921 | 1558058946 | Python | PyPy3 (2.4.0) | py | Runtime Error | 193 | 40560 | 506 | A, B, C, D, E, F= (int(i) for i in input().split())
dens=0
for a in range(30+1):
for b in range(30+1):
waterA=100*a*A
waterAB=waterA+100*b*B
if waterA<= F and 0 < waterAB <= F:
for c in range(100+1):
for d in range(100+1):
if waterAB+c*C+d*D <= F and c*C+d*D <= (a*A+b*B)*E:
... |
s661977962 | p03599 | u047393579 | 1558029558 | Python | Python (3.4.3) | py | Runtime Error | 1878 | 3064 | 622 | A, B, C, D, E, F = map(int, input().split())
con = 0
sugar = 0
for a in range(int(F / 100 / A) + 1):
for b in range(int((F - a * 100 * A)/ 100 / B) + 1):
if not a == b == 0:
for c in range(int((a*A+b*B)*E/C)+1):
for d in range(int(((a*A+b*B)*E-c*C)/D)+1):
if 1... |
s295603127 | p03599 | u163320134 | 1557943790 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 477 | a,b,c,d,e,d=map(int,input().split())
ans=[100*a,0]
for i in range(f//(100*a)+1):
for j in range((f-100*a*i)//(100*b)+1):
for k in range(f//c+1):
if i==0 and j==0:
break
for l in range((f-c*k)//d+1):
if 100*a*i+100*b*j+c*k+d*l>f:
break
elif c*k+d*l>(a*i+b*j)*e:
... |
s489139078 | p03599 | u163320134 | 1557943712 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 474 | a,b,c,d,e,d=map(int,input().split())
ans=[100*a,0]
for i in range(f//(100*a)+1):
for j in range((f-100*a*i)//(100*b)+1):
if i==0 and j==0:
break
for k in range(f//c+1):
for l in range((f-c*k)//d+1):
if 100*a*i+100*b*j+c*k+d*l>f:
break
elif c*k+d*l>(a*i+b*j)*e:
b... |
s622638012 | p03599 | u163320134 | 1557943651 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 439 | a,b,c,d,e,d=map(int,input().split())
ans=[100*a,0]
for i in range(f//(100*a)+1):
for j in range((f-100*a*i)//(100*b)+1):
for k in range(f//c+1):
for l in range((f-c*k)//d+1):
if 100*a*i+100*b*j+c*k+d*l>f:
break
elif c*k+d*l>(a*i+b*j)*e:
break
else:
if (c... |
s229041444 | p03599 | u687044304 | 1557465124 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 2082 | # -*- coding:utf-8 -*-
"""解説
https://www.youtube.com/watch?v=nCHz87GMdpo
"""
def solve2():
""" 全探索O(F**2) """
A, B, C, D, E, F = list(map(int, input().split()))
# 水をx, 砂糖をyとする
sugars = []
for i in range(0, F+1):
for j in range(0, F+1):
y = i*C + j*D
if y <= F:
... |
s974216676 | p03599 | u687044304 | 1557464795 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 2009 | # -*- coding:utf-8 -*-
"""解説
https://www.youtube.com/watch?v=nCHz87GMdpo
"""
def solve2():
""" 全探索O(F**2) """
A, B, C, D, E, F = list(map(int, input().split()))
# 水をx, 砂糖をyとする
sugars = []
for i in range(0, F+1):
for j in range(0, F+1):
y = i*C + j*D
if y <= F:
... |
s789883733 | p03599 | u391731808 | 1556986001 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 530 | A,B,C,D,E,F = map(int,input().split())
ans = [0,0]
M = 0
for a in range(31):
if F < a*A*100:
break
for b in range(31-a):
if a == 0 and b == 0:
continue
W = (a*A+b*B)*100
if F < W:
break
CD_max = min((E * W) // 100,F-W)
for c in range(CD_max... |
s827517373 | p03599 | u655834330 | 1556763274 | Python | PyPy3 (2.4.0) | py | Runtime Error | 201 | 39664 | 1412 |
import math
def read_input():
a, b, c, d, e, f = map(int, input().split())
return a, b, c, d, e, f
# 100aと100bの線形結合でf以下でとりうる値を見つける
def search_water_valiation(a, b, f):
result = []
for i in range(30):
for j in range(30):
water = 100*a*i + 100*b*j
if water <= f:
... |
s788211866 | p03599 | u806855121 | 1556463666 | Python | Python (3.4.3) | py | Runtime Error | 117 | 3188 | 664 | A, B, C, D, E, F = map(int, input().split())
AQ = set()
for i in range(F):
for j in range(F):
if 100*A*i + 100*B*j <= F:
AQ.add(100*A*i + 100*B*j)
else:
break
SG = set()
for i in range(F):
for j in range(F):
if C*i + D*j <= F:
SG.add(C*i + D*j)
... |
s903416176 | p03599 | u795630164 | 1556167670 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 628 | a,b,c,d,e,f = map(int, input().split())
per = 0
ans = []
for i in range(f//(100*a) + 1):
for j in range(f//(100*b) + 1):
w = i * a * 100 + j * b * 100
if w > f or w == 0:
break
for k in range((e * w//100)//c + 1):
for l in range((e * w//100)//d + 1):
... |
s001662720 | p03599 | u795630164 | 1556167601 | Python | Python (3.4.3) | py | Runtime Error | 539 | 3064 | 586 | a,b,c,d,e,f = map(int, input().split())
per = 0
ans = []
for i in range(f//(100*a) + 1):
for j in range(f//(100*b) + 1):
w = i * a * 100 + j * b * 100
if w > f or w == 0:
break
for k in range((e * w//100)//c + 1):
for l in range((e * w//100)//d + 1):
... |
s400571692 | p03599 | u859897687 | 1555998133 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 364 | a,b,c,d,e,f=map(int,input().split())
aa=0
ans=[0,0]
for i in range(0,f+1,a*100):
for j in range(0,f+1-i,b*100):
for k in range(0,e*(i+j)/100+1,c):
for l in range(0,e*(i+j)/100+1-k,d):
if i+j+k+l>f:
continue
if i+j>0 and aa<100*(k+l)/(i+j):
aa=100*(k+l)/(i+j)
ans... |
s606534604 | p03599 | u859897687 | 1555996293 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 364 | a,b,c,d,e,f=map(int,input().split())
aa=0
ans=[0,0]
for i in range(0,f+1,a*100):
for j in range(0,f+1-i,b*100):
for k in range(0,e*(i+j)/100+1,c):
for l in range(0,e*(i+j)/100+1-k,d):
if i+j+k+l>f:
continue
if i+j>0 and aa<(k+l)/(i+j+k+l):
aa=(k+l)/(i+j+k+l)
ans... |
s879232354 | p03599 | u859897687 | 1555994292 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3064 | 355 | a,b,c,d,e,f=map(int,input().split())
k=0
ans=[0,0]
for i in range(0,f+1,a*100):
for j in range(0,f+1-i,b*100):
for k in range(0,e*(i+j)//100+1,c):
for l in range(0,e*(i+j)//100+1-k,d):
if i+j+k+l>f:
continue
if k<(k+j)/(i+j) and i+j>0:
k=(k+j)/(i+j)
ans=[i+j+k+l... |
s396392615 | p03599 | u859897687 | 1555993192 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 345 | a,b,c,d,e,f=map(int,input().split())
k=0
ans=[0,0]
for i in range(0,f+1,a*100):
for j in range(0,f+1-i,b*100):
for k in range(0,e*(i+j)//100+1,c):
for l in range(0,e*(i+j)//100+1-k,d):
if i+j+k+l>f:
continue
if k<(k+j)/(i+j):
k=(k+j)/(i+j)
ans=[i+j+k+l,k+l]
prin... |
s321706012 | p03599 | u859897687 | 1555969755 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 345 | a,b,c,d,e,f=map(int,input().split())
a=0
ans=[0,0]
for i in range(0,f+1,a*100):
for j in range(0,f+1-i,b*100):
for k in range(0,e*(i+j)//100+1,c):
for l in range(0,e*(i+j)//100+1-k,d):
if i+j+k+l>f:
continue
if a<(k+j)/(i+j):
a=(k+j)/(i+j)
ans=[i+j+k+l,k+l]
prin... |
s619458899 | p03599 | u859897687 | 1555969491 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 335 | a,b,c,d,e,f=map(int,input().split())
f//=100
a=0
ans=[0,0]
for i in range(0,f+1,a):
for j in range(0,f+1-i,b):
for k in range(0,e*(i+j)+1,c):
for l in range(0,e*(i+j)+1-k,d):
if i+j+k+l>f:
continue
if a<(k+j)/(i+j):
a=(k+j)/(i+j)
ans=[i+j+k+l,k+l]
print(ans[0],a... |
s751221047 | p03599 | u859897687 | 1555956840 | Python | Python (3.4.3) | py | Runtime Error | 3156 | 3064 | 355 | a,b,c,d,e,f=map(int,input().split())
q=[[0,0]]
k=0
ans=0
while len(q)>0:
x,y=q.pop()
if x!=0 and y/(x+y)>k:
k=y/(x+y)
ans=[x,y]
if x+y+100*a<=f:
q+=[[x+100*a,y]]
if x+y+100*b<=f:
q+=[[x+100*b,y]]
if y+c<=(x-y)*e/100 and x+y+c<=f:
q+=[[x+c,y+c]]
if y+d<=(x-y)*e/100 and x+y+d<=f:
q+=[[... |
s835229167 | p03599 | u859897687 | 1555956681 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 346 | a,b,c,d,e,f=map(int,input().split())
q=[[0,0]]
k=0
ans=0
while len(q)>0:
x,y=q.pop()
if x/(x+y)>k:
k=x/(x+y)
ans=[x,y]
if x+y+100*a<=f:
q+=[[x+100*a,y]]
if x+y+100*b<=f:
q+=[[x+100*b,y]]
if y+c<=(x-y)*e/100 and x+y+c<=f:
q+=[[x+c,y+c]]
if y+d<=(x-y)*e/100 and x+y+d<=f:
q+=[[x+d,y+d]]... |
s834269635 | p03599 | u859897687 | 1555954887 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 346 | a,b,c,d,e,f=map(int,input().split())
q=[[0,0]]
k=0
ans=0
while len(q)>0:
x,y=q.pop()
if x/(x+y)>k:
k=x/(x+y)
ans=[x,y]
if x+y+100*a<=f:
q+=[[x+100*a,y]]
if x+y+100*b<=f:
q+=[[x+100*b,y]]
if y+c<=(x-y)*e/100 and x+y+c<=f:
q+=[[x+c,y+c]]
if y+d<=(x-y)*e/100 and x+y+d<=f:
q+=[[x+d,y+d]]... |
s726415036 | p03599 | u859897687 | 1555954444 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 357 | a,b,c,d,e,f=map(int,input().split())
q=[[0,0]]
ans=0
while len(q)>0:
x,y=pop(q)
if x+y+100*a<=f:
q+=[[x+100*a,y]]
if x+y+100*b<=f:
q+=[[x+100*b,y]]
if y+c<=(x-y)*e/100 and x+y+c<=f:
q+=[[x+c,y+c]]
ans=max(ans,100*(y+c)/(x+y+c))
if y+d<=(x-y)*e/100 and x+y+d<=f:
q+=[[x+d,y+d]]
ans=max(a... |
s086294776 | p03599 | u859897687 | 1555954275 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 377 | a,b,c,d,e,f=map(int,input().split())
q=[[0,0]]
ans=0
while len(q)>0:
x,y=pop(q)
if x+y+100*a<=f:
q.append([x+100*a,y])
if x+y+100*b<=f:
q.append([x+100*b,y])
if y+c<=(x-y)*e/100 and x+y+c<=f:
q.append([x+c,y+c])
ans=max(ans,100*(y+c)/(x+y+c))
if y+d<=(x-y)*e/100 and x+y+d<=f:
q.append([x+d... |
s052573896 | p03599 | u879309973 | 1555944405 | Python | Python (3.4.3) | py | Runtime Error | 76 | 3188 | 700 | def solve(a, b, c, d, e, f):
S = set()
for x in range(0, f, 100*a):
for y in range(0, f, 100*b):
z = x + y
if 0 < z <= f:
S.add(z)
T = set()
for x in range(0, f, c):
for y in range(0, f, d):
z = x + y
if z <= f:
... |
s955357813 | p03599 | u052499405 | 1555035354 | Python | Python (3.4.3) | py | Runtime Error | 241 | 3188 | 629 | import bisect
a, b, c, d, e, f = [int(item) for item in input().split()]
water = set()
for i in range(31):
for j in range(31):
w = i*a + j*b
if w <= f // 100:
water.add(w)
sugar = set()
for i in range(1501):
j = 0
while i*c + j*d <= 1500:
sugar.add(i*c + j*d)
j ... |
s212665610 | p03599 | u249447366 | 1554855117 | Python | Python (3.4.3) | py | Runtime Error | 50 | 3700 | 851 | A, B, C, D, E, F = map(int, input().split())
max_sugar = int(F / (100 + E) * E)
max_water = F - max_sugar
sugars = set()
waters = set()
for i in range(F):
for j in range(F):
w = 100 * A * j + 100 * B * i
if w > max_water:
break
if i + j != 0 and w <= max_water:
water... |
s409464923 | p03599 | u249447366 | 1554854903 | Python | Python (3.4.3) | py | Runtime Error | 49 | 3700 | 831 | A, B, C, D, E, F = map(int, input().split())
max_sugar = int(F / (100 + E) * E)
max_water = F - max_sugar
sugars = set()
waters = set()
for i in range(F):
for j in range(F):
w = 100 * A * j + 100 * B * i
if w > max_water:
break
if i + j != 0 and w <= max_water:
water... |
s738128136 | p03599 | u249447366 | 1554854785 | Python | Python (3.4.3) | py | Runtime Error | 48 | 3700 | 848 | A, B, C, D, E, F = map(int, input().split())
max_sugar = int(F / (100 + E) * E)
max_water = F - max_sugar
sugars = set()
waters = set()
a = int(F / 100)
for i in range(a):
for j in range(a):
w = 100 * A * j + 100 * B * i
if w > max_water:
break
if i + j != 0 and w <= max_water:
... |
s214723002 | p03599 | u249447366 | 1554854018 | Python | Python (3.4.3) | py | Runtime Error | 57 | 3700 | 829 | A, B, C, D, E, F = map(int, input().split())
max_sugar = F / (100 + E) * E
max_water = F - max_sugar
sugars = set()
waters = set()
for i in range(F):
for j in range(F):
w = 100 * A * i + 100 * B * j
if (i + j) != 0 and w <= max_water:
waters.add(w)
if w > max_water:
... |
s458814788 | p03599 | u249447366 | 1554853941 | Python | Python (3.4.3) | py | Runtime Error | 59 | 3572 | 846 | A, B, C, D, E, F = map(int, input().split())
max_sugar = F / (100 + E) * E
max_water = F - max_sugar
sugars = set()
waters = set()
a = int(F / 100)
for i in range(a):
for j in range(a):
w = 100 * A * i + 100 * B * j
if (i + j) != 0 and w <= max_water:
waters.add(w)
if w > max_wa... |
s993809627 | p03599 | u249447366 | 1554853562 | Python | Python (3.4.3) | py | Runtime Error | 57 | 3700 | 852 | A, B, C, D, E, F = map(int, input().split())
max_suger = F / (100 + E) * E
max_water = F - max_suger
sugers = set()
waters = set()
a = int(F / 100)
for i in range(a):
for j in range(a):
w = 100 * A * i + 100 * B * j
if i + j != 0 and w <= max_water:
waters.add(w)
if w > max_wate... |
s975757915 | p03599 | u249447366 | 1554849569 | Python | Python (3.4.3) | py | Runtime Error | 518 | 56000 | 860 | A, B, C, D, E, F = map(int, input().split())
max_suger = F / (100 + E) * E
max_water = F - max_suger
sugers = []
waters = []
a = int(F / 100)
for i in range(a):
for j in range(a):
w = 100 * A * i + 100 * B * j
if i + j != 0 and w <= max_water:
waters.append(w)
if w > max_water:
... |
s071326028 | p03599 | u249447366 | 1554849072 | Python | Python (3.4.3) | py | Runtime Error | 3155 | 55596 | 752 | A, B, C, D, E, F = map(int, input().split())
max_suger = F / (100 + E) * E
max_water = F - max_suger
sugers = []
waters = []
a = int(F / 100)
for i in range(a):
for j in range(a):
w = 100 * A * i + 100 * B * j
if i + j != 0 and w <= max_water:
waters.append(w)
for i in range(F):
fo... |
s452818663 | p03599 | u249447366 | 1554847043 | Python | Python (3.4.3) | py | Runtime Error | 3156 | 61676 | 1065 | A, B, C, D, E, F = map(int, input().split())
max_sugar = F / (100 + E) * E
max_water = F - max_sugar
# print('w_max', max_water, 's_max', max_sugar)
waters = []
sugers = []
for i in range(F):
for j in range(F):
a_water_g = 100 * A
b_water_g = 100 * B
w = a_water_g * i + b_water_g * j
... |
s745149018 | p03599 | u249447366 | 1554846941 | Python | Python (3.4.3) | py | Runtime Error | 29 | 4340 | 1132 | A, B, C, D, E, F = map(int, input().split())
max_sugar = F / (100 + E) * E
max_water = F - max_sugar
# print('w_max', max_water, 's_max', max_sugar)
range_arg = 30
# range_arg = int(F / (100 * A + C))
waters = []
sugers = []
for i in range(range_arg):
for j in range(range_arg):
a_water_g = 100 * A
... |
s090752436 | p03599 | u501643136 | 1554825752 | Python | Python (3.4.3) | py | Runtime Error | 109 | 3188 | 757 | A, B, C, D, E, F = map(int, input().split())
W = set()
S = set()
wtr = 100*A
sgr = 0
i = 1
j = 0
while(wtr <= F):
while(wtr <= F):
W.add(wtr)
wtr = i*A*100 + j*B*100
j +=1
i +=1
j = 0
wtr = i*A*100 + j*B*100
i = 0
j = 0
while(sgr <= F):
while(sgr <= F):
S.add(sgr)
sgr = i*C + j*D
j... |
s482043891 | p03599 | u501643136 | 1554825592 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 714 | A, B, C, D, E, F = map(int, input().split())
W = set()
S = set()
wtr = 100*A
sgr = 0
i = 1
j = 0
while(wtr <= F):
while(wtr <= F):
W.add(wtr)
wtr = i*A*100 + j*B*100
j +=1
i +=1
j = 0
wtr = i*A*100 + j*B*100
i = 0
j = 0
while(sgr <= F):
while(sgr <= F):
S.add(sgr)
sgr = i*C + j*D
j... |
s463606405 | p03599 | u501643136 | 1554825563 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 713 | A, B, C, D, E, F = map(int, input().split())
W = set()
S = set()
wtr = 100*A
sgr = 0
i = 1
j = 0
while(wtr <= F):
while(wtr <= F):
W.add(wtr)
wtr = i*A*100 + j*B*100
j +=1
i +=1
j = 0
wtr = i*A*100 + j*B*100
i = 0
j = 0
while(sgr <= F):
while(sgr <= F):
S.add(sgr)
sgr = i*C + j*D
j... |
s186949995 | p03599 | u371686382 | 1554611469 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 792 | A, B, C, D, E, F = map(int, input())
waters = set()
for i in range(F + 1):
for j in range(F + 1):
water = 100 * A * i + 100 * B * j
if water <= F:
waters.add(water)
waters.remove(0)
sugars = set()
for i in range(F + 1):
for j in range(F + 1):
sugar = C * i + D * j
i... |
s112976238 | p03599 | u655975843 | 1554526578 | Python | Python (3.4.3) | py | Runtime Error | 24 | 2940 | 731 | a, b, c, d, e, f = map(int, input().split())
ans = []
for ai in range(31):
bb = (f - (ai * a * 100)) // b
for bi in range(bb):
if ai == bi == 0:
continue
cc = (f - (ai * a * 100 + bi * b * 100)) // c
for ci in range(cc):
dd = (f - (ai * a * 100 + bi * b * 100 + ci * c... |
s614741195 | p03599 | u013408661 | 1554238900 | Python | Python (3.4.3) | py | Runtime Error | 579 | 12436 | 488 | a,b,c,d,e,f=map(int,input().split())
water=[]
salt=[]
for i in range(30):
for j in range(30):
x=a*100*i+b*100*j
if x<=f:
water.append(x)
for i in range(1501):
for j in range(1501):
x=c*i+d*j
if x<=f:
salt.append(x)
water=list(set(water))
salt=list(set(salt))
stack=0
ans_sol=0
ans_sal=0
f... |
s711567463 | p03599 | u013408661 | 1554238057 | Python | Python (3.4.3) | py | Runtime Error | 3159 | 50124 | 458 | a,b,c,d,e,f=map(int,input().split())
ans=[]
for i in range(f//100//a +1):
for j in range(f//100//b +1):
if i*a*100+j*b*100<=f:
for p in range(f//c +1):
for q in range(f//d +1):
if p*c+q*d<=(i*a+j*b)*e and (p*c+q*d+i*a*100+j*b*100<=f):
ans.append([p*c+q*d+i*a*100+j*b*100,p*c+q*d... |
s569878660 | p03599 | u315485238 | 1554235336 | Python | Python (3.4.3) | py | Runtime Error | 36 | 5104 | 724 | A,B,C,D,E,F=list(map(int, input().split()))
from fractions import gcd
highest_concentration=0
for a in range(F//(100*A) +1):
for b in range((F-100*A*a)//(100*B) +1):
water = 100*A*a + 100*B*b
if not water:
continue
max_sugar = min(E*(A*a+B*b), F-water)
lcm = C*D//gcd(C,D)
#(max_... |
s163869111 | p03599 | u315485238 | 1554235256 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 1430 | A,B,C,D,E,F=list(map(int, input().split()))
from fractions import gcd
highest_concentration=0
for a in range(F//(100*A) +1):
for b in range((F-100*A*a)//(100*B) +1):
water = 100*A*a + 100*B*b
if not water:
continue
max_sugar = min(E*(A*a+B*b), F-water)
lcm = C*D//gcd(C,D)
#(max_... |
s981424370 | p03599 | u013408661 | 1554228679 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 461 | a,b,c,d,e,f=map(int,input().split())
dp=[-1]*(f+1)
dp[0]=0
for i in range1,(f+1):
for j in [a*100,b*100]:
if i-j>=0 and dp[i-j]!=-1:
dp[i]=max(0,dp[i])
for j in [c,d]:
if i-j>=0 and dp[i-j]!=-1 and 100*(dp[i-j]+j)<=e*(i-(dp[i-j]+j)):
dp[i]=max(dp[i],dp[i-j]+j)
stack=0
index=min(a*100,b*100)
for ... |
s179906485 | p03599 | u013408661 | 1554228553 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3064 | 437 | a,b,c,d,e,f=map(int,input().split())
dp=[-1]*(f+1)
dp[0]=0
for i in range(f+1):
for j in [a*100,b*100]:
if dp[i-j]!=-1:
dp[i]=max(0,dp[i])
for j in [c,d]:
if dp[i-j]!=-1 and 100*(dp[i-j]+j)<=e*(i-(dp[i-j]+j)):
dp[i]=max(dp[i],dp[i-j]+j)
stack=0
index=min(a*100,b*100)
for i in range(index+1,f+1):... |
s976973502 | p03599 | u013408661 | 1554228466 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 430 | a,b,c,d,e,f=map(int,input().split())
dp=[-1]*(f+1)
dp[0]=0
for i in range(f+1):
for j in [a*100,b*100]:
if dp[i-j]!=-1:
dp[i]=max(0,dp[i])
for j in [c,d]:
if dp[i-j]!=-1 and 100*(dp[i-j]+j)<=e*(i-(dp[i-j]+j)):
dp[i]=max(dp[i],dp[i-j]+j)
stack=0
index=min(a*100,b*100)
for i in range(f+1):
if dp... |
s251371553 | p03599 | u013408661 | 1554228374 | Python | Python (3.4.3) | py | Runtime Error | 27 | 3064 | 415 | a,b,c,d,e,f=map(int,input().split())
dp=[-1]*(f+1)
dp[0]=0
for i in range(f+1):
for j in [a*100,b*100]:
if dp[i-j]!=-1:
dp[i]=max(0,dp[i])
for j in [c,d]:
if dp[i-j]!=-1 and 100*(dp[i-j]+j)<=e*(i-(dp[i-j]+j)):
dp[i]=max(dp[i],dp[i-j]+j)
stack=0
index=0
for i in range(f+1):
if dp[i]!=0:
if ... |
s491192398 | p03599 | u013408661 | 1554228165 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 417 | a,b,c,d,e,f=map(int,input().split())
dp=[-1]*(f+1)
dp[0]=0
for i in range(f+1):
for j in [a*100,b*100]:
if dp[i-j]!=-1:
dp[i]=max(0,dp[i])
for j in [c,d]:
if dp[i-j]!=-1 and 100*(dp[i-j]+j)<=e*(i-(dp[i-j]+j)):
dp[i]=max(dp[i],dp[i-j]+j)
stack=0
index=0
for i in range(f+1):
if dp[i]!=0:
if ... |
s058190632 | p03599 | u282228874 | 1554131836 | Python | Python (3.4.3) | py | Runtime Error | 57 | 3188 | 443 | A,B,C,D,E,F = map(int,input().split())
W = set()
for i in range(0,F+1,100*A):
for j in range(0,F+1-i,100*B):
W.add(i+j)
S = set()
for i in range(0,F+1,C):
for j in range(0,F+1-i,D):
S.add(i+j)
rate = 0
for w in W:
for s in S:
if 0 < w+s <= F and s/(w+s) <= E/(E+100):
... |
s105318669 | p03599 | u674885198 | 1553826235 | Python | Python (3.4.3) | py | Runtime Error | 219 | 14340 | 783 | a,b,c,d,e,f=map(int,input().split())
lis=[]
for i in range(int(f/(100*a))+1):
for j in range(int(f/(100*b))+1):
if 100*a*i+100*b*j <= f and 100*a*i+100*b*j>f/2:
lis.append(100*a*i+100*b*j)
lis.sort()
suglis=[]
for i in range(int((f*e/(100+e))/c)+1):
for j in range(int((f*e/(100+e))/d)+1):
... |
s537363052 | p03599 | u796942881 | 1553739586 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 828 | A, B, C, D, E, F = map(int, input().split())
ans = {}
def main():
MAX_A = F // (100 * A)
for i in range(MAX_A + 1):
MAX_B = (F - i * 100 * A) // (100 * B)
for j in range(MAX_B + 1):
if i == 0 and j == 0:
continue
a = i * A + j * B
SAT = ... |
s176985421 | p03599 | u796942881 | 1553649486 | Python | Python (3.4.3) | py | Runtime Error | 3156 | 3188 | 692 | A, B, C, D, E, F = map(int, input().split())
def main():
sa = {100 * i * A + 100 * j * B
for i in range(F) for j in range(F)
if 100 * i * A + 100 * j * B <= F and i + j != 0}
sb = {i * C + j * D for i in range(F) for j in range(F)
if i * C + j * D <= F and i + j != 0}
a = s... |
s578512347 | p03599 | u255067135 | 1553454760 | Python | Python (3.4.3) | py | Runtime Error | 158 | 3188 | 625 | A, B, C, D, E, F = map(int, input().split())
waters = set()
sugars = set()
for i in range(F//(A*100)+1):
for j in range(F//(B*100)+1):
if i!=0 or j!=0:
if A*i +B*j <= F:
waters.add(100*A*i+100*B*j)
for i in range(F//(C)+1):
for j in range(F//(D)+1):
if C*i +D*j <= F:
... |
s134149457 | p03599 | u593063683 | 1553360714 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3444 | 1876 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on 2019/3/23
Solved on 2019/3/
@author: shinjisu
"""
# ABC 074 C - Sugar Water
def getIntList(): return [int(x) for x in input().split()]
def zeros(n): return [0]*n
def zeros2(n, m): return [zeros(m) for i in range(n)] # obsoleted zeros((n, m))で代替
class Debu... |
s722775108 | p03599 | u151625340 | 1553191104 | Python | PyPy3 (2.4.0) | py | Runtime Error | 248 | 42864 | 688 | A,B,C,D,E,F = map(int,input().split())
concent = 0
ans = []
for one in range(F//(100*A)+1):
for two in range((F-100*A*one)//(100*B)+1):
for three in range((F-100*A*one-100*B*two)//C+1):
for four in range((F-100*A*one-100*B*two-C*three)//D+1):
water = 100*A*one+100*B*two
... |
s317601111 | p03599 | u707498674 | 1553120633 | Python | Python (3.4.3) | py | Runtime Error | 219 | 3064 | 690 | import math
A,B,C,D,E,F = map(int, input().split())
water = A
suger = 0
for a in range(31):
for b in range(31):
subwater = A * a + B * b
if subwater == 0:
continue
for c in range(151):
subsuger = C * c
if subsuger <= subwater * E:
subsu... |
s640125493 | p03599 | u677440371 | 1552017564 | Python | Python (3.4.3) | py | Runtime Error | 1001 | 91716 | 838 | a, b, c, d, e, f = map(int, input().split())
water = []
for i in range(31):
for j in range(31):
if a * i * 100 + b * j * 100 >= 3000:
break
water.append(a * i * 100 + b * j * 100)
water = sorted(list(set(water)))
sugar = []
for i in range(3001):
for j in range(3001):
... |
s398036106 | p03599 | u649427151 | 1551730242 | Python | Python (3.4.3) | py | Runtime Error | 234 | 13376 | 736 | a,b,c,d,e,f = map(int, input().split())
g = max(a, b)
h = min(a, b)
salt = []
water = []
concentration = 0
for i in range(int(e*f/(c*100)) + 1):
j = 0
while e*f/100 >= c*i +d*j:
salt.append(c*i+d*j)
j += 1
salt.sort()
for i in range(int(f/(100*g))+1):
j = 0
while f >= 100*(g*i+h*j):
... |
s342665798 | p03599 | u649427151 | 1551729896 | Python | Python (3.4.3) | py | Runtime Error | 215 | 13400 | 720 | a,b,c,d,e,f = map(int, input().split())
g = max(a, b)
h = min(a, b)
salt = []
water = []
concentration = 0
for i in range(int(e*f/(c*100)) + 1):
j = 0
while e*f/100 >= c*i +d*j:
salt.append(c*i+d*j)
j += 1
salt.sort()
for i in range(int(f/(100*g))+1):
j = 0
while f >= 100*(g*i+h*j):
... |
s020298919 | p03599 | u496744988 | 1551292187 | Python | Python (3.4.3) | py | Runtime Error | 125 | 22548 | 525 | a,b,c,d,e,f=map(int,input().split())
water = [100*i+100*j for i in range(1,(f//(a*100))+1) for j in range(1,(f//(b*100))+1)]
suger = [c*i+d*j for i in range(0,(f//c)+1) for j in range(0,(f//d)+1)]
print((f//(a*100))+1)
print((f//(b*100))+1)
water = set(water)
suger = set(suger)
print(sorted(water))
print(sorted(suger))... |
s613622780 | p03599 | u496744988 | 1551290259 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 439 | a,b,c,d,e,f=map(int,input().split())
water = [100*i+100*j for i in range(0,int(3000/(a*100))+1) for j in range(0,int(
suger = [c*i+d*j for i in range(0,int(3000/c)+1) for j in range(0,int(3000/d)+1)
water = set(water)
suger = set(suger)
ans=set()
for wa in water:
for su in suger:
if 0 < wa + su <= f and su... |
s733832509 | p03599 | u677440371 | 1550981292 | Python | Python (3.4.3) | py | Runtime Error | 186 | 12820 | 739 | a,b,c,d,e,f = map(int, input().split())
water_list = []
for i in range(f+1):
for j in range(f+1):
water = a * 100 * i + b * 100 * j
if water <= f:
water_list.append(water)
else:
break
sugar_list = []
for i in range(f+1):
for j in range(f+1):
sugar = c * i... |
s908995705 | p03599 | u677440371 | 1550964894 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3444 | 971 | a,b,c,d,e,f = map(int, input().split())
max_a = a * 100 * e * 10 ** (-2)
max_b = b * 100 * e * 10 ** (-2)
sugar_a = [0]
sugar_b = [0]
for i in range(100):
for j in range(100):
sugar_check = c * i + d * j
if a * 100 + sugar_check <= f:
sugar_a.append(sugar_check)
if b * 100 + sug... |
s947299001 | p03599 | u677440371 | 1550963618 | Python | Python (3.4.3) | py | Runtime Error | 1131 | 11908 | 857 | a,b,c,d,e,f = map(int, input().split())
max_a = a * 100 * e * 10 ** (-2)
max_b = b * 100 * e * 10 ** (-2)
sugar_a = []
sugar_b = []
for i in range(1501):
for j in range(1501):
sugar_check = c * i + d * j
if a * 100 + sugar_check <= f:
sugar_a.append(sugar_check)
if b * 100 + su... |
s231007431 | p03599 | u677440371 | 1550963533 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3444 | 851 | a,b,c,d,e,f = map(int, input().split())
max_a = a * 100 * e * 10 ** (-2)
max_b = b * 100 * e * 10 ** (-2)
sugar_a = []
sugar_b = []
for i in range(100):
for j in range(100):
sugar_check = c * i + d * j
if a * 100 + sugar_check <= f:
sugar_a.append(sugar_check)
if b * 100 + sugar... |
s723794558 | p03599 | u099566485 | 1550954428 | Python | Python (3.4.3) | py | Runtime Error | 622 | 3064 | 636 | #074-C
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return input()
w1,w2,s1,s2,c,lim=IL()
l=[]
for i in range(31):
for j in range(31):
w=w1*i*100+w2*j*100
if w<lim:
l.append(w)
ans_c=0
for w in l:
maxs=min(c*w/... |
s946681850 | p03599 | u634461820 | 1550871256 | Python | Python (3.4.3) | py | Runtime Error | 136 | 12480 | 571 | import itertools
Wa,Wb,Ga,Gb,Cmax,Gmax = list(map(int,input().split()))
W = []
G = []
i = -1
while Wa*i*100<=Gmax:
i += 1
j = 0
while Wa*i*100+Wb*j*100<=Gmax:
W.append(Wa*i*100+Wb*j*100)
j += 1
i = -1
while Ga*i<=Gmax:
i += 1
j = 0
while Ga*i+Gb*j<=Gmax:
G.append(Ga*i+Gb*j)
j += 1
W = so... |
s543930997 | p03599 | u367130284 | 1550673182 | Python | Python (3.4.3) | py | Runtime Error | 1009 | 3064 | 478 | a,b,c,d,e,f=map(int,input().split())
sugar=f*e/(e+100)
water=f*100/(e+100)
p=int(sugar//c if c<d else sugar//d)
q=int(water//(100*a) if a<b else water//(100*b))
ans=0
for s in range(q+1):
try:
for t in range(q-s+1):
for r in range(p+1):
for u in range(p-r+1):
x=100*(s*a+t*b)/((s*a+t*b)+100... |
s082896973 | p03599 | u794173881 | 1550022647 | Python | Python (3.4.3) | py | Runtime Error | 2590 | 3064 | 802 | a,b,c,d,e,f = map(int,input().split())
syokuen=[0]
if c == 1 or d == 1:
for i in range(1500+1):
syokuen.append(i)
else:
for i in range(1500//a+1):
for j in range(1500//b+1):
if c*i+d*j not in syokuen and c*i+d*j <=1500 :
syokuen.append(c*i+d*j)
mizu=[0]
for i in range(30):
for j in ra... |
s489362432 | p03599 | u794173881 | 1550021722 | Python | Python (3.4.3) | py | Runtime Error | 3156 | 3064 | 708 | a,b,c,d,e,f = map(int,input().split())
syokuen=[]
for i in range(1500//a):
for j in range(1500//b):
if c*i+d*j not in syokuen and c*i+d*j <=1500 :
syokuen.append(c*i+d*j)
mizu=[]
for i in range(30):
for j in range(30):
if a*i*100 + b*j*100 not in mizu and a*i*100 + b*j*100<=f:
mizu.appen... |
s663579683 | p03599 | u375616706 | 1549948021 | Python | Python (3.4.3) | py | Runtime Error | 82 | 12460 | 1246 | import bisect
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
def concentrate(water, sugar):
if water+sugar == 0:
return 0
else:
return sugar/(water+sugar)
A, B, C, D, E, F = map(int, input().split())
A *= 100
B *= 100
water_list = []
sugar_l... |
s550859463 | p03599 | u763968347 | 1549924384 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 643 | A,B,C,D,E,F = map(int,input().split())
ans_con = 0
max_con = E/(100+E)*100
a = 0
while F > 100*A*a:
b = 0
while F-100*A*a > 100*B*b:
c = 0
while F-100*(A*a+B*b) > C*c and c:
water = 100*(A*a+B*b)
sugar = C*c+D*min((F-100*(A*a+B*b)-C*c)//D, (water/100*E-C*c)//D)
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.