input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目を入れる場合vs入れない場合（前の段階から足し合わせることで価値がj以上になる場合）
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i][j], dp[i][j - v[i]] + w[i])
else:
dp[i + 1][j] = dp[i][j]
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans) | N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
Vi=[0] * N
for i in range(N):
if i==0:
Vi[i]=v[i]
else:
Vi[i]=Vi[i-1]+v[i]
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(Vi[i] + 1):
# i+1番目を入れる場合vs入れない場合（前の段階から足し合わせることで価値がj以上になる場合）
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i][j], dp[i][j - v[i]] + w[i])
else:
dp[i + 1][j] = dp[i][j]
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans) | p03164 |
import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, w = list(map(int, input().rstrip('\n').split()))
dp = [10 ** 10] * (1000 * n + 1)
dp[0] = 0
mw = 0
for _ in range(n):
wv, vv = list(map(int, input().rstrip('\n').split()))
for i in range(1000 * n - vv, -1, -1):
dp[i+vv] = min(dp[i+vv], dp[i] + wv)
mt = 0
for i in range(len(dp)):
if dp[i] <= w:
mt = max(mt, i)
print(mt)
if __name__ == '__main__':
solve()
| import sys
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n, w = list(map(int, input().rstrip('\n').split()))
dp = [10 ** 10] * (n * 10 ** 3 + 1)
dp[0] = 0
mv = 0
for i in range(n):
wv, vv = list(map(int, input().rstrip('\n').split()))
for j in range(mv, -1, -1):
dp[j+vv] = min(dp[j+vv], dp[j] + wv)
mv = max(mv, j+vv if dp[j+vv] != 10 ** 10 else mv)
mi = 0
for i in range(len(dp)):
if dp[i] <= w:
mi = i
print(mi)
if __name__ == '__main__':
solve()
| p03164 |
#import
#import math
#import numpy as np
#= int(input())
#= input()
N, W = list(map(int, input().split()))
#= list(map(int, input().split()))
#= [input(), input()]
x = [list(map(int, input().split())) for _ in range(N)]
dp = [[10**10] * (10 ** 5 + 10) for _ in range(N + 1)]
dp[0][0] = 0
# i:N個目 j:価値
for i, (w, v) in enumerate(x, 1):
for j in range(10**5 + 1):
dp[i][j] = dp[i - 1][j]
if j != 0 and v <= j:
dp[i][j] = min(dp[i][j], dp[i - 1][j - v] + w)
for i in range(10 ** 5, -1, -1):
if dp[-1][i] <= W:
print(i)
exit()
| #!/usr/bin/env python3
#import
#import math
#import numpy as np
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
dp = [10 ** 10] * (10 ** 5 + 1)
dp[0] = 0
for w, v in wv:
for i in range(10 ** 5, 0, -1):
if i - v < 0:
break
dp[i] = min(dp[i], dp[i - v] + w)
for i in range(10 ** 5, 0, -1):
if dp[i] <= W:
print(i)
exit()
| p03164 |
N,W = list(map(int,input().split()))
src = [tuple(map(int,input().split())) for i in range(N)]
dp = [{0:0} for i in range(N+1)]
for i,(w,v) in enumerate(src):
for v0,w0 in list(dp[i].items()):
if v0 in dp[i+1]:
dp[i+1][v0] = min(dp[i+1][v0], w0)
else:
dp[i+1][v0] = w0
if w0+w > W: continue
if v0+v in dp[i+1]:
dp[i+1][v0+v] = min(dp[i+1][v0+v], w0+w)
else:
dp[i+1][v0+v] = w0+w
print((max(dp[-1].keys()))) | N,W = list(map(int,input().split()))
wv = [tuple(map(int,input().split())) for i in range(N)]
dp = [{} for i in range(N+1)]
dp[0][0] = 0
for i,(w,v) in enumerate(wv):
for v0,w0 in list(dp[i].items()):
if v0 in dp[i+1]:
dp[i+1][v0] = min(dp[i+1][v0], w0)
else:
dp[i+1][v0] = w0
if w0+w > W: continue
if v0+v in dp[i+1]:
dp[i+1][v0+v] = min(dp[i+1][v0+v], w0+w)
else:
dp[i+1][v0+v] = w0+w
print((max(dp[-1].keys()))) | p03164 |
def main():
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
max_v = max(v)
dp = [[float('inf')] * (max_v * N + 5) for _ in range(N + 5)]
dp[0][0] = 0
for i in range(N):
for j in range(max_v * N):
if j + v[i] <= max_v * N:
dp[i+1][j + v[i]] = min(dp[i+1][j + v[i]], dp[i][j] + w[i])
dp[i+1][j] = min(dp[i+1][j], dp[i][j])
ans = 0
for j in range(max_v * N + 1):
if dp[N][j] <= W:
ans = j
print(ans)
if __name__ == "__main__":
main() | def main():
N, W = list(map(int, input().split()))
weight = [0] * N
value = [0] * N
for i in range(N):
weight[i], value[i] = list(map(int, input().split()))
V = sum(value)
dp = [[float('inf')] * (V + 5) for _ in range(N + 5)]
dp[0][0] = 0
for i in range(N):
for v in range(V+1):
if v - value[i] >= 0:
dp[i+1][v] = min(dp[i][v-value[i]] + weight[i], dp[i][v])
else:
dp[i+1][v] = dp[i][v]
ans = 0
for v in range(V+1):
if dp[N][v] <= W:
ans = v
print(ans)
if __name__ == "__main__":
main() | p03164 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
"""
for j in range(V + 1):
dp[0][j] = 0
"""
dp[0][0] = 0
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
for i in range(N):
for j in range(V + 1):
# i+1番目を選ぶ場合
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
# i+1番目を選ばない場合
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
# print(dp)
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| p03164 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目を選ぶ場合
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
# i+1番目を選ばない場合
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| p03164 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目を選ぶ場合
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
# i+1番目を選ばない場合
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
if j - v[i] >= 0:
dp[i + 1][j] = dp[i][j - v[i]] + w[i]
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| p03164 |
n,k = list(map(int,input().split()))
w=[]
v=[]
MAX_N = 110
MAX_V=100100
dp =[[float("inf") for i in range(MAX_V)] for j in range(MAX_N)]
dp[0][0] = 0
for i in range(n):
a,b = list(map(int,input().split()))
w.append(a)
v.append(b)
for i in range(n):
for sum_v in range(MAX_V):
if sum_v - v[i] >=0:
dp[i+1][sum_v]=min(dp[i][sum_v],dp[i][sum_v - v[i]] + w[i])
dp[i+1][sum_v]=min(dp[i][sum_v],dp[i+1][sum_v])
for sum_v in range(MAX_V):
if dp[n][sum_v] <= k:
res = sum_v
print(res) | N, W = list(map(int, input().split()))
a = []
for i in range(N):
x,y = list(map(int,input().split()))
a.append([x,y])
max_v, inf = 10**5, float("inf")
dp = [0] + [inf]*max_v
for w, v in a:
for i, j in zip(list(range(max_v-v, -1, -1)), list(range(max_v, -1, -1))):
if dp[i]+w <= W and dp[j] > dp[i]+w:
dp[j] = dp[i]+w
for weight, value in zip(dp[::-1], list(range(max_v, -1, -1))):
if weight != inf:
print(value)
break | p03164 |
n, w = list(map(int, input().split()))
weights, values = list(zip(*[tuple(map(int, input().split())) for _ in range(n)]))
UV = 10**5
INF = 10**10
dp = [[INF]*(UV+1) for _ in range(n+1)]
for i in range(n+1):
dp[i][0] = 0
for i in range(1, n+1):
for j in range(1, UV+1):
dp[i][j] = dp[i-1][j]
if 0 <= j-values[i-1]:
dp[i][j] = min(dp[i][j], dp[i-1][j-values[i-1]]+weights[i-1])
ans = 0
for i in reversed(list(range(UV+1))):
if dp[-1][i] <= w:
ans = i
break
print(ans) | n, w = list(map(int, input().split()))
weights, values = list(zip(*[tuple(map(int, input().split())) for _ in range(n)]))
UV = 10**5
INF = 10**10
dp = [INF]*(UV+1)
dp[0] = 0
for i in range(1, n+1):
for j in reversed(list(range(1, UV+1))):
if j-values[i-1] < 0:
continue
dp[j] = min(dp[j], dp[j-values[i-1]]+weights[i-1])
ans = 0
for j in reversed(list(range(UV+1))):
if dp[j] <= w:
ans = j
break
print(ans)
| p03164 |
# coding: utf-8
# Your code here!
# coding: utf-8
# Your code here!
N,W=list(map(int,input().split()))
l=[10**10]*(10**5+1)
l[0]=0
dp=l[:]
#indexが価値 itemが重さ
for i in range(N):
w,v=list(map(int,input().split()))
for index,item in enumerate(l):
if item!=10**10 and item+w<=W:
dp[index+v]=min(l[index+v],item+w)
l=dp[:]
ans=0
for index, item in enumerate(l):
if item!=10**10:
ans=index
else:
continue
print(ans)
| # coding: utf-8
# Your code here!
N,W=list(map(int,input().split()))
jwels=[]
for _ in range(N):
jwels.append(list(map(int,input().split())))
dp=[10**10]*(10**5+1)
dp[0]=0
for w,v in jwels:
for i in range(10**5+1)[::-1]:
if dp[i]!=10**10 and i+v<=10**5:
dp[i+v]=min(dp[i]+w,dp[i+v])
#print(dp[:100])
for i in range(10**5+1)[::-1]:
if dp[i]<=W:
print(i)
break
| p03164 |
N, W = list(map(int, input().split()))
MAX_V = N * (10 ** 3)
w, v = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [[10**9+7 for _ in range(MAX_V + 1)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(MAX_V + 1):
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i][j],dp[i][j - v[i]] + w[i])
else:
dp[i + 1][j] = dp[i][j]
mv = 0
for i in range(MAX_V + 1):
if dp[N][i] <= W:
mv = i
print(mv)
| N, W = list(map(int, input().split()))
MAX_V = N * (10 ** 3)
w, v = [], []
for _ in range(N):
a, b = list(map(int, input().split()))
w.append(a)
v.append(b)
dp = [10**9+7 for _ in range(MAX_V + 1)]
dp[0] = 0
for i in range(N):
for j in range(MAX_V, -1, -1):
if j - v[i] >= 0:
dp[j] = min(dp[j],dp[j - v[i]] + w[i])
else:
dp[j] = dp[j]
mv = 0
for i in range(MAX_V + 1):
if dp[i] <= W:
mv = i
print(mv)
| p03164 |
N, W = list(map(int, input().split()))
items = [None] * N
for n in range(N):
w, v = list(map(int, input().split()))
items[n] = (w, v)
V = 10 ** 6 + 1
dp = [[10 ** 9 + 1] * V for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V):
w, v = items[i]
if j >= v:
dp[i + 1][j] = min(dp[i][j - v] + w, dp[i][j])
else:
dp[i + 1][j] = dp[i][j]
ans = 0
for v in range(V):
if dp[N][v] <= W:
ans = v
print(ans)
| N, W = list(map(int, input().split()))
items = [None] * N
for n in range(N):
w, v = list(map(int, input().split()))
items[n] = (w, v)
V = 10 ** 5 + 1
dp = [[10 ** 9 + 1] * V for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V):
w, v = items[i]
if j >= v:
dp[i + 1][j] = min(dp[i][j - v] + w, dp[i][j])
else:
dp[i + 1][j] = dp[i][j]
ans = 0
for v in range(V):
if dp[N][v] <= W:
ans = v
print(ans)
| p03164 |
N, W = [int(i) for i in input().split()]
weight, value = [0] * (N + 1), [0] * (N + 1)
for i in range(1, N + 1):
weight[i], value[i] = [int(i) for i in input().split()]
#%%
sum_value = sum(value)
dp = [[float("inf")] * (sum_value + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
for j in range(sum_value + 1):
if j >= value[i]:
dp[i][j] = weight[i] + dp[i - 1][j - value[i]]
dp[i][j] = min(dp[i][j], dp[i -1][j])
ans = 0
for i in range(sum_value + 1):
if dp[N][i] <= W:
ans = i
print(ans)
| N, W = [int(i) for i in input().split()]
weight, value = [0] * (N + 1), [0] * (N + 1)
for i in range(1, N + 1):
weight[i], value[i] = [int(i) for i in input().split()]
#%%
sum_value = sum(value)
dp = [[float("inf")] * (sum_value + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(1, N + 1):
for j in range(sum_value + 1):
if j >= value[i]:
dp[i][j] = min(dp[i - 1][j], weight[i] + dp[i - 1][j - value[i]])
else:
dp[i][j] = dp[i -1][j]
ans = 0
for i in range(sum_value + 1):
if dp[N][i] <= W:
ans = i
print(ans) | p03164 |
N, W = [int(_) for _ in input().split()]
WV = [[int(_) for _ in input().split()] for _ in range(N)]
dp = {}
dp[0] = 0
for w, v in WV:
dp_o = dp.copy()
for k in dp_o:
if k + w <= W:
dp[k + w] = max(dp_o.get(k + w, 0), dp_o[k] + v)
print((max([v for k, v in list(dp.items())])))
| N, W = [int(_) for _ in input().split()]
WV = [[int(_) for _ in input().split()] for _ in range(N)]
dp = {}
dp[0] = 0
for w, v in WV:
dp_o = dp.copy()
for k in dp_o:
dp[k + v] = min(dp_o.get(k + v, float('inf')), dp_o[k] + w)
print((max([k for k, v in list(dp.items()) if v <= W])))
| p03164 |
from collections import defaultdict
N, W = list(map(int, input().split()))
dp = defaultdict(int)
dp[0] = 0
idx2check = {0}
for _ in range(N):
w, v = list(map(int, input().split()))
new_idx2check = set()
for k in idx2check:
dp[k + w] = max(dp[k + w], dp[k] + v)
new_idx2check.add(k+w)
idx2check |= new_idx2check
ans = 0
for k, v in list(dp.items()):
if k <= W:
ans = max(ans, v)
print(ans)
| from collections import defaultdict
N, W = list(map(int, input().split()))
dp = defaultdict(lambda: 1e9)
dp[0] = 0
ans = 0
for _ in range(N):
w, v = list(map(int, input().split()))
keys = sorted(list(dp.keys()), reverse=True)
for k in keys:
dp[k + v] = min(dp[k + v], dp[k] + w)
if dp[k + v] <= W:
ans = max(ans, k + v)
print(ans)
| p03164 |
# coding: utf-8
# Your code here!
n,W = [int(i) for i in input().split()]
wv = [[int(i) for i in input().split()] for j in range(n)] # 縦「n」行
V=10**5
MAX=10**12
dp = [MAX]*(V+1)
dp[0]=0
newdp = [MAX]*(V+1)
for i in range(n):
w, v = wv[i]
for j in range(V+1):
newdp[j] = dp[j]
for j in range(V+1):
if j+v <= V:
newdp[j+v] = min(dp[j] + w, newdp[j+v])
newdp, dp = dp, newdp
# print(dp)
print((max([i for i,c in enumerate(dp) if c <= W])))
#print(dp) | # coding: utf-8
# Your code here!
n,W = [int(i) for i in input().split()]
wv = [[int(i) for i in input().split()] for j in range(n)] # 縦「n」行
V=10**5
MAX=10**12
dp = [MAX]*(V+1)
dp[0]=0
newdp = [MAX]*(V+1)
for i in range(n):
w, v = wv[i]
newdp = dp[:]
for j in range(V+1):
if j+v <= V:
newdp[j+v] = min(dp[j] + w, newdp[j+v])
newdp, dp = dp, newdp
# print(dp)
print((max([i for i,c in enumerate(dp) if c <= W])))
#print(dp)
| p03164 |
a= input().split()
N = int(a[0])
W = int(a[1])
wv_list = []
max_value = 0
#価値と重さのやつをリストにしてる
for i in range(N):
b = input().split()
w = int(b[0])
v = int(b[1])
max_value += v
wv_list.append([w, v])
#初期化
#とりあえず、全部最大になるように
n_list = [[float('inf') for i in range(max_value + 1)] for j in range(N)]
#
n_list[0][wv_list[0][1]] = wv_list[0][0]
for i in range(1, N):
for j in range(max_value):
s = j + wv_list[i][1]
if s <= max_value:
n_list[i][s] = min(n_list[i - 1][j] + wv_list[i][0], n_list[i][s])
n_list[i][j] = min(n_list[i - 1][j], n_list[i][j])
n_list[i][wv_list[i][1]] = wv_list[i][0]
for i in range(1, max_value):
if n_list[-1][-i] <= W:
print((max_value - i + 1))
break
| a= input().split()
N = int(a[0])
W = int(a[1])
wv_list = []
max_value = 0
#価値と重さのやつをリストにしてる
for i in range(N):
b = input().split()
w = int(b[0])
v = int(b[1])
max_value += v
wv_list.append([w, v])
#初期化
#とりあえず、全部最大になるように
inf=float('inf')
n_list = [[inf for i in range(max_value + 1)] for j in range(N)]
#最初のアイテムに関して、重みを適切な価値のところにいれている
n_list[0][wv_list[0][1]] = wv_list[0][0]
for i in range(1, N):
# 今まで全く選んでなかった場合に、i番目のアイテムを選んだ時
n_list[i][wv_list[i][1]] = wv_list[i][0]
for j in range(max_value):
s = j + wv_list[i][1]
#アイテムを選んだらこうなりますよってのを更新
if s <= max_value:
n_list[i][s] = min(n_list[i - 1][j] + wv_list[i][0], n_list[i][s])
#選ばんかったらこうなりますよってのを更新？
n_list[i][j] = min(n_list[i - 1][j], n_list[i][j])
for i in range(1, max_value):
if n_list[-1][-i] <= W:
print((max_value - i + 1))
break | p03164 |
N,W = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(N)]
supremum = 10**5
dp = [float("inf") for i in range(supremum+1)]
dp[0] = 0
for i in range(N) :
weight_i,value_i = L[i]
for j in range(supremum,value_i-1,-1) :
if dp[j-value_i] < float("inf") :
dp[j] = min(dp[j], dp[j-value_i] + weight_i)
for i in range(supremum,-1,-1) :
if dp[i] <= W :
ans = i
break
print(ans)
| N,W = list(map(int,input().split()))
L = [list(map(int,input().split())) for i in range(N)]
supremum = 10**5
dp = [float("inf") for i in range(supremum+1)]
dp[0] = 0
for i in range(N) :
weight_i,value_i = L[i]
for value in range(supremum,value_i-1,-1) :
if dp[value-value_i] + weight_i <= W :
dp[value] = min(dp[value], dp[value-value_i] + weight_i)
for i in range(supremum,-1,-1) :
if dp[i] <= W :
ans = i
break
print(ans)
| p03164 |
N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = {0: 0}
for i in range(N):
for cw, cv in list(dp.items()):
if cw + w[i] > W:
continue
dp[cw + w[i]] = max(
dp.get(cw + w[i], 0),
cv + v[i])
print((max(dp.values()))) | N, W = list(map(int, input().split()))
w = [0] * N
v = [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = {0: 0}
for i in range(N):
for cv, cw in list(dp.items()):
if cw + w[i] > W:
continue
dp[cv + v[i]] = min(
dp.get(cv + v[i], float('inf')),
cw + w[i])
print((max(dp))) | p03164 |
#!/usr/bin/env python3
N, W = list(map(int, input().split()))
item_list = []
for _ in range(N):
w, v = list(map(int, input().split()))
item_list.append((w, v))
max_v = (10 ** 3) * 100
dp_table = [[0] + [float("inf")] * (max_v + 1) for _ in range(N + 1)]
total_v = 0
for i in range(1, N + 1):
w, v = item_list[i - 1]
# 品物iまで考慮したときの価値の最大値
total_v += v
for j in range(total_v + 1):
# 品物iを入れない場合
dp_table[i][j] = dp_table[i - 1][j]
before_min_weight = dp_table[i - 1][j]
# dp_table[i][j] = before_min_weight
# 品物iを入れる場合
if j - v < 0:
continue
weight = dp_table[i - 1][j - v] + w
min_weight = min(before_min_weight, weight)
dp_table[i][j] = min_weight
if i == N:
if min_weight <= W:
max_value = j
# max_value = 0
# for i, w in enumerate(dp_table[-1]):
# if w <= W:
# max_value = i
ans = max_value
print(ans)
| #!/usr/bin/env python3
N, W = list(map(int, input().split()))
item_list = []
for _ in range(N):
w, v = list(map(int, input().split()))
item_list.append((w, v))
max_v = (10 ** 3) * 100
dp_table = [[0] + [float("inf")] * (max_v + 1) for _ in range(N + 1)]
total_v = 0
for i in range(1, N + 1): # 最大で10**2
w, v = item_list[i - 1]
# 品物iまで考慮したときの価値の最大値
total_v += v
for j in range(total_v + 1): # 最大で10 ** 5
# 品物iを入れない場合
dp_table[i][j] = dp_table[i - 1][j]
before_min_weight = dp_table[i - 1][j]
# dp_table[i][j] = before_min_weight
# 品物iを入れる場合
if j - v < 0:
continue
weight = dp_table[i - 1][j - v] + w
min_weight = min(before_min_weight, weight)
dp_table[i][j] = min_weight
if i == N:
if min_weight <= W:
max_value = j
ans = max_value
print(ans)
| p03164 |
MAX_V = 100100
MAX_N = 101
INF = pow(2, 70)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V):
# print(i, sum_v, sum_v - v[i] >= 0)
if sum_v - v[i] >= 0:
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v - v[i]] + w[i])
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])
# print(dp[i + 1][sum_v])
ans = max([i for i in range(len(dp[N])) if dp[N][i] <= W])
# for l in dp:
# print([n for n in l if not n == INF])
print(ans)
| MAX_V = 100100
MAX_N = 101
INF = pow(2, 64)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V):
# print(i, sum_v, sum_v - v[i] >= 0)
if sum_v - v[i] >= 0:
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v - v[i]] + w[i])
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])
# print(dp[i + 1][sum_v])
ans = max([i for i in range(len(dp[N])) if dp[N][i] <= W])
# for l in dp:
# print([n for n in l if not n == INF])
print(ans)
| p03164 |
MAX_V = 100100
MAX_N = 101
INF = pow(2, 64)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V):
# print(i, sum_v, sum_v - v[i] >= 0)
if sum_v - v[i] >= 0:
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v - v[i]] + w[i])
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])
# print(dp[i + 1][sum_v])
ans = max([i for i in range(len(dp[N])) if dp[N][i] <= W])
# for l in dp:
# print([n for n in l if not n == INF])
print(ans)
| MAX_V = 100100
MAX_N = 101
INF = pow(2, 60)
N, W = list(map(int, input().split()))
w = [0 for _ in range(N)]
v = [0 for _ in range(N)]
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
dp = [[INF for _ in range(MAX_V)] for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V):
# print(i, sum_v, sum_v - v[i] >= 0)
if sum_v - v[i] >= 0:
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v - v[i]] + w[i])
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])
# print(dp[i + 1][sum_v])
ans = max([i for i in range(len(dp[N])) if dp[N][i] <= W])
# for l in dp:
# print([n for n in l if not n == INF])
print(ans)
| p03164 |
n, w = list(map(int, input().split()))
dp = [[float('inf') for _ in range(10**5+1)] for i in range(n)]
for i in range(n):
wi, vi = list(map(int, input().split()))
if i == 0:
dp[i][0] = 0
dp[i][vi] = wi
else:
for k in range(10**5+1):
if k < vi:
dp[i][k] = dp[i-1][k]
else:
dp[i][k] = min(dp[i-1][k], dp[i-1][k-vi]+wi)
for i in range(10**5+1)[::-1]:
if dp[n-1][i] <= w:
print(i)
exit()
| n, w = list(map(int, input().split()))
dp = [[float('inf') for _ in range(10**5+1)] for i in range(n)]
v_sum = 0
for i in range(n):
wi, vi = list(map(int, input().split()))
v_sum += vi
if i == 0:
dp[i][0] = 0
dp[i][vi] = wi
else:
for k in range(v_sum+1):
if k < vi:
dp[i][k] = dp[i-1][k]
else:
dp[i][k] = min(dp[i-1][k], dp[i-1][k-vi]+wi)
for i in range(v_sum, -1, -1):
if dp[n-1][i] <= w:
print(i)
exit()
| p03164 |
n, W = list(map(int,input().split()))
dp = [W+1]*(10**5 + 1)
vr=[]
for i in range(n):
w,v= list(map(int,input().split()))
vr.append(v)
if i==0:
dp[v]=w
for j in range(10**5-v,-1,-1):
cw=w+dp[j]
if j==v and vr.count(v)==1:
continue
if cw<=W:
dp[j+v]=min(dp[j+v],cw)
dp[v]=min(w,dp[v])
for i in range(10**5,-1,-1):
if dp[i]<=W:
print(i)
exit()
| n, W = list(map(int,input().split()))
dp = [W+1]*(10**5 + 1)
maxv=0
for i in range(n):
w,v= list(map(int,input().split()))
for j in range(10**5-v,-1,-1):
cw=w+dp[j]
if cw<=W:
dp[j+v]=min(dp[j+v],cw)
maxv=max(maxv,j+v)
dp[v]=min(w,dp[v])
maxv=max(v,maxv)
print(maxv)
| p03164 |
# D-Knapsack 1
N,W = list(map(int,input().split()))
Weight = [0 for _ in range(N)]
Value = [0 for _ in range(N)]
for i in range(N):
Weight[i],Value[i] = list(map(int,input().split()))
MAX_N = 110
MAX_V = 100100
dp = [[10**15 for i in range(MAX_V)] for j in range(MAX_N)]
dp[0][0] = 0
for i in range(N):
# あらゆる合計重量sum_wに対して品物iを入れるべきか計算する
for sum_v in range(MAX_V):
# i番目を選ぶ場合
if sum_v - Value[i] >= 0:
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v - Value[i]] + Weight[i])
# i番目を選ばない場合
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])
ans = 0
for sum_v in range(MAX_V):
if dp[N][sum_v] <= W:
ans = sum_v
print(ans) | # D-Knapsack 1
N,W = list(map(int,input().split()))
Weight = [0 for _ in range(N)]
Value = [0 for _ in range(N)]
for i in range(N):
Weight[i],Value[i] = list(map(int,input().split()))
MAX_N = 110
MAX_V = 100100
# dp[i+1][v]:= i番目までの品物の中からスコアがv以上になるように選んだときの、重さの総和の最小値
dp = [[10**15 for i in range(MAX_V)] for j in range(MAX_N)]
dp[0][0] = 0
for i in range(N):
for sum_v in range(MAX_V):
# i番目を選ぶ場合
if sum_v - Value[i] >= 0:
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v - Value[i]] + Weight[i])
# i番目を選ばない場合
dp[i+1][sum_v] = min(dp[i+1][sum_v], dp[i][sum_v])
ans = 0
# 重さの総和<=Wである最大スコアを探す
for sum_v in range(MAX_V):
if dp[N][sum_v] <= W:
ans = sum_v
print(ans) | p03164 |
N,W=list(map(int,input().split()))
w=[]
v=[]
for i in range(N):
x,y=list(map(int,input().split()))
w.append(x)
v.append(y)
S=sum(v)
DP=[[1000000000000]*(S+1) for i in range(N+1)]
for i in range(N+1):
DP[i][0]=0
for i in range(N):
for v1 in range(S+1):
DP[i+1][v1]=min(DP[i][v1-v[i]]+w[i],DP[i][v1])
for i in range(S,0,-1):
if DP[N][i]<=W:
print(i)
exit() | N,W=list(map(int,input().split()))
w=[]
v=[]
for i in range(N):
x,y=list(map(int,input().split()))
w.append(x)
v.append(y)
S=sum(v)
DP=[1000000000000]*(S+1)
DP[0]=0
for i in range(N):
for v1 in range(S,v[i]-1,-1):
DP[v1]=min(DP[v1-v[i]]+w[i],DP[v1])
for i in range(S,0,-1):
if DP[i]<=W:
print(i)
exit() | p03164 |
N, W = [int(i) for i in input().split()]
w, v = [0]*N, [0]*N
for i in range(N):
w[i], v[i] = [int(_) for _ in input().split()]
V = sum(v)
dp = [[float('inf')] * (V+1) for _ in range(N+1)]
# dp[i][j] i番目までの荷物で価値がj以上になるように選んだときの重さの最小値
dp[0][0] = 0
for i in range(N):
for j in range(V+1):
if v[i] <= j:# 荷物v[i]の価値がjに足りてないのでi番目の荷物を入れる可能性がある
dp[i+1][j] = min(dp[i][j], dp[i][j-v[i]] + w[i])
else:
dp[i+1][j] = dp[i][j]
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| N, W = list(map(int, input().split()))
w, v = [0]*(N+1),[0]*(N+1)
for i in range(N):
w[i+1], v[i+1] = [int(_) for _ in input().split()]
V = sum(v)
dp = [[10**12]*(V+1) for _ in range(N+1)]
dp[0][0] = 0
# dp[i][j]:i番目以前の商品を見たときの価値総和jとしたときの重さの最小値
ans = 0
for i in range(1,N+1):
for j in range(V+1): # なんか間違えて1スタートにしててハマった
if v[i] <= j: #v[i]が入るとjになるときの計算なので，v[i]がjよりでかいのはあり得ない。j-v[i]>0だしね。
# i-1番目までの商品で価値jの場合とi番目の商品を入れて価値jの場合の比較
dp[i][j] = min(dp[i-1][j], dp[i-1][j-v[i]] + w[i])
else:
dp[i][j] = dp[i-1][j]
for j in range(V+1):
if dp[N][j] <= W:
ans = max(ans, j)
print(ans) | p03164 |
from collections import defaultdict
N, W = [int(i) for i in input().split()]
Things = [[int(i) for i in input().split()] for j in range(N)]
dp = defaultdict(lambda: float('inf'))
dp[0] = 0
for w, v in Things:
for nv, nw in list(dp.items()):
if nw + w <= W:
dp[nv + v] = min(dp[nv + v], nw + w)
ans = 0
for v, w in list(dp.items()):
if w <= W and v >= ans:
ans = v
print(ans) | def e_knapsack2(N, W, Goods):
"""
Dと同じ設定だが、制約が違う(1 <= v_i <= 10^3 と価値の制約がゆるめ)
"""
from collections import defaultdict
# dp[v]: 価値vを達成するために要求される重さの最小値
dp = defaultdict(lambda: float('inf'))
dp[0] = 0
# w, vの順序が逆になっているのはdpテーブルの都合上
for w, v in Goods:
for nv, nw in list(dp.items()):
if nw + w <= W:
dp[nv + v] = min(dp[nv + v], nw + w)
# 遷移の仕方により、keyの値を達成する品物の重さの和がWを超えることは
# ないので、keyの最大値を解とすればいい
return max(dp.keys())
N, W = [int(i) for i in input().split()]
Goods = [[int(i) for i in input().split()] for j in range(N)]
print((e_knapsack2(N, W, Goods))) | p03164 |
import sys
read = sys.stdin.read
INF = 1 << 60
def main():
N, W, *WV = list(map(int, read().split()))
weight = WV[::2]
value = WV[1::2]
V = sum(value)
dp = [[INF] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for v in range(V + 1):
if v - value[i] >= 0:
dp[i + 1][v] = dp[i][v - value[i]] + weight[i]
else:
dp[i + 1][v] = weight[i]
if dp[i + 1][v] > dp[i][v]:
dp[i + 1][v] = dp[i][v]
ans = 0
for v in range(V + 1):
if dp[N][v] <= W:
ans = v
print(ans)
return
if __name__ == '__main__':
main()
| import sys
read = sys.stdin.read
INF = 1 << 60
def main():
N, W, *WV = list(map(int, read().split()))
weight = WV[::2]
value = WV[1::2]
V = sum(value)
dp = [[INF] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for v in range(V + 1):
if v - value[i] >= 0:
dp[i + 1][v] = dp[i][v - value[i]] + weight[i]
if dp[i + 1][v] > dp[i][v]:
dp[i + 1][v] = dp[i][v]
ans = 0
for v in range(V, 0, -1):
if dp[N][v] <= W:
ans = v
break
print(ans)
return
if __name__ == '__main__':
main()
| p03164 |
import pprint
N, W = list(map(int, input().split()))
weight = []
value = []
for _ in range(N):
w, v = list(map(int, input().split()))
weight.append(w)
value.append(v)
value_sum = sum(value)
dp = []
for _ in range(N + 1):
dp_val = [float('inf') for _ in range(value_sum + 1)]
dp.append(dp_val)
# print(dp)
dp[0][0] = 0
# for v in range(value_sum):
# dp[0][v] = 0
for idx in range(N):
for v in range(value_sum + 1):
if value[idx] <= v:
dp[idx + 1][v] = min(dp[idx][v], dp[idx][v - value[idx]] + weight[idx])
else:
dp[idx + 1][v] = dp[idx][v]
ans = 0
# print(dp)
for i in range(value_sum + 1):
if dp[-1][i] <= W:
ans = i
print(ans) | N, W = list(map(int, input().split()))
weight = []
value = []
for _ in range(N):
w, v = list(map(int, input().split()))
weight.append(w)
value.append(v)
value_sum = sum(value)
dp = []
for _ in range(N + 1):
dp_val = [float('inf') for _ in range(value_sum + 1)]
dp.append(dp_val)
dp[0][0] = 0
for idx in range(N):
for v in range(value_sum + 1):
if value[idx] <= v:
dp[idx + 1][v] = min(dp[idx][v], dp[idx][v - value[idx]] + weight[idx])
else:
dp[idx + 1][v] = dp[idx][v]
ans = 0
# print(dp)
for i in range(value_sum + 1):
if dp[-1][i] <= W:
ans = i
print(ans) | p03164 |
N, W = list(map(int, input().split()))
w, v = [0] * N, [0] * N
for i in range(N):
w[i], v[i] = list(map(int, input().split()))
V = sum(v)
# dp[i][j]:i番目までの品物から価値がj以上になるよう選んだときの重さの総和の最小値
dp = [[float("inf")] * (V + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(V + 1):
# i+1番目を選ぶ場合
if j - v[i] >= 0:
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j - v[i]] + w[i])
# i+1番目を選ばない場合
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for j in range(V + 1):
if dp[N][j] <= W:
ans = j
print(ans)
| # 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, W = list(map(int, input().split()))
weight, value = [0] * N, [0] * N
for i in range(N):
weight[i], value[i] = list(map(int, input().split()))
# この前段階で、荷物の数N、ウェイトの上限W、
# weightの表weightとvalueの表valueは用意しておく。
def knapsack(N, W, weight, value):
V=sum(value)
# dp[i][v]はvを運べる最小のウェイトを意味する。
# 求めたいのは、dp[N][v]<=Wなるvのmax
dp = [[float('inf')] * (V + 1) for _ in range(N + 1)]
dp[0][0]=0
for i in range(N):
for v in range(V + 1):
if v >= value[i]:
dp[i + 1][v] = min(dp[i][v], dp[i][v - value[i]] + weight[i])
else:
dp[i + 1][v] = dp[i][v]
# dp[N][j]がW以下であるようなjの最大値が答えになる
ans = 0
for v in range(V + 1):
if dp[N][v] <= W:
ans = v
return ans
print((knapsack(N, W, weight, value)))
resolve() | p03164 |
def main():
width, height, target = list(map(int, input().split()))
answer = False
if target == 0:
answer = True
else:
for i in range(height):
if answer:
break
for j in range(width):
if (width - j) * (height - i) + i * j == target:
answer = True
break
print(("Yes" if answer else "No"))
if __name__ == '__main__':
main()
| def main():
n, m, k = list(map(int, input().split()))
answer = False
for i in range(n + 1):
if answer:
break
for j in range(m + 1):
if i * j + (n - i) * (m - j) == k:
answer = True
break
print(("Yes" if answer else "No"))
if __name__ == '__main__':
main()
| p03592 |
n,m,k=list(map(int,input().split()))
for i in range(n+1):
for j in range(m+1):
if m*i+n*j-2*(i*j)==k:
print("Yes")
exit()
print("No") | n,m,k=list(map(int,input().split()))
s=[]
u=n
for i in range(1,n+1):
u-=2
for j in range(m+1):
s.append(m*i+u*j)
if k in s:
print("Yes")
else:
print("No") | p03592 |
#!/usr/bin/env python3
n, m, k = list(map(int, input().split()))
for i in range(n + 1):
for j in range(m + 1):
if m * i + j * n - 2 * i * j == k:
print("Yes")
exit()
print('No')
| #!/usr/bin/env python3
n, m, k = list(map(int, input().split()))
for i in range(n + 1):
a = k - i * m
b = n - 2 * i
if b != 0 and a % b == 0 and 0 <= a // b <= m:
print("Yes")
exit()
print("No")
| p03592 |
N,M,K = list(map(int,input().split()))
ans = "No"
for k in range(N+1):
for l in range(M+1):
if k*(M-l) + l*(N-k) == K:
ans = "Yes"
print(ans) | N,M,K = list(map(int,input().split()))
ans = "No"
for a in range(N+1):
if N - 2*a != 0:
if (K - a*M) % (N - 2*a) == 0:
if M >= (K - a*M) / (N - 2*a) >= 0:
ans = "Yes"
print(ans) | p03592 |
n, m, k = list(map(int, input().split()))
for i in range(n + 1):
for j in range(m + 1):
if m * i + n * j - i * j * 2 == k:
print('Yes')
exit()
print('No')
| n, m, k = list(map(int, input().split()))
for i in range(n + 1):
for j in range(m + 1):
if i * (m - j) + j * (n - i) == k:
print('Yes')
exit()
print('No')
| p03592 |
def main():
N, M, K = list(map(int, input().split()))
for n in range(N + 1):
for m in range(M + 1):
overlap = 2 * n * m
cnt = n * M + m * N - overlap
if cnt == K:
print("Yes")
return
else:
print("No")
return
main()
| import sys
sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7
def input():
return sys.stdin.readline().strip()
def main():
N, M, K = list(map(int, input().split()))
for n in range(N + 1):
for m in range(M + 1):
num = N * m + M * n - 2 * m * n
if K == num:
print("Yes")
return
print("No")
return
if __name__ == "__main__":
main()
| p03592 |
# 横の回数をx, 縦の回数をyとすると k=x*(M-2)+y*(N-2)になればいい
# あとは例外 N or M==1のときはK<=N*Mからすべての値が可能
# N or M==2のときはすべての偶数が可能
# KがNorMで割り切れれば可能
# しょうがくせいのさんすうなのにあたまがわるすぎてくそどはまりしたよ せかいいちきょうぷろむいてないね いんたいしたほうがいいよ
n, m, k = list(map(int, input().split()))
if n == 1 or m == 1:
print("Yes")
exit()
if (n == 2 or m == 2) and k % 2 == 0:
print("Yes")
exit()
if k % n == 0 or k % m == 0:
print("Yes")
exit()
for y in range(1, n):
for x in range(1, m):
# print("y, x = {}, {}".format(y, x))
# print("面積 {}".format((y * m - x * y) + x * (n - y)))
if k == (y * m - x * y) + x * (n - y):
# print(y, x)
# print("y*x={}".format(y * x))
print("Yes")
exit()
print("No")
| n, m, k = list(map(int, input().split()))
if n == 1 or m == 1:
print("Yes")
exit()
# これ必要か？？？？？？？？？？
# -> 意味不明だが必要らしい...
if k % n == 0 or k % m == 0:
print("Yes")
exit()
for p in range(n + 1):
for q in range(m + 1):
if p * (m - q) + q * (n - p) == k:
print("Yes")
exit()
print("No") | p03592 |
n, m, k = list(map(int, input().split()))
if n == 1 or m == 1:
print("Yes")
exit()
# これ必要か？？？？？？？？？？
# -> 意味不明だが必要らしい...
if k % n == 0 or k % m == 0:
print("Yes")
exit()
for p in range(n + 1):
for q in range(m + 1):
if p * (m - q) + q * (n - p) == k:
print("Yes")
exit()
print("No") | # どこを選んでもかまわん
n, m, k = list(map(int, input().split()))
for i in range(n + 1):
for j in range(m + 1):
black = i * m - (j * i) + (n - i) * j
if black == k:
print("Yes")
exit()
print("No")
| p03592 |
import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : list(map(int, input().split()))
lin=lambda : list(tin())
mod=1000000007
#+++++
def main():
#a = int(input())
n, m, k = tin()
#s = input()
for ni in range(n+1):
for mi in range(m+1):
bn = ni*(m-mi) + (n-ni)*(mi)
if bn == k:
return 'Yes'
return 'No'
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret) | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : list(map(int, input().split()))
lin=lambda : list(tin())
mod=1000000007
#+++++
def main():
#n = int(input())
n, m, k = tin()
#s = input()
for ni in range(n+1):
for mi in range(m+1):
nb = ni*(m-mi) + (n-ni)*mi
if k == nb:
return 'Yes'
return 'No'
#+++++
isTest=False
def pa(v):
if isTest:
print(v)
def input_clipboard():
import clipboard
input_text=clipboard.get()
input_l=input_text.splitlines()
for l in input_l:
yield l
if __name__ == "__main__":
if sys.platform =='ios':
if input_method==input_methods[0]:
ic=input_clipboard()
input = lambda : ic.__next__()
elif input_method==input_methods[1]:
sys.stdin=open('inputFile.txt')
else:
pass
isTest=True
else:
pass
#input = sys.stdin.readline
ret = main()
if ret is not None:
print(ret) | p03592 |
n,m,k=list(map(int,input().split()))
ans="No"
for i in range(n//2+1):
for j in range(m):
o=i*j+(m-j)*(n-i)
x=n*m-o
if o==k or x==k:
ans="Yes"
print(ans) | n,m,k=list(map(int,input().split()))
ans="No"
for i in range(n+1):
if (2*i-n)==0:
if k==m*n//2:
ans="Yes"
else:
if (k-n*m+m*i)%(2*i-n)==0 and 0<=(k-n*m+m*i)//(2*i-n)<=m:
ans="Yes"
print(ans) | p03592 |
N, M, K = list(map(int, input().split()))
fin = False
for n in range(N + 1):
for m in range(M + 1):
if n * (M - m) + m * (N - n) == K:
print("Yes")
fin = True
break
if fin: break
else: print("No") | import sys
def solve():
input = sys.stdin.readline
N, M, K = list(map(int, input().split()))
possible = False
for i in range(N + 1):
for j in range(M + 1):
black = (N - i) * j + i * (M - j)
if black == K:
print("Yes")
possible = True
break
if possible: break
else: print("No")
return 0
if __name__ == "__main__":
solve() | p03592 |
N, M, K = list(map(int, input().split()))
for k in range(N+1):
for l in range(M+1):
if l*(N-k)+k*(M-l)==K:
print("Yes")
exit(0)
print("No") | N, M, K = list(map(int,input().split()))
for k in range(N+1):
for l in range(M+1):
if k*l + (M-l)*(N-k) == K:
print("Yes")
exit(0)
print("No")
| p03592 |
N,M,K=list(map(int,input().split()))
for n in range(0,N+1):
for m in range(0,M+1):
if n*M+m*N-2*n*m==K:
print("Yes")
exit(0)
print("No") | N,M,K=list(map(int,input().split()))
ans="No"
for x in range(N+1):
a=K-x*M
b=N-2*x
if b!=0 and a%b==0 and 0<=a//b<M:
print("Yes")
exit()
print("No") | p03592 |
n,m,k = list(map(int,input().split()))
for i in range(n+1):
for j in range(m+1):
a = n*j + m*i - 2*i*j
if a == k:
print("Yes")
exit()
print("No")
| n,m,k = list(map(int,input().split()))
for i in range(n+1):
for j in range(m+1):
tmp = i * (m - j) + (n - i) * j
if tmp == k:
print("Yes")
exit()
print("No") | p03592 |
N,M,K = list(map(int,input().split()))
for a in range(N+1):
for b in range(M+1):
k = a*b + (N-a)*(M-b)
if k==K:
print('Yes')
exit()
print('No') | N,M,K = list(map(int,input().split()))
for i in range(N+1):
for j in range(M+1):
t = i*M + j*N - i*j*2
if t==K:
print('Yes')
exit()
print('No') | p03592 |
n,m,k = list(map(int,input().split()))
for i in range(n+1):
for j in range(m+1):
if i*(m-j)+(n-i)*j==k:
print('Yes')
exit()
print('No')
| n,m,k = list(map(int,input().split()))
for a in range(n+1):
# a行押す
black = a * m
for b in range(m+1):
# b列押す
res = black + b * (n - 2 * a)
if res == k:
print('Yes')
exit()
print('No')
| p03592 |
N,M,K=list(map(int,input().split()))
s=set()
for i in range(N+1):
for j in range(M+1):
s.add(j*(N-i)+i*(M-j))
print(("Yes" if K in s else "No")) | N,M,K=list(map(int,input().split()));s=set();[s.add(j*(N-i)+i*(M-j)) for i in range(N+1) for j in range(M+1)];print(("Yes" if K in s else "No")) | p03592 |
N, M, K = map(int, input().split())
if K % N == 0 or K % M == 0:
print('Yes')
exit()
candidates = set()
for i in range(1, N):
curr = i * M
for j in range(1, M):
curr += N - 2 * i
candidates.add(curr)
for j in range(1, M):
curr = j * N
for i in range(1, N):
curr += M - 2 * j
candidates.add(curr)
print('Yes') if K in candidates else print('No')
| N, M, K = map(int, input().split())
if K % N == 0 or K % M == 0:
print('Yes')
exit()
candidates = set()
for i in range(1, N):
curr = i * M
for j in range(1, M):
curr += N - 2 * i
candidates.add(curr)
print('Yes') if K in candidates else print('No')
| p03592 |
import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n, m, k = LI()
for i in range(n):
unit = n-2*i
if unit == 0:
if k == i*m:
print("Yes")
break
else:
j = (k-i*m)//(n-2*i)
jr = (k-i*m)%(n-2*i)
if 0 <= j <= m and jr == 0:
print("Yes")
break
else:
print("No")
main()
| import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n, m, k = LI()
for i in range(n):
for j in range(m+1):
if i*m + j*(n-2*i) == k:
print("Yes")
exit(0)
else:
print("No")
main()
| p03592 |
# B fLIP
n,m,k=list(map(int,input().split()))
for h in range(n+1):
for w in range(m+1):
black=m*h+n*w-2*h*w
if black==k:
print('Yes')
exit()
print('No') | n,m,k = list(map(int,input().split()))
for i in range(0,n+1):
for j in range(0,m+1):
if n*j+m*i-2*i*j == k:
print("Yes")
exit(0)
print("No")
| p03592 |
H,W,K = list(map(int,input().split()))
ans = "No"
for i in range(H+1):
for j in range(W+1):
if H*j + W*i - 2*i*j == K:
ans = "Yes"
break
print(ans) | H,W,K = list(map(int,input().split()))
ans = "No"
for i in range(H+1):
if H-2*i == 0:
if K-W*i == 0:
ans = "Yes"
else:
continue
if (K-W*i) % (H-2*i) != 0:
continue
j = (K-W*i) // (H-2*i)
if 0 <= j <= W:
ans = "Yes"
break
print(ans) | p03592 |
N, M, K = list(map(int, input().split()))
Flg = "No"
for i in range(N+1):
for j in range(M+1):
if(i*(M-j)+(N-i)*j == K):
Flg = "Yes"
break
print(Flg) | N, M, K = list(map(int, input().split()))
Flg = "No"
for i in range(N+1):
for j in range(M+1):
if((M-j)*i+(N-i)*j ==K):
Flg = "Yes"
break
print(Flg) | p03592 |
A, B = list(map(int, input().split()))
ans = None
for i in range(100000):
a = int(i * 0.08)
b = int(i * 0.1)
if a == A and b == B:
ans = i
break
if ans is None:
print((-1))
else:
print(ans)
| A, B = list(map(int, input().split()))
ans = -1
for yen in range(10000):
a = int(yen * (8/100))
b = int(yen * (10/100))
if A == a and B == b:
ans = yen
break
print(ans) | p02755 |
a, b = list(map(int, input().split()))
ans = -1
for i in range(100000):
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 money in range(pow(10, 4)):
if int(money*0.08) == a and int(money*0.1) == b:
ans = money
break
print(ans) | p02755 |
import math
A, B = list(map(int, input().split()))
ans = -1
for i in range(1, 1251):
a = int(math.floor(i * 0.08))
b = int(math.floor(i * 0.1))
if (a == A and b == B):
ans = i
break
print(ans) | # O(1) solution
import math
A, B = list(map(int, input().split()))
min_A = int(math.ceil(A * 12.5))
max_A = int(math.ceil((A + 1) * 12.5) - 1)
grp_A = {i for i in range(min_A, max_A + 1)}
min_B = int(math.ceil(B * 10))
max_B = int(math.ceil((B + 1) * 10) - 1)
grp_B = {i for i in range(min_B, max_B + 1)}
ans = grp_A & grp_B
if (len(ans) == 0):
ans = -1
else:
ans = min(ans)
print(ans) | p02755 |
from math import ceil
def solve(string):
a, b = list(map(int, string.split()))
ans = ceil(a / 0.08)
while ans // 10 != b:
ans += 1
return str(ans) if ans * 2 // 25 == a else "-1"
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
| from math import ceil
def solve(string):
a, b = list(map(int, string.split()))
ans = ceil(a / 0.08)
while ans // 10 < b:
ans += 1
return str(ans) if ans * 2 // 25 == a and ans // 10 == b else "-1"
if __name__ == '__main__':
import sys
print((solve(sys.stdin.read().strip())))
| p02755 |
a,b = input().split()
a = int(a)
b = int(b)
c = 0
for i in range(10000):
d = c*0.08
e = c*0.1
d = int(d)
e = int(e)
if d == a and e == b:
print(c)
break
elif c == 9999:
print('-1')
break
else:
c += 1 | a,b = input().split()
a = int(a)
b = int(b)
c = 0
for i in range(1001):
d = c*0.08
e = c*0.1
d = int(d)
e = int(e)
if d == a and e == b:
print(c)
break
elif c == 1000:
print('-1')
break
else:
c += 1 | p02755 |
A, B = list(map(int, input().split()))
def floor_inv(x, f):
res = int(x / f)
if int(res * f) < x:
res += 1
return res
lb1 = floor_inv(A, 0.08)
ub1 = floor_inv(A + 1, 0.08)
lb2 = floor_inv(B, 0.10)
ub2 = floor_inv(B + 1, 0.10)
if ub1 <= lb2 or ub2 <= lb1:
print((-1))
else:
print((max(lb1, lb2)))
|
A, B = list(map(int, input().split()))
lb_a = int(-(-A // 0.08))
ub_a = int(-(-(A + 1) // 0.08) - 1)
lb_b = int(-(-B // 0.1))
ub_b = int(-(-(B + 1) // 0.1) - 1)
if ub_b < lb_a or ub_a < lb_b:
print((-1))
else:
print((max(lb_a, lb_b)))
| p02755 |
import sys
import math
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
a,b=list(map(int, input().split()))
for i in range(13,1250):
if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
return i
return -1
print((main()))
resolve() | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
def main():
a,b=list(map(int, input().split()))
for i in range(13,1250):
if (i*8)//100==a and (i*10)//100==b:
return i
return -1
print((main()))
resolve() | p02755 |
import math
a,b=list(map(int,input().split()))
flag=True
for i in range(10**7):
if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
print(i)
flag=False
exit()
if flag:
print((-1)) | import math
a,b=list(map(int,input().split()))
flag=True
for i in range(10**6):
if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
print(i)
flag=False
exit()
if flag:
print((-1)) | p02755 |
import math
A, B = list(map(int, input().split()))
x_minA = math.ceil(100 / 8 * A)
x_minB = 10 * B
x_maxA = math.floor(100 / 8 * (A+1))
x_maxB = 10 * (B+1)
if x_minA > x_maxB or x_minB > x_maxA:
print((-1))
else:
x = max(x_minA, x_minB)
while (x * 8 / 100 - A >= 1) or (x / 10 - B >= 1):
print((x, x * 8 / 100, x / 10))
x += 1
print(x) | import math
A, B = list(map(int, input().split()))
x_minA = math.ceil(100 / 8 * A)
x_minB = 10 * B
x_maxA = math.floor(100 / 8 * (A+1))
x_maxB = 10 * (B+1)
if x_minA > x_maxB or x_minB > x_maxA:
print((-1))
else:
for x in range(max(x_minA, x_minB), min(x_maxA, x_maxB)+1):
if int(x * 8 / 100) == A and int(x / 10)==B:
print(x)
break
else:
print((-1)) | p02755 |
a,b=list(map(int,input().split()))
n=1
while n<=10**6:
if int(n*0.08)==a and int(n*0.1)==b:
print(n)
exit()
else:
n+=1
print((-1)) | a,b=list(map(int,input().split()))
n=1
while n<=2*10**4:
if int(n*0.08)==a and int(n*0.1)==b:
print(n)
exit()
else:
n+=1
print((-1)) | p02755 |
from math import floor
A, B = list(map(int, input().split()))
res = -1
for price in range(1, 10**7):
if floor(price*0.08) == A and floor(price*0.1) == B:
res = price
break
print(res)
| from math import floor
A, B = list(map(int, input().split()))
res = -1
for price in range(1, 10**6):
if floor(price*0.08) == A and floor(price*0.1) == B:
res = price
break
print(res)
| p02755 |
from math import floor
def Main(A, B):
a = A * 12.5
b = B * 10
st = floor(min(a, b))
for i in range(st, 1251):
if floor(i * 0.08) == A and floor(i * 0.1) == B:
return i
return -1
def main():
A, B = list(map(int, input().split()))
print((Main(A, B)))
if __name__ == '__main__':
main() | from math import floor
def Main(A, B):
for i in range(1, 1001):
if floor(i*0.08) == A and floor(i*0.1) == B:
return i
return -1
def main():
A, B = list(map(int, input().split()))
print((Main(A, B)))
if __name__ == '__main__':
main() | p02755 |
import math
ans=0
a,b=list(map(int,input().split()))
for i in range(b*20):
ans1=i*0.08
ans2=i*0.1
if math.floor(ans1)==a and math.floor(ans2)==b:
ans=i
break
else:
ans=-1
print(ans) | import math
a,b=list(map(int,input().split()))
for i in range(b*20):
if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
print(i)
exit()
print((-1)) | p02755 |
import math
A, B = list(map(int, input().split()))
A_min = math.ceil(A * 12.5)
A_max = math.ceil((A + 1) * 12.5) - 1
B_min = math.ceil(B * 10)
B_max = math.ceil((B + 1) * 10) - 1
# print(A_min, A_max, B_min, B_max)
candidate = max(A_min, B_min)
if candidate < min(A_max, B_max):
print(candidate)
else:
print('-1')
| import math
A, B = list(map(int, input().split()))
for i in range(1, 1001):
if math.floor(0.08 * i) == A and math.floor(0.1 * i) == B:
print(i)
exit()
print((-1))
| p02755 |
A, B = list(map(int, input().split()))
ans = -1
for p in range(1, 20000):
if p * 8 // 100 == A and p * 10 // 100 == B:
ans = p
break
print(ans) | A, B = list(map(int, input().split()))
p = max((25*A+1)//2,(20*B+1)//2)
if p * 2 >= min(25*(A+1), 20*(B+1)):
p = -1
print(p) | p02755 |
A,B=list(map(int,input().split()))
S=max(12.5*A,10*B)
if S%1!=0:
S=S//1+1
if S<12.5*A+12.5 and S<10*B+10:
print((int(S)))
else:
print("-1") | A,B=list(map(int,input().split()))
S=max(12.5*A,10*B)
if S%1!=0:
S=int(S)+1
if S<12.5*A+12.5 and S<10*B+10:
print((int(S)))
else:
print("-1")
| p02755 |
import math
a,b = [float(i) for i in input().split()]
ans = 1000000000
flag = False
for i in range(1,10000):
ans8 = int(math.floor(i*0.08))
ans10 = int(math.floor(i*0.1))
# print(ans8,ans10)
if ans8 == a and ans10 == b:
ans = min(ans, i)
flag = True
if flag is True:
print(ans)
else:
print((-1)) | import math
a,b = [float(i) for i in input().split()]
ans = 1000000000
flag = False
for i in range(1,1005):
ans8 = int(math.floor(i*0.08))
ans10 = int(math.floor(i*0.1))
# print(ans8,ans10)
if ans8 == a and ans10 == b:
ans = min(ans, i) # 更新する必要がある．
flag = True
if flag is True:
print(ans)
else:
print((-1)) | p02755 |
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)) | a,b = list(map(int, input().split()))
for i in range(10, 1300):
if int(i*0.08) == a:
if int(i*0.1) == b:
print(i)
exit()
print((-1)) | p02755 |
#n=int(input())
a,b=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
import math
flag=False
ans=-1
for i in range(1,10001):
a2=i*0.08
a1=int(i*0.08)
b1=int(i*0.1)
if a1==a and b1==b:
ans=i
break
print(ans)
| #k=int(input())
a,b=list(map(int,input().split()))
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
flag=False
import math
for price in range(1,1001):
if math.floor(price*0.08)==a and math.floor(price*0.1)==b:
flag=True
break
if flag:
print(price)
else:
print((-1))
| p02755 |
a,b=list(map(int,input().split()))
for i in range(10**6):
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(10**6):
if i*8//100==a and i//10==b:
print(i)
exit()
print((-1)) | p02755 |
a,b = list(map(int,input().split()))
ans =-1
for i in range(10000,-1,-1):
money0 = int(i*0.08)
money1= int(i*0.1)
if money0==a and money1==b:
ans = i
print(ans)
| a,b = list(map(int,input().split()))
ans =-1
for i in range(1001,-1,-1):
money0 = int(i*0.08)
money1= int(i*0.1)
if money0==a and money1==b:
ans = i
print(ans)
| p02755 |
import math
import sys
a , b = list(map(int , input().split()))
for i in range(2000):
if math.floor(i * 0.08) == a and math.floor(i * 0.1) == b:
print(i)
sys.exit()
print((-1)) | import math
import sys
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)
sys.exit()
print((-1)) | p02755 |
import math
a, b = list(map(int, input().split()))
for i in range(10001):
if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
ans = i
break
else :
ans = -1
print(ans)
| 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:
ans = i
break
else :
ans = -1
print(ans)
| p02755 |
A,B=[int(x) for x in input().rstrip().split()]
count=0
for i in range(1,20000):
ans1=int(0.08*i)
ans2=int(0.1*i)
if ans1==A and ans2==B:
print(i)
count=1
break
if count==0:
print((-1)) | A,B=[int(x) for x in input().rstrip().split()]
flag=0
for i in range(1,1001):
if int(i*0.08)==A and int(i*0.1)==B:
print(i)
flag=1
break
if flag==0:
print((-1))
| p02755 |
A, B = list(map(int, input().split()))
import math
ans = -1
for i in range(1, 10000):
if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
ans = i
break
print(ans) | a,b = list(map(int, input().split()))
ans = -1
for i in range(1, 10000):
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()))
ans = -1
for i in range(1, 10000):
if int(i*0.08)==a and int(i*0.1)==b:
ans = i
break
print(ans) | a,b = list(map(int, input().split()))
for i in range(1, 1001):
if int(i * 0.08) == a and int(i * 0.1) == b:
print(i)
exit()
print((-1)) | p02755 |
from math import ceil, floor
def main():
a, b = list(map(int, input().split()))
p8_l = ceil(a / 0.08)
p8_h = int((a+1) // 0.08)
p10_l = int(b / 0.10)
p10_h = int((b+1) / 0.10) - 1
if p8_h >= p10_h >= p8_l and p8_l >= p10_l:
print(p8_l)
elif p8_l <= p10_l <= p8_h and p8_l <= p10_l:
print(p10_l)
else:
print((-1))
if __name__ == '__main__':
main() | def main():
a, b = list(map(int, input().split()))
maxv = int((101 / 0.1) - 1)
for i in range(maxv+1):
if (i*8//100 == a) and (i*10//100 == b):
print(i)
exit()
print((-1))
if __name__ == '__main__':
main()
| p02755 |
# import bisect
# from collections import Counter, deque
# import copy
# from heapq import heappush, heappop, heapify
# from fractions import gcd
# import itertools
# from operator import attrgetter, itemgetter
import math
import sys
# import numpy as np
ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
a, b = list(map(int,ipti().split()))
for price in range(0, 10001):
aa = math.floor(price * 0.08)
bb = math.floor(price * 0.10)
if a == aa and b == bb:
print(price)
sys.exit()
print((-1))
if __name__ == '__main__':
main() | a, b = list(map(int, input().split()))
ans = -1 # 答えが見つからなかった場合の-1を初期値にしておく
for price in range(10000):
tax_a = int(price * 0.08)
tax_b = int(price * 0.1)
if tax_a == a and tax_b == b:
ans = price
break
print(ans) | p02755 |
import math
A ,B = list(map(int,input().split()))
def problem_koganemaru(A,B):
for price in range(10000):
if math.floor(price*0.08) == A and math.floor(price*0.1) == B:
return price
return -1
print((problem_koganemaru(A,B))) | import math
A,B = list(map(int,input().split()))
def problem_gksn(A, B):
x_min = math.ceil(A / (0.08))
x_max = math.floor((A+1)/0.08)
y_min = math.ceil(B / (0.10))
y_max = math.floor((B+1) / (0.10))
# print(x_min,x_max,y_min,y_max)
if max(x_min, y_min) < min(x_max, y_max):
return max(x_min, y_min)
else:
return -1
print((problem_gksn(A,B)))
# {[ } ] | p02755 |
#Tax Increase
import math
a, b = list(map(int, input().split()))
for i in range(10000):
if a == math.floor(i*0.08) and b == math.floor(i*0.1):
print(i)
break
else:
print((-1)) | #Tax Increase
import math
a, b = list(map(int, input().split()))
for i in range(1251):
if a == math.floor(i*0.08) and b == math.floor(i*0.1):
print(i)
break
else:
print((-1)) | p02755 |
import math
a, b = list(map(int, input().split()))
saitei = math.ceil(a/0.08)
for i in range(10000):
if int((saitei+i)*0.1) == b and int((saitei+i)*0.08) == a:
print((saitei+i))
exit()
print((-1)) | import math
a, b = list(map(int, input().split()))
mini_8 = a / 0.08
maxi_8 = mini_8 + 12.5
mini_8 = math.ceil(mini_8)
if maxi_8 - int(maxi_8) == 0:
maxi_8 = int(maxi_8 - 1)
else:
maxi_8 = int(maxi_8)
mini_10 = b / 0.1
maxi_10 = mini_10 + 9
for i in range(mini_8, maxi_8+1):
if mini_10 <= i and i <= maxi_10:
print(i)
exit()
print((-1)) | p02755 |
a,b=list(map(int,input().split()))
x=0
for i in range(2000):
if x == 0 and int(i*0.08) == a and int(i*0.10) == b:
print(i)
x=1
if x == 0 and i == 1299:
print("-1")
| a,b=list(map(int,input().split()))
x=0
for i in range(1251):
if x == 0 and int(i*0.08) == a and int(i*0.10) == b:
print(i)
x=1
if x == 0 and i == 1250:
print("-1")
| p02755 |
A, B = list(map(int, input().split()))
for x in range(1, 10**5):
if x*8//100 == A and x*10//100 == B:
print(x)
break
else:
print((-1))
| A, B = list(map(int, input().split()))
L1, R1 = -(-(100*A) // 8), -(-(100*(A+1)) // 8) - 1
L2, R2 = -(-(100*B) // 10), -(-(100*(B+1)) // 10) - 1
L = max(L1, L2)
R = min(R1, R2)
if L <= R:
print(L)
else:
print((-1))
| p02755 |
import fractions
import sys
A,B=list(map(int,input().split()))
for i in range(1,1009):
if(int(i*0.08) == A and int(i*0.1)==B):
print(i)
sys.exit()
print((-1)) | from math import floor
def myAnswer(A:int,B:int) -> int:
price = 1
while True:
if(floor(price*0.08)==A and floor(price*0.1)==B):
return price
elif(floor(price*0.08)>A or floor(price*0.1)>B):
return -1
else:
price+=1
def modelAnswer():
tmp=1
def main():
A,B = list(map(int,input().split()))
print((myAnswer(A,B)))
if __name__ == '__main__':
main() | p02755 |
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(0)
else :
print((-1))
| 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)
break
else:print((-1))
| p02755 |
def main():
a,b = list(map(int,input().split()))
for x in range(1,10001):
x_a = int(x * 0.08)
x_b = int(x * 0.1)
if x_a == a and x_b == b:
print(x)
return
print((-1))
if __name__=='__main__':
main()
| import math
a,b = list(map(int,input().split()))
for i in range(1,2000):
tax8 = math.floor(i*0.08)
tax1 = math.floor(i*0.1)
if a == tax8 and b == tax1:
print(i)
exit()
print((-1))
| p02755 |
A, B = list(map(int, input().split()))
for i in range(10101):
if i * 8 // 100 == A and i * 10 // 100 == B:
print(i)
exit()
print((-1))
| A, B = list(map(int, input().split()))
for i in range(1011):
if i * 8 // 100 == A and i * 10 // 100 == B:
print(i)
exit()
print((-1))
| p02755 |
import math
A, B=list(map(int,input().split()))
for i in range(10000):
if math.floor(i*0.08)==A and math.floor(i*0.1)==B:
print(i)
exit()
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()
print((-1)) | p02755 |
import sys
import math
a,b=list(map(int,input().split()))
for i in range(10*b,15*b):
if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
print(i)
sys.exit()
print((-1)) | a,b=list(map(int,input().split()))
for i in range(10*b,15*b):
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))
| import math
A, B = list(map(int, input().split()))
for i in range( 10001 ):
if math.floor(i * 0.08) == A and math.floor(i * 0.1) == B:
print(i)
break
else:
print((-1))
| p02755 |
import math
a, b = list(map(int, input().split()))
for i in range(1, 10**5):
if math.floor(i*0.08) == a and math.floor(i*0.1) == b:
print(i)
exit()
print((-1)) | from math import floor
a, b = list(map(int, input().split()))
for i in range(1,100001):
if floor(0.08*i) == a and floor(0.1*i) == b:
print(i)
exit()
print((-1)) | p02755 |
a,b=list(map(int,input().split()))
ans=-1
for i in range(1,10**4):
if ((i*10)//100)==b and ((i*8)//100)==a:
ans=i
break
print(ans) | def check(x):
if (x*10)//100>=b and (x*8)//100>=a: return True
else: return False
a,b=list(map(int,input().split()))
l=0
r=10**9
while(l<r):
mid=(l+r)//2
if check(mid):r=mid
else: l=mid+1
print((l if (l*10)//100==b and (l*8)//100==a else -1))
| p02755 |
A, B = list(map(int, input().split()))
for i in range(1, 10**5):
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(100000):
if (i * 8) // 100 == A and (i * 10) // 100 == B:
print(i)
exit()
print((-1))
| p02755 |
import math as m
a, b = list(map(int, input().split()))
cost = -1
flg = 0
while flg == 0 and cost < 10 ** 6 / 1.5:
cost += 1
aAns = m.floor(cost * 0.08)
bAns = m.floor(cost * 0.1)
if aAns == a and bAns == b:
flg = 1
print((cost if flg == 1 else -1))
| import math as m
a, b = list(map(int, input().split()))
cost = -1
flg = 0
while flg == 0 and cost < 10 ** 6 / 1.5:
cost += 1
aAns = m.floor(cost * 0.08)
bAns = m.floor(cost * 0.1)
if aAns == a and bAns == b:
flg = 1
if a - aAns < 0 or b - bAns < 0:
break
print((cost if flg == 1 else -1))
| p02755 |
def main():
#from sys import stdin, setrecursionlimit
#setrecursionlimit(10**9)
#r = input()
#n = int(input())
#a, b = map(int, input().split())
#s, y = input().split()
#a = input().split()
#a = [int(input()) for i in range(n)]
#a = list(map(int, input().split()))
#a = [list(map(int, input().split())) for i in range(n)]
#a = [int(s) - 1 for s in input().split()]
#l=[int(input()) for _ in range(int(input()))]
#res = 0
from math import floor
a, b = list(map(int, input().split()))
ax = 0
bx = 0
for i in range(1,1500):
ax = floor(i * 0.08)
bx = floor(i * 0.1)
if ax == a and bx == b:
print(i)
return 0
print((-1))
if __name__ == '__main__':
main()
| def main():
a,b = list(map(int,input().split()))
ax,bx = 0,0
from math import floor
# 100/0.08 = 1250
for i in range(1,1251):
ax = floor(i*0.08)
bx = floor(i*0.1)
if ax == a and bx == b:
print(i)
return 0
print((-1))
if __name__ == '__main__':
main()
| p02755 |
A, B = list(map(int, input().split(' ')))
rst = -1
for i in range(1, 100000):
if i * 8 // 100 == A and i * 10 // 100 == B:
rst = i
break
print(rst) | 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 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.