problem_id stringlengths 6 6 | buggy_code stringlengths 8 526k | fixed_code stringlengths 12 526k | labels listlengths 0 15 ⌀ | buggy_submission_id int64 1 1.54M | fixed_submission_id int64 2 1.54M | user_id stringlengths 10 10 | language stringclasses 8
values |
|---|---|---|---|---|---|---|---|
p02773 | import collections
n = int(input())
list = []
for x in range(n):
s = input()
list.append(s)
c = collections.Counter(list)
mc = c.most_common()
max = mc[0][1]
anslist = []
for val in mc:
if max == val[1]: anslist.append(val[0])
else: break
anslist.sort
for x in anslist:
print(x)
| import collections
n = int(input())
list = []
for x in range(n):
s = input()
list.append(s)
c = collections.Counter(list)
mc = c.most_common()
max = mc[0][1]
anslist = []
for val in mc:
if max == val[1]: anslist.append(val[0])
else: break
anslist.sort()
for x in anslist:
print(x)
| [
"call.add"
] | 571,697 | 571,698 | u556610039 | python |
p02773 | n = int(input())
s = [input() for _ in range(n)]
s.sort()
count = {}
for s_i in s:
if not s_i in count:
count[s_i] = 0
count[s_i] += 1
res = sorted(zip(count.keys(), count.values()),
key=lambda x: x[1], reverse=True)
num = res[0][1]
res2 = []
for res_i in res:
if res_i[1] != num:
... | n = int(input())
s = [input() for _ in range(n)]
s.sort()
count = {}
for s_i in s:
if not s_i in count:
count[s_i] = 0
count[s_i] += 1
res = sorted(zip(count.keys(), count.values()),
key=lambda x: x[1], reverse=True)
num = res[0][1]
res2 = []
for res_i in res:
if res_i[1] != num:
... | [
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 571,699 | 571,700 | u706929073 | python |
p02773 | n=int(input())
s=[]
ansl=[]
for i in range(n):
s.append(input())
counter = Counter(s)
max=counter.most_common(1)[0][1]
for w in counter.most_common():
if w[1]==max:
ansl.append(w[0])
ansl.sort()
for i in range(len(ansl)):
print(ansl[i]) | from collections import Counter
n=int(input())
s=[]
ansl=[]
for i in range(n):
s.append(input())
counter = Counter(s)
max=counter.most_common(1)[0][1]
for w in counter.most_common():
if w[1]==max:
ansl.append(w[0])
ansl.sort()
for i in range(len(ansl)):
print(ansl[i]) | [] | 571,701 | 571,702 | u189188797 | python |
p02773 | n = int(input())
s = {}
for i in range(n):
tmp = input()
if not tmp in s.keys():
s[tmp] = 1
else:
s[tmp] += 1
m = 0
l = []
for i in sorted(s.items(), key=lambda x:x[1], reverse=True):
if m < i[1]:
m = i[1]
l.append(i[0])
else:
break
for i in sorted(l):
pr... | n = int(input())
s = {}
for i in range(n):
tmp = input()
if not tmp in s.keys():
s[tmp] = 1
else:
s[tmp] += 1
m = 0
l = []
for i in sorted(s.items(), key=lambda x:x[1], reverse=True):
if m <= i[1]:
m = i[1]
l.append(i[0])
else:
break
for i in sorted(l):
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,707 | 571,708 | u061539997 | python |
p02773 | N = int(input())
words = []
for _ in range(N):
words.append(input())
count_table = {}
for w in words:
if w in count_table:
count_table[w] += 1
else:
count_table[w] = 0
best_count = 0
for w in count_table:
if best_count < count_table[w]:
best_count = count_table[w]
best_wo... | N = int(input())
words = []
for _ in range(N):
words.append(input())
count_table = {}
for w in words:
if w in count_table:
count_table[w] += 1
else:
count_table[w] = 0
best_count = 0
best_words = []
for w in count_table:
if best_count < count_table[w]:
best_count = count_table[w]... | [
"assignment.add"
] | 571,713 | 571,714 | u601321817 | python |
p02773 | N = int(input())
d = {}
for _ in range(N):
s = input()
if not s in d:
d[s] = 1
else:
d[s] += 1
x = sorted(list(d.items()), key=lambda x:x[1], reverse=True)
n = 0
l = []
for k, v in x:
if v >= n:
n = v
l.append(v)
for y in sorted(l):
print(y)
| N = int(input())
d = {}
for _ in range(N):
s = input()
if not s in d:
d[s] = 1
else:
d[s] += 1
x = sorted(list(d.items()), key=lambda x:x[1], reverse=True)
n = 0
l = []
for k, v in x:
if v >= n:
n = v
l.append(k)
for y in sorted(l):
print(y)
| [
"identifier.change",
"call.arguments.change"
] | 571,715 | 571,716 | u978178314 | python |
p02773 | n=int(input())
d={}
for i in range(n):
s=input()
try:
if d[s]==1:
d[s]+=1
except:
d[s]=1
l=[]
maxi=-1
for i in d:
if d[i]>maxi:
maxi=d[i]
for i in d:
if d[i]==maxi:
l.append(i)
l.sort()
for i in l:
print(i)
| n=int(input())
d={}
for i in range(n):
s=input()
try:
if d[s]>0:
d[s]+=1
except:
d[s]=1
l=[]
maxi=-1
for i in d:
if d[i]>maxi:
maxi=d[i]
for i in d:
if d[i]==maxi:
l.append(i)
l.sort()
for i in l:
print(i)
| [
"control_flow.loop.for.condition.change"
] | 571,729 | 571,730 | u641441412 | python |
p02773 | def main():
N = int(input())
strings = {}
for _ in range(N):
s = input()
if s in strings.keys():
strings[s] += 1
else:
strings[s] = 1
strings = sorted(strings.items(), key=lambda x: x[0], reverse=True)
maximum = strings[0][1]
answer = []
for s ... | def main():
N = int(input())
strings = {}
for _ in range(N):
s = input()
if s in strings.keys():
strings[s] += 1
else:
strings[s] = 1
strings = sorted(strings.items(), key=lambda x: x[1], reverse=True)
maximum = strings[0][1]
answer = []
for s ... | [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change"
] | 571,731 | 571,732 | u022979415 | python |
p02773 | from collections import Counter
n = int(input())
S = ['_']*n
for i in range(n):
S[i] = input()
cS = Counter(S).most_common()
mx = cS[0][1]
ans = []
for i in range(n):
if cS[i][1]==mx:
ans.append(cS[i][0])
else:
break
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i]) | from collections import Counter
n = int(input())
S = ['_']*n
for i in range(n):
S[i] = input()
cS = Counter(S).most_common()
mx = cS[0][1]
ans = []
for i in range(len(cS)):
if cS[i][1]==mx:
ans.append(cS[i][0])
else:
break
ans = sorted(ans)
for i in range(len(ans)):
print(ans[i]) | [
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change",
"call.arguments.add"
] | 571,737 | 571,738 | u747703115 | python |
p02773 | N = int(input())
S = [None] * N
m = dict()
for i in range(N):
s = input()
if not s in m.keys():
m[s] = 1
else:
m[s] += 1
max_cnt = max(m.values())
ret = []
for k, v in sorted(m.items(), key=lambda x: x[1], reverse=True):
if v < max_cnt:
break
ret.append(k)
ret.sort()
print(ret) | N = int(input())
S = [None] * N
m = dict()
for i in range(N):
s = input()
if not s in m.keys():
m[s] = 1
else:
m[s] += 1
max_cnt = max(m.values())
ret = []
for k, v in sorted(m.items(), key=lambda x: x[1], reverse=True):
if v < max_cnt:
break
ret.append(k)
ret.sort()
for s in ret:
... | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 571,742 | 571,743 | u512099209 | python |
p02773 | import collections
N = int(input())
S_list = [input() for i in range(N)]
C = collections.Counter(S_list)
L = C.most_common()
max_ = L[0][1]
ans = []
#print("========")
for i in L:
if i[1] == max_:
ans.append(i[0])
else:
exit()
ans.sort()
for i in ans:
print(i)
| import collections
N = int(input())
S_list = [input() for i in range(N)]
C = collections.Counter(S_list)
L = C.most_common()
max_ = L[0][1]
ans = []
#print("========")
for i in L:
if i[1] == max_:
ans.append(i[0])
else:
break
ans.sort()
for i in ans:
print(i)
| [
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 571,748 | 571,749 | u267300160 | python |
p02773 | from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
index = 0
ans = []
for k, v in counter.most_common():
if index == 0:
max_v = v
ans.append(k)
else:
if v == max_v:
ans.append(k)
else:
exit()
index +... | from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
counter = Counter(s)
index = 0
ans = []
for k, v in counter.most_common():
if index == 0:
max_v = v
ans.append(k)
else:
if v == max_v:
ans.append(k)
else:
break
index +=... | [
"control_flow.exit.remove",
"control_flow.break.add",
"call.arguments.change"
] | 571,761 | 571,762 | u690781906 | python |
p02774 | import numpy as np
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = np.array(a)
a.sort()
p = a[a>0]
z = a[a==0]
m = a[a<0]
low = -10**18
high = 10**18
while high-low>1:
mid = (high + low) //2
count = 0
if mid >= 0:
count += len(z)*n
count += a.searchsorted(mid//p,side = "rig... | import numpy as np
n,k = map(int,input().split())
a = list(map(int,input().split()))
a = np.array(a)
a.sort()
p = a[a>0]
z = a[a==0]
m = a[a<0]
low = -10**18
high = 10**18
while high-low>1:
mid = (high + low) //2
count = 0
if mid >= 0:
count += len(z)*n
count += a.searchsorted(mid//p,side = "rig... | [
"call.remove"
] | 571,774 | 571,775 | u201928947 | python |
p02774 | #abc_155_d
import numpy as np
n,k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a = np.array(a)
a.sort()
plus = a[a>0]
zero = a[a==0]
minus= a[a<0]
left = -10**9
right = 10**9
while left+1 < right:
mid = (left+right)//2
cnt = 0
if mid >=0:
cnt += len(zero) * n
... | #abc_155_d
import numpy as np
n,k = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
a = np.array(a)
a.sort()
plus = a[a>0]
zero = a[a==0]
minus= a[a<0]
left = -10**18
right = 10**18
while left+1 < right:
mid = (left+right)//2
cnt = 0
if mid >=0:
cnt += len(zero) * n
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 571,791 | 571,792 | u693716675 | python |
p02774 | import sys
import numpy as np
INF = 10**18+5
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.sort(a)
ap = a[a > 0]
an = a[a < 0]
zc = n * (n - ap.size - an.size)
l = -INF
r = INF
while(... | import sys
import numpy as np
INF = 10**18+5
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def main():
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.sort(a)
ap = a[a > 0]
an = a[a < 0]
zc = n * (n - ap.size - an.size)
l = -INF
r = INF
while(... | [
"call.arguments.change",
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.keyword_argument.change"
] | 571,803 | 571,804 | u927078824 | python |
p02774 | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
z = 0
while a[z] < 0:
z += 1
am = a[:z]
ap = a[z:]
if k <= len(am)*len(ap):
ap = ap[::-1]
a = -(10**18)-10
b = 0
while True:
if b-a <= 1:
break
m = (a+b)//2
count = 0
r = 0
... | n, k = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
z = 0
while a[z] < 0:
z += 1
am = a[:z]
ap = a[z:]
if k <= len(am)*len(ap):
ap = ap[::-1]
a = -(10**18)-10
b = 1000
while True:
if b-a <= 1:
break
m = (a+b)//2
count = 0
r = 0
... | [
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.unary.add"
] | 571,826 | 571,827 | u808916291 | python |
p02774 | import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -... | import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -... | [
"call.remove"
] | 571,844 | 571,845 | u297109012 | python |
p02774 | import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -... | import numpy as np
def partsolve(A, x, positive, zero, negative):
"""
:param A:
:param x:
:return: Aの積のペアの中で、x以下となるペアの個数
"""
count = 0
if x >= 0:
count = len(zero) * len(A)
P = x // positive
Pc = np.searchsorted(A, P, side='right')
count += Pc.sum()
N = (-x-1) // -... | [
"call.remove"
] | 571,844 | 571,846 | u297109012 | python |
p02774 | # coding: utf-8
import numpy as np
def solve(*args: str) -> str:
n, k = map(int, args[0].split())
A = np.array(sorted(map(int, args[1].split())))
N = A[A < 0]
P = A[0 < A]
count = 0
left, right = -10**18, 10**18
while left+1 < right:
x = (left+right)//2
count = 0
... | # coding: utf-8
import numpy as np
def solve(*args: str) -> str:
n, k = map(int, args[0].split())
A = np.array(sorted(map(int, args[1].split())))
N = A[A < 0]
P = A[0 < A]
count = 0
left, right = -10**18, 10**18
while left+1 < right:
x = (left+right)//2
count = 0
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,858 | 571,859 | u164727245 | python |
p02774 | import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, x//neg, side='right')... | import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, -(-x//neg), side='lef... | [
"call.arguments.change",
"literal.string.change",
"expression.operation.binary.change",
"call.arguments.keyword_argument.change"
] | 571,881 | 571,882 | u054514819 | python |
p02774 | import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, x//neg, side='left'))... | import numpy as np
N, K = map(int, input().split())
L = np.array(list(map(int, input().split())))
L = np.sort(L)
pos = L[0<L]
neg = L[0>L]
zero = len(L[L==0])
def f(x):
tmp = 0
if x>=0:
tmp += zero*N
tmp += np.searchsorted(L, x//pos, side='right').sum()
tmp += (N - np.searchsorted(L, -(-x//neg), side='lef... | [
"call.arguments.change"
] | 571,883 | 571,882 | u054514819 | python |
p02774 | def d_pairs():
# 参考: https://maspypy.com/atcoder-参加感想-2019-02-16abc-155
import numpy as np
N, K = [int(i) for i in input().split()]
A = np.array([int(i) for i in input().split()], np.int64)
A = np.sort(A)
zero = A[A == 0]
positive = A[A > 0]
negative = A[A < 0]
def f(c):
""... | def d_pairs():
# 参考: https://maspypy.com/atcoder-参加感想-2019-02-16abc-155
import numpy as np
N, K = [int(i) for i in input().split()]
A = np.array([int(i) for i in input().split()], np.int64)
A = np.sort(A)
zero = A[A == 0]
positive = A[A > 0]
negative = A[A < 0]
def f(c):
""... | [
"function.return_value.change",
"call.arguments.change"
] | 571,890 | 571,891 | u057668615 | python |
p02774 | from bisect import bisect_left
def binsearch(l, r, fn):
while r - l > 1:
m = (l + r) // 2
if fn(m):
l = m
else:
r = m
return l
def main():
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
p = bisect_left(A, 0)
A... | from bisect import bisect_left
def binsearch(l, r, fn):
while r - l > 1:
m = (l + r) // 2
if fn(m):
l = m
else:
r = m
return l
def main():
N, K = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))
p = bisect_left(A, 0)
A... | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.unary.add"
] | 571,915 | 571,914 | u858742833 | python |
p02774 | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collection... | [
"identifier.change",
"expression.operation.binary.change"
] | 571,945 | 571,946 | u191874006 | python |
p02774 | def main():
from bisect import bisect
n,k,*a=map(int,open(0).read().split())
a.sort()
i=bisect(a,0)
a,b=a[i:],a[i-1::-1]
n,m=len(a),len(b)
ok=10**18
ng=-ok
while ok-ng>1:
x=(ok+ng)//2
s=0
if x>0:
s+=n*m
t=0
i=n
for y in a:
while i and a[i-1]*y>x:i-=1
... | def main():
from bisect import bisect
n,k,*a=map(int,open(0).read().split())
a.sort()
i=bisect(a,0)
a,b=a[i:],a[i-1::-1]
n,m=len(a),len(b)
ok=10**18
ng=-ok
while ok-ng>1:
x=(ok+ng)//2
s=0
if x>=0:
s+=n*m
t=0
i=n
for y in a:
while i and a[i-1]*y>x:i-=1
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 571,966 | 571,967 | u729133443 | python |
p02774 | from bisect import*
def solve(x):
s=t=0
i=n
j=0
for y in a:
while i and a[i-1]*y>x:i-=1
while j+1<m and b[j+1]*y<=x:j+=1
s+=j+1
t+=i
if y*y<=x:t-=1
s+=t//2
t=0
i=m
for y in c:
while i and c[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
return s
n,k,*t=map(int,open(0).read... | from bisect import*
def solve(x):
s=t=0
i=n
j=-1
for y in a:
while i and a[i-1]*y>x:i-=1
while j+1<m and b[j+1]*y<=x:j+=1
s+=j+1
t+=i
if y*y<=x:t-=1
s+=t//2
t=0
i=m
for y in c:
while i and c[i-1]*y>x:i-=1
t+=i
if y*y<=x:t-=1
s+=t//2
return s
n,k,*t=map(int,open(0).rea... | [
"assignment.value.change",
"expression.operation.unary.add"
] | 571,969 | 571,970 | u729133443 | python |
p02774 | import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
#cn = len(mn)
##cp = len(mp)
#cz = len(mz)
#tcn = cn*cp
#if cn*cp < K <= cn*cp + (N-cz)*cz + cz*(cz-1)//2:
# print(0)
# exi... | import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
M = 10**18
m = -1*M-1
pos = 0
while M-m > 1:
a = 0
pos=(M+m)//2
a+=np.searchsorted(n,pos//mp,side="right").sum()
i... | [
"control_flow.branch.if.add"
] | 572,007 | 572,008 | u295294832 | python |
p02774 | import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
#cn = len(mn)
##cp = len(mp)
#cz = len(mz)
#tcn = cn*cp
#if cn*cp < K <= cn*cp + (N-cz)*cz + cz*(cz-1)//2:
# print(0)
# exi... | import numpy as np
N,K = [int(i) for i in input().split()]
n = np.array([int(i) for i in input().split()])
n=np.sort(n)
mn = n[np.where(n<0)]
mz = n[np.where(n==0)]
mp = n[np.where(n>0)]
#cn = len(mn)
##cp = len(mp)
#cz = len(mz)
#tcn = cn*cp
#if cn*cp < K <= cn*cp + (N-cz)*cz + cz*(cz-1)//2:
# print(0)
# exi... | [
"control_flow.branch.if.add"
] | 572,007 | 572,009 | u295294832 | python |
p02774 | import sys
from bisect import bisect_left
import numpy as np
def test(a, K):
from itertools import combinations
answer = []
for i, j in combinations(a, 2):
answer.append(i * j)
answer.sort()
print(answer[K - 1])
def main():
read = sys.stdin.read
N, K, *A = map(int, read().split(... | import sys
from bisect import bisect_left
import numpy as np
def test(a, K):
from itertools import combinations
answer = []
for i, j in combinations(a, 2):
answer.append(i * j)
answer.sort()
print(answer[K - 1])
def main():
read = sys.stdin.read
N, K, *A = map(int, read().split(... | [
"expression.operation.binary.remove"
] | 572,025 | 572,026 | u945181840 | python |
p02774 | import numpy as np
n, k = map(int, input().split())
num_list = [int(i) for i in input().split()]
num_list = np.array(num_list)
num_list.sort()
neg = num_list[num_list < 0]
pos = num_list[num_list > 0]
zero = num_list[num_list == 0]
def count(x):
ans = 0
if x >= 0:
ans += len(zero) * n
ans += np.... | import numpy as np
n, k = map(int, input().split())
num_list = [int(i) for i in input().split()]
num_list = np.array(num_list)
num_list.sort()
neg = num_list[num_list < 0]
pos = num_list[num_list > 0]
zero = num_list[num_list == 0]
def count(x):
ans = 0
if x >= 0:
ans += len(zero) * n
ans += np.... | [
"literal.string.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.arguments.keyword_argument.change"
] | 572,107 | 572,108 | u878239774 | python |
p02774 | import sys
input = sys.stdin.readline
import numpy as np
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A_m = np.array(sorted([abs(int(x)) for x in A if x < 0]), np.int64)
N_m = len(A_m)
A_p = np.array(sorted([int(x) for x in A if x > 0]), np.int64)
N_p = len(A_p)
M = N_m * N_p
P = (... | import sys
input = sys.stdin.readline
import numpy as np
N, K = [int(x) for x in input().split()]
A = [int(x) for x in input().split()]
A_m = np.array(sorted([abs(int(x)) for x in A if x < 0]), np.int64)
N_m = len(A_m)
A_p = np.array(sorted([int(x) for x in A if x > 0]), np.int64)
N_p = len(A_p)
M = N_m * N_p
P = (... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,248 | 572,249 | u609061751 | python |
p02774 | import sys
input=sys.stdin.readline
n,k=map(int,input().split())
a=list(map(int,input().split()))
ap,an=[],[]
zeronum=0
for i in range(n):
if a[i]>0:
ap.append(a[i])
elif a[i]<0:
an.append(-a[i])
else:
zeronum+=1
np,nn=len(ap),len(an)
def fminus(x):
j=0
cnt=0
for i in range(np):
cnt+=j
w... | import sys
input=sys.stdin.readline
n,k=map(int,input().split())
a=list(map(int,input().split()))
ap,an=[],[]
zeronum=0
for i in range(n):
if a[i]>0:
ap.append(a[i])
elif a[i]<0:
an.append(-a[i])
else:
zeronum+=1
np,nn=len(ap),len(an)
def fminus(x):
j=0
cnt=0
for i in range(np):
cnt+=j
w... | [
"identifier.change",
"control_flow.loop.condition.change"
] | 572,250 | 572,251 | u169138653 | python |
p02774 | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = map(int, input().split())
a = list(map(int, input().split()))
ma = []
pa = []
zc = 0
for num in a:
if num<0:
ma.append(num)
elif num>0:
pa.append(n... | import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
n,k = map(int, input().split())
a = list(map(int, input().split()))
ma = []
pa = []
zc = 0
for num in a:
if num<0:
ma.append(num)
elif num>0:
pa.append(nu... | [
"call.add",
"call.arguments.change"
] | 572,255 | 572,256 | u535803878 | python |
p02774 | from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
i... | from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
i... | [
"identifier.change",
"expression.operation.binary.change"
] | 572,296 | 572,297 | u426108351 | python |
p02774 | from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
i... | from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
i... | [
"identifier.change",
"expression.operation.binary.change"
] | 572,301 | 572,297 | u426108351 | python |
p02774 | from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
i... | from bisect import *
n, k = map(int, input().split())
a = list(map(int, input().split()))
posi = 0
nega = 0
zero = 0
p = []
m = []
for i in range(n):
if a[i] > 0:
p.append(a[i])
posi += 1
elif a[i] < 0:
nega += 1
m.append(-a[i])
else:
zero += 1
p.sort()
m.sort()
i... | [
"identifier.change",
"expression.operation.binary.change",
"expression.operation.unary.add",
"call.arguments.change"
] | 572,303 | 572,297 | u426108351 | python |
p02774 | def main():
import sys
from bisect import bisect_left
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
minus = []
plus = []
zero = 0
for a in A:
if a > 0:
plus.append(a)
elif a < 0:
minus.append(... | def main():
import sys
from bisect import bisect_left
input = sys.stdin.readline
N, K = map(int, input().split())
A = list(map(int, input().split()))
minus = []
plus = []
zero = 0
for a in A:
if a > 0:
plus.append(a)
elif a < 0:
minus.append(... | [
"call.add",
"call.arguments.change"
] | 572,306 | 572,307 | u892251744 | python |
p02774 | #https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#... | #https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のも... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 572,308 | 572,309 | u721407235 | python |
p02774 | #https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のも... | #https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のも... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"assignment.value.change"
] | 572,310 | 572,309 | u721407235 | python |
p02774 | #https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のも... | #https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155
import numpy as np
N,K=map(int,input().split())
A=np.array(list(map(int,input().split())))
A.sort()
G=A[A>0]
Z=A[A==0]
L=A[A<0]
ok=10**18+1
ng=-10**18-1
#x以下がK個以上であるxの最小値
while ok-ng>1:
mid = (ng+ok)//2
#mid以下のペアの個数を数える
#正のも... | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,311 | 572,309 | u721407235 | python |
p02774 | import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
negative_number_cnt = 0
positive_number_cnt = 0
negative_number = []
positive_number = []
zero_cnt = 0
a.sort()
def binary_search(left, right,positive):
if right - left <= 1:
return right
middle = (right + left) // 2
... | import bisect
n, k = map(int, input().split())
a = list(map(int, input().split()))
negative_number_cnt = 0
positive_number_cnt = 0
negative_number = []
positive_number = []
zero_cnt = 0
a.sort()
def binary_search(left, right,positive):
if right - left <= 1:
return right
middle = (right + left) // 2
... | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 572,319 | 572,320 | u691896522 | python |
p02774 | def General_Binary_Increase_Search(L,R,cond,Integer=True,ep=1/(1<<20)):
"""条件式が単調増加であるとき,一般的な二部探索を行う.
L:解の下限
R:解の上限
cond:条件(1変数関数,広義単調減少 or 広義単調減少を満たす)
Integer:解を整数に制限するか?
ep:Integer=Falseのとき,解の許容する誤差
"""
if not(cond(R)):
return False
if Integer:
R+=1
while R... | def General_Binary_Increase_Search(L,R,cond,Integer=True,ep=1/(1<<20)):
"""条件式が単調増加であるとき,一般的な二部探索を行う.
L:解の下限
R:解の上限
cond:条件(1変数関数,広義単調減少 or 広義単調減少を満たす)
Integer:解を整数に制限するか?
ep:Integer=Falseのとき,解の許容する誤差
"""
if not(cond(R)):
return False
if Integer:
R+=1
while R... | [
"control_flow.branch.if.condition.change"
] | 572,465 | 572,466 | u779805689 | python |
p02774 | from numpy import *
N,K = map(int,input().split())
A = array(sorted(list(map(int,input().split()))))
nega = A[A<0]
zera = A[A==0]
posa = A[0<A]
def cnt(x):
y = 0
if x>=0:
y+=n*len(zera)
y+=searchsorted(A,x//posa,side="right").sum()
y+=N*len(nega)-searchsorted(A,-(-x//nega)).sum()
y-=len(A[A*A<=x])
ret... | from numpy import *
N,K = map(int,input().split())
A = array(sorted(list(map(int,input().split()))))
nega = A[A<0]
zera = A[A==0]
posa = A[0<A]
def cnt(x):
y = 0
if x>=0:
y+=N*len(zera)
y+=searchsorted(A,x//posa,side="right").sum()
y+=N*len(nega)-searchsorted(A,-(-x//nega)).sum()
y-=len(A[A*A<=x])
ret... | [
"identifier.change",
"expression.operation.binary.change"
] | 572,467 | 572,468 | u759412327 | python |
p02774 | # https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155#toc3
# https://atcoder.jp/contests/abc155/submissions/10152895
# 写経
# 条件を満たす要素を抽出
# ndarray[条件式]
def binary_search(*, ok, ng, func):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if func(mid):
ok = mid... | # https://maspypy.com/atcoder-%E5%8F%82%E5%8A%A0%E6%84%9F%E6%83%B3-2019-02-16abc-155#toc3
# https://atcoder.jp/contests/abc155/submissions/10152895
# 写経
# 条件を満たす要素を抽出
# ndarray[条件式]
def binary_search(*, ok, ng, func):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if func(mid):
ok = mid... | [
"control_flow.branch.if.add"
] | 572,469 | 572,470 | u562935282 | python |
p02774 | import numpy as np
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.array(a)
a.sort()
nega = a[a<0]
zero = a[a==0]
posi = a[a>0]
l = -10**18-1
r = 10**18+1
while r - l > 1:
mid = (r+l)//2
cnt = 0
if mid >= 0:
cnt += len(zero)*n
cnt += a.searchsorted(mid//posi, side='righ... | import numpy as np
n, k = map(int, input().split())
a = list(map(int, input().split()))
a = np.array(a)
a.sort()
nega = a[a<0]
zero = a[a==0]
posi = a[a>0]
l = -10**18-1
r = 10**18+1
while r - l > 1:
mid = (r+l)//2
cnt = 0
if mid >= 0:
cnt += len(zero)*n
cnt += a.searchsorted(mid//posi, side='righ... | [
"call.arguments.change"
] | 572,484 | 572,485 | u113310313 | python |
p02774 | N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((-mid)//(-H),side="right")).sum()
cnt-... | N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((mid+1)//(H),side="right")).sum()
cnt-... | [
"expression.operation.unary.arithmetic.remove",
"call.arguments.change"
] | 572,486 | 572,487 | u113310313 | python |
p02774 | N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((-mid)//(-H),side="right")).sum()
cnt-... | N,K=map(int, input().split())
A=list(map(int, input().split()))
A=sorted(A)
import numpy as np
A=np.array(A,dtype="int64")
Z=A[A==0]
H=A[A<0]
S=A[A>0]
l,r=-10**19,10**19
while r-l>1:
mid=(r+l)//2
cnt=0
cnt+=A.searchsorted(mid//S,side="right").sum()
cnt+=(N-A.searchsorted((-mid-1)//(-H),side="right")).sum()
cn... | [
"expression.operation.binary.add"
] | 572,486 | 572,488 | u113310313 | python |
p02774 | ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("YES") if fl else print("NO")
import collections
import math
import itertools
import heapq as hq
def isok1(x,ls1,ls2,cnt=0):
##ls1 :minus -1,... | ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("YES") if fl else print("NO")
import collections
import math
import itertools
import heapq as hq
def isok1(x,ls1,ls2,cnt=0):
##ls1 :minus -2,... | [] | 572,495 | 572,496 | u401487574 | python |
p02774 | N, K, *A = map(int, open(0).read().split())
neg = sorted([-a for a in A if a < 0])
pos = sorted([a for a in A if a >= 0])
def _count_pair_neg(x):
x = -x
res = 0
MAX = len(neg)
i = 0
for n in reversed(neg):
while i < MAX and n * pos[i] < x:
i += 1
res += le... | N, K, *A = map(int, open(0).read().split())
neg = sorted([-a for a in A if a < 0])
pos = sorted([a for a in A if a >= 0])
def _count_pair_neg(x):
x = -x
res = 0
MAX = len(pos)
i = 0
for n in reversed(neg):
while i < MAX and n * pos[i] < x:
i += 1
res += MA... | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,514 | 572,515 | u057109575 | python |
p02774 | from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[... | from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[... | [
"literal.number.integer.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 572,536 | 572,537 | u367701763 | python |
p02774 | from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[... | from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,538 | 572,537 | u367701763 | python |
p02774 | from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[... | from bisect import *
def binary_search_int(ok, ng, test):
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if test(mid):
ok = mid
else:
ng = mid
return ng
def get_count1(k, A):
""" K番目の要素が正の場合 """
l, r = 0, len(A)-1
res = 0
while l < r:
if A[... | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"expression.operation.unary.add",
"literal.number.integer.change"
] | 572,539 | 572,537 | u367701763 | python |
p02775 | import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣り... | import sys
read = sys.stdin.readline
# 下の桁から貪欲に見ていくと解ける
# 1の位が4以下ならそのまま紙幣で支払うのが得→自身をそのまま答えに採用 (枚数として加算)
# 6以上ならばお釣り狙いのほうが得→自身は0にセットして、上位桁を+1する (枚数として10-自身を加算)
# 5ちょうどのときは、お釣りもそのまま払っても枚数は変わらない。だけど555みたいに、上位桁に+1すると得になる可能性がある。
# 555→15枚, 1000-445→15枚
# つまり5が出たときは更に上位の桁を見て、4以下ならそのまま払うほうが得,5以上なら桁上りのほうが得
# 5ちょうどのときは？ #お釣り... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 572,566 | 572,567 | u179169725 | python |
p02775 | S = input().strip()
dp = [[INFTY for _ in range(2)] for _ in range(len(S))]
for k in range(10):
n = int(S[-1])
if k>= n:
dp[0][0] = min(dp[0][0],2*k-n)
else:
dp[0][1] = min(dp[0][1],2*k-n+10)
for i in range(1,len(S)):
n = int(S[-(1+i)])
for k in range(10):
if k>n:
... | S = input().strip()
INFTY=10**8
dp = [[INFTY for _ in range(2)] for _ in range(len(S))]
for k in range(10):
n = int(S[-1])
if k>= n:
dp[0][0] = min(dp[0][0],2*k-n)
else:
dp[0][1] = min(dp[0][1],2*k-n+10)
for i in range(1,len(S)):
n = int(S[-(1+i)])
for k in range(10):
if k>n:... | [
"assignment.add"
] | 572,570 | 572,571 | u644907318 | python |
p02775 | import sys
input = sys.stdin.readline
# 不変
N = [0] + list(map(int, tuple(input().rstrip("\n"))))
# 計算用
Ncopy = N.copy()
ans = 0
# 繰り上げ発生時に変更
flag = False
for i in range(len(N)-1, 0, -1):
if (Ncopy[i] <= 4) or (Ncopy[i] == 5 and N[i-1] <= 4):
ans += Ncopy[i]
flag = False
else:
Ncopy[i-1... | import sys
input = sys.stdin.readline
# 不変
N = [0] + list(map(int, tuple(input().rstrip("\n"))))
# 計算用
Ncopy = N.copy()
ans = 0
# 繰り上げ発生時に変更
flag = False
for i in range(len(N)-1, 0, -1):
if (Ncopy[i] <= 4) or (Ncopy[i] == 5 and N[i-1] <= 4):
ans += Ncopy[i]
flag = False
else:
Ncopy[i-1... | [
"call.remove"
] | 572,572 | 572,573 | u561083515 | python |
p02775 |
n = list(map(int, list(input())))[::-1] + [0]
sum1 = sum(n)
for i in range(len(n)-1):
if n[i] > 5 or (n[i]==5 and n[i+1]==5):
n[i] = 10-n[i]
n[i+1] += 1
print(min(sum1, sum(n)))
|
n = list(map(int, list(input())))[::-1] + [0]
sum1 = sum(n)
for i in range(len(n)-1):
if n[i] > 5 or (n[i]==5 and n[i+1]>4):
n[i] = 10-n[i]
n[i+1] += 1
print(min(sum1, sum(n)))
| [
"control_flow.loop.for.condition.change"
] | 572,610 | 572,611 | u557565572 | python |
p02775 | n = input()
a = 0
b = 0
for s in n:
v = int(s)
a_ = min(a + v, b + v)
b_ = min(a + 10 - v + 1, b + 10 - v + 1 - 2)
a = a_
b = b_
print(min(a, b)) | n = input()
a = 0
b = 2
for s in n:
v = int(s)
a_ = min(a + v, b + v)
b_ = min(a + 10 - v + 1, b + 10 - v + 1 - 2)
a = a_
b = b_
print(min(a, b)) | [
"literal.number.integer.change",
"assignment.value.change"
] | 572,637 | 572,638 | u491100219 | python |
p02775 | import bisect
S=input()
dig=len(S)
ans=0
b=0#繰り上がり
for i in range(dig):
a=int(S[dig-i-1])
if a<=4:
ans+=a
b=0
elif a>=6:
ans+=(10-a)
b=1
else:#a==5
if i==dig-1:
ans+=5
b=0
else:
if int(S[dig-i-2])>=5:
... | import bisect
S=input()
dig=len(S)
ans=0
b=0#繰り上がり
for i in range(dig):
a=int(S[dig-i-1])+b
if a<=4:
ans+=a
b=0
elif a>=6:
ans+=(10-a)
b=1
else:#a==5
if i==dig-1:
ans+=5
b=0
else:
if int(S[dig-i-2])>=5:
... | [
"assignment.change"
] | 572,647 | 572,648 | u498487134 | python |
p02775 | s=[int(i) for i in input()]
n=len(s)
ans=0
f=0
for i in range(n-1,-1,-1):
j=s[i]+f
if j<5:
ans+=j
f=0
elif j>5:
ans+=10-j
f=1
elif s[i-1]>=5:
ans+=10-j
f=1
else:
ans+=j
f=0
print(ans+f) | s=[int(i) for i in input()]
n=len(s)
ans=0
f=0
for i in range(n-1,-1,-1):
j=s[i]+f
if j<5:
ans+=j
f=0
elif j>5:
ans+=10-j
f=1
elif i and s[i-1]>=5:
ans+=10-j
f=1
else:
ans+=j
f=0
print(ans+f) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change"
] | 572,660 | 572,661 | u730769327 | python |
p02775 | S = input()
ans = 0
flag = False #繰り上がりありならTrue
flag2 = False #前が5ならTrue
for k in range(len(S)):
n = int(S[-k-1])
if flag2:
if n < 5:
flag = False
else:
flag = True
if flag:
n += 1
if n == 5:
ans += 5
flag2 = True
elif n < 5:
ans += n
flag2 = False
flag = False
el... | S = input()
ans = 0
flag = False #繰り上がりありならTrue
flag2 = False #前が5ならTrue
for k in range(len(S)):
n = int(S[-k-1])
if flag2:
if n < 5:
flag = False
else:
flag = True
if flag:
n += 1
if n == 5:
ans += 5
flag2 = True
flag = False
elif n < 5:
ans += n
flag2 = False
... | [
"assignment.add"
] | 572,662 | 572,663 | u627600101 | python |
p02775 | n=[int(x) for x in list(input()[::-1])]+[0]
ans = 0
step = 0
for i in range(len(n)-1):
x = n[i]+step
if x < 5 or (x==5 and n[i+1]<5):
ans += x
step = 0
else:
ans += 10 - x
step = 1
print(ans) | n=[int(x) for x in list(input()[::-1])]+[0]
ans = 0
step = 0
for i in range(len(n)-1):
x = n[i]+step
if x < 5 or (x==5 and n[i+1]<5):
ans += x
step = 0
else:
ans += 10 - x
step = 1
print(ans+step) | [
"expression.operation.binary.add"
] | 572,668 | 572,669 | u095094246 | python |
p02775 | n = input()[::-1]
dp = [[0, 0] for i in range(len(n) + 1)]
dp[0][1] = 1
for i in range(len(n)):
dp[i + 1][0] = min(dp[i][0] + int(n[i]), dp[i][1] - int(n[i]) + 10)
dp[i + 1][1] = min(dp[i][0] + int(n[1]) + 1, dp[i][1] - int(n[i]) + 9)
print(dp[len(n)][0]) | n = input()[::-1]
dp = [[0, 0] for i in range(len(n) + 1)]
dp[0][1] = 1
for i in range(len(n)):
dp[i + 1][0] = min(dp[i][0] + int(n[i]), dp[i][1] - int(n[i]) + 10)
dp[i + 1][1] = min(dp[i][0] + int(n[i]) + 1, dp[i][1] - int(n[i]) + 9)
print(dp[len(n)][0]) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,676 | 572,677 | u923270446 | python |
p02775 | def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 1
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# 11-sは、追加で支払うものと、お釣り
# 9-sは、追加はすでに... | def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 2
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# dp[i+1][2] = min(dp[i][1], dp[i][2])+9-s
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 572,716 | 572,717 | u201234972 | python |
p02775 | def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 1
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# 11-sは、追加で支払うものと、お釣り
# 9-sは、追加はすでに... | def main():
S = list( map( int, list( input())))
N = len(S)
dp = [[0,0] for _ in range(N+1)]
dp[0][1] = 2
for i in range(N):
s = S[i]
dp[i+1][0] = min(dp[i][0] + s, dp[i][1]+s)
dp[i+1][1] = min(dp[i][0] + 11-s, dp[i][1]+9-s)
# dp[i+1][2] = min(dp[i][1], dp[i][2])+9-s
... | [
"literal.number.integer.change",
"assignment.value.change"
] | 572,716 | 572,718 | u201234972 | python |
p02775 | N = list(map(int, input()))
ans = 0
carry = 0 #0 or 1 or 2. when 2, it means that it's optional between 0 and 1.
for i in range(len(N) - 1, -1, -1):
if carry == 2:
if N[i] >= 5:
digit = N[i] + 1
carry = 1
ans += (10 - digit)
else:
digit = N[i]
... | N = list(map(int, input()))
ans = 0
carry = 0 #0 or 1 or 2. when 2, it means that it's optional between 0 and 1.
for i in range(len(N) - 1, -1, -1):
if carry == 2:
if N[i] >= 5:
digit = N[i] + 1
carry = 1
ans += (10 - digit)
else:
digit = N[i]
... | [
"control_flow.branch.if.add"
] | 572,721 | 572,722 | u034128150 | python |
p02775 | s = input()[::-1]
size = len(s)
s += "9"
ans = 0
bef = 0
for i in range(size):
v1 = int(s[i])
v2 = int(s[i+1])
if v1+bef>=6 or (v1+bef>=5 and v2>=5):
ans += 10-(v1+bef)
bef = 1
else:
ans += (v1+bef)
bef = 0
ans += bef
print(ans) | s = input()[::-1]
size = len(s)
s += "4"
ans = 0
bef = 0
for i in range(size):
v1 = int(s[i])
v2 = int(s[i+1])
if v1+bef>=6 or (v1+bef>=5 and v2>=5):
ans += 10-(v1+bef)
bef = 1
else:
ans += (v1+bef)
bef = 0
ans += bef
print(ans) | [
"literal.string.change"
] | 572,727 | 572,728 | u690536347 | python |
p02775 | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readlin... | import sys
import math
from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
from collections import deque
from bisect import bisect_left
from itertools import product
def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readlin... | [
"expression.operation.binary.add"
] | 572,734 | 572,735 | u380995377 | python |
p02775 | N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=0
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
| N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=1
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
| [
"literal.number.integer.change",
"assignment.value.change"
] | 572,749 | 572,750 | u375616706 | python |
p02775 | from math import ceil
N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=0
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][1]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
| N = input()
L=len(N)
DP=[[N]*2 for _ in range(L+1)]
DP[0][0]=0
DP[0][1]=1
for i,n in enumerate(N,1):
DP[i][0]= min(DP[i-1][0]+int(n),DP[i-1][1]+10-int(n))
DP[i][1] = min(DP[i-1][0]+int(n)+1,DP[i-1][1]+9-int(n))
print(DP[L][0])
| [
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,751 | 572,750 | u375616706 | python |
p02775 | N = input()
rN = N[::-1]
res = 0
add = False
for i, n in enumerate(rN):
p = int(n)
if add:
p += 1
if p == 10:
continue
elif p == 5:
if len(N) >= i+1 and int(rN[i+1]) >= 5:
add = True
res += p
else:
add = False
res += p
... | N = input()
rN = N[::-1]
res = 0
add = False
for i, n in enumerate(rN):
p = int(n)
if add:
p += 1
if p == 10:
continue
elif p == 5:
if len(N) > i+1 and int(rN[i+1]) >= 5:
add = True
res += p
else:
add = False
res += p
... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,754 | 572,755 | u596368396 | python |
p02775 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | [
"call.remove"
] | 572,795 | 572,796 | u788137651 | python |
p02775 | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | #
# ⋀_⋀
# (･ω･)
# .／ Ｕ ∽ Ｕ＼
# │＊ 合 ＊│
# │＊ 格 ＊│
# │＊ 祈 ＊│
# │＊ 願 ＊│
# │＊ ＊│
# ￣
#
import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log #log2ないｙｐ
from heapq import heappop, heappush, heappushpop
from collections import Counter,default... | [] | 572,797 | 572,796 | u788137651 | python |
p02775 | # e 数位dp 还可以从右到左
# 参考 https://maspypy.com/atcoder-%e5%8f%82%e5%8a%a0%e6%84%9f%e6%83%b3-2019-02-16abc-155
# https://atcoder.jp/contests/abc155/submissions/10155415
# in your code
import numpy as np
DBG=0
def p(*args, **kargs):
if DBG:print(*args, **kargs)
read = input
rn = lambda :list(map(int, read().split()))
de... | # e 数位dp 还可以从右到左
# 参考 https://maspypy.com/atcoder-%e5%8f%82%e5%8a%a0%e6%84%9f%e6%83%b3-2019-02-16abc-155
# https://atcoder.jp/contests/abc155/submissions/10155415
# in your code
import numpy as np
DBG=0
def p(*args, **kargs):
if DBG:print(*args, **kargs)
read = input
rn = lambda :list(map(int, read().split()))
de... | [
"call.add",
"call.arguments.change"
] | 572,816 | 572,817 | u028217518 | python |
p02775 | n=list(input())
lis=[]
for k in range(len(n)):
lis.append(int(n[len(n)-1-k]))
t=0
print(lis)
for k in range(len(lis)):
if lis[k]==10:
if k==len(lis)-1:
t+=1
break
else:
lis[k]=0
lis[k+1]+=1
if lis[k]<5:
t+=lis[k]
elif lis[k]>5:
t=t+10-lis[k]
if k==len(li... | n=list(input())
lis=[]
for k in range(len(n)):
lis.append(int(n[len(n)-1-k]))
t=0
for k in range(len(lis)):
if lis[k]==10:
if k==len(lis)-1:
t+=1
break
else:
lis[k]=0
lis[k+1]+=1
if lis[k]<5:
t+=lis[k]
elif lis[k]>5:
t=t+10-lis[k]
if k==len(lis)-1:
... | [
"call.remove"
] | 572,826 | 572,827 | u772395065 | python |
p02775 | def main():
N = [int(x) for x in input()]
dp0 = 0
dp1 = 1
for n in N:
# そのまま払う
a = min(dp0 + n, dp1 + 10 - n)
# 1多めに払う
b = min(dp0 + n + 1, dp1 + 10 - (n+1))
dp0, dp1 = a, b
print(min(dp0, dp1))
if __name__ == '__main__':
main() | def main():
N = [int(x) for x in input()]
dp0 = 0
dp1 = 1
for n in N:
# そのまま払う
a = min(dp0 + n, dp1 + 10 - n)
# 1多めに払う
b = min(dp0 + n + 1, dp1 + 10 - (n+1))
dp0, dp1 = a, b
print(dp0)
if __name__ == '__main__':
main() | [
"call.remove",
"call.arguments.change"
] | 572,828 | 572,829 | u185034753 | python |
p02775 | def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
class Interval():
def __init__(self, li):
self.li = li
self.n = len(li)
self.sum_li = [li[0]]
for i in range(1, self.n):
self.sum_li.append(self.su... | def s_in():
return input()
def n_in():
return int(input())
def l_in():
return list(map(int, input().split()))
class Interval():
def __init__(self, li):
self.li = li
self.n = len(li)
self.sum_li = [li[0]]
for i in range(1, self.n):
self.sum_li.append(self.su... | [
"expression.operation.binary.add"
] | 572,855 | 572,856 | u291278680 | python |
p02775 | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa =... | import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
return list(map(int,input().split()))
def m(): #複数文字
return map(int,input().split())
def onem(): #Nとかの取得
return int(input())
def s(x): #圧縮
a = []
aa =... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 572,878 | 572,879 | u807772568 | python |
p02775 | N = [int(n) for n in input()]
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i, n in enumerate(N):
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))
dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))
print(dp)
print(dp[-1][0]) | N = [int(n) for n in input()]
dp = [[0] * 2 for _ in range(len(N) + 1)]
dp[0][1] = 1
for i, n in enumerate(N):
dp[i + 1][0] = min(dp[i][0] + n, dp[i][1] + (10 - n))
dp[i + 1][1] = min(dp[i][0] + (n + 1), dp[i][1] + (10 - (n + 1)))
print(dp[-1][0]) | [
"call.remove"
] | 572,880 | 572,881 | u411203878 | python |
p02775 | s = input(); n = len(s)
dp = [ [0,1>>32] for i in range(n+1) ]
for i in range(n):
d = ord(s[i])-ord('0')
dp[i+1][0] = min(dp[i][0], dp[i][1])+d
dp[i+1][1] = min(dp[i][0], dp[i][1]-2)+11-d
print(min(dp[n][0],dp[n][1])) | s = input(); n = len(s)
dp = [ [0,1<<32] for i in range(n+1) ]
for i in range(n):
d = ord(s[i])-ord('0')
dp[i+1][0] = min(dp[i][0], dp[i][1])+d
dp[i+1][1] = min(dp[i][0], dp[i][1]-2)+11-d
print(min(dp[n][0],dp[n][1])) | [
"assignment.value.change",
"expression.operation.binary.change"
] | 572,882 | 572,883 | u128456980 | python |
p02775 | S = input()[::-1]
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
for i in range(l):
dp[i+1][0]=min(dp[i][0]+int(s[i]),dp[i][1]+int(s[i])+1)
if i!=0:
dp[i+1][1]=min(dp[i][0]+10-int(s[i]),dp[i][1]+10-(int(s[i])+1))
else:
dp[i+1][1]=dp[i][0]+10-int(s[i])
print(min(dp[-1][0],dp[-1][1]+1)) | S = input()[::-1]
l = len(S)
dp = [[0]*2 for _ in range(l+1)]
for i in range(l):
dp[i+1][0]=min(dp[i][0]+int(S[i]),dp[i][1]+int(S[i])+1)
if i!=0:
dp[i+1][1]=min(dp[i][0]+10-int(S[i]),dp[i][1]+10-(int(S[i])+1))
else:
dp[i+1][1]=dp[i][0]+10-int(S[i])
print(min(dp[-1][0],dp[-1][1]+1)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 572,900 | 572,901 | u268554510 | python |
p02775 |
N = list(input())
N.reverse()
ans = 0
flag = False
L = len(N)
for i,s in enumerate(N):
n = int(s)
if flag:
n += 1
if n<5:
ans += n
flag = False
elif n>5:
ans += 10-n
flag = True
else:
if i==L-1:
ans += n
flag = Fals... |
N = list(input())
N.reverse()
ans = 0
flag = False
L = len(N)
for i,s in enumerate(N):
n = int(s)
if flag:
n += 1
if n<5:
ans += n
flag = False
elif n>5:
ans += 10-n
flag = True
else:
if i==L-1:
ans += n
flag = Fals... | [
"control_flow.break.add"
] | 572,908 | 572,909 | u698176039 | python |
p02775 | # -*- coding: utf-8 -*-
def solve():
N = input()[::-1]+'0'
res = 0
c = 0
for i in range(len(N)-1):
r = int(N[i])+c
c = r//10
r %= 10
r_ = (int(N[i+1])+c)%10
if r < 5 or (r==5 and r_ < 5):
res += r
else:
res += 10-r
return str(re... | # -*- coding: utf-8 -*-
def solve():
N = input()[::-1]+'00'
res = 0
c = 0
for i in range(len(N)-1):
r = int(N[i])+c
c = r//10
r %= 10
r_ = (int(N[i+1])+c)%10
if r < 5 or (r==5 and r_ < 5):
res += r
else:
res += 10-r
c +=... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 572,956 | 572,957 | u667469290 | python |
p02775 | n = input()[::-1]
print(n)
cnt = 0
flag = 0
for i in range(len(n)-1):
if int(n[i])+flag < 5:
cnt += int(n[i])+flag
flag = 0
elif int(n[i])+flag > 5:
cnt += (10-int(n[i])-flag)
flag = 1
else:
if int(n[i+1]) >= 5:
cnt += (10 - int(n[i])-flag)
fla... | n = input()[::-1]
cnt = 0
flag = 0
for i in range(len(n)-1):
if int(n[i])+flag < 5:
cnt += int(n[i])+flag
flag = 0
elif int(n[i])+flag > 5:
cnt += (10-int(n[i])-flag)
flag = 1
else:
if int(n[i+1]) >= 5:
cnt += (10 - int(n[i])-flag)
flag = 1
... | [
"call.remove"
] | 572,962 | 572,963 | u912115033 | python |
p02775 | n=input()
keta=[0]
for i in range(len(n)):
keta.append(int(n[i]))
ans=0
for i in range(len(keta)-1):
if keta[-i-2]>=5:
if keta[-i-1]>=5:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
else:
if keta[-i-1]>=6:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
print(ans) | n=input()
keta=[0,0]
for i in range(len(n)):
keta.append(int(n[i]))
ans=0
for i in range(len(keta)-1):
if keta[-i-2]>=5:
if keta[-i-1]>=5:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
else:
if keta[-i-1]>=6:
ans+=10-keta[-i-1]
keta[-i-2]+=1
else:
ans+=keta[-i-1]
print(ans) | [] | 572,964 | 572,965 | u296150111 | python |
p02775 | n = list(map(int, input()))
dp = (0, 1)
for i in n:
dp = (min(dp[0] + i, dp[1] + 10 - i), min(dp[0] + i + 1, dp[1] + 9 - i))
print(dp)
print(dp[0]) | n = list(map(int, input()))
dp = (0, 1)
for i in n:
dp = (min(dp[0] + i, dp[1] + 10 - i), min(dp[0] + i + 1, dp[1] + 9 - i))
print(dp[0]) | [
"call.remove"
] | 573,002 | 573,003 | u853819426 | python |
p02775 | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
L=list(map(int,input())); n=len(L)
L.reverse();L.append(0)
for i in range(n):
if L[i] >= 6:
count... | #!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
L=list(map(int,input())); n=len(L)
L.reverse();L.append(0)
for i in range(n):
if L[i] >= 6:
count... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 573,006 | 573,007 | u716530146 | python |
p02775 | def main():
n = input()[::-1] + "0"
s = 0
cnt = 0
for i, ni in enumerate(n[:-1]):
k = int(ni) + s
if k < 5 or k == 5 and int(n[i + 1]) <= 5:
cnt += k
s = 0
else:
cnt += 10 - k
s = 1
cnt += s
print(cnt)
if __name__ == '__mai... | def main():
n = input()[::-1] + "0"
s = 0
cnt = 0
for i, ni in enumerate(n[:-1]):
k = int(ni) + s
if k < 5 or k == 5 and int(n[i + 1]) < 5:
cnt += k
s = 0
else:
cnt += 10 - k
s = 1
cnt += s
print(cnt)
if __name__ == '__main... | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 573,008 | 573,009 | u219197917 | python |
p02775 | N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 6:
ans += n
... | N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 573,013 | 573,014 | u281303342 | python |
p02775 | N = ("0"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
e... | N = ("00"+input())[::-1]
ans = 0
carry = 0
for i in range(len(N)-1):
n = int(N[i])
nextn = int(N[i+1])
if carry == 1:
carry = 0
n += 1
if n <=4:
ans += n
elif n >= 6:
ans += 10-n
carry = 1
else: # n==5
if nextn <= 4:
ans += n
... | [
"literal.string.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 573,015 | 573,014 | u281303342 | python |
p02775 | # -*- coding: utf-8 -*-
import sys
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 range(c)] for j in range(b)] for i in range(a... | # -*- coding: utf-8 -*-
import sys
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 range(c)] for j in range(b)] for i in range(a... | [
"expression.operation.binary.remove"
] | 573,021 | 573,022 | u588341295 | python |
p02775 | n = list(reversed([0]+list(map(int, input()))))
ans = 0
for i in range(len(n)):
if n[i] < 5 or (n[i]==5 and n[i]<5):
ans += n[i]
else:
ans += 10 - n[i]
n[i+1] += 1
print(ans) | n = list(reversed([0]+list(map(int, input()))))
ans = 0
for i in range(len(n)):
if n[i] < 5 or (n[i]==5 and n[i+1]<5):
ans += n[i]
else:
ans += 10 - n[i]
n[i+1] += 1
print(ans) | [
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"misc.off_by_one"
] | 573,029 | 573,030 | u693378622 | python |
p02775 | s=input()
a=0
b=0
c=len(s)
s='0'+s
s=s[::-1]
d=0
for i in range(c):
if 0<b:
if 4<int(s[i])+1:
if 5==int(s[i])+1 and int(s[i+1])<5:
a+=5
b=0
else:
a+=(9-int(s[i]))
else:
a+=(int(s[i])+1)
b=0
else:
if 4<int(s[i]):
if int(s[i])==5 and int(s[i+1])<5:
... | s=input()
a=0
b=0
c=len(s)
s='0'+s
s=s[::-1]
d=0
for i in range(c+1):
if 0<b:
if 4<int(s[i])+1:
if 5==int(s[i])+1 and int(s[i+1])<5:
a+=5
b=0
else:
a+=(9-int(s[i]))
else:
a+=(int(s[i])+1)
b=0
else:
if 4<int(s[i]):
if int(s[i])==5 and int(s[i+1])<5:
... | [
"control_flow.loop.range.bounds.upper.change",
"expression.operation.binary.add"
] | 573,041 | 573,042 | u917558625 | python |
p02775 | N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=4:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=6:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans) | N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=5:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=6:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 573,043 | 573,044 | u625963200 | python |
p02775 | N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=4:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=10-n:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans) | N=list(input())
N.insert(0,0)
ans=0
for i in range(len(N)-1,-1,-1):
n=int(N[i])
if n//10>=1:
N[i-1]=str(int(N[i-1])+1)
continue
if n==5:
if int(N[i-1])>=5:
N[i-1]=str(int(N[i-1])+1)
ans+=5
elif n>=6:
ans+=10-n
N[i-1]=str(int(N[i-1])+1)
else:
ans+=n
print(ans) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change",
"control_flow.loop.for.condition.change",
"expression.operation.binary.remove"
] | 573,045 | 573,044 | u625963200 | python |
p02775 | N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i-1] < 4):
ans += temp[i]
else:
temp[i-1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans) | N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i-1] < 5):
ans += temp[i]
else:
temp[i-1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 573,050 | 573,051 | u497046426 | python |
p02775 | N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i+1] < 4):
ans += temp[i]
else:
temp[i+1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans) | N = list(input())
ans = 0
temp = [0] + [int(n) for n in N]
for i in reversed(range(1, len(N)+1)):
if temp[i] < 5 or (temp[i] == 5 and temp[i-1] < 5):
ans += temp[i]
else:
temp[i-1] += 1
ans += (10 - temp[i])
temp[i] = 0
ans += temp[0]
print(ans) | [
"misc.opposites",
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"literal.number.integer.change",
"expression.operation.binary.change"
] | 573,052 | 573,051 | u497046426 | python |
p02775 | n = list(map(int, list(input())))
m = len(n)
DP = [[float("inf")]*2 for i in range(m+1)]
DP[0] = [0,1]
for i in range(m):
# tight
tmp = float("inf")
for j in range(10):
if j == 0:
tmp = min(tmp, DP[i][1]+9-n[i])
elif j <= n[i]:
tmp = min(tmp, DP[i][1]+j+10+j-1-n[i])... | n = list(map(int, list(input())))
m = len(n)
DP = [[float("inf")]*2 for i in range(m+1)]
DP[0] = [0,1]
for i in range(m):
# tight
tmp = float("inf")
for j in range(10):
if j == 0:
tmp = min(tmp, DP[i][1]+9-n[i])
elif j <= n[i]:
tmp = min(tmp, DP[i][1]+j+10+j-1-n[i])... | [
"call.arguments.change",
"io.output.change"
] | 573,067 | 573,068 | u803848678 | python |
p02775 | N = [int(x) for x in input()]
def solve(N):
# n円の場合、n+1円の場合
# 繰り上げる方がいいのか繰り上げない方がいいのか判断している
dp = 0, 1
print(dp)
for n in N:
# 繰り上げた方が小さいのか繰り上げない方が小さいのか
a = min(dp[0] + n, dp[1] + 10 - n)
# 一個下の位を繰り上げた場合に、今の位までにかかる枚数
b = min(dp[0] + n + 1, dp[1] + 10 - (n + 1))
... | N = [int(x) for x in input()]
def solve(N):
# n円の場合、n+1円の場合
# 繰り上げる方がいいのか繰り上げない方がいいのか判断している
dp = 0, 1
for n in N:
# 繰り上げた方が小さいのか繰り上げない方が小さいのか
a = min(dp[0] + n, dp[1] + 10 - n)
# 一個下の位を繰り上げた場合に、今の位までにかかる枚数
b = min(dp[0] + n + 1, dp[1] + 10 - (n + 1))
dp = a, b
... | [
"call.remove"
] | 573,073 | 573,074 | u977193988 | python |
p02775 | n = str(input())[::-1]
n = "0" + n
l = len(n)
ans = 0
flg = 0
check = 0
for i in range(l):
check = int(n[i])
check += flg
if check == 5:
if int(n[i + 1]) >= 5:
ans += 5
flg = 1
else:
ans += 5
flg = 0
elif check > 5:
ans += 10 - che... | n = str(input())[::-1]
n = n + "0"
l = len(n)
ans = 0
flg = 0
check = 0
for i in range(l):
check = int(n[i])
check += flg
if check == 5:
if int(n[i + 1]) >= 5:
ans += 5
flg = 1
else:
ans += 5
flg = 0
elif check > 5:
ans += 10 - che... | [
"expression.operation.binary.remove"
] | 573,075 | 573,076 | u977193988 | python |
p02775 | n=input()
m=list(n)
l=[int(i) for i in m]
l.reverse()
l.append(0)
k=l
ans=0
for i in range(len(l)):
if k[i]<5:
ans+=k[i]
elif k[i]==5:
if k[i+1]>5:
k[i+1]+=1
ans+=5
else:
ans+=10-k[i]
k[i+1]+=1
print(ans) | n=input()
m=list(n)
l=[int(i) for i in m]
l.reverse()
l.append(0)
k=l
ans=0
for i in range(len(l)):
if k[i]<5:
ans+=k[i]
elif k[i]==5:
if k[i+1]>=5:
k[i+1]+=1
ans+=5
else:
ans+=10-k[i]
k[i+1]+=1
print(ans) | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 573,082 | 573,083 | u672542358 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.