input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
N,M=list(map(int,input().split()))
X = [[] for i in range(8)]
for i in range(N):
x,y,z=list(map(int,input().split()))
for i in range(8):
X[i].append(int(2*((i%2)-1/2))*x + int(2*(((i//2)%2)-1/2))*y + int(2*(((i//4)%2)-1/2))*z)
ans=0
for i in range(8):
X[i].sort()
X[i]=X[i][::-1]
an... | N,M = list(map(int,input().split()))
X = []
for i in range(N):
x,y,z = list(map(int,input().split()))
X.append([x,y,z])
max_score = 0
for i in range(8):
a = i%2
j = i//2
b = j%2
k = j//2
c = k%2
a,b,c = 2*a-1,2*b-1,2*c-1
Z = []
for j in range(N):
Z.ap... | p03326 |
from itertools import product
n, m = list(map(int, input().split()))
xyz = [tuple(map(int, input().split())) for _ in range(n)]
ans = 0
for subset in product((-1, 1), repeat=3):
INF = 10**18
dp = [-INF]*(n+1)
dp[0] = 0
def func(xyz):
return sum(x*a for x, a in zip(xyz, subset))
... | from itertools import product
n, m = list(map(int, input().split()))
xyz = [tuple(map(int, input().split()))for _ in range(n)]
ans = 0
for subset in product((-1, 1), repeat=3):
def func(xyz):
return sum(x*a for x, a in zip(xyz, subset))
score = sum(sorted(map(func, xyz), reverse=True)[:m])
... | p03326 |
n, m = list(map(int, input().split()))
v = [list(map(int, input().split())) for i in range(n)]
ans = 0
op = [-1,1]
for i in range(2):
for j in range(2):
for k in range(2):
sx, sy, sz = op[i], op[j], op[k]
dp = [0]*(m+1)
for l, (x, y, z) in enumerate(v):
... | n, m = list(map(int, input().split()))
v = [list(map(int, input().split())) for i in range(n)]
ans = 0
op = [-1,1]
for i in range(2):
for j in range(2):
for k in range(2):
sx, sy, sz = op[i], op[j], op[k]
dp = [-float("inf")]*(m+1)
dp[0] = 0
for l, (... | p03326 |
from itertools import product
n,m = list(map(int, input().split()))
# dp[i][j] i個取った時の{+,-}*3 タイプの最大値
dp = [[0]*8 for i in range(m+1)]
op = [i for i in product([-1,1], repeat=3)]
#print(op)
for i in range(n):
x,y,z = list(map(int, input().split()))
nxt = [[0]*8 for i in range(m+1)]
for j in ran... | from itertools import product
n,m = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(n)]
ans = 0
for i, j, k in product([-1,1], repeat=3):
ans = max(ans, sum(sorted(i*x+j*y+k*z for x,y,z in a)[::-1][:m]))
print(ans) | p03326 |
n,m=list(map(int,input().split()))
xyz=[list(map(int,input().split())) for i in range(n)]
lst=[]
for i in range(8):
if i&1==1:
a=1
else:
a=-1
if (i>>1)&1==1:
b=1
else:
b=-1
if (i>>2)&1==1:
c=1
else:
c=-1
h=[0]
for u in xyz:... | n,m=list(map(int,input().split()))
xyz=[list(map(int,input().split())) for i in range(n)]
lst=[]
for i in range(8):
if i&1==1:
a=1
else:
a=-1
if (i>>1)&1==1:
b=1
else:
b=-1
if (i>>2)&1==1:
c=1
else:
c=-1
h=[]
for u in xyz:
... | p03326 |
N,M = list(map(int,input().split()))
xyz = []
for i in range(N):
x,y,z = list(map(int,input().split()))
xyz.append([x,y,z])
ans = -1 * float("inf")
for bpm in range(2):
for dpm in range(2):
for fpm in range(2):
if bpm == 0:
bpm = -1
... |
N,M = list(map(int,input().split()))
xyz = []
for i in range(N):
x,y,z = list(map(int,input().split()))
xyz.append([x,y,z])
ans = -1 * float("inf")
for bpm in range(2):
for dpm in range(2):
for fpm in range(2):
if bpm == 0:
bpm = -1
... | p03326 |
N, M = list(map(int,input().split()))
max = -float('inf')
x = []
y = []
z = []
for i in range(N):
xx,yy,zz = list(map(int,input().split()))
x.append(xx)
y.append(yy)
z.append(zz)
for i in range(-1,2,2):
for j in range(-1,2,2):
for k in range(-1,2,2):
s = []
for m in range(N):
s.append(i*... | n,m = list(map(int,input().split()))
xyz = [list(map(int,input().split())) for _ in range(n)]
res = 0
for a in (1,-1):
for b in (1,-1):
for c in (1,-1):
l = []
for (x,y,z) in xyz:
l.append(x*a+y*b+z*c)
l = sorted(l,reverse=True)
res =... | p03326 |
# D Patisserie
N,M=list(map(int,input().split()))
check=M+10 if M+10<=N else N
xyz_list,x_list,y_list,z_list=[],[],[],[]
for i in range(N):
xyz_list.append(input().split())
for i in range(N):
x_list.append([int(xyz_list[i][0]),i+1])
y_list.append([int(xyz_list[i][1]),i+1])
z_list.append([int(xy... | # D Patisserie
import itertools as itl
#入力を取得
N,M=list(map(int,input().split()))
check=M+10 if M+10<=N else N
xyz_list,x_list,y_list,z_list=[],[],[],[]
for i in range(N):
xyz_list.append(input().split())
var_list=[x for x in itl.product([-1,1],repeat=3)]
sum_list=[]
for i in var_list:
sort_list... | p03326 |
import itertools
N, M = list(map(int, input().split()))
xyz = list()
for n in range(N):
xyz.append([int(x) for x in input().split()])
ans = 0
for x in itertools.combinations(list(range(N)), M):
tmp = [0,0,0]
for m in x:
for y in range(3):
tmp[y] += xyz[m][y]
ans = max(ans,... | import itertools
N, M = list(map(int, input().split()))
xyz = list()
for n in range(N):
xyz.append([int(x) for x in input().split()])
ans = 0
for a,b,c in itertools.product([-1,1], repeat=3):
tmp = []
for x, y, z in xyz:
tmp.append(a*x+b*y+c*z)
tmp.sort(reverse=True)
ans = max(ans... | p03326 |
import itertools
n,m = list(map(int,input().split()))
a = []
for i in range(n):
a.append(list(map(int,input().split())))
ans = 0
b = []
for i in itertools.combinations(a,m):
i0 = 0
i1 = 0
i2 = 0
for j in i:
i0 += j[0]
i1 += j[1]
i2 += j[2]
ans = max(ans... | n,m = list(map(int,input().split()))
a = []
b = []
c = []
d = []
e = []
f = []
g = []
h = []
for i in range(n):
j = list(map(int,input().split()))
a.append(j[0]+j[1]+j[2])
b.append(-j[0]+j[1]+j[2])
c.append(j[0]-j[1]+j[2])
d.append(j[0]+j[1]-j[2])
e.append(-j[0]-j[1]+j[2])
... | p03326 |
import itertools
def main():
N, M = list(map(int, input().split(' ')))
cakes = [list(map(int, input().split(' '))) for _ in range(N)]
ans = 0
for sign in itertools.product([-1, 1], repeat=3):
dp = [[0 for _ in range(M + 1)] for _ in range(N + 1)]
for n in range(N):
... | import itertools
def main():
N, M = list(map(int, input().split(' ')))
cakes = [list(map(int, input().split(' '))) for _ in range(N)]
ans = 0
for sign in itertools.product([-1, 1], repeat=3):
scores = [sum([s * c for s, c in zip(sign, cake)]) for cake in cakes]
scores.sort(rev... | p03326 |
n,m=list(map(int,input().split()))
box=list(list(map(int,input().split())) for i in range(n))
ans = 0
for i in (1,-1):
for j in (1,-1):
for k in (1,-1):
cost=list(i*x+j*y+z*k for x,y,z in box)
cost.sort(reverse=True)
ans=max(ans,sum(cost[:m]))
print(ans) | n,m=list(map(int,input().split()))
XYZ=[list(map(int,input().split())) for _ in range(n)]
ans=0
for i in (-1,1):
for j in (-1,1):
for k in (-1,1):
cost=list(i*x+j*y+z*k for x,y,z in XYZ)
cost.sort(reverse=True)
ans=max(ans,sum(cost[:m]))
print(ans) | p03326 |
import itertools
N,M=[int(i) for i in input().split(" ")]
cake=[]
for i in range(N):
x,y,z=[int(j) for j in input().split(" ")]
cake.append([x,y,z])
_num=[i for i in range(N)]
num=list(itertools.combinations(_num,M))
result=0
for i in num:
delicious=0
beautiful=0
popular=0
for... | N,M=[int(i) for i in input().split(" ")]
cake1=[]
cake2=[]
cake3=[]
cake4=[]
cake5=[]
cake6=[]
cake7=[]
cake8=[]
for i in range(N):
x,y,z=[int(j) for j in input().split(" ")]
cake1.append(x+y+z)
cake2.append(-x+y+z)
cake3.append(x-y+z)
cake4.append(x+y-z)
cake5.append(-x-y+z)
... | p03326 |
n, m = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(n)]
B = []
def pm(n):
if n % 2 == 0:
return 1
else:
return -1
for i in range(8):
temp = sorted([pm(i//4) * x + pm(i//2) * y + pm(i) * z for x, y, z in A], reverse=True)
B.append... | n, m = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(n)]
B = []
def f(x):
if x % 2 == 0:
return 1
else:
return -1
for i in range(8):
temp = sorted([f(i // 4) * x + f(i // 2) * y + f(i) * z for x, y, z in A], reverse=True)
B.append... | p03326 |
N, M = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(N)]
ans = 0
for i in range(1 << 3):
x = bin(i)[2:]
while len(x) < 3:
x = '0' + x
op = ''
for j in x:
if j == '1':
op += '+'
else:
op += '-'
B = ... | N, M = list(map(int, input().split()))
A = [[int(i) for i in input().split()] for i in range(N)]
def f(x):
if x == 1:
return 1
else:
return -1
ans = 0
for i in range(1 << 3):
B = []
for x, y, z in A:
B.append(f((i >> 2) & 1) * x + f((i >> 1) & 1) * y + f(i & 1) * z... | p03326 |
import itertools
N,M = list(map(int,input().split()))
info = [list(map(int,input().split())) for i in range(N)]
note = []
for x,y,z in info:
X = [x,-x]; Y = [y,-y]; Z = [z,-z]
tmp = []
for c in itertools.product(X,Y,Z):
tmp.append(sum(c))
note.append(tmp)
ans = -float('inf')
for j i... | import itertools
N,M = list(map(int,input().split()))
info = [list(map(int,input().split())) for i in range(N)]
ans = -float('inf')
for i,j,k in itertools.product([1,-1],repeat=3):
tmp = []
for x,y,z in info:
value = x*i + y*j + z*k
tmp.append(value)
tmp.sort(reverse=True)
res ... | p03326 |
import itertools
import heapq
n,m = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
ans = 0
c = [0,1]
for l,j,k in itertools.product(c,repeat=3):
ans = max(ans,sum(heapq.nlargest(m,([a[i][0]*(-1)**l+a[i][1]*(-1)**j+a[i][2]*(-1)**k for i in range(n)]))))
print(ans) | from itertools import product as p
n,m = [int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(n)]
c = [1,-1]
ans = 0
for l,j,k in p(c,repeat=3):
ans = max(ans,sum(sorted([a[i][0]*l+a[i][1]*j+a[i][2]*k for i in range(n)])[n-m:]))
print(ans) | p03326 |
# https://abc100.contest.atcoder.jp/tasks/abc100_d
# D - Patisserie ABC
# D_Patisserie_ABC.py
import collections
N, M = list(map(int, input().strip().split(" ")))
A = [[] for i in range(8)]
for n in range(N):
# 「綺麗さ」「おいしさ」「人気度」
x, y, z = list(map(int, input().strip().split(" ")))
A[0].appen... | # https://abc100.contest.atcoder.jp/tasks/abc100_d
# D - Patisserie ABC
# D_Patisserie_ABC.py
#import collections
N, M = list(map(int, input().strip().split(" ")))
A = [[] for i in range(8)]
for n in range(N):
# 「綺麗さ」「おいしさ」「人気度」
x, y, z = list(map(int, input().strip().split(" ")))
A[0].appe... | p03326 |
import re
for i in range(int(eval(input()))):
s=input().replace(" ","")
print((''.join(re.sub(r'0\w','',''.join([i+j for(i,j)in zip(str(10000+eval('+'.join([i[0]+{'m':'*1000','c':'*100','x':'*10','i':''}[i[1]]for i in ['1'+i for i in''.join(re.split(r'\d\w',s))]+re.findall(r'\d\w',s)])))[1:],list('mcxi'))])).split... | import re
for i in range(int(eval(input()))):
s=input().replace(" ","")
print((re.sub(r'0.','',''.join([i+j for(i,j)in zip(str(10000+eval('+'.join([i[0]+{'m':'*1000','c':'*100','x':'*10','i':''}[i[1]]for i in ['1'+i for i in''.join(re.split(r'\d\w',s))]+re.findall(r'\d\w',s)])))[1:],list('mcxi'))]).replace('1','')... | p00718 |
import math
r = float(eval(input()))
s = r*r*math.pi
v = 2*math.pi*r
print(("{:f} {:f}".format(s, v))) | import math
r = float(eval(input()))
s = r**2*math.pi
v = 2*math.pi*r
print(("{:f} {:f}".format(s, v))) | p02400 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.st... | import sys
def LS2():
return list(sys.stdin.readline().rstrip()) #空白なし
s = LS2()
print((s[0]+str(len(s)-2)+s[-1])) | p03636 |
from sys import stdin
s = stdin.readline().rstrip()
print((''.join([s[0], str(len(s) - 2), s[-1]]))) | import sys
s = sys.stdin.readline().rstrip()
l = len(s)
def main():
return s[0] + str(l-2) + s[-1]
if __name__ == '__main__':
ans = main()
print(ans) | p03636 |
from itertools import accumulate
import sys
sys.setrecursionlimit(10**8)
class BIT():
def __init__(self,number):
self.n=number
self.list=[0]*(number+1)
def add(self,i,x):#ith added x 1indexed
while i<=self.n:
self.list[i]+=x
i+=i&-i
... | from itertools import accumulate
import sys
sys.setrecursionlimit(10**8)
class BIT():
def __init__(self,number):
self.n=number
self.list=[0]*(number+1)
def add(self,i,x):#ith added x 1indexed
while i<=self.n:
self.list[i]+=x
i+=i&-i
... | p03703 |
from itertools import accumulate
from bisect import bisect_right
N, K = list(map(int, input().split()))
A = [0] + [int(eval(input())) for i in range(N)]
diff = [a - K for a in A]
diff = list(accumulate(diff))
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit = [... | from itertools import accumulate
from bisect import bisect_right
N, K = list(map(int, input().split()))
A = [3] + [int(eval(input())) for i in range(N)]
diff = [a - K for a in A]
diff = list(accumulate(diff))
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit = [... | p03703 |
from itertools import accumulate
from bisect import bisect_right
N, K = list(map(int, input().split()))
A = [3] + [int(eval(input())) for i in range(N)]
diff = [a - K for a in A]
diff = list(accumulate(diff))
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit = [... | from itertools import accumulate
from bisect import bisect_right
N, K = list(map(int, input().split()))
A = [-19] + [int(eval(input())) for i in range(N)]
diff = [a - K for a in A]
diff = list(accumulate(diff))
class BinaryIndexedTree:
def __init__(self, n):
self.size = n
self.bit =... | p03703 |
N, K = list(map(int, input().split()))
A = [int(eval(input())) for _ in range(N)]
B = [0] * (N + 1)
B[1] = A[0] - K
for i in range(1, N):
A[i] += A[i - 1]
B[i + 1] = A[i] - K * (i + 1)
tmp = sorted(B)
dic = dict()
for index, x in enumerate(tmp):
dic[x] = index
N = len(B)
bit = [0] * (N... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)
MOD = 10 ** 9 + 7
N, K = list(map(int, input().split()))
A = [0] + [int(eval(input())) - K for _ in range(N)]
# print (A)
for i in range(N):
A[i + 1] += A[i]
B = sorted(A)
dic = dict()
for i, b in enumerate(B):
dic[b] = i + 1... | p03703 |
class BIT():
def __init__(self,size):
self.size=size
self.node=[0]*(size+1)
def sum(self,idx):
ret=0
while idx>0:
ret+=self.node[idx]
idx-=idx&(-idx)
return ret
def add(self,idx,x):
while idx<=self.size:
self... | class BIT():
def __init__(self,size):
self.size=size
self.node=[0]*(size+1)
def sum(self,idx):
ret=0
while idx>0:
ret+=self.node[idx]
idx-=idx&(-idx)
return ret
def add(self,idx,x):
while idx<=self.size:
self... | p03703 |
import sys
from itertools import accumulate
def solve():
n, k = list(map(int, sys.stdin.readline().split()))
a = [int(sys.stdin.readline().rstrip()) - k for i in range(n)]
s = [0] + list(accumulate(a))
# 座標圧縮
s = [(si, i) for (i, si) in enumerate(s)]
s.sort()
z = [None] * (n +... | import sys
from itertools import accumulate
inf = 1<<60
ans = 0
def solve():
n, k = list(map(int, sys.stdin.readline().split()))
a = [int(sys.stdin.readline().rstrip()) - k for i in range(n)]
s = [0] + list(accumulate(a))
MergeSort(s)
print(ans)
def MergeSort(a):
if len(a) =... | p03703 |
import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
from collections import deque
import copy
import heapq
from bisect import bisect, bisect_left, bisect_right
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.stdin.readline().strip(... | import sys
import math
import string
import fractions
import random
from operator import itemgetter
import itertools
import collections
from collections import deque
import copy
import heapq
from bisect import bisect, bisect_left, bisect_right
MOD = 10 ** 9 + 7
INF = float('inf')
input = lambda: sys.std... | p03703 |
from bisect import bisect_right
import sys
input = sys.stdin.buffer.readline
class BIT:
def __init__(self, size, values):
self.size = size
self.tree = [0] * (size + 1)
self.values = values
self.values.sort()
self.vToI = {v: i for i, v in enumerate(self.values, st... | from bisect import bisect_right
import sys
input = sys.stdin.buffer.readline
class BIT:
def __init__(self, size):
self.size = size
self.tree = [0] * (size + 1)
def add(self, index):
while index <= self.size:
self.tree[index] += 1
index += index & (-i... | p03703 |
from itertools import accumulate as acc
class BIT:
def __init__(self, n):
self.N = n+1
self.bit = [0]*self.N
def bit_sum(self, i):
s = 0
i += 1
while i>0:
s += self.bit[i]
i -= i & -i
return s
def bit_add(self, i, n):
i += 1
while i<self.N:
se... | from itertools import accumulate as acc
def bit_sum(ls, i):
s = 0
i += 1
while i>0:
s += ls[i]
i -= i & -i
return s
def bit_add(ls, i, n):
i += 1
while i<len(ls):
ls[i] += n
i += i & -i
N, K, *A = list(map(int, open(0).read().split()))
A = [a-K for a in A]
B = [(b,i) for... | p03703 |
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from bisect import bisect_right, bisect_left
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import... | from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations, product
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, ... | p03703 |
# -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | # -*- coding: utf-8 -*-
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in rang... | p03703 |
from itertools import accumulate
def main():
class BIT:
def __init__(self, N):
self.size = N
self.tree = [0] * (N + 1)
def sum(self, i):
s = 0
while i > 0:
s += self.tree[i]
i -= i & -i
return ... | from itertools import accumulate
def main():
N, K, *A = list(map(int, open(0).read().split()))
B = [0] + list(accumulate(a - K for a in A))
memo = {n: i for i, n in enumerate(sorted(set(B)), 1)}
N += 1
tree = [0] * (N + 1)
def bit_sum(i):
s = 0
while i > 0:
... | p03703 |
import sys
from copy import deepcopy
F = sys.stdin
N, K = list(map(int, F.readline().strip("\n").split()))
A = [None] * (N + 1)
A[0] = 0
A_order = {0}
for a in range(N):
A[a+1] = int(F.readline().strip("\n")) - K + A[a]
A_order |= {A[a+1]}
maxA = len(A_order)
A_order = list(A_order)
A_order.sort()... | import sys
from copy import deepcopy
F = sys.stdin
N, K = list(map(int, F.readline().strip("\n").split()))
A = [None] * (N + 1)
A[0] = 0
A_order = {0}
for a in range(N):
A[a+1] = int(F.readline().strip("\n")) - K + A[a]
A_order |= {A[a+1]}
maxA = len(A_order)
A_order = list(A_order)
A_order.sort()... | p03703 |
from bisect import bisect_right as br
n,k=list(map(int,input().split()))
b=[0]*(n+1)
def f(x):
c=0
while x>0:
c+=b[x]
x-=x&-x
return c
def g(x,a):
while x<n+1:
b[x]+=a
x+=x&-x
for i in range(n):
g(i+1,int(eval(input()))-k)
c=[0]
d=0
for i in range(1,n... | n,k=list(map(int,input().split()))
b=[0]*(n+1)
for i in range(n):
b[i+1]=b[i]+int(eval(input()))-k
a=sorted(set(b))
s={a[i-1]:i for i in range(1,len(a)+1)}
c=[]
for i in b:
c.append(s[i])
b=[0]*(len(a)+1)
def f(x):
c=0
while x>0:
c+=b[x]
x-=x&-x
return c
def g(x):
... | p03703 |
class BIT:
def __init__(self,n):
self.size=n
self.tree=[0]*-~n
def sum(self,i):
s=0
while i:
s+=self.tree[i]
i-=i&-i
return s
def add(self,i,x):
while i<=self.size:
self.tree[i]+=x
i+=i&-i
n,k,*a=li... | class BIT:
def __init__(self,n):
self.size=n
self.tree=[0]*-~n
def sum(self,i):
s=0
while i:
s+=self.tree[i]
i-=i&-i
return s
def add(self,i,x):
while i<=self.size:
self.tree[i]+=x
i+=i&-i
n,k,*a=li... | p03703 |
from bisect import bisect,insort
n,k = (int(i) for i in input().split())
a = [int(eval(input()))-k for i in range(n)]
b = [[0,0]]
for i in range(n): b.append([-(a[i]-b[-1][0]),-(i+1)])
b.sort()
q,ans,num = [-b[0][1]],0,1
for i,j in b[1:]:
c = bisect(q,-j)
ans+=num-c
num+=1
insort(q,-j,c,c)
print(ans) | n,k = (int(i) for i in input().split())
a = [int(eval(input()))-k for i in range(n)]
b = [[0,0]]
for i in range(n): b.append([b[-1][0]+a[i],i+1])
b.sort()
num,c = 1,[[b[0][1],1]]
for i in range(1,n+1):
if b[i][0]!=b[i-1][0]: num+=1
c.append([b[i][1],num])
c,d,ans = sorted(c),[0]*(n+2),0
def add(i):
while ... | p03703 |
import bisect
N,K = list(map(int,input().split()))
src = [int(eval(input())) for i in range(N)]
if N == 1:
print((int(src[0]>=K)))
exit()
cums = [0]
for a in src:
cums.append(cums[-1] + a - K)
s_cums = sorted(cums)
cmp = []
for a in cums:
i = bisect.bisect(s_cums, a)
cmp.append(i-... | N,K = list(map(int,input().split()))
src = [int(eval(input())) for i in range(N)]
cums = [(0,1)]
for i,a in enumerate(src):
cums.append((cums[-1][0] + a - K, i+2))
bit = [0] * (N+2)
def bit_add(a,w):
x = a
while x <= N:
bit[x] += w
x += (x & -x)
def bit_sum(a):
x = a
... | p03703 |
N, K = list(map(int, input().split()))
a = []
for _ in range(N):
a.append(int(eval(input()))-K)
ans = 0
for i in range(N):
for j in range(i+1, N+1):
# print(a[i:j])
if sum(a[i:j]) >= 0:
ans += 1
print(ans) | N, K = list(map(int, input().split()))
a = []
for _ in range(N):
a.append(int(eval(input()))-K)
su = 0
v = [(0, 0)]
for i in range(N):
su += a[i]
v.append((su, i+1))
v = sorted(v)
data = [0]*(N+5)
def sumation(i):
s = 0
while i > 0:
s += data[i]
i -= i & -i
... | p03703 |
from bisect import bisect_left
class SEGTree:
def __init__(self,n):
self.Unit=0
i=1
while(i<n):
i*=2
self.SEG=[self.Unit]*(2*i-1)
self.d=i
def update(self,i,x):
i+=self.d-1
self.SEG[i]+=x
while i>0:
i=(i-1)//2
... | from bisect import bisect_left
class BIT:
def __init__(self,N):
self.N=N
self.bit=[0]*N
def add(self,a,w):
x=a
while(x<self.N):
self.bit[x]+=w
x|=x+1
def get(self,a):
ret,x=0,a-1
while(x>=0):
ret+=self.bit[x]
... | p03703 |
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return list(map(int,input().split()))
def lmp(): return list(map(int,inp... | n=int(eval(input()))
print(((-n)%1000)) | p02612 |
import math
n = int(eval(input()))
if n % 1000 == 0:
print((0))
else:
print((math.ceil(n / 1000) * 1000 - n)) | print((-int(eval(input()))%1000))
| p02612 |
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる
mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000
d = collections.de... | N = int(eval(input()))
print(((1000 - N % 1000) % 1000)) | p02612 |
#!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
print((1000 - N%1000))
if __name__ == "__main__":
main()
| print(((1000-int(eval(input()))%1000)%1000)) | p02612 |
N = int(eval(input()))
if 0 <= N <= 1000:
print((1000-N))
elif 1000 < N <= 2000:
print((2000-N))
elif 2000 < N <= 3000:
print((3000-N))
elif 3000 < N <= 4000:
print((4000-N))
elif 4000 < N <= 5000:
print((5000-N))
elif 5000 < N <= 6000:
print((6000-N))
elif 6000 < N <= 7000:
... | n = int(eval(input()))
if n % 1000 == 0:
ans = 0
else:
ans = 1000- n % 1000
print(ans) | p02612 |
N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
print((1000 - (N % 1000))) | n = int(eval(input()))
if n % 1000 == 0:
print((0))
else:
print((1000 - n % 1000)) | p02612 |
n = int(eval(input()))
r = n % 1000
x = 0 if r == 0 else 1000-r
print(x) | print((-int(eval(input()))%1000)) | p02612 |
n = int(eval(input()))
print(((10000-n) % 1000)) | S = int(eval(input()))
if S % 1000 == 0:
W = 0
else:
W = 1000-(S % 1000)
print(W)
190 | p02612 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.st... | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
print((999-(N-1)%1000)) | p02612 |
n=int(eval(input()))
print(((10000-n)%1000)) | n=int(eval(input()))
print(((1000-n%1000)%1000)) | p02612 |
def main():
arg = int(eval(input()))
if arg % 1000 == 0:
ans = 0
else:
ans = 1000 - (arg % 1000)
print((str(ans)))
if __name__ == '__main__':
main()
| def main():
m = int(eval(input())) % 1000
ans = 0 if m == 0 else 1000 - m
print((str(ans)))
if __name__ == '__main__':
main()
| p02612 |
n = int(eval(input())) % 1000
if n == 0:
print((0))
else:
print((1000 - n)) | n = int(eval(input()))
print(((1000 - n % 1000) % 1000)) | p02612 |
N = int(eval(input()))
ans = (1000 - N % 1000) % 1000
print(ans) | N = int(eval(input()))
k = 0
while k * 1000 < N:
k += 1
ans = k * 1000 - N
print(ans) | p02612 |
x=int(eval(input()))
from math import ceil
u=ceil(x/1000)*1000
print((u-x)) | from math import ceil
x=int(eval(input()))
print((ceil(x/1000)*1000-x)) | p02612 |
n = int(eval(input()))
i=1
ans=0
for i in range(100):
if i*1000>=n:
ans = i*1000-n
break
print(ans)
| n=int(eval(input()))
if n%1000==0:
print((0))
else:print((1000-n%1000)) | p02612 |
n = int(eval(input()))
x = (10000-n)%1000
print(x)
| N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
print((1000-N % 1000))
| p02612 |
N = int(eval(input()))
print(((1000-N%1000)%1000)) | N = int(eval(input()))
tmp = N%1000
if tmp == 0:
print((0))
else:
print((1000 - tmp)) | p02612 |
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right
from itert... | '''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,... | p02612 |
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,... | '''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from heapq import heappush,heappop
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,insort,... | p02612 |
N = int(eval(input()))
while N > 0:
N = N - 1000
if N < 0:
N = N * -1
print(N) | N = int(eval(input()))
while N > 0:
N -= 1000
if N < 0:
N *= -1
print(N) | p02612 |
n = int(eval(input()))
if n%1000 == 0:
print((0))
else:
print((1000-n%1000)) | n = int(eval(input()))
print(((1000-n%1000)%1000)) | p02612 |
print(((1000 - int(eval(input())) % 1000) % 1000)) | print((-int(eval(input())) % 1000))
| p02612 |
a=int(eval(input()))
if a%1000==0:
print((0))
else:
print((1000-a%1000)) | n=int(eval(input()))
n=n%1000
if n==0:
print((0))
else:
print((1000-n)) | p02612 |
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())
N = I()
ans = N // 1000
ans2 = N - (ans*1000)
if ans2 == 0:
... | 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())
N = I()
N %= 1000
if N==0:
print((0))
else:
print((1000-N... | p02612 |
# -*- coding: utf-8 -*-
# 標準入力を取得
N = int(eval(input()))
# 求解処理
ans = (1000 - (N % 1000)) % 1000
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
N = int(eval(input()))
return N
def main(N: int) -> None:
"""
メイン処理.
Args:\n
N (int): 整数（1 <= N <= 10000）
"""
# 求解処理
ans = (1000 - (N % 1000... | p02612 |
N = int(eval(input()))
if N%1000 == 0:
print((0))
else:
print((1000-N%1000)) | N = int(eval(input()))
print(((10000-N)%1000))
| p02612 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | n=eval(input())
n=int(n)
x=n%1000
if x==0:
print((0))
else:
print((1000-x))
| p02612 |
n=int(eval(input()))
ans=(1000-n%1000)%1000
print(ans) | n = int(eval(input()))
print((1000 - n % 1000 if n % 1000 != 0 else 0))
| p02612 |
n = int(eval(input()))
if n % 1000 == 0:
print((0))
else:
print(((n // 1000 + 1) * 1000 - n))
| n = int(eval(input()))
print(((1000 - n % 1000) % 1000))
| p02612 |
import sys
#input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return sys.stdin.read()
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,input().split()))
def LI(): return list(map(int... | n=int(eval(input()))
print(((-n)%1000)) | p02612 |
r = 1000 - int(eval(input())) % 1000
print((r if r < 1000 else 0))
| print(((1000 - int(eval(input())) % 1000) % 1000))
| p02612 |
import math
n = int(eval(input()))
print((math.ceil(n/1000)*1000-n))
| n = int(eval(input()))
p = 0
while p < n:
p += 1000
print((p - n))
| p02612 |
def main():
N = int(eval(input()))
change = -N % 1000
print(change)
if __name__ == '__main__':
main()
| def main():
N = int(eval(input()))
ans = - N % 1000
if ans < 0:
ans += 1000
print(ans)
if __name__ == '__main__':
main()
| p02612 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | p02612 |
N = int(eval(input()))
if N%1000 == 0:
print((0))
else:
Str = str(N)
if len(Str) > 3:
K = (int(Str[0]) + 1) * 1000
print((K - N))
else:
print((1000 - N))
| n = int(eval(input()))
if n % 1000 == 0:
print((0))
else:
k = int(((n/1000)+1))*1000
print((k-n)) | p02612 |
n = int(eval(input()))
if n%1000 == 0:
print((0))
else:
k = int((n/1000)+1)*1000
print((k-n)) | n = int(eval(input()))
k = int((n/1000)+1)*1000
print((0 if n%1000 == 0 else (k-n)))
| p02612 |
n=int(eval(input()))
for i in range(1000,10001,1000):
num=i-n
if num >=0:
print(num)
break | n=int(eval(input()))
for i in range(1000,10001,1000):
if i>=n:
print((i-n))
break | p02612 |
n = int(eval(input()))
print((1000 - n%1000 if n%1000 != 0 else 0)) | print(((1000-int(eval(input()))%1000)%1000)) | p02612 |
n = int(eval(input()))
amari = n%1000
ans = 1000 - amari
if amari == 0:
print((0))
else:
print(ans) | n = int(eval(input()))
pre = n % 1000
ans = 1000 - pre
if pre == 0:
print((0))
else:
print(ans) | p02612 |
from math import ceil
N = int(eval(input()))
print((ceil(N/1000)*1000 - N)) | N = int(eval(input()))
print(((10000-N)%1000)) | p02612 |
import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | import sys, os, math, bisect, itertools, collections, heapq, queue
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
from decimal import Decimal
from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: li... | p02612 |
import math
o = 1000
n = int(eval(input()))
m = math.ceil(n / o) * o - n
print(m) | n = int(eval(input()))
t = 1000
while n > t:
t += 1000
print((t - n)) | p02612 |
print(((1000-(int(eval(input()))%1000))%1000)) | print((-int(eval(input()))%1000)) | p02612 |
n = int(eval(input()))
if n % 1000 == 0:
print((0))
else:
print((1000 - n % 1000)) | print(( (1000 - int(eval(input())) % 1000 ) % 1000 )) | p02612 |
import math
N = int(eval(input()))
n = math.ceil(N/1000)
ans = (n*1000) - N
print(ans)
| import math
N = int(eval(input()))
n = math.ceil(N/1000)*1000
print((n-N)) | p02612 |
n=int(eval(input()))
if n<1000:
print((1000-n))
else:
str1=""
k=n//1000
l=len(str(n))-len(str(k))
str1=str(k)+'0'*l
if str1==str(n):
print((0))
else:
p=int(str1)+1000
print((p-n)) | n=int(eval(input()))
print(((1000-n%1000)%1000)) | p02612 |
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operato... | n = int(eval(input()))
change = n % 1000
if change:
print((1000-change))
else:
print((0)) | p02612 |
n=int(eval(input()))
print((1000-n%1000 if n%1000!=0 else 0)) | n=int(eval(input()))
print((0 if n%1000==0 else 1000-n%1000)) | p02612 |
N=int(eval(input()))
if N>1000:
if N%1000==0:
print((0))
else:
print((1000-N%1000))
else:
print((1000-N)) | N=int(eval(input()))
if N%1000==0:
print((0))
else:
print((1000-N%1000)) | p02612 |
n = int(eval(input()))
e = 1000
x = n % e
if x == 0:
print((0))
else:
print((e-x)) | n = int(eval(input()))
a = 1000
x = 1
while True:
if int(a * x) >= n:
break
x += 1
print((int(a * x) -n)) | p02612 |
n = int(eval(input()))
ans = 0 if n%1000 == 0 else 1000 - n%1000
print(ans)
| N = int(eval(input()))
print((-N%1000)) | p02612 |
N = int(eval(input()))
if N % 1000 == 0:
print((0))
else:
n = N // 1000
print((1000*(n+1)-N)) | N = int(eval(input()))
print((1000 * ((N - 1) // 1000 + 1) - N)) | p02612 |
N = int(eval(input()))
maisuu = int(N/1000)
if N % 1000 == 0:
money = maisuu*1000
else:
money = (maisuu+1)*1000
result = money - N
print(result) | N = int(eval(input()))
while N > 1000:
N = N - 1000
print((1000-N)) | p02612 |
N = int(eval(input()))
n = -(-N//1000)
print((n*1000 - N)) | print(((1000 - int(eval(input()))%1000) % 1000)) | p02612 |
N = eval(input())
Num = int(N)
while Num > 0:
OTURI = 1000 - Num
Num -= 1000
print(OTURI) | N = int(eval(input()))
OTURI = 0
while N > 0:
OTURI = 1000 - N
N -= 1000
print(OTURI) | p02612 |
N = int(eval(input()))
s = N // 1000
print((N - 1000 * s if N % 1000 == 0 else (1000 * (s + 1)) - N)) | print(((1000-int(eval(input()))%1000)%1000)) | p02612 |
m=int(eval(input()))
if m%1000==0:
print((0))
else:
print((1000-m%1000)) | m=int(eval(input()))
print(((1000-m%1000)%1000)) | p02612 |
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
import math
n = ni()
if n%1000==0:
print((0))
else:
print((1000-n%1000))
| n=int(eval(input()))
print(((10000-n)%1000)) | p02612 |
import heapq
from collections import defaultdict, deque
from math import ceil, factorial, gcd
from itertools import accumulate, permutations
import bisect
# ----------
INF = float("inf")
MOD = 10 ** 9 + 7
# ----------
N = int(eval(input()))
print((ceil(N/1000)*1000-N))
| N = int(eval(input()))
# 切り上げ
print((-(-N // 1000) * 1000 - N))
| p02612 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.