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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s620818494 | p03599 | u102445737 | 1582187810 | Python | PyPy3 (2.4.0) | py | Runtime Error | 230 | 41820 | 985 | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
a,b,c,d,e... |
s333176375 | p03599 | u102445737 | 1582187480 | Python | PyPy3 (2.4.0) | py | Runtime Error | 226 | 41820 | 985 | from sys import stdout
printn = lambda x: stdout.write(str(x))
inn = lambda : int(input())
inl = lambda: list(map(int, input().split()))
inm = lambda: map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 999999999
R = 10**9 + 7
def ddprint(x):
if DBG:
print(x)
a,b,c,d,e... |
s292911457 | p03599 | u595064211 | 1582001316 | Python | Python (3.4.3) | py | Runtime Error | 183 | 3064 | 990 | A, B, C, D, E, F = map(int, input().split())
density = 0
max_density = 0
ans = []
for a in range(31):
if a*A*100> F:
break
for b in range(31):
if a==0 and b==0:
break
if a*A*100+b*B*100>F:
break
for c in range(101):
for d in range(101):
... |
s549405803 | p03599 | u347640436 | 1579971917 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 753 | A, B, C, D, E, F = map(int, input().split())
w = set()
for i in range(F // (100 * A) + 1):
t = F - 100 * a
for j in range(t // (100 * B) + 1):
a = (A * i + B * j) * 100
w.add(a)
w.remove(0)
s = set()
t = E * F // 100
for i in range(t // C + 1):
for j in range(t // D + 1):
b = C * i... |
s680904268 | p03599 | u347640436 | 1579965390 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 733 | A, B, C, D, E, F = map(int, input().split())
w = set()
for i in range(F // (100 * A) + 1):
for j in range(F // (100 * B) + 1):
a = (A * i + B * j) * 100
if a < F:
w.append(a)
w.remove(0)
best_concentration = -1
best_a = -1
best_b = -1
for a in w:
for i in range((F - a) // C + 1):
... |
s975326471 | p03599 | u469700628 | 1579760898 | Python | Python (3.4.3) | py | Runtime Error | 151 | 5936 | 910 | A, B, C, D, E, F = list(map(int, input().split()))
water = set()
sugar = set()
res = {}
noudo = []
counter = max([int(F / A), int(F / B)])
A_counter = int(F / (A * 100))
B_counter = int(F / (B * 100))
for i in range(A_counter + 1):
for j in range(B_counter + 1):
tmp = A * i * 100 + B * 100 * j
if ... |
s043111425 | p03599 | u469700628 | 1579760568 | Python | Python (3.4.3) | py | Runtime Error | 165 | 5936 | 909 | A, B, C, D, E, F = list(map(int, input().split()))
water = set()
sugar = set()
res = {}
noudo = []
counter = max([int(F / A), int(F / B)])
A_counter = int(F / (A * 100))
B_counter = int(F / (B * 100))
for i in range(A_counter + 1):
for j in range(B_counter + 1):
tmp = A * i * 100 + B * 100 * j
if ... |
s479773239 | p03599 | u469700628 | 1579760485 | Python | Python (3.4.3) | py | Runtime Error | 164 | 5936 | 853 | A, B, C, D, E, F = list(map(int, input().split()))
water = set()
sugar = set()
res = {}
noudo = []
counter = max([int(F / A), int(F / B)])
A_counter = int(F / (A * 100))
B_counter = int(F / (B * 100))
for i in range(A_counter + 1):
for j in range(B_counter + 1):
tmp = A * i * 100 + B * 100 * j
if ... |
s446628531 | p03599 | u050024609 | 1579739234 | Python | Python (3.4.3) | py | Runtime Error | 605 | 5308 | 490 | A, B, C, D, E, F = map(int, input().split())
W = sorted(list({a*100*A + b*100*B for a in range(F // 100 // A + 1) for b in range(F // 100 // B + 1) if a*100*A + b*100*B <= F}))
S = [max([c*C + d*D for c in range(int((E*w / 100) / C) + 1) for d in range(int((E*w / 100) / D) + 1) if ((c*C + d*D)*100 <= E*w) and (c*C + d... |
s847598203 | p03599 | u050024609 | 1579142542 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 458 | A, B, C, D, E, F = map(int, input().split())
W = sorted(list({a*100*A + b*100*B for a in range(F // 100 // A + 1) for b in range(F // 100 // B + 1) if a*100*A + b*100*B <= F}))
S = [max([c*C + d*D for c in range((E*w / 100) / C + 1) for d in range((E*w / 100) / D + 1) if ((c*C + d*D)*100 <= E*w) and (c*C + d*D + w <= ... |
s324816499 | p03599 | u747602774 | 1579059056 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 743 | A,B,C,D,E,F = map(int,input().split())
f = F//100
per = -1
#水の量を100g単位ずつ全探索
for w in range(1,f+1):
#そのような水の取り方があるか確認
wt = 0
for b in range(0,w+1,B):
if (w-b)%A == 0:
wt = 1
break
if wt == 0:
continue
water = w*100
sugar = w*E
#砂糖として考えられる量を大きい順に0gまでに全... |
s529513547 | p03599 | u747602774 | 1579058779 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 811 | #F<=3000で100刻みなので、多分全探索すればよさそう
A,B,C,D,E,F = map(int,input().split())
f = F//100
per = -1
#水の量を100g単位ずつ全探索
for w in range(1,f+1):
#そのような水の取り方があるか確認
wt = 0
for b in range(0,w+1,B):
if (w-b)%A == 0:
wt = 1
break
if wt == 0:
continue
water = w*100
sugar = w... |
s365371390 | p03599 | u747602774 | 1579058651 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 573 | A,B,C,D,E,F = map(int,input().split())
f = F//100
per = 0
for w in range(1,f+1):
wt = 0
for b in range(0,w+1,B):
if (w-b)%A == 0:
wt = 1
break
if wt == 0:
continue
water = w*100
sugar = w*E
for s in range(sugar,-1,-1):
st = 0
for d in r... |
s057333879 | p03599 | u747602774 | 1579058593 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3192 | 802 | A,B,C,D,E,F = map(int,input().split())
f = F//100
per = 0
#水の量を100g単位ずつ全探索
for w in range(1,f+1):
#そのような水の取り方があるか確認
wt = 0
for b in range(0,w+1,B):
if (w-b)%A == 0:
wt = 1
break
if wt == 0:
continue
water = w*100
sugar = w*E
#砂糖として考えられる量を大きい順に0gまでに全探... |
s810865825 | p03599 | u747602774 | 1579058568 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 801 | A,B,C,D,E,F = map(int,input().split())
f = F//100
per = 0
#水の量を100g単位ずつ全探索
for w in range(1,f+1):
#そのような水の取り方があるか確認
wt = 0
for b in range(0,w+1,B):
if (w-b)%A == 0:
wt = 1
break
if wt == 0:
continue
water = w*100
sugar = w*E
#砂糖として考えられる量を大きい順に0gまでに全探... |
s462164325 | p03599 | u291766461 | 1578802636 | Python | Python (3.4.3) | py | Runtime Error | 546 | 3064 | 510 | A, B, C, D, E, F = tuple(map(int, input().split()))
max_con = 0
res = None
for i in range(31):
for j in range(31):
for k in range(31):
for l in range(31):
x = 100 * A * i + 100 * B * j
y = C * k + D * l
if x + y != 0 and x + y <= F and y <= (x // 1... |
s866677972 | p03599 | u071416928 | 1578509143 | Python | Python (3.4.3) | py | Runtime Error | 47 | 3064 | 854 | a, b, c, d, e, f = map(int, input().split())
a, b = a*100, b*100
limit_a = f//a +1
limit_b = f//b +1
limit_c = f//c +1
limit_d = f//d +1
rslt = 0
for i in range(limit_a):
for j in range(limit_b):
water = a*i + b*j
if water == 0 or water > f:break
for k in range(limit_c):
for l... |
s940979249 | p03599 | u754022296 | 1578459146 | Python | Python (3.4.3) | py | Runtime Error | 2997 | 3064 | 551 | A, B, C, D, E, F = map(int, input().split())
Swater, sugar, percent = 0, 0, 0
for k in range(F//(100*A) + 1):
for l in range(F//(100*B) + 1):
if k == 0 and l == 0:
continue
M = k*A + l*B
if 100 * M > F:
continue
for x in range(M*E//C + 1):
for y in range(M*E//D + 1):
S = C*x ... |
s022870639 | p03599 | u095021077 | 1577656099 | Python | Python (3.4.3) | py | Runtime Error | 267 | 3064 | 666 | a, b, c, d, e, f=map(int, input().split())
def g(x, y):
if y==0:
return 0
else:
return x/y
maxnodo=g(e, 100+e)
a*=100
b*=100
candnodo=0
q_max=f//b
for q in range(q_max, -1, -1):
p_max=(f-b*q)//a
for p in range(p_max, -1, -1):
s_max=(f-(a*p+b*q))//d
while s_max>0 and g(d*s_max, a*p+b*q+d*s_m... |
s699216654 | p03599 | u161776322 | 1576619501 | Python | Python (3.4.3) | py | Runtime Error | 864 | 10244 | 664 |
A, B, C, D, E, F = map(int, input().split())
water = []
for i in range(F//(A*100) + 1):
for j in range(F//(B*100) + 1):
n = (i*A + j*B)*100
if n <= F:
water.append(n)
water = sorted(list(set(water)))
result = {"0":[0,0]}
noud = []
for i in water:
suger_limit = E*(i//100)
for j... |
s734070476 | p03599 | u161776322 | 1576619453 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 664 |
A, B, C, D, E, F = map(int, input().split())
water = []
for i in range(F//(A*100) + 1):
for j in range(F//(B*100) + 1):
n = (i*A + j*B)*100
if n <= F:
water.append(n)
water = sorted(list(set(water)))
result = {"0",[0,0]}
noud = []
for i in water:
suger_limit = E*(i//100)
for j... |
s898254057 | p03599 | u161776322 | 1576619260 | Python | Python (3.4.3) | py | Runtime Error | 851 | 10248 | 666 |
A, B, C, D, E, F = map(int, input().split())
water = []
for i in range(F//(A*100) + 1):
for j in range(F//(B*100) + 1):
n = (i*A + j*B)*100
if n <= F:
water.append(n)
water = sorted(list(set(water)))
result = {}
noud = []
for i in water:
suger_limit = E*(i//100)
for j in range... |
s522492147 | p03599 | u161776322 | 1576619179 | Python | Python (3.4.3) | py | Runtime Error | 878 | 10164 | 655 |
A, B, C, D, E, F = map(int, input().split())
water = []
for i in range(F//(A*100) + 1):
for j in range(F//(B*100) + 1):
n = (i*A + j*B)*100
if n <= F:
water.append(n)
water = sorted(list(set(water)))
result = {}
noud = []
for i in water:
suger_limit = E*(i//100)
for j in range... |
s969754727 | p03599 | u161776322 | 1576619004 | Python | Python (3.4.3) | py | Runtime Error | 895 | 10164 | 636 |
A, B, C, D, E, F = map(int, input().split())
water = []
for i in range(F//(A*100) + 1):
for j in range(F//(B*100) + 1):
n = (i*A + j*B)*100
if n <= F:
water.append(n)
water = sorted(list(set(water)))
result = {}
noud = []
for i in water:
suger_limit = E*(i//100)
for j in range... |
s276212737 | p03599 | u623819879 | 1576552015 | Python | PyPy3 (2.4.0) | py | Runtime Error | 286 | 42984 | 1879 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def L... |
s216281844 | p03599 | u623819879 | 1576551962 | Python | PyPy3 (2.4.0) | py | Runtime Error | 188 | 38764 | 1878 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def L... |
s449494586 | p03599 | u623819879 | 1576551919 | Python | PyPy3 (2.4.0) | py | Runtime Error | 267 | 42984 | 1738 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def L... |
s777276932 | p03599 | u623819879 | 1576551864 | Python | PyPy3 (2.4.0) | py | Runtime Error | 277 | 43112 | 1862 | from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations,combinations
import sys
import bisect
import string
import math
import time
#import random
def I():
return int(input())
def MI():
return map(int,input().split())
def L... |
s294762195 | p03599 | u711539583 | 1576365819 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38256 | 314 | a, b, c, d, e, f = map(int, input().split())
ans = [0, 0, 0]
for i in range(a+b+2):
for j in range(1,c+d+2):
if i + 100 * j > f:
continue:
if i > j * e:
continue
cand = i / 100 / j
if cand > ans[0]:
ans[0] = cand
ans[1] = i + 100 * j
ans[2] = i
print(ans[1], ans[2]) |
s303045801 | p03599 | u626467464 | 1576304800 | Python | Python (3.4.3) | py | Runtime Error | 72 | 5808 | 818 | import math
a,b,c,d,e,f = map(int,input().split())
water_nodo = 100 /(100 + e)
water_max = f*water_nodo
a_max = math.ceil(water_max / (100*a))
b_max = math.ceil(water_max / (100*b))
water_gaps = []
for i in range(a_max):
for j in range(b_max):
water_gap = water_max - 100*a*i - 100*b*j
if water_gap >= 0:
... |
s678903180 | p03599 | u626467464 | 1576304587 | Python | Python (3.4.3) | py | Runtime Error | 74 | 5808 | 818 | import math
a,b,c,d,e,f = map(int,input().split())
water_nodo = 100 /(100 + e)
water_max = f*water_nodo
a_max = math.ceil(water_max / (100*a))
b_max = math.ceil(water_max / (100*b))
water_gaps = []
for i in range(a_max):
for j in range(b_max):
water_gap = water_max - 100*a*i - 100*b*j
if water_gap >= 0:
... |
s841361188 | p03599 | u088552457 | 1575522518 | Python | Python (3.4.3) | py | Runtime Error | 162 | 12452 | 596 | a, b, c, d, e, f = map(int, input().split())
waters = []
count = 0
for ai in range(int(f/(100*a))):
for bi in range(int(f/(100*b))):
waters.append((ai+1)*100 + bi*100)
waters = list(set(waters))
m = int((f / 100) * e)
sugars = []
for ci in range(int(m/c)):
for di in range(int(m/d) + 1):
if (ci*c)+(di*d)... |
s740540185 | p03599 | u423585790 | 1575499778 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38512 | 1731 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... |
s806168595 | p03599 | u423585790 | 1575499752 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38384 | 1729 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... |
s821278157 | p03599 | u423585790 | 1575498787 | Python | PyPy3 (2.4.0) | py | Runtime Error | 218 | 103248 | 1623 | #!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return... |
s191588400 | p03599 | u470542271 | 1575001578 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 700 | A, B, C, D, E, F = map(int, input().split())
ans = []
max_conc = 0
for a in range(F // 100 + 1):
left = F - 100 * a * A
for b in range(left // 100 + 1):
w = 100 * a * A + 100 * b * B
s_max = min(F - w, w * E // 100)
if s_max >= 0:
for c in range(s_max // C + 1):
... |
s715760070 | p03599 | u470542271 | 1575001218 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3064 | 637 | A, B, C, D, E, F = map(int, input().split())
ans = []
max_conc = 0
for a in range(F // 100 + 1):
for b in range(F // 100 + 1):
w = 100 * a * A + 100 * b * B
s_max = min(F - w, w * E // 100)
if s_max >= 0:
for c in range(s_max // C + 1):
d_max = (s_max - c * C) /... |
s466242232 | p03599 | u363995337 | 1574652701 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 452 | import math
A,B,X = map(int,input().split())
# A * N + B * d(N) yen
check_num = [1,10,100,1000,10000,100000,1000000,10000000,100000000,1000000000]
if((A*1+B*1)>X):
print(0)
else:
flag = True
for i in range(len(check_num)):
if((A*check_num[i]+B*(i+1)) > X):
flag = False
i... |
s531340639 | p03599 | u314089899 | 1573881223 | Python | Python (3.4.3) | py | Runtime Error | 28 | 3064 | 1987 | #074c
A,B,C,D,E,F = map(int, input().split())
#あり得る水量をすべて書き出す
set_water = set()
for i in range(F//(100*A),-1,-1):
for j in range((F-(100*A*i))//(100*B),-1,-1):
water = 100*A*i + 100*B*j
if water not in set_water:
set_water.add(water)
#print(set_water)
set_water_and_sugar = set()
... |
s462840202 | p03599 | u846634344 | 1573766815 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 916 | import math
a, b, c, d, e, f = [int(x) for x in input().split()]
threshold = e / (100 + e) * 100
max_concent = 0
max_total = 0
max_suger = 0
max_suger_try = int(threshold/100*f//c)
for i in range(31):
for j in range(31):
for k in range(max_suger_try):
for l in range(max_suger_try):
... |
s857861368 | p03599 | u846634344 | 1573764992 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 896 | a, b, c, d, e, f = [int(x) for x in input().split()]
threshold = e / (100 + e) * 100
max_concent = 0
max_total = 0
max_suger = 0
max_try_water = int(f / 100 * a)
max_try_suger = int(f / c)
for i in range(max_try):
for j in range(max_try):
for k in range(max_try):
for l in range(max_try): ... |
s648031661 | p03599 | u846634344 | 1573764952 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 896 | a, b, c, d, e, f = [int(x) for x in input().split()]
threshold = e / (100 + e) * 100
max_concent = 0
max_total = 0
max_suger = 0
max_try_water = int(f / 100 * a)
max_try_suger = int(f / c)
for i in range(max_try):
for j in range(max_try):
for k in range(max_try):
for l in range(max_try): ... |
s536816415 | p03599 | u223904637 | 1573450545 | Python | PyPy3 (2.4.0) | py | Runtime Error | 264 | 41180 | 449 | a,b,c,d,e,f=map(int,input().split())
w=set([])
for i in range(31):
for j in range(31):
x=a*i*100+b*j*100
if 0<x<=f:
w.add(x)
s=set([])
for i in range(3001):
for j in range(3001):
y=c*i+d*j
if y<=f:
s.add(y)
tmpn=0
for i in w:
for j in s:
if i+j... |
s225644340 | p03599 | u223904637 | 1573450361 | Python | Python (3.4.3) | py | Runtime Error | 2532 | 3188 | 446 | a,b,c,d,e,f=map(int,input().split())
w=set([])
for i in range(31):
for j in range(31):
x=a*i*100+b*j*100
if x<=f:
w.add(x)
s=set([])
for i in range(3001):
for j in range(3001):
y=c*i+d*j
if y<=f:
s.add(y)
tmpn=0
for i in w:
for j in s:
if i+j<=... |
s531533225 | p03599 | u153902122 | 1573360213 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 655 | A, B, C, D, E, F = map(int, input().split())
ans = [100 * A, 0]
c = 0
for i in range(1, F // (100 * A) + 1):
for j in range((F - 100 * A * i) // (100 * B) + 1):
a = 100 * A * i + 100 * b * j
if a < F:
break
for k in range((F - a) // C + 1):
for l in range((F - a - C ... |
s859335868 | p03599 | u366959492 | 1572995446 | Python | PyPy3 (2.4.0) | py | Runtime Error | 194 | 41584 | 488 | a,b,c,d,e,f=map(int,input().split())
a*=100
b*=100
x=set()
for i in range(0,f+1,a):
for j in range(0,f+1,b):
if 0<(i+j)<=f:
x.add(i+j)
y=set()
for i in range(0,f+1,c):
for j in range(0,f+1,d):
if 0<(i+j)<=f:
y.add(i+j)
ans=[]
for n in x:
for m in y:
if n+m>f:... |
s009342887 | p03599 | u366959492 | 1572995230 | Python | PyPy3 (2.4.0) | py | Runtime Error | 186 | 41328 | 505 | a,b,c,d,e,f=map(int,input().split())
a*=100
b*=100
x=set()
for i in range(0,f+1,a):
for j in range(0,f+1,b):
if 0<(i+j)<=f:
x.add(i+j)
y=set()
for i in range(0,f+1,c):
for j in range(0,f+1,d):
if 0<(i+j)<=f:
y.add(i+j)
ans=[]
noudoma=e/100
for n in x:
for m in y:
... |
s921419627 | p03599 | u366959492 | 1572994988 | Python | PyPy3 (2.4.0) | py | Runtime Error | 193 | 41456 | 517 | a,b,c,d,e,f=map(int,input().split())
a*=100
b*=100
x=set()
for i in range(f//a+2):
for j in range(f//b+2):
if 0<(a*i+b*j)<=f:
x.add(a*i+b*j)
y=set()
for i in range(f//c+2):
for j in range(f//d+2):
if 0<(c*i+d*j)<=f:
y.add(c*i+d*j)
ans=[]
noudoma=e/100
for n in x:
for... |
s789287810 | p03599 | u366959492 | 1572994910 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 41584 | 517 | a,b,c,d,e,f=map(int,input().split())
a*=100
b*=100
x=set()
for i in range(f//a+1):
for j in range(f//b+1):
if 0<(a*i+b*j)<=f:
x.add(a*i+b*j)
y=set()
for i in range(f//c+1):
for j in range(f//d+1):
if 0<(c*i+d*j)<=f:
y.add(c*i+d*j)
ans=[]
noudoma=e/100
for n in x:
for... |
s175810651 | p03599 | u366959492 | 1572994786 | Python | PyPy3 (2.4.0) | py | Runtime Error | 185 | 41328 | 477 | a,b,c,d,e,f=map(int,input().split())
a*=100
b*=100
x=set()
for i in range(f//a+1):
for j in range(f//b+1):
if 0<(a*i+b*j)<=f:
x.add(a*i+b*j)
y=set()
for i in range(f//c+1):
for j in range(f//d+1):
if 0<c*i+d*j<=f:
y.add(c*i+d*j)
ans=[]
noudoma=e/100
for n in x:
for m... |
s075737022 | p03599 | u748241164 | 1572650293 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 39024 | 684 | from sys import stdin
import math
A, B, C, D, E, F = [int(x) for x in stdin.readline().rstrip().split()]
water = set()
for i in range(0, F//(100*A)+1):
for j in range(0, F//(100*B)+1):
water.add(A*i*100+B*j*100)
sugar = set()
capa = math.ceil(F/100)*E
for k in range(0, capa//C+1):
for l in range(0, ca... |
s923930780 | p03599 | u819048695 | 1572643400 | Python | PyPy3 (2.4.0) | py | Runtime Error | 203 | 73012 | 514 | from bisect import bisect
a,b,c,d,e,f=map(int,input().split())
g=f//100
lst=[0]*(g+1)
i=0
for i in range(31):
for j in range(31):
h=a*i+b*j
if h<=g:
lst[h]=1
data=[]
for i in range(g*e//c):
for j in range(g*e//d):
data.append(c*i+d*j)
data.sort()
ans=0
z=[]
for i in range(1,g... |
s929745342 | p03599 | u714642969 | 1572053282 | Python | PyPy3 (2.4.0) | py | Runtime Error | 170 | 38640 | 503 | a,b,c,d,e,f=map(int,input().split())
w_m=(f*100/(100+e))//100*100
s_m=f*e//(100+e)
answ=float('inf')
anss=0
for i in range(w_m//(a*100)+1):
for j in range((w_m-i*a*100)//(b*100)+1):
w=(i*a+j*b)*100
if w!=0:
for k in range(s_m//c+1):
for l in range((s_m-k*c)//d+1):
... |
s540185641 | p03599 | u714642969 | 1572051558 | Python | PyPy3 (2.4.0) | py | Runtime Error | 178 | 39408 | 478 | a,b,c,d,e,f=map(int,input().split())
w_m=f//(100+e)*100
s_m=f//(100+e)*e
w=w_m//(100*a)*(100*a)
s=s_m//c*c
wn=w_m//(100*b)
sc=s_m//c
sd=s_m//d
noudo=0
answ=0
anss=0
for i in range(wn+1):
for j in range(sc+1):
for k in range((s_m-j*c)//d+1):
s=j*c+k*d
if (noudo<s/(s+w)) and (s/(s+w)<=... |
s602504978 | p03599 | u960653324 | 1572033048 | Python | Python (3.4.3) | py | Runtime Error | 1786 | 9184 | 864 | A,B,C,D,E,F = (int(i) for i in input().split())
water_list = []
suger_list = []
for i in range(F):
if 100*A*i <= F:
for j in range(F):
if 100*B*j <= F:
if 100*A*i + 100*B*j <= F:
water_list.append(100*A*i + 100*B*j)
else:
break
else:
break
else:
brea... |
s319988158 | p03599 | u960653324 | 1572032839 | Python | Python (3.4.3) | py | Runtime Error | 3156 | 18424 | 620 | A,B,C,D,E,F = (int(i) for i in input().split())
water_list = []
suger_list = []
for i in range(F):
for j in range(F):
if 100*A*i + 100*B*j <= F:
water_list.append(100*A*i + 100*B*j)
for i in range(F):
for j in range(F):
if C*i + D*i <= F:
suger_list.append(C*i+D*j)
ans = 0
ans_list = []
for... |
s130142276 | p03599 | u960653324 | 1572032809 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 19 | 17 19 22 26 55 2802 |
s627206426 | p03599 | u174434198 | 1572023971 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 995 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0; i < (n); ++i)
#define REPR(i,n) for(ll i=(n); i >= 0; --i)
#define FOR(i, m, n) for(ll i = (m); i < (n); ++i)
#define INF 1e9
int A, B, C, D, E, F;
int main(){
cin >> A >> B >> C >> D >> E >> F;
pair<int, int> ans =... |
s478810878 | p03599 | u174434198 | 1572023878 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 979 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define REP(i,n) for(ll i=0; i < (n); ++i)
#define REPR(i,n) for(ll i=(n); i >= 0; --i)
#define FOR(i, m, n) for(ll i = (m); i < (n); ++i)
#define INF 1e9
int A, B, C, D, E, F;
int main(){
cin >> A >> B >> C >> D >> E >> F;
pair<int, int> ans =... |
s250188444 | p03599 | u489108157 | 1571886060 | Python | Python (3.4.3) | py | Runtime Error | 50 | 3188 | 970 | a,b,c,d,e,f=map(lambda x: int(x), input().split())
dic_w={}
i=0
while True:
if (a*i*100)>f:
break
j=0
while True:
w=(a*i+b*j)*100
if w>f:
break
else:
dic_w[w]=dic_w.get(w,0)+1
j+=1
i+=1
list_w=list(dic_w.keys())
list_w.sort()
dic_s={}
max... |
s986662096 | p03599 | u291766461 | 1571111701 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 387 | A, B, C, D, E, F = tuple(map(int, input().split()))
max_con = 0
res = None
for l in range(100*A, F+1, 100):
if l % (100 * A) == 0 or l % (100 * B) == 0:
for e in range(1, E*(l//100)+1):
if (e % C == 0 or e % D == 0) and l + e <= F:
if max_con < e / (l + e):
m... |
s451456568 | p03599 | u520276780 | 1570226709 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 635 | a, b, c, d, e, f = map(int,input().split( ))
mx = 0
ans = []
for i in range(f//(a*100)+1):
sup_b = f-i*a*100
for j in range(sup_b//(b*100)+1):
wat = i*a*100 + j*b*100
if wat > f or not wat:
continue
sup_sug = min(e*(wat/100), f - wat)
for k in ... |
s708656536 | p03599 | u033606236 | 1569963900 | Python | Python (3.4.3) | py | Runtime Error | 785 | 3064 | 534 | A,B,C,D,E,F = map(int,input().split())
A *= 100
B *= 100
check = 0
for i in range(F//A+1):
for j in range((F-(A*i))//B+1):
if i + j == 0:continue
for k in range(((F-(A*i))-B*j)//C+1):
for l in range((((F-(A*i))-B*j)-C*k)//D+1):
water = A*i+B*j
sugar = C*k+... |
s713471778 | p03599 | u204616996 | 1569878453 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 635 | def solve():
A, B, C, D, E, F = map(int, input().split())
memo = {}
for a in range(31):
for b in range(31):
for c in range(101):
for d in range(101):
w = (100*A)*a + (100*B)*b
s = C*c + D*d
if w ==0:
break
if w+s > F:
break
else:
if w/100... |
s882826306 | p03599 | u204616996 | 1569877596 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 814 | A,B,C,D,E,F = map(int,input().split())
noudo = E/(100+E)
_=min(A,B)
max_noudo=0
ans_weight=0
ans_suger=0
def chk(s,C,D):
i=s//(C%100)
j=s//(D%100)
for _i in range(i+1):
for _j in range(j+1):
if s == C*_i + D*_j:
return True
return False
for water in range(100*_,F+1,10... |
s636769534 | p03599 | u572142121 | 1569167442 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 541 | A, B, C, D, E, F = map(int, input().split(' '))
maxconc = 0.0
maxwater = 100*A
maxconc = 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:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
su... |
s210924262 | p03599 | u572142121 | 1569167415 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 540 | A, B, C, D, E, F = map(int, input().split(' '))
maxconc = 0.0
maxwater = 100*A
maxconc = 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:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
sug... |
s201848802 | p03599 | u572142121 | 1569134796 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 529 | A,B,C,D,E,F=map(int,input().split())
maxconc = 0.0
maxwater = 100*A
maxconc = 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:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
sugar = max(su... |
s026620614 | p03599 | u572142121 | 1569134363 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 523 | A,B,C,D,E,F=map(int,input().split())
maxconc = 0.0
maxwater = 100*A
maxconc = 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:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
sugar = max(sugar... |
s685605661 | p03599 | u572142121 | 1569134058 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3064 | 508 | A,B,C,D,E,F=map(int,input().split())
maxconc = 0.0
maxwater = 100*A
maxconc = 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:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
sugar = max(sugar... |
s507555986 | p03599 | u572142121 | 1569133973 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 511 | A,B,C,D,E,F=map(int,input().split())
maxconc = 0
maxwater = 100*A
maxconc = 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:
continue
S =min(E*(A*i+B*j),F-100*(A*i+B*j))
sugar=0
for c in range(S//C+1):
d = (S-c*C)//D
sugar = max(sugar,c... |
s726433235 | p03599 | u891635666 | 1568801813 | Python | Python (3.4.3) | py | Runtime Error | 823 | 3188 | 530 | a, b, c, d, e, f = map(int, input().split())
res = None
m = 0
for aa in range(0, f, 100 * a):
for bb in range(0, f, 100 * b):
w = aa + bb
if w == 0 or aa + bb > f:
continue
r = f - w
for cc in range(0, r, c):
for dd in range(0, r, d):
s = cc + ... |
s527008567 | p03599 | u799479335 | 1568683497 | Python | Python (3.4.3) | py | Runtime Error | 868 | 3064 | 496 | A,B,C,D,E,F = map(int, input().split())
val_max = 0
for a in range(0,1+F//(100*A)):
for b in range(0,1+(F-100*A*a)//(100*B)):
if (a==0)&(b==0):
continue
for c in range(0,1+(F-100*A*a-100*B*b)//C):
for d in range(0,1+(F-100*A*a-100*B*b-C*c)//D):
if C*c+D*d <= E*(A*a+B*b):
val = (... |
s704008780 | p03599 | u799479335 | 1568683416 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 458 | A,B,C,D,E,F = map(int, input().split())
val_max = 0
for a in range(0,1+F//(100*A)):
for b in range(0,1+(F-100*A*a)//(100*B)):
for c in range(0,1+(F-100*A*a-100*B*b)//C):
for d in range(0,1+(F-100*A*a-100*B*b-C*c)//D):
if C*c+D*d <= E*(A*a+B*b):
val = (C*c+D*d)/(100*A*a+100*B*b+C*c+D*d)
... |
s639819767 | p03599 | u799479335 | 1568683309 | Python | Python (3.4.3) | py | Runtime Error | 782 | 3064 | 458 | A,B,C,D,E,F = map(int, input().split())
val_max = 0
for a in range(1,1+F//(100*A)):
for b in range(0,1+(F-100*A*a)//(100*B)):
for c in range(0,1+(F-100*A*a-100*B*b)//C):
for d in range(0,1+(F-100*A*a-100*B*b-C*c)//D):
if C*c+D*d <= E*(A*a+B*b):
val = (C*c+D*d)/(100*A*a+100*B*b+C*c+D*d)
... |
s827021661 | p03599 | u296518383 | 1568434821 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3188 | 704 | A,B,C,D,E,F=map(int,input().split())
water=[0]*3001
if 100*A<3001: water[100*A]=100*A
if 100*B<3001: water[100*B]=100*B
for i in range(3001):
if water[i]>0:
if i+100*A<3001: water[i+100*A]=i+100*A
if i+100*B<3001: water[i+100*B]=i+100*B
for i in range(1,3001):
if water[i]==0:
water[i]=water[i-1]
#print... |
s946984660 | p03599 | u296518383 | 1568434651 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3188 | 674 | A,B,C,D,E,F=map(int,input().split())
water=[0]*3001
water[100*A]=100*A
water[100*B]=100*B
for i in range(3001):
if water[i]>0:
if i+100*A<3001: water[i+100*A]=i+100*A
if i+100*B<3001: water[i+100*B]=i+100*B
for i in range(1,3001):
if water[i]==0:
water[i]=water[i-1]
#print(water)
suger=[0]*3001
suger[... |
s913261395 | p03599 | u386819480 | 1568176710 | Python | Python (3.4.3) | py | Runtime Error | 195 | 12464 | 1475 | #!/usr/bin/env python3
import sys
from math import ceil, floor
def solve(A: int, B: int, C: int, D: int, E: int, F: int):
x = []
y = []
for i in range(ceil(F/(100*A))+1):
for j in range(ceil(F/(100*B))+1):
dx = 100*A*i+100*B*j
if(100*min(A,B) <= dx <= F):
... |
s610635507 | p03599 | u638282348 | 1567815048 | Python | Python (3.4.3) | py | Runtime Error | 124 | 3188 | 996 | A, B, C, D, E, limit = map(int, input().rstrip("\n").split())
target_rate = E * 100 / (100 + E)
water_vars = {(i * A + j * B) * 100 for i in range(limit // (100 * A) + 1) for j in range(limit // (100 * B) + 1) if (i * A + j * B) * 100 <= limit}
water_vars = sorted(water_vars)
ans_solution = 0
ans_sugar = 0
min_rate_de... |
s048826686 | p03599 | u214434454 | 1567809911 | Python | Python (3.4.3) | py | Runtime Error | 1266 | 12440 | 620 | a, b, c, d, e, f = map(int, input().split())
max_a = f // (100*a)
max_b = f // (100*b)
max_c = f // c
max_d = f // d
wat = []
sug = []
for i in range(max_a + 1):
for j in range(max_b + 1):
w = 100 * a * i + 100 * b * j
if w <= f and w > 0:
wat.append(w)
for i in range(max_c + 1):
for... |
s860382253 | p03599 | u214434454 | 1567809627 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 620 | a, b, c, d, e, f = map(int, input().split())
max_a = f // (100*a)
max_b = f // (100*b)
max_c = f // c
max_d = f // d
wat = []
sug = []
for i in range(max_a + 1):
for j in range(max_b + 1):
w = 100 * a * i + 100 * b * j
if w =< f and w > 0:
wat.append(w)
for i in range(max_c + 1):
for... |
s424135163 | p03599 | u214434454 | 1567809288 | Python | Python (3.4.3) | py | Runtime Error | 1221 | 12440 | 619 | a, b, c, d, e, f = map(int, input().split())
max_a = f // (100*a)
max_b = f // (100*b)
max_c = f // c
max_d = f // d
wat = []
sug = []
for i in range(max_a + 1):
for j in range(max_b + 1):
w = 100 * a * i + 100 * b * j
if w < f and w > 0:
wat.append(w)
for i in range(max_c + 1):
for ... |
s059506482 | p03599 | u214434454 | 1567809262 | Python | Python (3.4.3) | py | Runtime Error | 1252 | 12440 | 619 | a, b, c, d, e, f = map(int, input().split())
max_a = f // (100*a)
max_b = f // (100*b)
max_c = f // c
max_d = f // d
wat = []
sug = []
for i in range(max_a + 1):
for j in range(max_b + 1):
w = 100 * a * i + 100 * b * j
if w < f and w > 0:
wat.append(w)
for i in range(max_c + 1):
for ... |
s732025731 | p03599 | u266874640 | 1567789382 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 349 | A, B, C, D, E, F = map(int,input().split())
dp = [0] * 31
ans = 0
MAX = 0
for i in range(1,31):
dp[i] = max(i*E//C*C, i*E//D*D, i*E//(C+D)*(C+D))
for i in range(1,31):
if 100*i+dp[i] <= F:
result = (100*dp[i])/100*i+dp[i]
if result > MAX:
MAX = result
ans = (100*i+dp[i], ... |
s513131180 | p03599 | u698176039 | 1567544177 | Python | PyPy3 (2.4.0) | py | Runtime Error | 305 | 41692 | 715 | A,B,C,D,E,F = map(int,input().split())
maxconc = 0
for i in range(31):
for j in range(31):
water = A*i + B*j
if 100 * water > F:continue
loopk = E*water // C + 1
loopl = E*water // D + 1
for k in range(loopk):
for l in range(loopl):
sugar... |
s736023485 | p03599 | u698176039 | 1567543641 | Python | PyPy3 (2.4.0) | py | Runtime Error | 247 | 42348 | 652 | A,B,C,D,E,F = map(int,input().split())
maxconc = 0
for i in range(31):
for j in range(31):
for k in range(31):
for l in range(31):
water = A*i + B*j
sugar = C*k + D*l
if 100*water + sugar > F or 100*water + sugar == 0:continue
if s... |
s101600061 | p03599 | u698176039 | 1567543635 | Python | Python (3.4.3) | py | Runtime Error | 425 | 3064 | 652 | A,B,C,D,E,F = map(int,input().split())
maxconc = 0
for i in range(31):
for j in range(31):
for k in range(31):
for l in range(31):
water = A*i + B*j
sugar = C*k + D*l
if 100*water + sugar > F or 100*water + sugar == 0:continue
if s... |
s089742060 | p03599 | u897328029 | 1567195142 | Python | Python (3.4.3) | py | Runtime Error | 104 | 12584 | 1281 | # https://atcoder.jp/contests/abc074/tasks/arc083_a
# C - Sugar Water
import math
w_A, w_B, s_C, s_D, limit_E, max_F = list(map(int, input().split()))
# それ以上溶かすことができるか
# それ以上重量を増やせるか
# 取りうる水の組み合わせ
w_A_list = [w_A * x * 100 for x in range(math.floor(max_F / (w_A * 100)) + 1)]
w_B_list = [w_B * x * 100 for x in range(m... |
s122335111 | p03599 | u617515020 | 1566954046 | Python | Python (3.4.3) | py | Runtime Error | 160 | 22444 | 767 | A,B,C,D,E,F = map(int,input().split())
a_limit = int(-(-F//(100*A)))
b_limit = int(-(-F//(100*B)))
c_limit = int(-(-F*E//(100*C)))
d_limit = int(-(-F*E//(100*D)))
water_cand = []
for i in range(a_limit):
for j in range(b_limit):
water_cand.append(100*A*i+100*B*j)
water_cand = [x for x in list(set(water_cand)) ... |
s089398970 | p03599 | u617515020 | 1566953800 | Python | Python (3.4.3) | py | Runtime Error | 164 | 22444 | 746 | A,B,C,D,E,F = map(int,input().split())
a_limit = int(-(-F//(100*A)))
b_limit = int(-(-F//(100*B)))
c_limit = int(-(-F*E//(100*C)))
d_limit = int(-(-F*E//(100*D)))
water_cand = []
for i in range(a_limit):
for j in range(b_limit):
water_cand.append(100*A*i+100*B*j)
water_cand = [x for x in list(set(water_cand)) i... |
s570363503 | p03599 | u617515020 | 1566953734 | Python | Python (3.4.3) | py | Runtime Error | 159 | 22444 | 764 | A,B,C,D,E,F = map(int,input().split())
a_limit = int(-(-F//(100*A)))
b_limit = int(-(-F//(100*B)))
c_limit = int(-(-F*E//(100*C)))
d_limit = int(-(-F*E//(100*D)))
water_cand = []
for i in range(a_limit):
for j in range(b_limit):
water_cand.append(100*A*i+100*B*j)
water_cand = [x for x in list(set(water_cand)) i... |
s382287472 | p03599 | u573272932 | 1566684335 | Python | Python (3.4.3) | py | Runtime Error | 161 | 3188 | 615 | A, B, C, D, E, F = map(int, input().split())
sato = set()
miz = set()
for i in range(F//100//A + 1):
for j in range(F//100//B + 1):
if i*A + j*B <= F//100:
miz.add((i*A + j*B)*100)
for i in range(F//C + 1):
for j in range(F//D + 1):
if i*C + j*D <= F:
sato.add(i*C + j*D)
miz = list(miz)
sato = list(sato)
#... |
s321997101 | p03599 | u573272932 | 1566684256 | Python | Python (3.4.3) | py | Runtime Error | 158 | 3188 | 609 | A, B, C, D, E, F = map(int, input().split())
sato = set()
miz = set()
for i in range(F//100//A + 1):
for j in range(F//100//B + 1):
if i*A + j*B <= F//100:
miz.add((i*A + j*B)*100)
for i in range(F//C + 1):
for j in range(F//D + 1):
if i*C + j*D <= F:
sato.add(i*C + j*D)
miz = list(miz)
sato = list(sato)
#... |
s202194421 | p03599 | u187516587 | 1566598319 | Python | PyPy3 (2.4.0) | py | Runtime Error | 210 | 40940 | 507 | A,B,C,D,E,F=map(int,input().split())
w=set()
s=set()
for i in range(31):
for j in range(16):
if 100*(A*i+B*j)<=F:
w.add(100*(A*i+B*j))
for i in range(1501):
for j in range(751):
if C*i+D*j<=F/2:
s.add(C*i+D*j)
w=list(w)
w.sort()
del w[0]
s=list(s)
s.sort()
M=-1
for i in w... |
s093152350 | p03599 | u187516587 | 1566597886 | Python | PyPy3 (2.4.0) | py | Runtime Error | 216 | 41580 | 506 | A,B,C,D,E,F=map(int,input().split())
w=set()
s=set()
for i in range(31):
for j in range(16):
if 100*(A*i+B*j)<=F:
w.add(100*(A*i+B*j))
for i in range(1501):
for j in range(751):
if C*i+D*j<=F/2:
s.add(C*i+D*j)
w=list(w)
w.sort()
del w[0]
s=list(s)
s.sort()
M=0
for i in w:... |
s869472225 | p03599 | u187516587 | 1566597707 | Python | PyPy3 (2.4.0) | py | Runtime Error | 195 | 41068 | 497 | A,B,C,D,E,F=map(int,input().split())
w=set()
s=set()
for i in range(31):
for j in range(16):
if 100*(A*i+B*j)<=F:
w.add(100*(A*i+B*j))
for i in range(1501):
for j in range(751):
if C*i+D*j<=F/2:
s.add(C*i+D*j)
w=list(w)
del w[0]
s=list(s)
s.sort()
M=0
for i in w:
for ... |
s982110933 | p03599 | u187516587 | 1566590955 | Python | PyPy3 (2.4.0) | py | Runtime Error | 205 | 41312 | 481 | A,B,C,D,E,F=map(int,input().split())
w=set()
s=set()
for i in range(31):
for j in range(16):
if 100*(A*i+B*j)<=F:
w.add(100*(A*i+B*j))
for i in range(1501):
for j in range(751):
if C*i+D*j<=F/2:
s.add(C*i+D*j)
w=list(w)
del w[0]
s=list(s)
s.sort()
a=0
M=0
for i in w:
... |
s559055753 | p03599 | u187516587 | 1566590833 | Python | Python (3.4.3) | py | Runtime Error | 425 | 3188 | 481 | A,B,C,D,E,F=map(int,input().split())
w=set()
s=set()
for i in range(31):
for j in range(16):
if 100*(A*i+B*j)<=F:
w.add(100*(A*i+B*j))
for i in range(1501):
for j in range(751):
if C*i+D*j<=F/2:
s.add(C*i+D*j)
w=list(w)
del w[0]
s=list(s)
s.sort()
a=0
M=0
for i in w:
... |
s250756890 | p03599 | u091051505 | 1565725796 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 666 | a, b, c, d, e, f = map(int, input().split())
a_list = set([])
b_list = set([])
for i in range((f // a) + 1):
for j in range((f // b) + 1):
if 0 < ((a*i) + (b*j)) * 100 <= f:
a_list.add(((a*i)+(b*j))*100)
for i in range((f // c) + 1):
for j in range((f // d) + 1):
if ((c*i) + (d*j)) <... |
s957396771 | p03599 | u528720841 | 1565372247 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2212 | #include <bits/stdc++.h>
#include <vector>
#include <numeric>
#define PI 3.14159265358979323846
#define MAXINF (1e18L)
#define INF (1e9L)
#define EPS (1e-9)
#define MOD ((ll)(1e9+7))
#define REP(i, n) for(int i=0;i<int(n);++i)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define RREP(i, n) for(int i=int(n)-1;i>=0;--i)
#... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.