input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
A,B,M = list(map(int,input().split()))
A_li = list(map(int,input().split()))
B_li = list(map(int,input().split()))
X = set()
Y = set()
inf = float("inf")
posibility = inf
for m in range(M):
x,y,c=list(map(int,input().split()))
tmp_posibility=A_li[x-1]+B_li[y-1]-c
posibility=min(posibility,tmp_posibility)
X.add(x)
Y.add(y)
import itertools
a_li = set(A_li)-X
b_li = set(B_li)-Y
for a,b in itertools.product(a_li,b_li):
tmp_posibility = a+b
posibility = min(posibility,tmp_posibility)
print(posibility) | A,B,M = list(map(int,input().split()))
A_li = list(map(int,input().split()))
B_li = list(map(int,input().split()))
inf = float("inf")
posibility = inf
for m in range(M):
x,y,c=list(map(int,input().split()))
tmp_posibility=A_li[x-1]+B_li[y-1]-c
posibility=min(posibility,tmp_posibility)
no_c = min(A_li)+min(B_li)
decition = min(posibility,no_c)
print(decition) | p02748 |
A,B,M = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = float("inf")
for i in range(M):
x,y,c = list(map(int,input().split()))
ans = min(a[x-1]+b[y-1]-c,ans)
for i in range(A):
for j in range(B):
ans = min(ans,a[i]+b[j])
print(ans)
| A,B,M = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
ans = float("inf")
for i in range(M):
x,y,c = list(map(int,input().split()))
ans = min(a[x-1]+b[y-1]-c,ans)
ans = min(ans,min(a)+min(b))
print(ans)
| p02748 |
a, b, m = list(map(int, input().split()))
ax = list(map(int, input().split()))
bx = list(map(int, input().split()))
x = []
for i in range(m):
_x = list(map(int, input().split()))
x.append(list(_x))
min_sum = 99999999
for i in range(a):
for j in range(b):
sum = ax[i] + bx[j]
for k in x:
sum2 = sum
if k[0] == i+1 and k[1] == j+1:
sum2 = sum2 - k[2]
if sum2 < min_sum:
min_sum = sum2
print(("{}".format(min_sum))) | a, b, m = list(map(int, input().split()))
ax = list(map(int, input().split()))
bx = list(map(int, input().split()))
x = []
for i in range(m):
_x = list(map(int, input().split()))
x.append(list(_x))
min_a = min(ax)
min_b = min(bx)
min_sum = min_a + min_b
for k in x:
sum = ax[k[0]-1] + bx[k[1]-1] - k[2]
if sum < min_sum:
min_sum = sum
print(("{}".format(min_sum))) | p02748 |
A,B,M = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
oldp = 10**20
c = [[0 for _ in range(B)] for _ in range(A)]
for _ in range(M):
x, y, cp = list(map(int,input().split()))
p = a[x-1]+b[y-1]-cp
if oldp > p:
oldp = p
p = min(a)+min(b)
print((min(oldp,p))) | A,B,M = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
oldp = min(a)+min(b)
for _ in range(M):
x, y, cp = list(map(int,input().split()))
p = a[x-1]+b[y-1]-cp
if oldp > p:
oldp = p
print(oldp) | p02748 |
a, b, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = min(a)
bb = min(b)
aabb = aa+bb
ab = [a+b for a, b in zip(a, b)]
ans = []
for i in ab:
ans.append(i)
for i in range(m):
x, y, c = list(map(int, input().split()))
ans.append(a[x-1]+b[y-1]-c)
ans.append(aabb)
print((min(ans))) | a, b, m = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
aa = min(a)
bb = min(b)
aabb = aa+bb
ans = []
ans.append(aabb)
for i in range(m):
x, y, c = list(map(int, input().split()))
ans.append(a[x-1]+b[y-1]-c)
print((min(ans))) | p02748 |
from sys import stdin
A, B, M = [int(x) for x in stdin.readline().rstrip().split()]
a = [int(x) for x in stdin.readline().rstrip().split()]
b = [int(x) for x in stdin.readline().rstrip().split()]
X = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(M)]
L = []
for a_i in a:
for b_i in b:
L.append(a_i + b_i)
for x in X:
L.append(a[x[0]-1] + b[x[1]-1] - x[2])
print((min(L)))
| from sys import stdin
A, B, M = [int(x) for x in stdin.readline().rstrip().split()]
a = [int(x) for x in stdin.readline().rstrip().split()]
b = [int(x) for x in stdin.readline().rstrip().split()]
X = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(M)]
L = []
L.append(min(a) + min(b))
for x in X:
L.append(a[x[0]-1] + b[x[1]-1] - x[2])
print((min(L)))
| p02748 |
a,b,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [tuple(map(int,input().split())) for i in range(m)]
p = []
x = 0
p.append(min(a)+min(b))
for ka,ai in enumerate(a):
for kb,bi in enumerate(b):
for t in c:
if t[0]==ka+1 and t[1]==kb+1:
x = t[2]
p.append(ai+bi-x)
print((min(p))) | a,b,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [tuple(map(int,input().split())) for i in range(m)]
p = min(a)+min(b)
for t in c:
p = min(p,a[t[0]-1]+b[t[1]-1]-t[2])
print(p) | p02748 |
a,b,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [tuple(map(int,input().split())) for i in range(m)]
p = min(a)+min(b)
for t in c:
p = min(p,a[t[0]-1]+b[t[1]-1]-t[2])
print(p) | a,b,m = list(map(int,input().split()))
a = list(map(int,input().split()))
b = list(map(int,input().split()))
c = [tuple(map(int,input().split())) for i in range(m)]
p = [min(a)+min(b)]
for t in c:
p.append(a[t[0]-1]+b[t[1]-1]-t[2])
print((min(p))) | p02748 |
a, b, m = list(map(int, input().split()))
priceOfMicrowaves = list(map(int, input().split()))
priceOfRefrigerators = list(map(int, input().split()))
priceTable = [list(map(int,input().split())) for i in range(m)]
cheepest = priceOfMicrowaves[0] + priceOfRefrigerators[0]
for price in priceTable:
if priceOfMicrowaves[price[0]-1]-price[2] >= cheepest:
continue
elif priceOfRefrigerators[price[1]-1]-price[2] >= cheepest:
continue
elif priceOfMicrowaves[price[0]-1]+priceOfRefrigerators[price[1]-1]-price[2] < cheepest:
cheepest = priceOfMicrowaves[price[0]-1]+priceOfRefrigerators[price[1]-1]-price[2]
for p in priceOfMicrowaves:
if p >= cheepest:
continue
for q in priceOfRefrigerators:
if q >= cheepest:
continue
if p + q < cheepest:
cheepest = p + q
print(cheepest) | a, b, m = list(map(int, input().split()))
priceOfMicrowaves = list(map(int, input().split()))
priceOfRefrigerators = list(map(int, input().split()))
priceTable = [list(map(int,input().split())) for i in range(m)]
cheepest = priceOfMicrowaves[0] + priceOfRefrigerators[0]
for price in priceTable:
if priceOfMicrowaves[price[0]-1]-price[2] >= cheepest:
continue
elif priceOfRefrigerators[price[1]-1]-price[2] >= cheepest:
continue
elif priceOfMicrowaves[price[0]-1]+priceOfRefrigerators[price[1]-1]-price[2] < cheepest:
cheepest = priceOfMicrowaves[price[0]-1]+priceOfRefrigerators[price[1]-1]-price[2]
if cheepest > min(priceOfMicrowaves) + min(priceOfRefrigerators):
cheepest = min(priceOfMicrowaves) + min(priceOfRefrigerators)
print(cheepest)
| p02748 |
S = input().split()
#冷蔵庫
A = int(S[0])
#電子レンジ
B = int(S[1])
#割引券
M = int(S[2])
a = list(map(int,input().split()))
b = list(map(int,input().split()))
total_mini = 999999999
for j in range(A):
for k in range(B):
total = a[j] + b[k]
if total_mini > total:
total_mini = total
minimum = 999999999
for i in range(M):
m = list(map(int,input().split()))
amount = a[m[0]-1] + b[m[1]-1] - m[2]
if minimum > amount:
minimum = amount
if minimum <= total_mini:
print(minimum)
else:
print(total_mini)
| S = input().split()
#冷蔵庫
A = int(S[0])
#電子レンジ
B = int(S[1])
#割引券
M = int(S[2])
a = list(map(int,input().split()))
b = list(map(int,input().split()))
total_mini = min(a) + min(b)
for i in range(M):
m = list(map(int,input().split()))
amount = a[m[0]-1] + b[m[1]-1] - m[2]
if total_mini > amount:
total_mini = amount
print(total_mini)
| p02748 |
def resolve():
A, B, M = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
grid=[list(map(int,input().split())) for i in range(M)]
res = min(a) + min(b)
for m in grid:
if m[0]-1 < A and m[1]-1 < B:
tmp = a[m[0]-1] + b[m[1]-1] - m[2]
if tmp < res:
res = tmp
print(res)
resolve() | def resolve():
A, B, M = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
grid=[list(map(int,input().split())) for i in range(M)]
res = min(a) + min(b)
for x, y, c in grid:
res = min(res, a[x-1]+b[y-1]-c)
print(res)
resolve() | p02748 |
import sys
def main():
input = sys.stdin.readline
a, b, m = input().split()
a, b, m = int(a), int(b), int(m)
alist = input().split()
blist = input().split()
waribiki = [input().split() for _ in range(m)]
res = [200000] * 200001
count = 0
for i in range(a):
for j in range(b):
try:
res[count] = int(alist[i]) + int(blist[j])
except Exception:
pass
count += 1
for i in range(m):
res[count] = int(alist[int(waribiki[i][0])-1]) + int(blist[int(waribiki[i][1])-1]) - int(waribiki[i][2])
count += 1
print((min(res)))
if __name__ == '__main__':
main() | import sys
def main():
input = sys.stdin.readline
a, b, m = input().split()
a, b, m = int(a), int(b), int(m)
alist = list(map(int, input().split()))
blist = list(map(int, input().split()))
waribiki = [input().split() for _ in range(m)]
res = [200000] * (m + 1)
count = 0
for i in range(m):
res[count] = alist[int(waribiki[i][0])-1] + blist[int(waribiki[i][1])-1] - int(waribiki[i][2])
count += 1
res[count] = min(alist) + min(blist)
print((min(res)))
if __name__ == '__main__':
main() | p02748 |
A, B, M = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 10**6
for i in range(M):
x, y, c = list(map(int, input().split()))
ans = min(ans, a[x - 1] + b[y - 1] - c)
ans = min(ans, min(a) + min(b))
print(ans) | import sys
input = sys.stdin.readline
def main():
A, B, M = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 10**6
for i in range(M):
x, y, c = list(map(int, input().split()))
ans = min(ans, a[x - 1] + b[y - 1] - c)
ans = min(ans, min(a) + min(b))
print(ans)
main() | p02748 |
A, B, M = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = 10**6
for i in range(M):
X, Y, C = list(map(int, input().split()))
if(ans > a[X-1]+b[Y-1]-C):
ans = a[X-1]+b[Y-1]-C
for j in range(len(a)):
for k in range(len(b)):
if(a[j]+b[k] < ans):
ans = a[j]+b[k]
print(ans) | A, B, M = list(map(int, input().split()))
a = list(map(int, input().split()))
b = list(map(int, input().split()))
ans = min(a)+min(b)
for i in range(M):
X, Y, C = list(map(int, input().split()))
if(ans > a[X-1]+b[Y-1]-C):
ans = a[X-1]+b[Y-1]-C
print(ans) | p02748 |
n = int(eval(input()))
P =[]
s = 0
for i in range(n):P.append([int(i) for i in input().split()])
P.append(P[0])
for i in range(n):
a = P[i][0] ; b = P[i][1]; c = P[i+1][0] ; d = P[i+1][1]
s += a * d - b * c
print((abs(s)*0.5)) | n = int(eval(input()))
P =[]
s = 0
x0,y0 = [int(i) for i in input().split()]
for i in range(n-1):
x,y = [int(i) for i in input().split()]
P.append([x-x0,y-y0])
for i in range(n-2):
s += P[i][0]*P[i+1][1] - P[i][1]*P[i+1][0]
print((abs(s)*0.5)) | p02297 |
n = int(eval(input()))
P =[]
s = 0
for i in range(n):P.append(input().split())
P.append(P[0])
for i in range(n):s += int(P[i][0])*int(P[i+1][1]) - int(P[i][1])*int(P[i+1][0])
print((abs(s)*0.5)) | n = int(eval(input()))
P =[]
s = 0
for i in range(n):P.append([int(i) for i in input().split()])
P.append(P[0])
for i in range(n):s += (P[i][0]*P[i+1][1] - P[i][1]*P[i+1][0])
print((abs(s)*0.5)) | p02297 |
def area(p,q):return p[0]*q[1]-p[1]*q[0]
n=int(eval(input()))
point=[]
x_1,y_1=[int(i) for i in input().split(" ")]
for _ in range(n-1):
x,y=[int(i) for i in input().split(" ")]
point.append([x-x_1,y-y_1])
a=0
for i in range(n-2):a+=area(point[i],point[i+1])
print((a*0.5)) | n=int(eval(input()))
point=[]
x_1,y_1=[int(i) for i in input().split(" ")]
for _ in range(n-1):
x,y=[int(i) for i in input().split(" ")]
point.append([x-x_1,y-y_1])
a=0
for i in range(n-2):a+=point[i][0]*point[i+1][1] - point[i][1]*point[i+1][0]
print((a*0.5)) | p02297 |
x=list(range(int(eval(input()))))
P=[]
for _ in x:P+=[[int(i) for i in input().split()]]
_=0
P+=[P[0]]
for j in x:_+=P[j][0]*P[j+1][1]-P[j][1]*P[j+1][0]
print((_*0.5)) | x=list(range(int(eval(input()))))
P=[]
Q=[]
for _ in x:P+=[[int(i) for i in input().split()]]
P+=[P[0]]
for j in x:Q+=[P[j][0]*P[j+1][1]-P[j][1]*P[j+1][0]]
print((sum(Q)*0.5)) | p02297 |
x=list(range(int(eval(input()))))
P=[]
Q=[]
for _ in x:P+=[[int(i) for i in input().split()]]
P+=[P[0]]
for j in x:Q+=[P[j][0]*P[j+1][1]-P[j][1]*P[j+1][0]]
print((sum(Q)*0.5)) | x=list(range(int(eval(input()))))
P=[]
for _ in x:P+=[[int(i) for i in input().split()]]
_=0
P+=[P[0]]
for j in x:_+=P[j][0]*P[j+1][1]-P[j+1][0]*P[j][1]
print((_*0.5)) | p02297 |
x=list(range(int(eval(input()))))
P=[]
for _ in reversed(x):P+=[[int(i) for i in input().split()]]
P+=[P[0]]
for j in x:_+=P[j+1][1]*P[j][0]-P[j][1]*P[j+1][0]
print((_*0.5)) | x=list(range(int(eval(input()))-1,-1,-1))
P=[]
for _ in x:P+=[[int(i) for i in input().split()]]
P+=[P[0]]
for j in x:_+=P[j+1][1]*P[j][0]-P[j][1]*P[j+1][0]
print((_*0.5)) | p02297 |
N, K = list(map(int,input().split()))
if K > 0:
count = 0
for a in range(1, N+1):
for b in range(K+1, a):
if a%b >= K:
count = count + 1
count = count + int((N+1-K)*(N-K)/2)
print(count)
else:
print((N*N)) | N, K = list(map(int,input().split()))
if K > 0:
count = 0
for b in range(K+1, N+1):
p = N // b
r = N % b
count = count + p*(b-K)
if r >= K:
count = count + r-K+1
print(count)
else:
print((N*N)) | p03418 |
#!/usr/bin/env python3
import sys
def solve(N: int, K: int):
if K!=0:
ans = 0
for j in range(1,N+1): #10**5ループなのでいけるはず。
if K <= j-1:
ans += (j-K) * (N//j)
if N%j >=K:
ans += N%j - K + 1
else:
ans = N * N
print(ans)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(N, K)
if __name__ == '__main__':
main()
| #!/usr/bin/env python3
import sys
def solve(N: int, K: int):
if K!=0:
ans = 0
for j in range(K+1,N+1):
ans += (j-K) * (N//j)
if N%j >=K:
ans += N%j - K + 1
else:
ans = N * N
print(ans)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
K = int(next(tokens)) # type: int
solve(N, K)
if __name__ == '__main__':
main()
| p03418 |
n, k = list(map(int, input().split()))
if k == 0:
print((n**2))
exit()
ans = 0
for b in range(1,n+1):
# 連続部分
if b - k > 0:
ans += (n // b) * (b-k)
# 繰り返し範囲外
if ((n - (n // b)*b) - (k-1)) > 0:
ans += ((n - (n // b)*b) - (k-1))
print(ans) | N,K = list(map(int, input().split()))
if K == 0:
print((N*N))
exit()
ans = 0
for b in range(K+1,N+1):
# N = b * num + rest
num = N // b
rest = N - (b*num)
# b一周期の中に、余りがK以上になる数字が(b-K)個、残りの中でさらに余りがKを超える物があればそれも加算
ans += (b - K) * num + max(0, rest-K+1)
print(ans) | p03418 |
N,K = list(map(int,input().split()))
count = 0
if K == 0:
print((N*N))
else:
for b in range(K+1,N+1):
x = N // b
y = N % b
count = count + (b-K)*x
if y >= K:
count = count + y-K+1
print(count) | N,K = list(map(int,input().split()))
count = 0
if K == 0:
print((N*N))
else:
for b in range(K+1,N+1):
x = N // b
y = N % b
count = count + (b-K)*x #植木算.b-1-K+1 = b-K
if y >= K:
count = count + y-K+1 #K=0のときはこの式だと1多くなってしまう
print(count) | p03418 |
N, K = list(map(int, input().split()))
if K == 0:
print((N**2))
exit()
ans = 0
for b in range(1, N+1):
p = N // b
r = N % b
ans += max(0, b-K) * p
ans += max(0, r-K+1)
print(ans) | N, K = list(map(int, input().split()))
ans = 0
if K == 0:
print((N ** 2))
else:
for b in range(1, N+1):
ans += (N // b) * max(0, b - K) + max(0, (N % b) - K + 1)
print(ans)
| p03418 |
N, K = list(map(int, input().split()))
ans = 0
for b in range(1, N + 1):
ans += (N // b) * max(0, b - K) + max(0, (N % b) - K + 1)
print((ans - (N if K == 0 else 0)))
| N, K = list(map(int, input().split()))
ans = 0
for b in range(K + 1, N + 1):
ans += (b - K) * (N // b)
ans += max(0, N % b - K + 1)
if K == 0:
ans -= N
print(ans)
| p03418 |
n,k=list(map(int,input().split()))
ans=0
## a<b and k>0
ans+=(n-k)*(n-k+1)//2
#print(ans)
## a>b
for i in range(k,n+1):
for j in range(1,i):
if i%j>=k:
ans+=1
print(ans)
| n,k=list(map(int,input().split()))
if k==0:
print((n*n))
exit()
ans=0
for i in range(k+1,n+1):
ans+=((n+1)//i)*(i-k)+max(0,((n+1)%i-k))
print(ans) | p03418 |
n,k=list(map(int,input().split()))
c=0
for b in range(k+1,n+1):
c+=n//b*(b-k)+max(n%b-k+1,0)-(k<1)
print(c) | n,k=list(map(int,input().split()))
print((sum(n//b*(b-k)+max(n%b-k+1,0)-(k<1) for b in range(k+1,n+1)))) | p03418 |
# -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem D
if __name__ == '__main__':
number, k = list(map(int, input().split()))
count = 0
# HACK: Not beautiful.
if k == 0:
print((number ** 2))
else:
for b in range(1, number + 1):
p = (number + 1) // b
r = number - (p * b)
count += p * max(0, b - k)
if (number + 1) % b != 0:
count += max(0, r - k + 1)
print(count)
| # -*- coding: utf-8 -*-
# AtCoder Beginner Contest
# Problem D
if __name__ == '__main__':
number, k = list(map(int, input().split()))
count = 0
# See:
# https://img.atcoder.jp/arc091/editorial.pdf
# https://beta.atcoder.jp/contests/abc090/submissions/2193514
for b in range(1, number + 1):
p, r = divmod(number, b)
count += p * max(0, b - k) + max(0, r - k + 1)
if k == 0:
count -= number
print(count)
| p03418 |
n, k = list(map(int, input().split()))
if k == 0:
print((n**2))
exit()
ans = 0
for b in range(k+1, n+1):
ans_bk = (n-k)//b+1
ans_b = ans_bk*(b-k)
mod_k_max = ((n-k)//b)*b+k
if n-mod_k_max+1 < b-k:
ans_b -= ((b-k) - (n-mod_k_max+1))
# print(ans_b)
ans += ans_b
print(ans)
| n, k = list(map(int, input().split()))
if k == 0:
print((n**2))
exit()
ans = 0
for b in range(k+1, n+1):
p = n//b
r = n%b
ans += p*(b-k)
ans += max(0, r-k+1)
print(ans) | p03418 |
import sys
n, k = list(map(int, sys.stdin.readline().split()))
def main():
res = 0
for b in range(k+1, n+1):
q, r = divmod(n, b)
res += q * (b - k) + max(0, r - (max(k, 1) - 1))
return res
if __name__ == '__main__':
ans = main()
print(ans) | import sys
n, k = list(map(int, sys.stdin.readline().split()))
def main():
res = 0
for b in range(k+1, n+1):
q, r = divmod(n, b)
res += q * (b - k) + max(0, r - (k - 1))
if k == 0:
res -= n - k
return res
if __name__ == '__main__':
ans = main()
print(ans) | p03418 |
N, K = list(map(int, input().split()))
count = 0
for a in range(1,N+1):
for b in range(1,N+1):
if a%b >= K:
count += 1
print (count)
| N, K = list(map(int, input().split()))
ans = 0
for b in range(1, N+1): #bを全探索
amari = max(b-K, 0)
count = N // b
# print ('b=', b)
# print (count * amari + max(N%b - K + 1, 0))
ans += count * amari + max(N%b - K + 1, 0)
if K == 0:
ans -= N
print (ans)
#以下単純な全探索O(N^2)となり間に合わない
# count = 0
# for a in range(1,N+1):
# for b in range(1,N+1):
# if a%b >= K:
# count += 1
# print (count)
| p03418 |
N,K = list(map(int,input().split()))
ans = 0
for b in range(K+1,N+1):
ans += N//b*(b-K) + max(0,N%b-K+1)
if K==0:ans = N*N
print(ans) | N,K = list(map(int,input().split()))
ans = sum(N//b*(b-K) + max(0,N%b-K+1) for b in range(K+1,N+1)) if K>0 else N*N
print(ans) | p03418 |
n,k = list(map(int,input().split()))
if k == 0:
print((n**2))
else:
r = n//k
ans = 0
for i in range(1,r+3): #a=(i-1)×b+あまり
genkai = n - (i)*k
for j in range(1,n-k+1): #b=k+j
x = (i-1)*j
ans += min(max(genkai-x+1,0),j)
print(ans)
| n,k = list(map(int,input().split()))
if k == 0:
print((n**2))
elif k <= 100:
ans = 0
for j in range(k):
for i in range(k+1,n+1):
ans += (n-j)//i
print(((n-k+1)*(n-k)-ans))
else:
r = n//k
ans = 0
for i in range(1,r+3): #a=(i-1)×b+あまり
genkai = n - (i)*k
for j in range(1,n-k+1): #b=k+j
x = (i-1)*j
ans += min(max(genkai-x+1,0),j)
print(ans)
| p03418 |
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split(" ")))
c = 0
if K == 0:
print((N*N))
else:
for b in range(K+1, N+1):
for a in range(K, b):
n = (N-a)//b + 1
c += n
print(c) | # -*- coding: utf-8 -*-
N, K = list(map(int, input().split(" ")))
c = 0
if K != 0:
for b in range(K+1, N+1):
s = N % b
t = N - s
p = t // b * (b - K)
q = max(0, s - (K - 1))
c += (p + q)
else:
c = N ** 2
print(c) | p03418 |
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split(" ")))
c = 0
if K != 0:
for b in range(K+1, N+1):
s = N % b
t = N - s
p = t // b * (b - K)
q = max(0, s - (K - 1))
c += (p + q)
else:
c = N ** 2
print(c) | # -*- coding: utf-8 -*-
N, K = list(map(int, input().split(" ")))
c = 0
if K != 0:
for b in range(K+1, N+1):
r = N % b
p = N // b
s = p * (b-K)
t = max(0, r - (K - 1))
c += (s + t)
else:
c = N ** 2
print(c) | p03418 |
def As(b):
if K==0:
return N
q = N//b
# on each range we have b-K possible A's
s = (b-K) * q
if q*b+K <= N:
s += min((q+1)*b-1,N) - (q*b+K-1)
return s
N, K = list(map(int,input().split()))
s = 0; b = K+1;
while b <= N:
s += As(b)
b += 1
print(s)
| # 解説どおりにやるとK = 0で失敗する?
def number_of_a(b):
if K == 0:
return N
q, r = divmod(N,b)
# for each range, we have b-K possible A's
# in the last range, we have max(0,r-K+1) possible A's.
s = q * max(0,b-K) + max(0,r-K+1)
# print((b,q,r,s))
return s
N, K = list(map(int,input().split()))
s = 0; b = 1;
while b <= N:
s += number_of_a(b)
b += 1
print(s) | p03418 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from copy import deepcopy
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n,k=LI()
ans=0
if k==0:
print((n*n))
exit()
for b in range(k+1,n+1):
ans+=n//b*(b-k)+max(0,n%b-k+1)
print(ans) | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
from bisect import bisect_left, bisect_right
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from copy import deepcopy
INF = 10 ** 20
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]
mod = 10 ** 9 + 7
n,k=LI()
ans=0
if k==0:
print((n*n))
exit()
for b in range(k+1,n+1):
ans+=(n+1)//b*(b-k)+max(0,(n+1)%b-k)
print(ans) | p03418 |
n,k=list(map(int,input().split()))
x=0
for b in range(k+1,n+1):
for i in range(k,b):
x+=(n-i)//b+(i>0)
print(x) | n,k=list(map(int,input().split()))
x=0
for b in range(k+1,n+1):
r=n%b
if r==0:
x+=(n//b)*(b-k)
else:
x+=(n//b+1)*max(0,(r-k+1))
x+=(n//b)*max(0,(b-max(k,r+1)))
if k==0:
x-=1
print(x) | p03418 |
Tmp = []
Tmp = input().rstrip().split(' ')
N = int(Tmp[0])
K = int(Tmp[1])
Ans = 0
Num = K + 1
nTmp = 0
nTmp2 = 0
if K == 0:
Ans = N**2
else:
nTmp = int((N - K)*(N - K + 1)/2)
Ans += nTmp
while Num < N:
nTmp2 = N
while nTmp2 - K >= Num:
nTmp = nTmp2 % Num
if nTmp >= K:
Ans += 1
nTmp2 -= 1
Num += 1
print(Ans)
| Tmp = []
Tmp = input().rstrip().split(' ')
N = int(Tmp[0])
K = int(Tmp[1])
Ans = 0
nTmp = 0
nTmp2 = 0
nTmp3 = 0
if K == 0:
Ans = N **2
else:
for i in range(N+1):
if i == 0:
continue
B = i
nTmp = B - K
if nTmp > 0:
nTmp2 = N // B
nTmp3 = (B - K) * nTmp2
Ans += nTmp3
nTmp2 = N % B
if nTmp2 != 0:
nTmp2 = nTmp2 - K + 1
if nTmp2 > 0:
Ans += nTmp2
print(Ans)
| p03418 |
N, K = list(map(int, input().split()))
ans = 0
for b in range(1, N + 1):
p, r = divmod(N, b)
ans += p * max(0, b - K) + max(0, r - K + 1)
if K == 0:
ans -= N
print(ans) | N, K = list(map(int, input().split()))
if K == 0:
print((N * N))
exit()
cnt = 0
for b in range(K + 1, N + 1):
p, r = divmod(N, b)
cnt += p * (b - K)
if r >= K:
cnt += r - K + 1
print(cnt) | p03418 |
import itertools
N, K = list(map(int, input().split()))
count = 0
for i in range(K, N+1):
count += N - i
for i in range(K+1, N+1):
for j in range(1, i):
if i % j >= K:
count += 1
print(count) | N, K = list(map(int, input().split()))
count = 0
if K == 0:
print((N*N))
exit()
for i in range(1, N+1):
count += int(N/i) * max(i-K, 0) + max(N - int(N/i)*i + 1 - K, 0)
print(count) | p03418 |
n, k = [int(i) for i in input().split()]
ans = 0
for a in range(k,n+1):
ans += n - a
for b in range(1,a):
if a % b >= k:
ans += 1
print(ans) | def max(a,b):
if a > b:
return a
else:
return b
n, k = [int(i) for i in input().split()]
ans = 0
for b in range(1,n+1):
p = n // b
r = n % b
ans += p * max(0,b-k)+max(0,r-k+1)
if k == 0:
ans -= n
print(ans) | p03418 |
import sys
def input():
return sys.stdin.readline()[:-1]
n,k=list(map(int,input().split()))
tmp=0
ans=0
if k==0:
print((n*n))
quit()
for i in range(k,n):
tmp=n//(i+1)
ans+=(i+1-k)*tmp
if n%(i+1)-k+1>0:
ans+=n%(i+1)-k+1
print(ans) | import sys
def input():
return sys.stdin.readline()[:-1]
n,k=list(map(int,input().split()))
tmp=0
ans=0
# if k==0:
# print(n*n)
# quit()
for i in range(k,n):
tmp=n//(i+1)
ans+=(i+1-k)*tmp
tmp=max(1,k)
if n%(i+1)-tmp+1>0:
ans+=n%(i+1)-tmp+1
print(ans) | p03418 |
def main():
N,K = list(map(int,input().split()))
ans = 0
for k in range(K,N):
for b in range(k+1,N+1):
cnt = (N-k)//b
if k!=0:
cnt += 1
ans += cnt
print(ans)
if __name__ == '__main__':
main() | n,k = list(map(int,input().split()))
count = 0
if k==0:
print((n ** 2))
exit()
for i in range(1,n+1):
if i <= k:
continue
count += max(0, (n%i) - k + 1)
count += (n // i) * (i - k)
print(count) | p03418 |
n,k = list(map(int,input().split()))
cnt = 0
for b in range(1,n+1):
p = n//b
r = n%b
cnt += max(0, b-k)*p + max(0, r-k+1)
else:
if k==0:
cnt -= n
print(cnt) | n,k = list(map(int,input().split()))
if k==0:
print((n**2))
else:
ans = 0
for b in range(k,n+1):
ans += (n//b)*(b-k)
if n%b>=k:
ans += n%b-(k-1)
print(ans) | p03418 |
N,K = list(map(int,input().split()))
if K == 0:
print((N**2))
exit()
ans = 0
for b in range(1,N+1):
if b <= K: continue
else: ans += N//b*(b-K) + max(0,(N-(N//b)*b)-K+1)
print(ans) | N, K = list(map(int, input().split()))
if K == 0:
print((N ** 2))
exit()
ans = 0
for b in range(K + 1, N + 1):
val1 = N // b * (b - K)
if N % b == 0:
val2 = 0
else:
val2 = max(0, N - (N // b) * b - K + 1)
ans += val1 + val2
print(ans)
| p03418 |
def f(n, k):
return 0.5*(n-k)*(n-k+1)
N, K = list(map(int, input().split()))
cnt = 0
for a in range(K, N+1):
for b in range(K, a+1):
if a <= 1 or b <= 1:
continue
if ((a%b) >= K):
cnt += 1
cnt += f(N, K)
print((int(cnt)))
| N, K = list(map(int, input().split()))
cnt = 0
for b in range(1, N+1):
p = N // b
q = N % b
cnt += max(b-K,0)*p + max(q+1-K,0)
if K == 0:
cnt -= N
print((int(cnt))) | p03418 |
N,K=list(map(int,input().split()))
t=0
for b in range(K+1,N+1):
t+=(N//b)*(b-K)+((N%b-K+(1 if K>0 else 0) if N%b>=K else 0)if N%b else 0)
print(t)
| N,K=list(map(int,input().split()))
t=0
for b in range(K+1,N+1):
t+=(-~N//b)*(b-K)+max(-~N%b-K,0)
print((t-(0 if K else N-K)))
| p03418 |
def ans(N, M):
if M == 0: return(N * N)
ans = 0
for i in range(1,N+1):
p, q = divmod(N,i)
ans += p * max(i-M,0) + max((q-M)+1,0)
return(ans)
N, M = list(map(int, input().split()))
print((ans(N, M))) | def ans(N, M):
if M == 0: return(N * N)
cnt = 0
for i in range(1,N+1):
p, q = divmod(N,i)
cnt += p * max(i-M,0) + max((q-M)+1,0)
return(cnt)
N, M = list(map(int, input().split()))
print((ans(N, M))) | p03418 |
n,k = list(map(int,input().split()))
ans = 0
if k==0:
ans = n**2
else:
for i in range(1,n+1):
loop = n//i
rem = n%i
ans += loop*max(i-k,0) + max(rem-k+1,0)
print(ans) | n,k = list(map(int,input().split()))
ans = 0
for i in range(1,n+1):
loop = n//i
rem = n%i
ans += max(0,i-k) * loop + max(rem+1-k,0)
if k==0:
ans -= n
print(ans) | p03418 |
n,k=list(map(int, input().split()))
if k==0:
print((n**2))
quit()
cnt=0
for a in range(k,n+1):
b=list(range(k,n+1))
cnt+=len(list([x for x in b if a%x>=k]))
print(cnt)
| n, k = list(map(int, input().split()))
s = 0
for b in range(1, n+1):
s += max(0, b-k)*(n//b) + max(0, n%b-k+1)
if k == 0:
s = n*n
print(s)
| p03418 |
def rep(b,r,N):
return (N-r)//b+1 if r>0 else N//b
N,K=list(map(int,input().split(' ')))
count = 0
for b in range(K+1,N+1):
for r in range(K,b):
count += rep(b,r,N)
print(count) |
N,K=list(map(int,input().split(' ')))
count = 0
for b in range(K+1,N+1):
l, h, n = K, b-1, b-K
while l <= N:
if h <= N:
count += n
if l==0:
count -=1
else:
count += N-l+1
if l==0:
count -=1
break
l+=b
h+=b
print(count) | p03418 |
n,k=list(map(int,input().split()))
if k==0:
print((n**2));exit()
ans=0
for i in range(k+1,n+1):
p=n//i
q=n%i
ans +=p*max(0,i-k)+max(0,q-k+1)
print(ans) | n,k=list(map(int,input().split()))
if k==0:print((n**2));exit()
ans=0
for i in range(k+1,n+1):
ans +=n//i*max(0,i-k)+max(0,n%i-k+1)
print(ans) | p03418 |
N,K=list(map(int,input().split()))
if K==0:
print((N*N))
else:
ans=0
for i in range(K,N+1):
ans+=(N//i*max(0,i-K)+max((N%i)+1-K,0))
print(ans)
| N,K=list(map(int,input().split()))
if K==0:
print((N*N))
else:
ans=0
for i in range(K+1,N+1):
ans+=N//i*max(0,i-K)+max(0,N%i-K+1)
print(ans) | p03418 |
n, k = list(map(int, input().split()))
ans = 0
if k == 0:
ans = n ** 2
else:
for b in range(k + 1, n + 1):
for a in range(k, b):
ans += ((n - a) // b) + 1
print(ans)
| n, k = list(map(int, input().split()))
ans = 0
if k == 0:
ans = n ** 2
else:
for b in range(k + 1, n + 1):
ans += (b - k) * (n // b)
last_count = n % b - k + 1
ans += last_count if last_count > 0 else 0
print(ans)
| p03418 |
#coding=utf-8
def solve(A, B):
count = 0
for b in range(B + 1, A + 1):
for a in range(1, A + 1):
if a % b >= B:
count += 1
return count
def main():
A, B = input().split(' ')
print((solve(int(A), int(B))))
if __name__ == '__main__':
main()
| #coding=utf-8
def solve(N, K):
count = 0
if K == 0:
return N * N
for b in range(K + 1, N + 1):
p = N // b
r = N % b
count += p * (b - K)
if r >= K:
count += r - K + 1
return count
def main():
A, B = input().split(' ')
print((solve(int(A), int(B))))
if __name__ == '__main__':
main()
| p03418 |
n, k = list(map(int, input().split()))
count = 0
if k == 0:
count += n * n
else:
for b in range(k + 1, n + 1):
q, r = n // b, n % b
count += q * (b - k) + max((r + 1 - k), 0)
print(count) | n, k = list(map(int, input().split()))
ans = 0
if k == 0:
ans = n ** 2
else:
for b in range(k + 1, n + 1):
q, r = n // b, n % b
ans += (b - k) * q + max(r + 1 - k, 0)
print(ans) | p03418 |
import sys
s = sys.stdin.readline().strip()
n = len(s)
if s[0] == s[n-1]:
move = 1
else:
move = 0
move = (n - move) % 2
if move == 1:
print('First')
else:
print('Second')
| import sys
s = str(sys.stdin.readline().strip())
n = len(s)
if s[0] == s[n-1]:
move = 1
else:
move = 0
move = (n - move) % 2
if move == 1:
print('First')
else:
print('Second')
| p03865 |
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]*(W+1) for _ in range(N+1)]
#dp[ i ][ sum_w ] :
#i-1 番目までの品物から重さが sum_w 以下となるように選んだときの、
#価値の総和の最大値
for i in range(N):
for j in range(W+1):
if j - w[i] >= 0:
dp[i+1][j] = max(dp[i+1][j], dp[i][j-w[i]] + v[i])
dp[i+1][j] = max(dp[i][j], dp[i+1][j])
print((dp[N][W]))
| 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]*(W+1) for _ in range(N+1)]
#dp[ i ][ sum_w ] :
#i-1 番目までの品物から重さが sum_w 以下となるように選んだときの、
#価値の総和の最大値
for i in range(N):
for j in range(W+1):
if j - w[i] >= 0:
#dp[i+1][j] = max(dp[i+1][j], dp[i][j-w[i]] + v[i])
dp[i+1][j] = dp[i][j - w[i]] + v[i]
dp[i+1][j] = max(dp[i][j], dp[i+1][j])
print((dp[N][W]))
| p03163 |
import sys
input = sys.stdin.readline
n, w = list(map(int, input().split()))
dp = [0] * (w + 1)
for _ in range(n):
wi, vi = list(map(int, input().split()))
for wj in range(w, wi - 1, -1):
nv = dp[wj - wi] + vi
if dp[wj] < nv:
dp[wj] = nv
print((max(dp)))
| import sys
input = sys.stdin.readline
def main():
n, w = list(map(int, input().split()))
dp = [0] * (w + 1)
for _ in range(n):
wi, vi = list(map(int, input().split()))
for wj in range(w, wi - 1, -1):
nv = dp[wj - wi] + vi
if dp[wj] < nv:
dp[wj] = nv
print((max(dp)))
main()
| p03163 |
n, w = list(map(int, input().split()))
wt, v = [], []
for i in range(n):
a, b = list(map(int, input().split()))
wt.append(a)
v.append(b)
dp = [[0 for i in range(w + 1)] for j in range(n + 1)]
for i in range(1, len(wt)+1):
for j in range(w + 1):
if j >= wt[i-1]:
dp[i][j] = max(dp[i-1][j], v[i - 1] + dp[i - 1][j - wt[i - 1]])
else:
dp[i][j] = dp[i-1][j]
print((dp[-1][-1]))
| n, w = list(map(int, input().split()))
wt, v = [], []
for i in range(n):
a, b = list(map(int, input().split()))
wt.append(a)
v.append(b)
dp = [0 for i in range(w + 1)]
for i in range(len(wt)):
for j in range(w, wt[i]-1, -1):
dp[j] = max(dp[j], v[i] + dp[j - wt[i]])
print((dp[-1]))
| p03163 |
N,W=list(map(int,input().split()))
#S = [[0 for j in range(3)] for i in range(2)] 2行3列の場合S
weight=[0]*110
value=[0]*110
S = [[0 for j in range(3)] for i in range(100010)]
DP= [[0 for j in range(100100)] for i in range(110)]
for i in range(N):
A,B=list(map(int,input().split()))
weight[i]=A
value[i]=B
for i in range(N):
for w in range(W+1):
if w>=weight[i]:
DP[i+1][w]=max(DP[i][w-weight[i]]+value[i],DP[i][w])
else:
DP[i+1][w]=DP[i][w]
print((DP[N][W])) | N,W=list(map(int,input().split()))
S = [[0 for j in range(2)] for i in range(N+1)]
DP= [[0 for j in range(100010)] for i in range(110)]
def chmax(a,b):
if a>b:
return a
else:
return b
for i in range(N):
w,v=list(map(int,input().split()))
S[i][0]=w
S[i][1]=v
for i in range(N):
for j in range(W+1):
if j-S[i][0]>=0:
DP[i+1][j]=chmax(DP[i][j],DP[i][j-S[i][0]]+S[i][1])
else:
DP[i+1][j]=DP[i][j]
print((DP[N][W]))
| p03163 |
n,W = list(map(int, input().split(' ')))
WV = (list(map(int, input().split(' '))) for _ in range(n))
dp = [0] * (W+1)
for w, v in WV:
for j in range(W, w-1, -1):
DP = dp[j-w] + v
if dp[j] < DP:
dp[j] = DP
print((max(dp)))
| def DP():
n,W = list(map(int, input().split(' ')))
WV = (list(map(int, input().split(' '))) for _ in range(n))
dp = [0] * (W+1)
for w, v in WV:
for j in range(W, w-1, -1):
DP = dp[j-w] + v
if dp[j] < DP:
dp[j] = DP
return max(dp)
print((DP()))
| p03163 |
def DP():
n,m=list(map(int,input().split()))
dp=[0]*(m+2)
for i in range(n): #商品を一つずつ見ていく。
w,v=(list(map(int,input().split())))
for j in range(m+1,w,-1): #w~(限界-w)までのdpの箱に入れていく。(例)w,m=3,8なら3~5
if (dp[j-w]+v)>dp[j]:
dp[j]=dp[j-w]+v
else:
dp[j]=dp[j]
return max(dp)
print((DP()))
| def DP():
n,m=list(map(int,input().split()))
dp=[0]*(m+2)
for i in range(n): #商品を一つずつ見ていく。
w,v=(list(map(int,input().split())))
for j in range(m+1,w,-1): #w~(限界-w)までのdpの箱に入れていく。(例)w,m=3,8なら3~5
dp[j]=max(dp[j-w]+v,dp[j])
return max(dp)
print((DP())) | p03163 |
N, W = list(map(int, input().split()))
Bs = []
for i in range(N):
Bs.append(tuple(map(int, input().split())))
dp = [[0 for _ in range(W + 1)] for _ in range(N)]
for i in range(Bs[N - 1][0], W + 1):
dp[N - 1][i] = Bs[N - 1][1]
for i in range(N - 2, -1, -1):
for j in range(W + 1):
dp[i][j] = max(dp[i + 1][j], (dp[i + 1][j - Bs[i][0]] + Bs[i][1]) if j >= Bs[i][0] else 0)
print((dp[0][W])) | N, W = list(map(int, input().split()))
Bs = []
for i in range(N):
Bs.append(tuple(map(int, input().split())))
dp = [[0 for _ in range(W + 1)] for _ in range(N + 1)]
for i in range(N - 1, -1, -1):
for j in range(W + 1):
dp[i][j] = max(dp[i + 1][j], (dp[i + 1][j - Bs[i][0]] + Bs[i][1]) if j >= Bs[i][0] else 0)
print((dp[0][W])) | p03163 |
N, W = list(map(int, input().split()))
Bs = []
for i in range(N):
Bs.append(tuple(map(int, input().split())))
dp = [[0 for _ in range(W + 1)] for _ in range(N + 1)]
for i in range(N - 1, -1, -1):
for j in range(W + 1):
dp[i][j] = max(dp[i + 1][j], (dp[i + 1][j - Bs[i][0]] + Bs[i][1]) if j >= Bs[i][0] else 0)
print((dp[0][W])) | N, W = list(map(int, input().split()))
Bs = [tuple(map(int, input().split())) for _ in range(N)]
dp = [0] * (W + 1)
for w, v in Bs:
for i in range(W, w - 1, -1):
dp[i] = max(dp[i], dp[i - w] + v)
print((dp[W]))
| p03163 |
def main():
goods, weight_limit = list(map(int, input().split()))
good_info = [tuple(map(int, input().split())) for _ in range(goods)]
dp = [[0 for _ in range(weight_limit + 1)] for _ in range(goods + 1)]
for i in range(goods):
for j in range(weight_limit + 1):
if j >= good_info[i][0]:
dp[i + 1][j] = max(dp[i][j], dp[i][j - good_info[i][0]] + good_info[i][1])
else:
dp[i + 1][j] = dp[i][j]
print((dp[goods][weight_limit]))
if __name__ == '__main__':
main()
| def main():
goods, weight_limit = list(map(int, input().split()))
weight = []
value = []
for _ in range(goods):
w, v = list(map(int, input().split()))
weight.append(w)
value.append(v)
dp = [[0 for _ in range(weight_limit + 1)] for _ in range(goods + 1)]
for i in range(goods):
for j in range(weight_limit + 1):
if j >= weight[i]:
dp[i + 1][j] = max(dp[i][j], dp[i][j - weight[i]] + value[i])
else:
dp[i + 1][j] = dp[i][j]
print((dp[-1][-1]))
if __name__ == '__main__':
main()
| p03163 |
from pprint import pprint
import sys
N, W = list(map(int, sys.stdin.readline().strip().split(" ")))
w = []
for _ in range(N):
w_i, v_i = list(map(int, sys.stdin.readline().strip().split(" ")))
w.append((w_i, v_i))
dp = []
for _ in range(N+1):
dp.append([0] * (W+1))
for i in range(N):
for j in range(W+1):
if j - w[i][0] >= 0:
dp[i+1][j] = max(dp[i][j - w[i][0]] + w[i][1], dp[i+1][j])
dp[i+1][j] = max(dp[i][j], dp[i+1][j])
# pprint(dp)
print((dp[N][W])) | from pprint import pprint
import sys
N, W = list(map(int, sys.stdin.readline().strip().split(" ")))
w = []
for _ in range(N):
w_i, v_i = list(map(int, sys.stdin.readline().strip().split(" ")))
w.append((w_i, v_i))
dp = []
for _ in range(N+1):
dp.append([0] * (W+1))
for i in range(N):
for j in range(W+1):
if j - w[i][0] >= 0:
# dp[i+1][j] = max(dp[i][j - w[i][0]] + w[i][1], dp[i+1][j])
dp[i+1][j] = dp[i][j - w[i][0]] + w[i][1]
dp[i+1][j] = max(dp[i][j], dp[i+1][j])
# pprint(dp)
print((dp[N][W])) | p03163 |
# https://atcoder.jp/contests/dp/submissions/13960132
def MAX(a, b):
d = a + ms - b
return b + ((((d & ms) >> (K - 1)) * tt) & d)
def tolist(n):
sx = bin(n)[2:] + "_"
return [int(sx[-(i+1) * K - 1:-i * K - 1], 2) for i in range((len(sx)+K-2) // K)]
K = 52
N, W = list(map(int, input().split()))
ms = int(("1" + "0" * (K - 1)) * (W + 1), 2)
tt = (1 << K - 1) - 1
one = int(("0" * (K - 1) + "1") * (W + 1), 2)
s = 1 << K - 2 + (W * K)
for _ in range(N):
w, v = list(map(int, input().split()))
s = MAX(s, (s >> w * K) + one * v)
print((max(tolist(s)) - (1 << K - 2))) | # https://atcoder.jp/contests/dp/submissions/13960132
def MAX(a, b):
d = a + ms - b
return b + ((ms - ((d & ms) >> (K - 1))) & mask & d)
def tolist(n):
sx = bin(n)[2:] + "_"
return [int(sx[-(i+1) * K - 1:-i * K - 1], 2) for i in range((len(sx)+K-2) // K)]
K = 52
N, W = list(map(int, input().split()))
ms = int(("1" + "0" * (K - 1)) * (W + 1), 2)
mask = int(("0" + "1" * (K - 1)) * (W + 1), 2)
tt = (1 << K - 1) - 1
one = int(("0" * (K - 1) + "1") * (W + 1), 2)
s = 1 << K - 2 + (W * K)
for _ in range(N):
w, v = list(map(int, input().split()))
s = MAX(s, (s >> w * K) + one * v)
print((max(tolist(s)) - (1 << K - 2))) | p03163 |
N, W = list(map(int, input().split()))
wv = [list(map(int, input().split())) for _ in range(N)]
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(N):
w, v = wv[i]
for j in range(W+1):
if j<w:
dp[i][j] = dp[i-1][j]
continue
dp[i][j] = max(dp[i-1][j-w]+v, dp[i-1][j])
print((max(dp[N-1]))) | N, W = list(map(int, input().split()))
dp = [[0]*(W+1) for _ in range(N+1)]
for i in range(N):
w, v = list(map(int, input().split()))
for j in range(W+1):
if j<w:
dp[i][j] = dp[i-1][j]
continue
dp[i][j] = max(dp[i-1][j-w]+v, dp[i-1][j])
print((max(dp[N-1]))) | p03163 |
n,w_lim = list(map(int,input().split()))
dp = [[0 for i in range(w_lim+1)] for i in range(n+1)]
w,v = [],[]
for i in range(n):
ww,vv = list(map(int,input().split()))
w.append(ww)
v.append(vv)
#初期条件
for ww in range(w_lim+1): dp[0][ww] = v[0] if ww>=w[0] else 0
#漸化式
for i in range(n-1):
for ww in range(w_lim+1):
dp[i+1][ww] = dp[i][ww] if w[i+1]>ww else max(dp[i][ww], dp[i][ww-w[i+1]]+v[i+1])
ans = dp[n-1][w_lim]
print(ans)
| n,w_lim = list(map(int,input().split()))
dp = [[0 for i in range(w_lim+1)] for i in range(n)]
w,v = [],[]
for i in range(n):
ww,vv = list(map(int,input().split()))
w.append(ww)
v.append(vv)
#初期条件
for ww in range(w_lim+1): dp[0][ww] = v[0] if ww>=w[0] else 0
#漸化式
for i in range(n-1):
for ww in range(w_lim+1):
dp[i+1][ww] = dp[i][ww] if w[i+1]>ww else max(dp[i][ww], dp[i][ww-w[i+1]]+v[i+1])
ans = dp[n-1][w_lim]
print(ans)
| p03163 |
n,w=list(map(int,input().split()))
weight,value=[0]*110,[0]*110
dp = [[0 for _ in range(100100)] for _ in range(110)]
for i in range(n):
weight[i],value[i] = list(map(int,input().split()))
for i in range(n):
for sum_w in range(w+1):
#i番目の品物を選ぶ
if(sum_w - weight[i] >=0):
dp[i+1][sum_w] =max(dp[i+1][sum_w], dp[i][sum_w - weight[i]]+ value[i])
#選ばない場合
dp[i + 1][sum_w] = max(dp[i + 1][sum_w], dp[i][sum_w])
print((dp[n][w])) | N,W=list(map(int,input().split()))
w,v=[],[]
for i in range(N):
weight, value = list(map(int,input().split()))
w.append(weight)
v.append(value)
dp = [[0 for _ in range(100100)] for _ in range(N+2)]
for i in range(N):
for sum_w in range(W+1):
if sum_w -w[i] >=0:
dp[i+1][sum_w] = max(dp[i+1][sum_w],dp[i][sum_w-w[i]] + v[i])
dp[i+1][sum_w]=max(dp[i+1][sum_w],dp[i][sum_w])
print((dp[N][W])) | p03163 |
from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
INF, NINF = float('inf'), float('-inf')
def main():
n, W = rli()
weight = [0 for _ in range(n)]
val = [0 for _ in range(n)]
for i in range(n):
w, v = rli()
weight[i], val[i] = w, v
#dp(i, j) = max val using items 1,...,i at
# weight j
dp = [[NINF for c in range(W+1)] for r in range(n+1)]
for r in range(n+1):
dp[r][0] = 0
for c in range(W+1):
dp[0][c] = 0
for r in range(1, n+1):
w, v = weight[r-1], val[r-1]
for c in range(1, W+1):
if c - w < 0:
dp[r][c] = max(dp[r][c], dp[r-1][c])
else:
dp[r][c] = max(dp[r][c], dp[r-1][c], v + dp[r-1][c-w])
print((dp[-1][-1]))
stdout.close()
if __name__ == "__main__":
main() | from sys import stdin, stdout
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: list(map(int, stdin.readline().split()))
INF, NINF = float('inf'), float('-inf')
def main():
n, W = rli()
weight = [0 for _ in range(n)]
val = [0 for _ in range(n)]
for i in range(n):
w, v = rli()
weight[i], val[i] = w, v
#dp(i, j) = max val using items 1,...,i at
# weight j
dp = [[NINF for c in range(W+1)] for r in range(n+1)]
for r in range(n+1):
dp[r][0] = 0
for c in range(W+1):
dp[0][c] = 0
for r in range(1, n+1):
w, v = weight[r-1], val[r-1]
for c in range(1, W+1):
dp[r][c] = dp[r-1][c]
if c - w >= 0:
dp[r][c] = max(dp[r][c], dp[r-1][c], v + dp[r-1][c-w])
print((dp[-1][-1]))
stdout.close()
if __name__ == "__main__":
main() | p03163 |
from bisect import bisect_left
def main():
n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for _ in range(n)]
dp = [0]*(w+1)
item.sort()
for i in range(n):
for j in reversed(list(range(item[i][0], w+1))):
dp[j] = max(dp[j-item[i][0]]+item[i][1], dp[j])
print((dp[w]))
if __name__ == "__main__":
main()
| from bisect import bisect_left
def main():
n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for _ in range(n)]
dp = [0]*(w+1)
item.sort()
x = 0
for i in range(n):
for j in reversed(list(range(item[i][0], min(w+1, x+item[i][0]+1)))):
dp[j] = max(dp[j-item[i][0]]+item[i][1], dp[j])
x += item[i][0]
ans = 0
for i in reversed(list(range(w+1))):
if dp[i] > ans:
ans = dp[i]
print(ans)
if __name__ == "__main__":
main()
| p03163 |
from bisect import bisect_left
def main():
n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for _ in range(n)]
dp = [0]*(w+1)
item.sort()
x = 0
for i in range(n):
for j in reversed(list(range(item[i][0], min(w+1, x+item[i][0]+1)))):
dp[j] = max(dp[j-item[i][0]]+item[i][1], dp[j])
x += item[i][0]
print((max(dp)))
if __name__ == "__main__":
main()
| from bisect import bisect_left
def main():
n, w = list(map(int, input().split()))
item = [list(map(int, input().split())) for _ in range(n)]
dp = [0]*(w+1)
item.sort()
x = 0
for p, q in item:
for j in reversed(list(range(p, min(w+1, x+p+1)))):
dp[j] = max(dp[j-p]+q, dp[j])
x += p
print((max(dp)))
if __name__ == "__main__":
main()
| p03163 |
n, w = list(map(int, input().split()))
things = []
things.append([0,0])
things += [list(map(int, input().split())) for _ in range(n)]
dp = [[0 for _ in range(w + 1)] for _ in range(n + 1)]
def do_dp():
for i,thing in enumerate(things):
dp_1 = dp[i-1]
for j in range(1, w + 1):
dp[i][j] = dp_1[j-thing[0]] + thing[1] if (j - thing[0]) >= 0 else dp_1[j]
dp[i][j] = max(dp[i][j], dp_1[j])
do_dp()
print((dp[n][w]))
| n, w = list(map(int, input().split()))
dp = [0]*(w+1)
for _ in range(n):
wei, v = list(map(int, input().split()))
dp_1 = dp[:]
for j in range(w + 1):
if j - wei >= 0:
dp[j] = dp_1[j-wei] + v if (dp_1[j-wei] + v) > dp_1[j] else dp[j]
print((dp[w]))
| p03163 |
N, W = list(map(int, input().split()))
dp = [[0 for i in range(W + 1)] for j in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((max(dp[N]))) | N, W = list(map(int, input().split()))
dp = [[0 for i in range(W + 1)] for j in range(N + 1)]
for i in range(1, N + 1):
w, v = list(map(int, input().split()))
for j in range(1, W + 1):
if j - w >= 0:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - w] + v)
else:
dp[i][j] = dp[i - 1][j]
print((dp[N][W])) | p03163 |
# D - Knapsack 1
from collections import defaultdict
def main():
N, W, *WV = list(map(int, open(0).read().split()))
dp = defaultdict(int)
dp[0] = 0
for w, v in zip(*[iter(WV)] * 2):
for cur_w, cur_v in tuple(dp.items()):
if w + cur_w <= W:
dp[w + cur_w] = max(dp[w + cur_w], v + cur_v)
print((max(dp.values())))
if __name__ == "__main__":
main()
| # D - Knapsack 1
def solve_knapsack(weight_limit: int, weights: list, values: list) -> int:
dp = [0] * (weight_limit + 1) # dp[i] := optimum value at weight i
for w, v in zip(weights, values):
for cur_w in range(weight_limit, w - 1, -1):
dp[cur_w] = max(dp[cur_w], dp[cur_w - w] + v)
return dp[-1]
def main():
N, W, *WV = list(map(int, open(0).read().split()))
print((solve_knapsack(W, WV[::2], WV[1::2])))
if __name__ == "__main__":
main()
| p03163 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
N, W = list(map(int, input().split()))
dp = [0]*(W+1)
for _ in range(N):
w, v = list(map(int, input().split()))
for j in range(W,-1,-1):# 後ろから更新しないとダメ
if j - w >= 0:
dp[j] = max(dp[j], dp[j-w]+v)
print((dp[W]))
if __name__ == "__main__":
main()
| def main():
N, W = list(map(int, input().split()))
dp = [0]*(W+1)
for _ in range(N):
w, v = list(map(int, input().split()))
for j in range(W,-1,-1):# 後ろから更新しないとダメ
if j - w >= 0:
dp[j] = max(dp[j], dp[j-w]+v)
print((dp[W]))
if __name__ == "__main__":
main() | p03163 |
from sys import stdin
from collections import defaultdict
n, w = [int(i) for i in stdin.readline().split(' ')]
weights = []
values = []
for i in range(0, n):
cur = [int(i) for i in stdin.readline().split(' ')]
weights.append(cur[0])
values.append(cur[1])
dp = defaultdict(lambda: defaultdict(int))
dp[0][0] = 0+0
for minInd in range(0, n):
for allowed in range(0, w):
dp[minInd+1][allowed] = max(dp[minInd+1][allowed], dp[minInd][allowed])
if allowed+weights[minInd] <= w:
dp[minInd+1][allowed+weights[minInd]] = max(dp[minInd+1][allowed+weights[minInd]], dp[minInd][allowed]+values[minInd])
print((max(dp[n].values())))
| def woo(n, w):
res = [0 for i in range(0, w+1)]
for i in range(0, n):
ww, vv = list(map(int, input().split()))
for j in range(w, ww-1, -1):
wtotal = j + ww
vtotal = res[j-ww] + vv
if vtotal > res[j]:
res[j] = vtotal
return res
if __name__ == '__main__':
n, w = list(map(int, input().split()))
r = woo(n, w)
print((max(r))) | p03163 |
def woo(n, w):
res = [0 for i in range(0, w+1)]
for i in range(0, n):
ww, vv = list(map(int, input().split()))
for j in range(w, ww-1, -1):
wtotal = j + ww
vtotal = res[j-ww] + vv
if vtotal > res[j]:
res[j] = vtotal
return res
if __name__ == '__main__':
n, w = list(map(int, input().split()))
r = woo(n, w)
print((max(r))) | def main():
n, w = tuple([int(e) for e in input().split()])
items = []
for i in range(n):
items.append(tuple([int(e) for e in input().split()]))
t = [[0] * (n + 1) for _ in range(w + 1)]
for i in range(1, w + 1):
for j in range(1, n + 1):
if i - items[j - 1][0] >= 0:
t[i][j] = t[i - items[j - 1][0]][j - 1] + items[j - 1][1]
t[i][j] = max(t[i][j], t[i][j - 1], t[i - 1][j], t[i - 1][j - 1])
print((t[w][n]))
return 0
if __name__ == "__main__":
main() | p03163 |
def main():
n, w = tuple([int(e) for e in input().split()])
items = []
for i in range(n):
items.append(tuple([int(e) for e in input().split()]))
t = [[0] * (n + 1) for _ in range(w + 1)]
for i in range(1, w + 1):
for j in range(1, n + 1):
if i - items[j - 1][0] >= 0:
t[i][j] = t[i - items[j - 1][0]][j - 1] + items[j - 1][1]
t[i][j] = max(t[i][j], t[i][j - 1], t[i - 1][j], t[i - 1][j - 1])
print((t[w][n]))
return 0
if __name__ == "__main__":
main() | n,W = list(map(int,input().split()))
w = []
v = []
for x in range(n):
peso,valor = list(map(int,input().split()))
w.append(peso)
v.append(valor)
dp = [0] * (W+1)
for i in range(n):
for j in range(W,-1,-1):
if j + w[i] <= W:
dp[j+w[i]] = max(dp[j+w[i]], dp[j] + v[i])
resposta = 0
for x in dp:
resposta = max(x,resposta)
print(resposta)
| p03163 |
n, w = list(map(int, input().split()))
dp = [-1] * (w + 1)
dp[w] = 0
for i in range(n):
input_w, input_v = list(map(int, input().split()))
for i in range(input_w, w + 1):
if dp[i] == -1:
continue
if dp[i - input_w] < dp[i] + input_v:
dp[i - input_w] = dp[i] + input_v
print((max(dp))) | def main():
n, w = list(map(int, input().split()))
dp = [-1] * (w + 1)
dp[w] = 0
for i in range(n):
input_w, input_v = list(map(int, input().split()))
for i in range(input_w, w + 1):
if dp[i] == -1:
continue
if dp[i - input_w] < dp[i] + input_v:
dp[i - input_w] = dp[i] + input_v
print((max(dp)))
main() | p03163 |
import sys
input = sys.stdin.readline
def main():
N, W = [int(x) for x in input().split()]
wv = [[int(x) for x in input().split()] for _ in range(N)]
dp = [[0] * (W + 1) for j in range(N)]
for j in range(N):
for i in range(W + 1):
if j == 0:
if i < wv[j][0]:
continue
dp[j][i] = wv[j][1]
else:
if i < wv[j][0]:
dp[j][i] = dp[j - 1][i]
else:
dp[j][i] = max(dp[j - 1][i], dp[j - 1][i - wv[j][0]] + wv[j][1])
print((max(dp[-1])))
if __name__ == '__main__':
main()
| import sys
input = sys.stdin.readline
def main():
N, W = [int(x) for x in input().split()]
wv = [[int(x) for x in input().split()] for _ in range(N)]
dp = [[0] * (W + 1) for j in range(N + 1)]
for j in range(N):
for i in range(W + 1):
if i < wv[j][0]:
dp[j + 1][i] = dp[j][i]
else:
dp[j + 1][i] = max(dp[j][i], dp[j][i - wv[j][0]] + wv[j][1])
print((dp[N][W]))
if __name__ == '__main__':
main()
| p03163 |
def resolve():
n, w = list(map(int, input().split()))
goods = [list(map(int, input().split())) for _ in range(n)]
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in reversed(list(range(w + 1))):
# もしi番目の品物が入るのであれば
if goods[i - 1][0] <= j:
dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - goods[i - 1][0]] + goods[i - 1][1])
else:
dp[i][j] = dp[i - 1][j]
print((dp[n][w]))
resolve() | def resolve():
n, w = list(map(int, input().split()))
goods = [list(map(int, input().split())) for _ in range(n)]
dp = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
for j in reversed(list(range(w + 1))):
tmp = dp[i - 1][j - goods[i - 1][0]] + goods[i - 1][1] if j >= goods[i - 1][0] else 0
dp[i][j] = max(dp[i - 1][j], tmp)
print((dp[n][w]))
resolve() | p03163 |
N, W = list(map(int, input().split()))
W += 1
A = [[0] * W for _ in range(N)]
wi, vi = list(map(int, input().split()))
for w in range(W):
A[0][w] = 0 if w < wi else vi
for i in range(1, N):
wi, vi = list(map(int, input().split()))
for w in range(W):
A[i][w] = max([
A[i-1][w_] + vi for w_ in range(w - wi + 1)
] + [A[i-1][w]])
print((max(A[-1]))) | N, W = list(map(int, input().split()))
W += 1
A = [0] * W
wi, vi = list(map(int, input().split()))
A[wi] = vi
for _ in range(N-1):
wi, vi = list(map(int, input().split()))
tmp = [0] * W
for w in range(W):
if w-wi < 0:
tmp[w] = A[w]
else:
tmp[w] = max(A[w-wi] + vi, A[w])
A = tmp
print((max(A))) | p03163 |
def rec(depth, w, v):
if w > maxW:
return
WV[depth][w] = max(v, WV[depth][w])
if depth+1 >= N:
return
rec(depth+1, w+W[depth+1], v+V[depth+1])
rec(depth+1, w, v)
N, maxW = list(map(int, input().split()))
WV = [[-1 for i in range(maxW+1)] for j in range(N)]
W = [0 for i in range(N)]
V = [0 for i in range(N)]
for i in range(N):
W[i], V[i] = list(map(int, input().split()))
rec(0, 0, 0)
rec(0, W[0], V[0])
print((max(WV[-1])))
| N, maxW = list(map(int, input().split()))
WV = [[0 for i in range(maxW+1)] for j in range(N+1)]
W = [0 for i in range(N+1)]
V = [0 for i in range(N+1)]
for i in range(1, N+1):
W[i], V[i] = list(map(int, input().split()))
for i in range(1, N+1):
for w in range(maxW+1):
WV[i][w] = max(WV[i-1][w], WV[i][w])
nw = w + W[i]
if nw <= maxW:
WV[i][nw] = WV[i-1][w] + V[i]
print((max(WV[-1]))) | p03163 |
def main():
from collections import deque
n,w=list(map(int,input().split()))
item=deque([list(map(int,input().split())) for _ in range(n)])
DP=[[0]*(w+1) for _ in range(n+1)]
for i in range(1,n+1):
itemNow=item.popleft()
weight=itemNow[0]
value=itemNow[1]
for j in range(w+1):
if j<weight:
DP[i][j]=DP[i-1][j]
else:
DP[i][j]=max(DP[i-1][j],DP[i-1][j-weight]+value)
print((DP[n][w]))
if __name__=="__main__":
main() | def main():
import sys
num,capacity=list(map(int,input().split()))
items=tuple([list(map(int,sys.stdin.readline().split())) for _ in range(num)])
DP=[-1]*(capacity+1)
DP[0]=0
for item in items:
weight=item[0]
value=item[1]
left=capacity-weight
for i in range(left,-1,-1):
if DP[i]<0:
continue
DP[i+weight]=max(DP[i]+value,DP[i+weight])
print((max(DP)))
if __name__=="__main__":
main() | p03163 |
def main():
import sys
sys.setrecursionlimit(10**7)
N,W=list(map(int,sys.stdin.readline().split()))
dp=[[0]*N for _ in range(W+1)]#W*N
WL=[0]* N
VL=[0]*N
for i in range(N):
w,v=list(map(int,sys.stdin.readline().split()))
WL[i]=w
VL[i]=v
def dfs(W,i):
if i==N:
return 0
if dp[W][i]:
return dp[W][i]
if W-WL[i]>=0:
dp[W][i]=max(dfs(W,i+1),dfs(W-WL[i],i+1)+VL[i])
return dp[W][i]
else:
dp[W][i]=dfs(W,i+1)
return dp[W][i]
print((dfs(W,0)))
main()
| def main():
import sys
sys.setrecursionlimit(10**7)
N,W=list(map(int,sys.stdin.readline().split()))
dp=[[0]*(W+1) for _ in range(N+1)]#N*W
WL=[0]*N
VL=[0]*N
for i in range(N):
w,v=list(map(int,sys.stdin.readline().split()))
WL[i]=w
VL[i]=v
for i in range(1,N+1):
for w in range(1,W+1):
if w>=WL[i-1]:
a=dp[i-1][w-WL[i-1]]+VL[i-1]
b=dp[i-1][w]
dp[i][w]=max(a,b)
else:
dp[i][w]=dp[i-1][w]
print((dp[-1][-1]))
main()
| p03163 |
def knapsack1(N,W,H,max_W):
#print(W,H,max_W)
#print(H[1][0],H[1][1])
DP = [[0]*(max_w+1) for i in range(N+1)]
#print(DP[0][0],DP[0][1])
for i in range(N):
for j in range(max_w+1):
if j-H[i][0] >= 0:
DP[i+1][j] = chmax(DP[i+1][j],DP[i][j-H[i][0]]+H[i][1])
else:
DP[i+1][j] = chmax(DP[i+1][j],DP[i][j])
#print(DP)
#print(DP)
return DP
def chmax(a,b):
if a > b:
return a
else:
return b
if __name__ == '__main__':
N,W = list(map(int,input().split()))
H = [[0]*2 for i in range(N)]
max_w = 0
for i in range(N):
lst = list(map(int,input().split()))
H[i] = lst
max_w += lst[0]
ans = knapsack1(N,W,H,max_w)
finlst = []
finans = 0
for i in range(N+1):
#print(ans[i][W])
maxr = max(ans[i][:W+1])
if maxr > finans:
finans = maxr
print(finans)
#print(lstx)
#print(max(ans[-1]))
|
def knapsack1(N,W,weight,value):
inf = float("inf")
DP = [[-inf]*(W+1) for i in range(N+1)]
for i in range(W+1): DP[0][i]=0
for i in range(N):
for j in range(W+1):
if j-weight[i] >= 0:
DP[i+1][j] = chmax(DP[i][j],DP[i][j-weight[i]]+value[i])
else:
DP[i+1][j] = chmax(DP[i+1][j],DP[i][j])
return DP[N][W]
def chmax(a,b):
if a > b:
return a
else:
return b
if __name__ == '__main__':
N,W = list(map(int,input().split()))
weight = [0]*N
value = [0]*N
#print(weight,value)
for i in range(N):
lst = list(map(int,input().split()))
#print(lst)
weight[i] = lst[0]
value[i] = lst[1]
#max_w += lst[0]
#print(weight,value)
ans = knapsack1(N,W,weight,value)
print(ans)
#print(max(max(ans)))
#print(max(ans[-1]))
| p03163 |
import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
for _ in range(N):
w, v = list(map(int, input().split()))
for wk in range(W, w-1, -1):
tv = dp[wk - w] + v
if tv > dp[wk]:
dp[wk] = tv
print((max(dp))) |
import sys
input = sys.stdin.readline
N, W = list(map(int, input().split()))
dp = [0] * (W + 1)
def knapsack(n, w):
for _ in range(N):
w, v = list(map(int, input().split()))
for wk in range(W, w-1, -1):
tv = dp[wk - w] + v
if tv > dp[wk]:
dp[wk] = tv
return dp[-1]
print((knapsack(N, W))) | p03163 |
N, W = list(map(int, input().split()))
weights = [None for i in range(N)]
values = [None for i in range(N)]
# dp[i][j] = maximum value using at most i weight and using elements 1,...,j
dp = [[0 for i in range(N+1)] for j in range(W+1)]
for i in range(N):
w, v = list(map(int, input().split()))
weights[i] = w
values[i] = v
for weight in range(W+1):
for item in range(1,N+1):
if weights[item-1] > weight: continue
dp[weight][item] = max([dp[weight][item]] +
[values[item-1] + dp[weight - weights[item-1]][j] for j in range(item)])
dp[weight][item] = max(dp[weight-1][item], dp[weight][item])
print((max(dp[-1])))
| N, W = list(map(int, input().split()))
weights = [None for i in range(N)]
values = [None for i in range(N)]
# dp[i][j] = maximum value using at most i weight and using elements 1,...,j
dp = [[0 for i in range(N+1)] for j in range(W+1)]
for i in range(N):
w, v = list(map(int, input().split()))
weights[i] = w
values[i] = v
for weight in range(W+1):
for item in range(1,N+1):
# Case: dont include item
dp[weight][item] = max(dp[weight][item],
dp[weight][item-1])
# Case: include item
dp[weight][item] = max(dp[weight][item],
dp[weight-1][item])
if weights[item-1] > weight: continue
# Case: include item
dp[weight][item] = max(dp[weight][item],
values[item-1] + dp[weight - weights[item-1]][item - 1])
print((max(dp[-1])))
| p03163 |
def solve(items, n, w):
f = [[0] * (w + 1) for _ in range(n + 1)]
for i in range(1, n + 1):
wi, vi = items[i-1]
for j in range(w + 1):
f[i][j] = f[i-1][j]
if j >= wi:
f[i][j] = max(f[i][j], f[i-1][j-wi] + vi)
return f[n][w]
def main():
inp = lambda: [int(x) for x in input().split()]
n, w = inp()
items = [inp() for _ in range(n)]
print((solve(items, n, w)))
if __name__ == '__main__':
main()
| def solve(items, n, w):
dp = [0] * (w+1)
for i in range(n):
wi, vi = items[i]
for j in range(w, wi-1, -1):
dp[j] = max(dp[j], dp[j-wi] + vi)
return dp[w]
def main():
inp = lambda: [int(x) for x in input().split()]
n, w = inp()
items = [inp() for _ in range(n)]
print((solve(items, n, w)))
if __name__ == '__main__':
main()
| p03163 |
# -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 18:19:39 2020
@author: matsui
"""
N,W=list(map(int,input().split()))
dp=[0]*(W+1)
L = sorted([list(map(int,input().split())) for i in range(N)])
s=0
for w, v in L:
s+=w
for j in range(min(W,s),w-1,-1):
dp[j]=max(dp[j],dp[j-w]+v)
print((max(dp)))
| # -*- coding: utf-8 -*-
"""
Created on Tue Jan 21 18:19:39 2020
@author: matsui
"""
N,W=list(map(int,input().split()))
dp=[0]*(W+1)
L = sorted([list(map(int,input().split())) for i in range(N)])
s=0
for w, v in L:
s+=w
for j in range(min(W,s),w-1,-1):
if dp[j-w]+v > dp[j]: dp[j]=dp[j-w]+v
print((max(dp)))
| p03163 |
import sys
input=sys.stdin.readline
n,w=list(map(int,input().split()))
dp=[0]*(w+1)
c,p=list(map(int,input().split()))
dp[c]=p
def ans(n,w):
for _ in range(1,n):
c,p=list(map(int,input().split()))
for j in range(w,c-1,-1):
if dp[j]<dp[j-c]+p:
dp[j]=dp[j-c]+p
return max(dp)
print((ans(n,w))) | import sys
input=sys.stdin.readline
n,w=list(map(int,input().split()))
dp=[0]*(w+1)
def ans(n,w):
for _ in range(n):
c,p=list(map(int,input().split()))
for j in range(w,c-1,-1):
tmp=dp[j-c]+p
if dp[j]<tmp:
dp[j]=tmp
return max(dp)
print((ans(n,w))) | p03163 |
import sys
input=sys.stdin.readline
n,w=list(map(int,input().split()))
dp=[0]*(w+1)
def ans(n,w):
for _ in range(n):
c,p=list(map(int,input().split()))
for j in range(w,c-1,-1):
tmp=dp[j-c]+p
if dp[j]<tmp:
dp[j]=tmp
return max(dp)
print((ans(n,w))) | import sys
input=sys.stdin.readline
n,w=list(map(int,input().split()))
dp=[0]*(w+1)
c,p=list(map(int,input().split()))
dp[c]=p
def ans(n,w):
for _ in range(1,n):
c,p=list(map(int,input().split()))
for j in range(w,c,-1):
if dp[j-c] != 0 and dp[j]<dp[j-c]+p:
dp[j]=dp[j-c]+p
if dp[c] < p:
dp[c]=p
return max(dp)
print((ans(n,w)))
| p03163 |
N,W = [int(i) for i in input().rstrip().split()]
F = [[int(i) for i in input().rstrip().split()] for _ in range(N)]
def dp(f,w):
global F
if w < 0:
return -10**9
if f == 0:
if w < F[0][0]:
return 0
else:
return F[0][1]
return max(dp(f-1,w),dp(f-1,w-F[f][0])+F[f][1])
print((dp(N-1,W))) | N,W = [int(i) for i in input().rstrip().split()]
F = [[int(i) for i in input().rstrip().split()] for _ in range(N)]
DP = []
for w,v in F:
if DP == []:
DP = [0]*w+[v]*(W-w+1)
else:
dp = DP[::]
for w2 in range(w,W+1):
dp[w2] = max(DP[w2-w] + v, DP[w2])
DP = dp
#print(DP)
print((DP[-1]))
| p03163 |
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
文字列で与えられた盤面を読み取る用
'''
return [read() for _ in range(H)]
def read_col(H, n_cols):
'''
H is number of rows
n_cols is number of cols
A列、B列が与えられるようなとき
'''
ret = [[] for _ in range(n_cols)]
for _ in range(H):
tmp = list(map(int, read().split()))
for col in range(n_cols):
ret[col].append(tmp[col])
return ret
def main():
N, K = read_ints()
W, V = read_col(N, 2)
dp = [[-float('inf') for _ in range(K + 1)] for _ in range(N + 1)]
dp[0] = [0] * (K + 1)
for i in range(N + 1):
dp[i][0] = 0
for sum_w in range(K + 1):
for i in range(N):
if sum_w - W[i] < 0:
dp[i + 1][sum_w] = dp[i][sum_w]
else:
dp[i + 1][sum_w] = max(
dp[i][sum_w],
dp[i][sum_w - W[i]] + V[i]
)
print((dp[-1][-1]))
main()
| import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, read().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
文字列で与えられた盤面を読み取る用
'''
return [read() for _ in range(H)]
def read_col(H, n_cols):
'''
H is number of rows
n_cols is number of cols
A列、B列が与えられるようなとき
'''
ret = [[] for _ in range(n_cols)]
for _ in range(H):
tmp = list(map(int, read().split()))
for col in range(n_cols):
ret[col].append(tmp[col])
return ret
def main():
N, K = read_ints()
# W, V = read_col(N, 2)
dp = [[-float('inf') for _ in range(K + 1)] for _ in range(N + 1)]
dp[0] = [0] * (K + 1)
for i in range(N + 1):
dp[i][0] = 0
for i in range(N):
w, v = read_ints()
for sum_w in range(K + 1):
if sum_w - w < 0:
dp[i + 1][sum_w] = dp[i][sum_w]
else:
dp[i + 1][sum_w] = max(
dp[i][sum_w],
dp[i][sum_w - w] + v)
print((dp[-1][-1]))
main()
| p03163 |
import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, input().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
文字列で与えられた盤面を読み取る用
'''
return [read() for _ in range(H)]
def read_col(H, n_cols):
'''
H is number of rows
n_cols is number of cols
A列、B列が与えられるようなとき
'''
ret = [[] for _ in range(n_cols)]
for _ in range(H):
tmp = list(map(int, read().split()))
for col in range(n_cols):
ret[col].append(tmp[col])
return ret
def main():
N, K = read_ints()
# W, V = read_col(N, 2)
dp = [[-float('inf') for _ in range(K + 1)] for _ in range(N + 1)]
dp[0] = [0] * (K + 1)
for i in range(N + 1):
dp[i][0] = 0
for i in range(N):
w, v = read_ints()
for sum_w in range(K + 1):
if sum_w - w < 0:
dp[i + 1][sum_w] = dp[i][sum_w]
else:
dp[i + 1][sum_w] = max(
dp[i][sum_w],
dp[i][sum_w - w] + v)
print((dp[-1][-1]))
main()
| import sys
read = sys.stdin.readline
def read_ints():
return list(map(int, input().split()))
def read_a_int():
return int(read())
def read_matrix(H):
'''
H is number of rows
'''
return [list(map(int, read().split())) for _ in range(H)]
def read_map(H):
'''
H is number of rows
文字列で与えられた盤面を読み取る用
'''
return [read() for _ in range(H)]
def read_col(H, n_cols):
'''
H is number of rows
n_cols is number of cols
A列、B列が与えられるようなとき
'''
ret = [[] for _ in range(n_cols)]
for _ in range(H):
tmp = list(map(int, read().split()))
for col in range(n_cols):
ret[col].append(tmp[col])
return ret
def main():
N, K = read_ints()
dp = [[-10 for _ in range(K + 1)] for _ in range(N + 1)]
dp[0] = [0] * (K + 1)
for i in range(N + 1):
dp[i][0] = 0
for i in range(N):
w, v = read_ints()
for sum_w in range(K + 1):
if sum_w - w < 0:
dp[i + 1][sum_w] = dp[i][sum_w]
else:
dp[i + 1][sum_w] = max(
dp[i][sum_w],
dp[i][sum_w - w] + v)
print((dp[-1][-1]))
main()
# pythonでもpypyでもTLE
| p03163 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.