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 |
|---|---|---|---|---|---|---|---|
p02718 | N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
if A[N - M] < 1/(4 * M):
print("No")
else:
print("Yes") | N,M = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
if A[N - M] < sum(A)/(4 * M):
print("No")
else:
print("Yes") | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change",
"call.arguments.add"
] | 490,170 | 490,171 | u210369205 | python |
p02718 | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=sum(a)/(4*m)
ans=0
for i in range(n):
if a[n]>=c:
ans+=1
if ans>=m:
print('Yes')
else:
print('No') | n,m=map(int,input().split())
a=list(map(int,input().split()))
c=sum(a)/(4*m)
ans=0
for i in range(n):
if a[i]>=c:
ans+=1
if ans>=m:
print('Yes')
else:
print('No') | [
"identifier.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 490,174 | 490,175 | u568576853 | python |
p02718 | n,m = map(int, input().split())
a = list(map(int, input().split()))
count = 0
lim = 1/(4*m)
for num in a:
if num >= lim:
count+=1
if count >= m:
print('Yes')
else:
print('No') | n,m = map(int, input().split())
a = list(map(int, input().split()))
count = 0
lim = sum(a)/(4*m)
for num in a:
if num >= lim:
count+=1
if count >= m:
print('Yes')
else:
print('No') | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"expression.operation.binary.change",
"call.arguments.add"
] | 490,178 | 490,179 | u873190923 | python |
p02718 | n, m = map(int, input().split())
a_list = [int(i) for i in input().split()]
a_sum = sum(a_list)
a_sorted = sorted(a_list)[::-1]
if a_sorted[m-1] > a_sum/m/4:
print('Yes')
else:
print('No') | n, m = map(int, input().split())
a_list = [int(i) for i in input().split()]
a_sum = sum(a_list)
a_sorted = sorted(a_list)[::-1]
if a_sorted[m-1] >= a_sum/m/4:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 490,190 | 490,191 | u608053762 | python |
p02718 | n,m=map(int,input().split())
alist=list(map(int,input().split()))
soutokuhyou = sum(alist) / (4*m)
count = 0
for i in alist:
if i > soutokuhyou:
count += 1
if count >= m:
print('Yes')
else:
print('No') | n,m=map(int,input().split())
alist=list(map(int,input().split()))
soutokuhyou = sum(alist) / (4*m)
count = 0
for i in alist:
if i >= soutokuhyou:
count += 1
if count >= m:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 490,194 | 490,195 | u312666261 | python |
p02718 | N, M = map(int, input().split())
A = list(map(int, input().split()))
B = [x for x in A if x >= sum(A)//(4*M)]
print("Yes" if len(B) >= M else "No") | N, M = map(int, input().split())
A = list(map(int, input().split()))
B = [x for x in A if x >= sum(A)/(4*M)]
print("Yes" if len(B) >= M else "No") | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 490,196 | 490,197 | u886747123 | python |
p02718 | n,m = map(int,input().strip().split())
ls = list(map(int,input().strip().split()))
mini = sum(ls)//(4*m)
i = 0
while i<n and m>0:
if ls[i]>=mini:
m -= 1
i += 1
if m<=0:
print("Yes")
else:
print("No")
| n,m = map(int,input().strip().split())
ls = list(map(int,input().strip().split()))
mini = sum(ls)/(4*m)
i = 0
while i<n and m>0:
if ls[i]>=mini:
m -= 1
i += 1
if m<=0:
print("Yes")
else:
print("No")
| [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 490,198 | 490,199 | u657173608 | python |
p02718 | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
div = sum(A) / (4 * M)
cnt = 0
for a in A:
if a > div:
cnt += 1
if cnt >= M:
print('Yes')
else:
print('No') | N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
div = sum(A) / (4 * M)
cnt = 0
for a in A:
if a >= div:
cnt += 1
if cnt >= M:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 490,200 | 490,201 | u953311536 | python |
p02718 | n,m = map(int,input().split())
a = []
a = list(map(int,input().split()))
b = sum(a)/(4.0*m)
c = 0
for i in range(n) :
if a[i]>=b :
c += 1
if c>=m :
print('YES')
else :
print('NO') | n,m = map(int,input().split())
a = []
a = list(map(int,input().split()))
b = sum(a)/(4.0*m)
c = 0
for i in range(n) :
if a[i]>=b :
c += 1
if c>=m :
print('Yes')
else :
print('No')
| [
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 490,202 | 490,203 | u942767171 | python |
p02718 | n, m = map(int, input().split())
a = list(map(int, input().split()))
cnt = 0
a.sort()
a.reverse()
for i in a:
if i >= sum(a) / (4 * m):
cnt += 1
else:
if cnt >= m:
print("Yes")
else:
print("No")
exit() | n, m = map(int, input().split())
a = list(map(int, input().split()))
cnt = 0
a.sort()
a.reverse()
for i in a:
if i >= sum(a) / (4 * m):
cnt += 1
if cnt >= m:
print("Yes")
else:
print("No")
exit() | [] | 490,216 | 490,217 | u923270446 | python |
p02718 | N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))[::-1]
th = sum(A)/4/M
if A[M-1]>th:
print('Yes')
else:
print('No') | N, M = list(map(int, input().split()))
A = sorted(list(map(int, input().split())))[::-1]
th = sum(A)/4/M
if A[M-1]>=th:
print('Yes')
else:
print('No')
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 490,230 | 490,231 | u090266528 | python |
p02718 | n,m=map(int,input().split())
arr=list(map(int,input().split()))
arr=sorted(arr,reverse=True)
cnt=0
for val in arr:
if val*4*m>sum(arr):
cnt+=1
if cnt>=m:
print('Yes')
else:
print('No') | n,m=map(int,input().split())
arr=list(map(int,input().split()))
arr=sorted(arr,reverse=True)
cnt=0
for val in arr:
if val*4*m>=sum(arr):
cnt+=1
if cnt>=m:
print('Yes')
else:
print('No') | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 490,238 | 490,239 | u163320134 | python |
p02718 | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split())
A = list(map(int, input().split()))
S = sum(A)
m = S // (4 * M)
cnt = 0
for a in A:
if a < m:
continue
cnt += 1
if cnt >... | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N, M = map(int, input().split())
A = list(map(int, input().split()))
S = sum(A)
m = S / (4 * M)
cnt = 0
for a in A:
if a < m:
continue
cnt += 1
if cnt >=... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 490,240 | 490,241 | u593567568 | python |
p02718 |
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
return(int(input().rstrip()))
def inlt():
return(list(map(int,input().rstrip().split())))
def insr():
s = input().rstrip()
return(s[:len(s) - 1])
def invr():
return(map(int,input().rstrip().split()))
######################... |
############ ---- USER DEFINED INPUT FUNCTIONS ---- ############
def inp():
return(int(input().rstrip()))
def inlt():
return(list(map(int,input().rstrip().split())))
def insr():
s = input().rstrip()
return(s[:len(s) - 1])
def invr():
return(map(int,input().rstrip().split()))
######################... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 490,246 | 490,247 | u763424241 | python |
p02718 | n,m = map(int,input().split())
a = list(map(int,input().split()))
al = sum(a)
count = 0
for i in range(n):
if a[i] <al/(4*m):
count += 1
if count >= m:
print("Yes")
else:
print("No") | n,m = map(int,input().split())
a = list(map(int,input().split()))
al = sum(a)
count = 0
for i in range(n):
if a[i] >=al/(4*m):
count += 1
if count >= m:
print("Yes")
else:
print("No") | [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 490,248 | 490,249 | u437727817 | python |
p02718 | n,m=map(int,input().split())
A = sorted(list(map(int,input().split())))[::-1]
s = sum(A)
print('Yes' if A[m-1]>=s//(4*m) else 'No') | n,m=map(int,input().split())
A = sorted(list(map(int,input().split())))[::-1]
s = sum(A)
print('Yes' if A[m-1]>=s/(4*m) else 'No') | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 490,252 | 490,253 | u393253137 | python |
p02718 | n, m = map(int, input().split())
data = list(map(int, input().split()))
data.sort(reverse=True)
if data[m - 1] >= sum(data) // (4 * m):
print("Yes")
else:
print("No") | n, m = map(int, input().split())
data = list(map(int, input().split()))
data.sort(reverse=True)
if data[m - 1] >= sum(data) / (4 * m):
print("Yes")
else:
print("No") | [
"expression.operator.arithmetic.change",
"control_flow.branch.if.condition.change"
] | 490,260 | 490,261 | u957796755 | python |
p02718 | n,m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse = True)
if a[m] * 4*m >= sum(a):
print('Yes')
else:
print('No') | n,m = map(int, input().split())
a = list(map(int, input().split()))
a.sort(reverse = True)
if a[m-1] * 4*m >= sum(a):
print('Yes')
else:
print('No') | [
"control_flow.branch.if.condition.change"
] | 490,262 | 490,263 | u744034042 | python |
p02718 | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
import heapq
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):
i... | #import sys
MOD = 10 ** 9 + 7
INFI = 10**10
#input = sys.stdin.readline
import math
import itertools
import heapq
#import bisect
import copy
from functools import lru_cache
def sosuhante(n):
for k in range(2, int(math.sqrt(n))+1):
if n% k ==0:
return False
return True
def cmb(n, r):
i... | [
"control_flow.branch.if.condition.change"
] | 490,266 | 490,267 | u366482170 | python |
p02719 | #C
N, K = map(int,input().split())
if N%K==0:
print(0)
else:
print(min(N%K,-N%(K+1))) | #C
N, K = map(int,input().split())
if N%K==0:
print(0)
else:
print(min(N%K,-(N%(K)-K))) | [
"call.arguments.change"
] | 490,268 | 490,269 | u408677243 | python |
p02719 | N, K = map(int, input().split())
print(min[N%K,K-N%K]) | N, K = map(int, input().split())
print(min([N%K,K-N%K]))
| [
"call.arguments.change"
] | 490,332 | 490,333 | u240630407 | python |
p02719 | n, k = map(int, input().split())
if n > k:
n %= 4
print(min(n, k - n)) | n, k = map(int, input().split())
if n > k:
n %= k
print(min(n, k - n)) | [
"identifier.replace.add",
"literal.replace.remove"
] | 490,340 | 490,341 | u040298438 | python |
p02719 | N,K=map(int,input().split())
if N==K:
print(0)
elif N<K:
lis1=[N,abs(N-K)]
print(min(lis))
else:
lis2=[N%K,abs(N%K-K)]
print(min(lis2))
| N,K=map(int,input().split())
if N==K:
print(0)
elif N<K:
lis1=[N,abs(N-K)]
print(min(lis1))
else:
lis2=[N%K,abs(N%K-K)]
print(min(lis2))
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 490,369 | 490,370 | u591919975 | python |
p02719 | N,K = map(int,input().split())
print(min(N % K,K-t)) | N,K = map(int,input().split())
print(min(N % K,K-N % K)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 490,377 | 490,378 | u848535504 | python |
p02719 | n, k = map(int,input().split())
x1 = n%k
x2 = k - x1
print(min[x1, x2]) | n, k = map(int,input().split())
x1 = n%k
x2 = k - x1
print(min(x1, x2))
| [
"call.arguments.change",
"io.output.change"
] | 490,391 | 490,392 | u625864724 | python |
p02719 | N, K = map(int, input().split())
ans = min(N % K, N - N % K) | N, K = map(int, input().split())
ans = min(N % K, K - N % K)
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"call.add"
] | 490,424 | 490,425 | u170324846 | python |
p02719 | n,k=map(int,input().split())
print(max(n%k,k-n%k)) | n,k=map(int,input().split())
print(min(n%k,k-n%k))
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 490,445 | 490,446 | u131881594 | python |
p02719 | n, k = map(int, input().split())
ans = min(n % k, k - abs(n - k))
print(ans) | n, k = map(int, input().split())
ans = min(n % k, k - n % k)
print(ans) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 490,477 | 490,478 | u630467326 | python |
p02719 | N, K = map(int, input().split())
if N >= K:
A = N//K
B = N - A*K
print(min([B, abs(B-K)]))
else:
if K >= 2:
print(N)
else:
print(abs(N-K)) | N, K = map(int, input().split())
if N >= K:
A = N//K
B = N - A*K
print(min([B, abs(B-K)]))
else:
if K >= 2*N:
print(N)
else:
print(abs(N-K)) | [
"control_flow.branch.if.condition.change"
] | 490,499 | 490,500 | u397020326 | python |
p02719 | N, K = map(int, input().split())
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
m = -(-N//K)
print(min(N - m*K, -(N - (m+1)*K)))
"""
print(min(N%K, abs(N%K - K)))
""" | N, K = map(int, input().split())
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
m = N//K
print(min(N - m*K, -(N - (m+1)*K)))
"""
print(min(N%K, abs(N%K - K)))
""" | [] | 490,522 | 490,523 | u189516107 | python |
p02719 | N, K = map(int, input().split())
res = 0
if N % K == 0:
res = 0
elif N % K > 2 / K:
res = K - (N % K)
else:
res = N % K
print(res)
| N, K = map(int, input().split())
res = 0
if N % K == 0:
res = 0
elif N % K > K / 2:
res = K - (N % K)
else:
res = N % K
print(res)
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 490,552 | 490,553 | u770076823 | python |
p02719 | n,m=map(int,input().split())
ans=0
n%=m
ans=(min(n,k-n))
print(ans)
| n,m=map(int,input().split())
ans=0
n%=m
#print(n,m)
ans=min(n,(m-n))
print(ans) | [
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 490,574 | 490,572 | u963747475 | python |
p02719 | #K = int(input())
N,K = map(int,input().split())
#N = int(input())
#A = list(map(int,input().split()))
flag=True
c=N
if N%K==0:
print(0)
else:
l=N//K
N=l*N
while flag==True:
N=abs(N-K)
if c <= N:
flag=False
else:
c=N
print(c)
| #K = int(input())
N,K = map(int,input().split())
#N = int(input())
#A = list(map(int,input().split()))
flag=True
c=N
if N%K==0:
print(0)
exit()
else:
l=N//K
N-=l*K
while flag==True:
N=abs(N-K)
if c <= N:
flag=False
else:
c=N
print(c)
| [
"call.add",
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 490,606 | 490,607 | u991619971 | python |
p02719 | n, k = map(int, input().split())
print(min(n % k), (k - (n % k)))
| n, k = map(int, input().split())
print(min((n % k), (k - (n % k))))
| [
"call.arguments.change"
] | 490,688 | 490,689 | u313291636 | python |
p02719 | n, k = map(int, input().split())
n = n % k
print(min(abs(n - k)), n) | n, k = map(int, input().split())
n = n % k
print(min(abs(n - k), n)) | [
"call.arguments.change"
] | 490,736 | 490,737 | u167647458 | python |
p02719 | N, K = list(map(int, input().split()))
if N == 0 or N < K:
print(N)
elif N % K == 0:
print("0")
else:
print(min(N % K, K - (N % K)))
| N, K = list(map(int, input().split()))
if N == 0:
print(N)
elif N % K == 0:
print("0")
else:
print(min(N % K, K - (N % K)))
| [] | 490,738 | 490,739 | u974039237 | python |
p02719 | N, K = map(int,input().split())
x = N%K
print(min(x,k-x)) | N, K = map(int,input().split())
x = N%K
print(min(x,K-x)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 490,746 | 490,747 | u234189749 | python |
p02719 | n,k =map(int, input().split())
m = n % k
print(min(n, k - m)) | n,k =map(int, input().split())
m = n % k
print(min(m, k - m)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 490,754 | 490,755 | u187193817 | python |
p02719 | a,b =map(int, input().split())
m = a % k
print(min(m, k - m)) | n,k =map(int, input().split())
m = n % k
print(min(m, k - m)) | [
"assignment.variable.change",
"identifier.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 490,756 | 490,755 | u187193817 | python |
p02719 |
N, K = map(int, input().split())
amari%=K
print(min(amari,abs(amari-k)))
|
N, K = map(int, input().split())
amari=N%K
print(min(amari,abs(amari-K)))
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 490,759 | 490,760 | u028014940 | python |
p02719 | n,k=map(int,input().split())
print(max(n%k,(k-n%k)%k)) | n,k=map(int,input().split())
print(min(n%k,(k-n%k)%k)) | [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 490,784 | 490,785 | u566529875 | python |
p02719 | n, k = map(int, input().split())
max_i = max(n, k)
if n>=k:
n = n%k
if n==0 or n==1 or k==1:
print(0)
else:
for _ in range(max_i):
tmp = abs(n-k)
if tmp >= n:
break
else :
n = tmp
print(n)
| n, k = map(int, input().split())
max_i = max(n, k)
if n>=k:
n = n%k
if n==0 or k==1:
print(0)
else:
for _ in range(max_i):
tmp = abs(n-k)
if tmp >= n:
break
else :
n = tmp
print(n)
| [] | 490,808 | 490,809 | u235027735 | python |
p02719 | n,k=map(int,input().split())
print(min(n%k,n-n%k)) | n,k=map(int,input().split())
print(min(n%k,k-n%k)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 490,817 | 490,818 | u341267151 | python |
p02719 | n, k = list(map(int, input().split()))
counter = 0
x_min = n
x = n
while not counter == 3:
x = x % k
if x_min > x:
x_min = x
counter = 1
elif x_min == x:
counter = counter + 1
print(x_min)
| n, k = list(map(int, input().split()))
counter = 0
x_min = n
x = n
while not counter == 3:
x = x % k
if x_min > x:
x_min = x
counter = 1
elif x_min == x:
counter = counter + 1
x = k - x
print(x_min)
| [
"assignment.add"
] | 490,829 | 490,830 | u374815848 | python |
p02719 | N, K = map(int, input().split())
min(N % K, K - N % K) | N, K = map(int, input().split())
print(min(N % K, K - N % K)) | [
"call.add",
"call.arguments.change"
] | 490,833 | 490,834 | u692453235 | python |
p02719 | N,K=map(int,input().split())
n_b=N
a=N%K
if(K/2<a):
print(a-K)
else:
print(a)
| N,K=map(int,input().split())
n_b=N
a=N%K
if(K/2<a):
print(abs(a-K))
else:
print(a)
| [
"call.arguments.add",
"call.arguments.change"
] | 490,847 | 490,848 | u750822433 | python |
p02719 | N,K=map(int,input().split())
n_b=N
a=N%k
if(K/2<a):
print(a-k)
else:
print(a)
| N,K=map(int,input().split())
n_b=N
a=N%K
if(K/2<a):
print(abs(a-K))
else:
print(a)
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.add",
"call.arguments.change",
"io.output.change"
] | 490,849 | 490,848 | u750822433 | python |
p02719 | n,k=map(int,input().split())
print(min(n%k,n%k-k)) | n,k=map(int,input().split())
print(min(n,n%k,abs(n%k-k))) | [
"call.arguments.add",
"call.add",
"call.arguments.change"
] | 490,852 | 490,851 | u127288756 | python |
p02719 | N,K=map(int,input().split())
M=N%K
print(min(M,N-M)) | N,K=map(int,input().split())
M=N%K
print(min(M,K-M)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 490,864 | 490,865 | u440113208 | python |
p02719 | nk = list(map(int,input().split()))
n = nk[0]
k = nk[1]
amari = n % k
if amari == 0:
ans = k
else:
if amari <= k/2:
ans = amari
else:
ans = -(amari - k)
print(ans) | nk = list(map(int,input().split()))
n = nk[0]
k = nk[1]
amari = n % k
if amari == 0:
ans = 0
else:
if amari <= k/2:
ans = amari
else:
ans = -(amari - k)
print(ans)
| [
"assignment.value.change",
"identifier.replace.remove",
"literal.replace.add"
] | 490,876 | 490,877 | u099022530 | python |
p02719 | n,k = map(int,input().split())
d = n//k
n = n - d*n
if abs(n-k)>n:
print(n)
else:
print(abs(n-k))
| n,k = map(int,input().split())
d = n//k
n = n - d*k
if abs(n-k)>n:
print(n)
else:
print(abs(n-k))
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 490,893 | 490,894 | u987326700 | python |
p02719 | N, K = input().split();
N = int(N);
K = int(K);
amari = N % K;
hu = -1* (amari - K);
max_N = max(amari,hu);
print(max_N);
| N, K = input().split();
N = int(N);
K = int(K);
amari = N % K;
hu = -1* (amari - K);
max_N = min(amari,hu);
print(max_N);
| [
"misc.opposites",
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 490,895 | 490,896 | u508061226 | python |
p02719 | def main():
n,k = (int(x) for x in input().split())
min = n
n = n % k
while True:
n = abs(n - k)
if(n < min):
min = n
else:
break
print(min)
if __name__ == '__main__':
main()
| def main():
n,k = (int(x) for x in input().split())
n = n % k
min = n
while True:
n = abs(n - k)
if(n < min):
min = n
else:
break
print(min)
if __name__ == '__main__':
main()
| [
"assignment.remove",
"assignment.add"
] | 490,928 | 490,929 | u250554058 | python |
p02719 | N, K = int(input().split())
# N = 1000000000000000000
# K = 1
amari = N%K
bmari = abs(amari-K)
if amari >= bmari:
print(bmari)
else:
print(amari) | N, K = map(int, input().split())
amari = N%K
bmari = abs(amari-K)
if amari >= bmari:
print(bmari)
else:
print(amari) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add"
] | 490,940 | 490,941 | u532031128 | python |
p02719 | l = input()
m = l.split(" ")
n = int(m[0])
k = int(m[1])
if n > k:
n = n % k
if n < k:
if n < (k-n):
print(n)
else:
print(k-n)
| l = input()
m = l.split(" ")
n = int(m[0])
k = int(m[1])
if n > k:
n = n % k
if n < (k-n):
print(n)
else:
print(k-n)
| [] | 490,942 | 490,943 | u641393644 | python |
p02719 | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq imp... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq imp... | [
"call.remove",
"assignment.value.change",
"call.arguments.change"
] | 490,950 | 490,951 | u952022797 | python |
p02719 | n, k = map(int, input().split())
if n == k:
print(0)
exit()
l = k%n
print(min(l, k-l)) | n, k = map(int, input().split())
if n == k:
print(0)
exit()
l = n%k
print(min(l, k-l)) | [
"expression.operation.binary.remove"
] | 491,019 | 491,020 | u720636500 | python |
p02719 | N, K = map(int, input().split())
ans = N
x = abs(x - K * max(x // K, 1))
while ans > x:
ans = x
x = abs(x - K * max(x // K, 1))
print(ans) | N, K = map(int, input().split())
ans = N
x = abs(N - K * max(N // K, 1))
while ans > x:
ans = x
x = abs(x - K * max(x // K, 1))
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,041 | 491,042 | u384476576 | python |
p02719 | inp=[int(x) for x in input().split()]
n,k=inp[0],inp[1]
if n>k:
print(n%k,k-n%k)
elif n<k:
print(min(n,k-n))
else:
print(0) | inp=[int(x) for x in input().split()]
n,k=inp[0],inp[1]
if n>k:
print(min(n%k,k-n%k))
elif n<k:
print(min(n,k-n))
else:
print(0) | [
"call.arguments.add",
"call.arguments.change"
] | 491,058 | 491,059 | u266264498 | python |
p02719 | n,k=map(int,input().split())
m=n%k
d=abs(m-k)
if m<k:
print(m)
else:
print(k)
| n,k=map(int,input().split())
m=n%k
d=abs(m-k)
if d<m:
print(d)
else:
print(m)
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.remove"
] | 491,100 | 491,101 | u846385882 | python |
p02719 |
N,K=map(int,input().split())
po=(N//K+1)*N-N
ne=N//K
print(min(po,ne))
| N,K=map(int,input().split())
po=(N//K+1)*K-N
ne=N%K
print(min(po,ne))
| [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"expression.operator.arithmetic.change"
] | 491,107 | 491,108 | u111652094 | python |
p02719 | n,k = map(int,input().split())
if n<=(k/2):
print(n)
n = n - (n//k)*k
if n<= k/2:
print(n)
else:
print(abs(n-k))
| n,k = map(int,input().split())
if n<=(k/2):
print(n)
else:
n = n - (n//k)*k
if n<= k/2:
print(n)
else:
print(abs(n-k))
| [] | 491,144 | 491,145 | u719166355 | python |
p02719 | ##161 C
N,M= map(int, input().split())
amari= N % M
if(amari<=(N/2)):
print(amari)
else:
amari = amari-M
print(amari)
| ##161 C
N,M= map(int, input().split())
amari= N % M
if(amari<=(M/2)):
print(amari)
else:
amari = abs(amari-M)
print(amari)
| [
"identifier.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.change"
] | 491,148 | 491,149 | u773686010 | python |
p02719 | n, k = map(int, input().split())
print(n%k, k - n%k) | n, k = map(int, input().split())
print(min(n%k, k - n%k))
| [
"call.arguments.add",
"call.arguments.change"
] | 491,154 | 491,155 | u004482945 | python |
p02719 | n,k =[int(x) for x in input().split()]
pre_value = n+1
tmp = n
a = n / k
tmp = n - a*k
while tmp < pre_value:
pre_value = tmp
tmp = abs( tmp - k)
print(pre_value) | n,k =[int(x) for x in input().split()]
pre_value = n+1
tmp = n
a = n // k
tmp = n - a*k
while tmp < pre_value:
pre_value = tmp
tmp = abs( tmp - k)
print(pre_value) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 491,169 | 491,170 | u374018235 | python |
p02719 | N,K=mapp(int,input().split())
print(min(N%K,abs(N%K-K)))
| N,K=map(int,input().split())
print(min(N%K,abs(N%K-K))) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 491,180 | 491,181 | u182898140 | python |
p02719 | N,K=mapp(int,input().split())
print(min(N%K,abs(N%K-K))) | N,K=map(int,input().split())
print(min(N%K,abs(N%K-K))) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 491,182 | 491,181 | u182898140 | python |
p02719 | N,K=mapp(int,input().split())
print(min(N%K,abs(N%K-K)))
| N,K=map(int,input().split())
print(min(N%K,abs(N%K-K)))
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 491,180 | 491,184 | u182898140 | python |
p02719 | N,K=mapp(int,input().split())
print(min(N%K,abs(N%K-K))) | N,K=map(int,input().split())
print(min(N%K,abs(N%K-K)))
| [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 491,182 | 491,184 | u182898140 | python |
p02719 | n,k = map(int,input().split())
print(min(n%k,(k-(n&k))%k)) | n,k = map(int,input().split())
print(min(n%k,(k-(n%k))%k)) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,195 | 491,196 | u940592576 | python |
p02719 | n_k = [int(i) for i in input().split()]
n = n_k[0]
k = n_k[1]
r = n % k
r_1 = abs(r - k)
min = np.array([r, r_1]).min()
print(min) | import numpy as np
n_k = [int(i) for i in input().split()]
n = n_k[0]
k = n_k[1]
r = n % k
r_1 = abs(r - k)
min = np.array([r, r_1]).min()
print(min)
| [] | 491,204 | 491,205 | u617779302 | python |
p02719 | #/usr/bin/env python
import sys
N, K = [int(x) for x in sys.stdin.readline().strip().split()]
mod = N % K
if mod < (2 / K):
print(mod)
else:
print(K - mod)
| #/usr/bin/env python
import sys
N, K = [int(x) for x in sys.stdin.readline().strip().split()]
mod = N % K
if mod < (K / 2.):
print(mod)
else:
print(K - mod)
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 491,224 | 491,223 | u599620638 | python |
p02719 | a,b = map(int, input().split())
if a > b:
if a % b == 0:
print(0)
exit()
else:
print(min(int(a/b), b-int(a/b)))
exit()
while True:
x = abs(a-b)
if x < a:
a = x
else:
print(a)
break | a,b = map(int, input().split())
if a > b:
if a % b == 0:
print(0)
exit()
else:
print(min(a%b, b-(a%b)))
exit()
while True:
x = abs(a-b)
if x < a:
a = x
else:
print(a)
break | [
"call.remove",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,231 | 491,232 | u799528852 | python |
p02719 | N,K = map(int,input().split())
r = N%K
s = K-r
print(min[r,s]) | N,K = map(int,input().split())
r = N%K
s = K-r
print(min([r,s])) | [
"call.arguments.change"
] | 491,235 | 491,236 | u630004940 | python |
p02719 | N,K = map(int,input().split())
r = N%K
s = s-r
print(min[r,s]) | N,K = map(int,input().split())
r = N%K
s = K-r
print(min([r,s])) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change",
"call.arguments.change"
] | 491,237 | 491,236 | u630004940 | python |
p02719 | a,b = map(int,input().split())
z = a % b
if z > b/2:
print(abs(z-k))
else:
print(z) | a,b = map(int,input().split())
z = a % b
if z > b/2:
print(abs(z-b))
else:
print(z) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,260 | 491,261 | u704459429 | python |
p02719 | N, K = map(int, input().split())
r = N%K
if r == 0 or r == 1:
print(r)
s = abs(r - K)
if s < r:
print(s)
else:
print(r) | N, K = map(int, input().split())
r = N%K
if r == 0 or r == 1:
print(r)
else:
s = abs(r - K)
if s < r:
print(s)
else:
print(r) | [] | 491,276 | 491,277 | u714732628 | python |
p02719 | N,K = map(int, input().split())
a = N % K
if a == 0:
print(0)
else:
print(min(a, abs(a-k))) | N,K = map(int, input().split())
a = N % K
if a == 0:
print(0)
else:
print(min(a, abs(a-K))) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,284 | 491,285 | u875449556 | python |
p02719 | N, K = map(int, open(0).read().split())
a = N % K
print(min(K - b, b))
| N, K = map(int, open(0).read().split())
a = N % K
print(min(K - a, a)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,286 | 491,287 | u647287452 | python |
p02719 | list_NK = list(map(int, input().split()))
N = list_NK[0]
K = list_NK[1]
number = N - K*(N//K)
abs_now = number
while all:
abs_past = abs(abs_now - K)
if(abs_past >= abs_now):
break
abs_now = abs_past
print(abs_past)
| list_NK = list(map(int, input().split()))
N = list_NK[0]
K = list_NK[1]
number = N - K*(N//K)
abs_now = number
while all:
abs_past = abs(abs_now - K)
if(abs_past >= abs_now):
break
abs_now = abs_past
print(abs_now) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 491,288 | 491,289 | u802234211 | python |
p02719 | from sys import stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
mod = N % K
print(mod, abs(K - mod)) | from sys import stdin
N, K = [int(_) for _ in stdin.readline().rstrip().split()]
mod = N % K
print(min(mod, abs(K - mod)))
| [
"call.arguments.add",
"call.arguments.change"
] | 491,329 | 491,330 | u724742135 | python |
p02719 | buf = input().split()
n = int(buf[0])
k = int(buf[1])
c1 = n % k
c2 = -1 * (c1 - k)
return min([c1, c2]) | buf = input().split()
n = int(buf[0])
k = int(buf[1])
c1 = n % k
c2 = -1 * (c1 - k)
print(min([c1, c2])) | [
"function.return_value.change",
"call.arguments.change"
] | 491,366 | 491,367 | u500276166 | python |
p02719 | n,k=map(int,input().split())
if n>=k:
print(min(n%k,abs(k-n%k)))
else:
print(n,abs(n-k)) | n,k=map(int,input().split())
if n>=k:
print(min(n%k,abs(k-n%k)))
else:
print(min(n,abs(n-k))) | [
"call.arguments.add",
"call.arguments.change"
] | 491,385 | 491,386 | u901582103 | python |
p02719 | N, K = map(int, input().split())
print(min(N % K, N - N % K))
| N, K = map(int, input().split())
print(min(N % K, K - N % K))
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,387 | 491,388 | u500297289 | python |
p02719 | #入力受け取り
N, K=map(int, input().split())
#N=aK+bとした時のbを求める
B=N%K
#bとK-bの小さい方を出力
print(min(b, K-b))
| #入力受け取り
N, K=map(int, input().split())
#N=aK+bとした時のbを求める
b=N%K
#bとK-bの小さい方を出力
print(min(b, K-b))
| [
"assignment.variable.change",
"identifier.change"
] | 491,389 | 491,390 | u095021077 | python |
p02719 | a = list(map(int,input().split()))
print(a)
if a[0]<a[1]:
print(str(min(a[0],a[1]-a[0])))
else:
r=a[0]%a[1]
print(str(min(r,a[1]-r))) | a = list(map(int,input().split()))
if a[0]<a[1]:
print(str(min(a[0],a[1]-a[0])))
else:
r=a[0]%a[1]
print(str(min(r,a[1]-r))) | [
"call.remove"
] | 491,408 | 491,409 | u064434060 | python |
p02719 | n,k=map(int,input().spulit())
print(min(n%k,k-n%k))
| n,k=map(int,input().split())
print(min(n%k,k-n%k))
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change"
] | 491,412 | 491,413 | u931118906 | python |
p02719 | n,k=map(int,input().split())
if not n or k == 1:
print(0)
else:
if n >= k:
print(n%k)
else:
print(min(n,k-n)) | n,k=map(int,input().split())
if not n or k == 1:
print(0)
else:
if n >= k:
n = n%k
print(min(n,k-n)) | [
"call.arguments.change"
] | 491,424 | 491,425 | u859773831 | python |
p02719 | N,K=map(int, input().split())
a=N%K
print(a,K-a) | N,K=map(int, input().split())
a=N%K
print(min(a,K-a)) | [
"call.arguments.add",
"call.arguments.change"
] | 491,449 | 491,450 | u273345915 | python |
p02719 | n,k = map(int,input().split())
print(min(n%k),k - (n%k)) | n,k = map(int,input().split())
print(min(n%k,k - n%k)) | [
"call.arguments.change"
] | 491,453 | 491,452 | u595786324 | python |
p02719 | n, k = map(int, input().split())
mod = n % k
if mod > k - mod:
print(mod)
else:
print(k-mod)
| n, k = map(int, input().split())
mod = n % k
if mod > k - mod:
print(k-mod)
else:
print(mod) | [
"call.remove",
"call.add"
] | 491,482 | 491,483 | u350412774 | python |
p02719 | N, K = map(int, input().split())
print(min(N%K, N-N%K)) | N, K = map(int, input().split())
print(min(N%K, K-N%K)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,498 | 491,499 | u870559097 | python |
p02719 | list = input().split(" ")
startNum, standardNum = int(list[0]), int(list[1])
mod = startNum % standardNum
minusMod = abs(mod - standardNum)
result = mod if mod <= standardNum else minusMod
print(result) | list = input().split(" ")
startNum, standardNum = int(list[0]), int(list[1])
mod = startNum % standardNum
minusMod = abs(mod - standardNum)
result = mod if mod <= minusMod else minusMod
print(result) | [
"assignment.value.change",
"identifier.change"
] | 491,537 | 491,538 | u946404093 | python |
p02719 | a, b = int(input().split(" "))
quotinent = a // b
res = max(a - b * quotinent, abs( a- b * (quotinent + 1)))
print(res) | a, b = map(int, input().split(" "))
quotinent = a // b
res = min(a - b * quotinent, abs(a- b * (quotinent + 1)))
print(res) | [
"assignment.value.change",
"identifier.change",
"call.function.change",
"call.arguments.add",
"misc.opposites"
] | 491,546 | 491,547 | u108648546 | python |
p02719 | N , K = map(int , input().split())
mini = N % K
if mini < abs(mini - K):
mini = mini
else:
mini = abs(mini - k)
print(mini)
| N , K = map(int , input().split())
mini = N % K
if mini < abs(mini - K):
mini = mini
else:
mini = abs(mini - K)
print(mini)
| [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,550 | 491,551 | u228636605 | python |
p02719 | n, k = map(int, input().split())
rot = n//k
x = n
if n == 1 or n == k or n%k == 0:
x = 0
elif rot >= 1:
x = n - k*rot
t = x%k
print(min(t, abs(t-k))) | n, k = map(int, input().split())
rot = n//k
x = n
if k == 1 or n == k or n%k == 0:
x = 0
elif rot >= 1:
x = n - k*rot
t = x%k
print(min(t, abs(t-k))) | [
"identifier.change",
"control_flow.branch.if.condition.change"
] | 491,559 | 491,560 | u479638406 | python |
p02719 | n, k = map(int, input().split())
m = n % k
print(m, abs(m-k)) | n, k = map(int, input().split())
m = n % k
print(min(m, abs(m-k))) | [
"call.arguments.add",
"call.arguments.change"
] | 491,572 | 491,573 | u218487926 | python |
p02719 | n, k = map(int, input().split())
m = n % k
print(m, abs(m-k)) | n, k = map(int, input().split())
m = n % k
print(min(m, abs(m-k)))
| [
"call.arguments.add",
"call.arguments.change"
] | 491,572 | 491,574 | u218487926 | python |
p02719 | a = input()
a, b = a.split(' ')
a = int(a)
b = int(b)
a = a % b
print(a if a < b - a else b)
| a = input()
a, b = a.split(' ')
a = int(a)
b = int(b)
a = a % b
print(a if a < b - a else b - a)
| [
"expression.operation.binary.add"
] | 491,579 | 491,580 | u353478669 | python |
p02719 | import math
n,k=map(int,input().split())
num=math.floor(n/k)
n=n-num*k
ans=min(abs(k-n),n)
print(ans) | import math
n,k=map(int,input().split())
num=n//k
n=n-num*k
ans=min(abs(k-n),n)
print(ans) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,583 | 491,584 | u867848444 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.