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 |
|---|---|---|---|---|---|---|---|
p02719 | N,K=map(int,input().split())
r=N%K
print(max(r,K-r)) | N,K=map(int,input().split())
r=N%K
print(min(r,K-r))
| [
"misc.opposites",
"identifier.change",
"call.function.change",
"call.arguments.change",
"io.output.change"
] | 491,595 | 491,596 | u623283955 | python |
p02719 | def absolute(N,K):
return abs(N-K)
N,K=map(int,input().split())
N=N%K
valuelist = [N%K]
for i in range (0,1):
i+=1
N=absolute(N,K)
valuelist.append(absolute(N,K))
print(min(valuelist))
| def absolute(N,K):
return abs(N-K)
N,K=map(int,input().split())
N=N%K
valuelist = [N%K]
for i in range (0,3):
i+=1
N=absolute(N,K)
valuelist.append(absolute(N,K))
print(min(valuelist)) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 491,597 | 491,600 | u687135117 | python |
p02719 | def absolute(N,K):
return abs(N-K)
N,K=map(int,input().split())
N=N%K
valuelist = [N%K]
for i in range (0,1):
i+=1
N=absolute(N,K)
valuelist.append(absolute(N,K))
print(min(valuelist))
| def absolute(N,K):
return abs(N-K)
N,K=map(int,input().split())
N=N%K
valuelist = [N%K]
for i in range (0,3):
i+=1
N=absolute(N,K)
valuelist.append(absolute(N,K))
print(min(valuelist))
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 491,597 | 491,601 | u687135117 | python |
p02719 | #AtCoder
N, K = map(int, input().split())
q, mod = divmod(N, K)
print(min(q, mod)) | #AtCoder
N, K = map(int, input().split())
q, mod = divmod(N, K)
print(min(mod, K-mod)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 491,602 | 491,603 | u259861571 | python |
p02719 | n, k = map(int, input().split())
n %= m
print(min(n, k - n)) | n, k = map(int, input().split())
n %= k
print(min(n, k - n)) | [
"identifier.change"
] | 491,604 | 491,605 | u831294922 | python |
p02719 | n, k = map(int, input().split())
n %= m
print(min(n, m - n)) | n, k = map(int, input().split())
n %= k
print(min(n, k - n)) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,606 | 491,605 | u831294922 | python |
p02719 | N,K=map(int, input().split())
import math
y = math.floor(N/K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = int(N//K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | [
"assignment.value.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,617 | 491,618 | u933717615 | python |
p02719 | N,K=map(int, input().split())
y = int(N/K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = int(N//K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,619 | 491,618 | u933717615 | python |
p02719 | N,K=map(int, input().split())
import math
y = math.floor(N/K)
x = N - y*K
#x = N%K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = int(N//K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | [
"assignment.value.change",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,620 | 491,618 | u933717615 | python |
p02719 | N,K=map(int, input().split())
y = int(N/K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = int(N//K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,621 | 491,618 | u933717615 | python |
p02719 | N,K=map(int, input().split())
y = int(N/K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = N//K
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,619 | 491,622 | u933717615 | python |
p02719 | N,K=map(int, input().split())
y = int(N/K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = N//K
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,621 | 491,622 | u933717615 | python |
p02719 | N,K=map(int, input().split())
y = int(N/K)
x = N - y*K
ans = min(x, abs(x-K))
print(ans) | N,K=map(int, input().split())
y = N//K
x = N - y*K
#x = N%K
ans = min(x, abs(x-K))
print(ans) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,621 | 491,623 | u933717615 | python |
p02719 | N,K = map(int, input().split())
x = abs(N - K*(int(N/K)-1))
ans = N
for i in range(0,5):
x = abs(x-K)
ans = min(ans,x)
print(ans) | N,K = map(int, input().split())
x = abs(N - K*(int(N/K)-1))
ans = N
for i in range(0,100000):
x = abs(x-K)
ans = min(ans,x)
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 491,636 | 491,637 | u314089899 | python |
p02719 | N,K = map(int, input().split())
x = abs(N - K*(int(N/K)-1))
for i in range(0,5):
x = abs(x-K)
ans = min(ans,x)
print(ans) | N,K = map(int, input().split())
x = abs(N - K*(int(N/K)-1))
ans = N
for i in range(0,100000):
x = abs(x-K)
ans = min(ans,x)
print(ans) | [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 491,638 | 491,637 | u314089899 | python |
p02719 | N, K = map(int, input().split())
N = N % K
if (N > abs(N - K)):
N = abs(N - K)
else:
print(N)
break | N, K = map(int, input().split())
N = N % K
if (N > abs(N - K)):
N = abs(N - K)
print(N) | [
"control_flow.break.remove"
] | 491,653 | 491,654 | u339199690 | python |
p02719 | N,K = map(int, input().split())
syou = int(N/K)
min_1 = N - syou*K
min_2 = -(N - (syou+1)*K)
if min_1 < min_2:
print(min_1)
else :
print(min_2)
| N,K = map(int, input().split())
syou = N//K
min_1 = N - syou*K
min_2 = -(N - (syou+1)*K)
if min_1 < min_2:
print(min_1)
else :
print(min_2) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,655 | 491,656 | u427163848 | python |
p02719 | n,k=map(int,input().split())
if n>=k:n%=k
print(min(k,k-n)) | n,k=map(int,input().split())
if n>=k:n%=k
print(min(n,k-n)) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 491,685 | 491,686 | u821432765 | python |
p02719 | N, K = map(int, input().split())
E = N % K
if (E == 0):
print('0')
else:
if (E > K):
print(E)
else:
print(abs(E - K)) | N, K = map(int, input().split())
E = N % K
if (E == 0):
print('0')
else:
if E < abs(E - K):
print(E)
else:
print(abs(E - K)) | [
"control_flow.branch.if.condition.change"
] | 491,725 | 491,726 | u428891594 | python |
p02719 | N, K = map(int, input().split())
if N%K != 0:
print(min(N%K, N-N%K))
else:
print(0) | N, K = map(int, input().split())
if N%K != 0:
print(min(N%K, K-N%K))
else:
print(0) | [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,736 | 491,737 | u161712560 | python |
p02719 | n,k = map(int,input().split())
if k==1 :
ln=0
elif k==0 :
ln=n
elif n>=k:
a = n%k
while 1:
ln = a
n = abs(n-k)
if ln<=n:
break
else:
while 1:
ln = n
n = abs(n-k)
if ln<=n:
break
print(ln) | n,k = map(int,input().split())
if k==1 :
ln=0
elif k==0 :
ln=n
elif n>=k:
a = n%k
n=a
while 1:
ln = n
n = abs(a-k)
if ln<=n:
break
else:
while 1:
ln = n
n = abs(n-k)
if ln<=n:
break
print(ln) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,747 | 491,748 | u262244504 | python |
p02719 | n,k = map(int, input().split())
tmpNum = n
subtraction = n
if n % k == 0:
print(0)
else:
tmp = int(n/k)
subtraction = n - (tmp*k)
while(1):
subtraction = abs(subtraction-k)
print(subtraction,tmpNum)
if subtraction < tmpNum:
tmpNum = subtraction
else:
break
print(tmpNum)
| n,k = map(int, input().split())
tmpNum = n
subtraction = n
if n % k == 0:
print(0)
else:
tmp = int(n/k)
subtraction = n - (tmp*k)
while(1):
subtraction = abs(subtraction-k)
if subtraction < tmpNum:
tmpNum = subtraction
else:
break
print(tmpNum) | [
"call.remove"
] | 491,757 | 491,758 | u256801986 | python |
p02719 | N, K = list(map(int,input().split()))
d = int(N/K)
S0 = N - d * K
S1 = S0 - K
Sa = abs(S1)
if S0 <= Sa:
print(S0)
else:
print(Sa) | N, K = list(map(int,input().split()))
d = N//K
S0 = N - d * K
S1 = S0 - K
Sa = abs(S1)
if S0 <= Sa:
print(S0)
else:
print(Sa) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,762 | 491,763 | u699944218 | python |
p02719 | n, k = map(int, input().split())
min_num = n
new_min = n % k
while True:
new_min = new_min - k
if new_min < 0:
new_min *= -1
if min_num > new_min:
min_num = new_min
else:
break
print(min_num) | n, k = map(int, input().split())
min_num = new_min = n % k
while True:
new_min = new_min - k
if new_min < 0:
new_min *= -1
if min_num > new_min:
min_num = new_min
else:
break
print(min_num) | [] | 491,790 | 491,791 | u821265215 | python |
p02719 | N, K = map(int, input().split())
if N > K:
N = N - K*(N//K)
if N==K:
print(0)
else:
print(K-N) | N, K = map(int, input().split())
if N > K:
N = N - K*(N//K)
if N==K:
print(0)
else:
print(min(N,K-N)) | [
"call.add",
"call.arguments.change"
] | 491,792 | 491,793 | u178509296 | python |
p02719 | import sys
N, K = map(int, input().split())
if N == 1 or N == 0 or K == 1 or N == K:
print(0)
sys.exit()
if N > K:
N = N%K
ans = [N]
for _ in range(100):
ans.append(abs(N-K))
N = abs(N-K)
print(min(ans))
| import sys
N, K = map(int, input().split())
if N == 0 or K == 1 or N == K:
print(0)
sys.exit()
if N > K:
N = N%K
# elif N < K:
# print(N)
# sys.exit()
ans = [N]
for _ in range(100):
ans.append(abs(N-K))
N = abs(N-K)
print(min(ans))
| [] | 491,848 | 491,849 | u459150945 | python |
p02719 | import sys
N, K = map(int, input().split())
if N == 1 or N == 0 or K == 1 or N == K:
print(0)
sys.exit()
if N > K:
N = N%K
ans = [N]
for _ in range(10):
ans.append(abs(N-K))
N = abs(N-K)
print(min(ans))
| import sys
N, K = map(int, input().split())
if N == 0 or K == 1 or N == K:
print(0)
sys.exit()
if N > K:
N = N%K
# elif N < K:
# print(N)
# sys.exit()
ans = [N]
for _ in range(100):
ans.append(abs(N-K))
N = abs(N-K)
print(min(ans))
| [
"literal.number.integer.change",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 491,850 | 491,849 | u459150945 | 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"
] | 491,891 | 491,892 | u985835425 | python |
p02719 | N, K = map(int, input().split())
if N == 0:
print(N)
elif (K / N) > 1:
print(N)
else:
amari = N % K
mainasu_noatai = abs(amari - K)
if (amari > mainasu_noatai):
print(mainasu_noatai);
else:
print(amari)
| N, K = map(int, input().split())
if N == 0:
print(N)
elif int(K / N) > 1:
print(N)
else:
amari = N % K
mainasu_noatai = abs(amari - K)
if (amari > mainasu_noatai):
print(mainasu_noatai);
else:
print(amari)
| [
"call.add",
"control_flow.branch.if.condition.change"
] | 491,917 | 491,918 | u651314218 | python |
p02719 | import sys
import math
n, k = map(int, input().split())
pre=n-math.floor(n/k)*k
while 1:
if pre <= abs(pre-k):
print(pre)
sys.exit()
pre = abs(pre - k)
| import sys
import math
n, k = map(int, input().split())
pre=n-n//k*k
while 1:
if pre <= abs(pre-k):
print(pre)
sys.exit()
pre = abs(pre - k)
| [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 491,977 | 491,979 | u625920333 | 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,abs(K-(N%K)))) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.arguments.add"
] | 491,989 | 491,990 | u703528810 | python |
p02719 | # C
import math
def my_round(val, digit=0):
p = 10 ** digit
return (val * p * 2 + 1) // 2 / p
n, k = map(int, input().split())
s = n / k
print(min(n%k,k-s)) | # C
import math
def my_round(val, digit=0):
p = 10 ** digit
return (val * p * 2 + 1) // 2 / p
n, k = map(int, input().split())
s = n / k
print(min(n%k,k-(n%k))) | [
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 491,995 | 491,996 | u490489966 | python |
p02719 | nums = list(map(int, input().split()))
n = nums[0]
k = nums[1]
x = n % k
print(min(n, k - n))
| nums = list(map(int, input().split()))
n = nums[0]
k = nums[1]
n = n % k
print(min(n, k - n))
| [
"assignment.variable.change",
"identifier.change"
] | 492,003 | 492,004 | u215286521 | 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"
] | 492,009 | 492,010 | u698988260 | python |
p02719 | N,K=map(int,input().split())
N=N%K
print(min(K,abs(N-K))) | N,K=map(int,input().split())
N=N%K
print(min(N,abs(N-K))) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 492,026 | 492,027 | u272682534 | 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)) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 492,028 | 492,029 | u502028059 | python |
p02719 | a = [int(a) for a in input().split(' ')]
N = a[0]
K = a[1]
def abs_met(N):
if N > abs(N - K):
N = abs(N - K)
abs_met(N)
else:
print(N)
if K == 1:
print(0)
else:
abs_met(N) | a = [int(a) for a in input().split(' ')]
N = a[0]
K = a[1]
def abs_met(N):
N = N % K
if N > abs(N - K):
N = abs(N - K)
abs_met(N)
else:
print(N)
if K == 1:
print(0)
else:
abs_met(N) | [
"assignment.add"
] | 492,058 | 492,059 | u731467249 | python |
p02719 | NK = input("").split()
N = int(NK[0])
K = int(NK[1])
if N == K or K==1:
print(0)
elif N > K:
A = N % K
if A > K-A:
print(K-A)
#elif A == K:
#print(A)
else:
print(A)
else:
if N <= N-K:
print(N)
else:
print(K-N)
| NK = input("").split()
N = int(NK[0])
K = int(NK[1])
if N == K or K==1:
print(0)
elif N > K:
A = N % K
if A > K-A:
print(K-A)
else:
print(A)
else:
if N <= K-N:
print(N)
else:
print(K-N)
| [
"expression.operation.binary.remove",
"control_flow.branch.if.condition.change"
] | 492,090 | 492,091 | u735091636 | python |
p02719 | import math
first_input = list(map(lambda x:int(x), input().split(" ")))
#second_input = list(map(lambda x:int(x), input().split(" ")))
N = first_input[0]
K = first_input[1]
#print(int(N/K))
if N>K:
first_min_N = N - K*math.floor(N/K)
else:
first_min_N = N
print(min(first_min_N,abs(first_min_N-K)))
| import math
first_input = list(map(lambda x:int(x), input().split(" ")))
#second_input = list(map(lambda x:int(x), input().split(" ")))
N = first_input[0]
K = first_input[1]
#print(math.floor(N // K))
#print(K*math.floor(N // K))
if N>K:
first_min_N = N - K*math.floor(N // K)
else:
first_min_N = N
print(min(... | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,102 | 492,103 | u222185706 | python |
p02719 | N,K = map(int,input().split())
ans1 = N % K
ans2 = abs(ans1 - 4)
if ans1 <= ans2:
print(ans1)
else:
print(ans2) | N,K = map(int,input().split())
ans1 = N % K
ans2 = abs(ans1 - K)
if ans1 <= ans2:
print(ans1)
else:
print(ans2) | [
"assignment.value.change",
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,109 | 492,110 | u763383823 | python |
p02719 | [n, k] = map(int, input().split())
n -= n//k
if n > k//2:
n = k -n
print(n)
| [n, k] = map(int, input().split())
n -= (n//k) * k
if n > k//2:
n = k -n
print(n)
| [
"expression.operation.binary.add"
] | 492,111 | 492,112 | u571941361 | python |
p02719 | #coding:utf-8
N,K=map(int,input().split())
if (N%K) <=(K/2):
x=N%K
else:
x=N-N%K
print(x) | #coding:utf-8
N,K=map(int,input().split())
if (N%K) <=(K/2):
x=N%K
else:
x=K-N%K
print(x) | [
"assignment.value.change",
"identifier.change",
"expression.operation.binary.change"
] | 492,119 | 492,120 | u279121950 | python |
p02719 | n, k = map(int, input().split())
L = []
if n > k:
n = n - k*(n//k)
if n*2 <= k:
print(n)
else:
print(k) | n, k = map(int, input().split())
L = []
if n > k:
n = n - k*(n//k)
if n*2 <= k:
print(n)
else:
print(k-n) | [
"expression.operation.binary.add"
] | 492,162 | 492,163 | u658288444 | python |
p02719 | n, k = map(int, input().split())
if n < k:
if n < k-n:
print(n)
else:
print(k-n)
else:
n = n//k
if n < k-n:
print(n)
else:
print(k-n) | n, k = map(int, input().split())
if n < k:
if n < k-n:
print(n)
else:
print(k-n)
else:
n = n%k
if n < k-n:
print(n)
else:
print(k-n) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 492,209 | 492,210 | u624190157 | python |
p02719 | N,K=list(map(int,input().split()))
n=N%K
old_n=K+1
while True:
if old_n<=n:
print(old_n)
break
old_n=n
N=abs(n-K) | N,K=list(map(int,input().split()))
n=N%K
old_n=K+1
while True:
if old_n<=n:
print(old_n)
break
old_n=n
n=abs(n-K) | [
"assignment.variable.change",
"identifier.change"
] | 492,248 | 492,249 | u638867180 | python |
p02719 | num = list(map(int, input().split()))
print(min([num[0],num[0]%num[1],abs((num[0]//num[1])-num[1])])) | num = list(map(int, input().split()))
print(min([num[0],num[0]%num[1],abs((num[0]%num[1])-num[1])])) | [
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,260 | 492,261 | u813993459 | python |
p02719 | num = list(map(int, input().split()))
min([num[0],num[0]%num[1],abs((num[0]//num[1])-num[1])]) | num = list(map(int, input().split()))
print(min([num[0],num[0]%num[1],abs((num[0]%num[1])-num[1])])) | [
"call.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,262 | 492,261 | u813993459 | python |
p02719 | N, K = map(int, input().split(' '))
def main(n, k):
print(n, k)
if n % k == 0:
# print('n%k=0')
res = 0
else:
# print(n % k, abs((n % k)-k), n)
res = min(n % k, abs((n % k) - k), n)
print(res)
main(N, K)
# main(7, 4)
# main(2, 6)
# main(1000000000000000000, 1)
# main... | N, K = map(int, input().split(' '))
def main(n, k):
# print(n, k)
if n % k == 0:
# print('n%k=0')
res = 0
else:
# print(n % k, abs((n % k)-k), n)
res = min(n % k, abs((n % k) - k), n)
print(res)
main(N, K)
# main(7, 4)
# main(2, 6)
# main(1000000000000000000, 1)
# ma... | [
"call.remove"
] | 492,266 | 492,267 | u673101577 | python |
p02719 | n, k = input().split(' ')
n = int(n)
k = int(k)
if k == 1 or n == 0:
print(0)
elif n < k :
r1 = n
r2 = n - k
if r2 < 0:
r2 *= -1
print(min(r1,r2))
else:
r1 = n // k
r2 = r1 - k
if r2 < 0:
r2 *= -1
print(min(r1,r2)) | n, k = input().split(' ')
n = int(n)
k = int(k)
if k == 1 or n == 0:
print(0)
elif n < k :
r1 = n
r2 = n - k
if r2 < 0:
r2 *= -1
print(min(r1,r2))
else:
r1 = n % k
r2 = r1 - k
if r2 < 0:
r2 *= -1
print(min(r1,r2)) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 492,270 | 492,271 | u406405116 | python |
p02719 | n, k = input().split(' ')
n = int(n)
k = int(k)
if k == 1 or n == 0:
print(0)
elif n < k :
r1 = n
r2 = n - k
if r2 < 0:
r2 *= -1
print(min(r1,r2))
else:
r1 = n // k
r2 = n - k
if r2 < 0:
r2 *= -1
print(min(r1,r2)) | n, k = input().split(' ')
n = int(n)
k = int(k)
if k == 1 or n == 0:
print(0)
elif n < k :
r1 = n
r2 = n - k
if r2 < 0:
r2 *= -1
print(min(r1,r2))
else:
r1 = n % k
r2 = r1 - k
if r2 < 0:
r2 *= -1
print(min(r1,r2)) | [
"expression.operator.arithmetic.change",
"assignment.value.change",
"expression.operation.binary.change",
"identifier.change"
] | 492,272 | 492,271 | u406405116 | python |
p02719 | n, k = (int(i) for i in input().split())
if k > n:
print(n, abs(n-k))
elif n % k == 0:
print(0)
else:
q = n % k
p = (k * (n//k+1)) - n
print(min(p, q)) | n, k = (int(i) for i in input().split())
if k > n:
print(min(n, abs(n-k)))
elif n % k == 0:
print(0)
else:
q = n % k
p = (k * (n//k+1)) - n
print(min(p, q)) | [
"call.arguments.add",
"call.arguments.change"
] | 492,282 | 492,283 | u058592821 | python |
p02719 | n, k = (int(i) for i in input().split())
if k > n:
print(n, n-k)
elif n % k == 0:
print(0)
else:
q = n % k
p = (k * (n//k+1)) - n
print(min(p, q)) | n, k = (int(i) for i in input().split())
if k > n:
print(min(n, abs(n-k)))
elif n % k == 0:
print(0)
else:
q = n % k
p = (k * (n//k+1)) - n
print(min(p, q)) | [
"call.arguments.add",
"call.add"
] | 492,284 | 492,283 | u058592821 | python |
p02719 | #n = int(input())
n,k = map(int,input().split())
#a_L = list(map(int,input().split()))
if abs(n-k) >= n:
print(n)
exit()
if n > k:
tmp = n%k
print(min(tmp,abs(tmp-k)))
exit()
if n==k:
print(0)
exit()
if n == 0:
print(0)
print(1)
| #n = int(input())
n,k = map(int,input().split())
#a_L = list(map(int,input().split()))
if abs(n-k) >= n:
print(n)
exit()
if n > k:
tmp = n%k
print(min(tmp,abs(tmp-k)))
exit()
if n==k:
print(0)
exit()
if n == 0:
print(0)
print(abs(n-k))
| [
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"io.output.change",
"call.arguments.add"
] | 492,293 | 492,294 | u625255205 | python |
p02719 | #n = int(input())
n,k = map(int,input().split())
#a_L = list(map(int,input().split()))
if abs(n-k) > n:
print(n)
exit()
if n > k:
tmp = n%k
print(min(tmp,abs(tmp-k)))
exit()
if n==k:
print(0)
exit()
if n == 0:
print(0)
print(n)
| #n = int(input())
n,k = map(int,input().split())
#a_L = list(map(int,input().split()))
if abs(n-k) >= n:
print(n)
exit()
if n > k:
tmp = n%k
print(min(tmp,abs(tmp-k)))
exit()
if n==k:
print(0)
exit()
if n == 0:
print(0)
print(abs(n-k))
| [
"expression.operator.compare.change",
"control_flow.branch.if.condition.change",
"call.add",
"call.arguments.add"
] | 492,295 | 492,294 | u625255205 | python |
p02719 | import math
#n,k
n,k = (int(x) for x in input().split())
b = n % k
print(b)
#c = abs(k-b)
if b < c:
ans = b
else:
ans = c
print(ans) | import math
#n,k
n,k = (int(x) for x in input().split())
b = n % k
#print(b)
c = abs(k-b)
if b < c:
ans = b
else:
ans = c
print(ans) | [
"assignment.variable.change",
"io.output.change"
] | 492,303 | 492,304 | u654528273 | python |
p02719 | import sys
input = sys.stdin.readline
N ,K = map(int,input().split())
intlist = [ (N % K) ,abs (( N % K ) - N )]
print ( min(intlist) ) | import sys
input = sys.stdin.readline
N ,K = map(int,input().split())
intlist = [ (N % K) ,abs (( N % K ) - K )]
print (min(intlist)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,317 | 492,318 | u055668007 | python |
p02719 | def solution():
n, m = map(int, input().split())
if n < m:
print(n)
return
ans = n % m
print(min(ans, abs(ans-m)))
solution() | def solution():
n, m = map(int, input().split())
# if n < m:
# print(0)
# return
if n == 0:
print(0)
return
ans = n % m
print(min(ans, abs(ans-m)))
solution() | [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 492,321 | 492,322 | u305388378 | python |
p02719 | n,k=map(int,input().split())
n1=n-(n//k)*k
n2=n-k
print(min(n1,n2)) | n,k=map(int,input().split())
n1=n-(n//k)*k
n2=abs(n1-k)
print(min(n1,n2)) | [
"assignment.value.change",
"expression.operation.binary.change",
"call.arguments.add",
"call.arguments.change"
] | 492,342 | 492,343 | u016901717 | python |
p02719 | n,k=map(int,input().split())
a=n%k
b=k-a
print(a,b) | n,k=map(int,input().split())
a=n%k
b=k-a
print(min(a,b)) | [
"call.arguments.add",
"call.arguments.change"
] | 492,360 | 492,361 | u674959776 | python |
p02719 | n,k = map(int, input().split())
if n//k != 0:
print(min(n%k, abs(k-n%k)))
else:
print(min(n-k, n)) | n,k = map(int, input().split())
if n//k != 0:
print(min(n%k, abs(k-n%k)))
else:
print(min(abs(n-k), n)) | [
"call.add",
"call.arguments.change"
] | 492,366 | 492,367 | u204208382 | python |
p02719 | n,k = map(int, input().split())
if n//k != 0:
print(min(n%k, abs(k-n%k)))
else:
print(min(n%k, n)) | n,k = map(int, input().split())
if n//k != 0:
print(min(n%k, abs(k-n%k)))
else:
print(min(abs(n-k), n)) | [
"call.add",
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 492,368 | 492,367 | u204208382 | python |
p02719 | N,K = map(int, input().split())
if N<=K:
while K<2*N:
N=abs(N-k)
print(N)
else:
R=N%K
print(min(R,K-R)) | N,K = map(int, input().split())
if N<=K:
while K<2*N:
N=abs(N-K)
print(N)
else:
R=N%K
print(min(R,K-R)) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,377 | 492,378 | u327078256 | python |
p02719 | n,k=map(int,input().split())
if n >= k:
print(min(n%k,k-n%k))
elif n == 0:
print(n)
else:
print(min(n,n-k)) | n,k=map(int,input().split())
if n >= k:
print(min(n%k,k-n%k))
elif n == 0:
print(n)
else:
print(min(n,k-n)) | [
"expression.operation.binary.remove"
] | 492,395 | 492,396 | u393253137 | python |
p02719 | a,b=map(int,input().split())
print(min(a%b,(b%(a%b))))
| a,b=map(int,input().split())
print(min(a%b,b-a%b)) | [
"call.arguments.change",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"io.output.change"
] | 492,410 | 492,411 | u769870836 | python |
p02719 | aa=list(map(int,input().split()))
n=aa[0]
k=aa[1]
minn=n%k
print(abs(min(n%k,(n%k)-k))) | aa=list(map(int,input().split()))
n=aa[0]
k=aa[1]
minn=n%k
print(min(n%k,abs((n%k)-k))) | [
"call.arguments.change",
"call.add"
] | 492,414 | 492,415 | u050017042 | python |
p02719 | n,k = map(int,input().split())
if n % 4 == 0:
ans = 0
else:
x = n % k
y = abs(k - x)
ans = min(x,y)
print(ans) | n,k = map(int,input().split())
if n % k == 0:
ans = 0
else:
x = n % k
y = abs(k - x)
ans = min(x,y)
print(ans) | [
"identifier.replace.add",
"literal.replace.remove",
"control_flow.branch.if.condition.change"
] | 492,441 | 492,442 | u201382544 | python |
p02719 | import sys
n, k = map(int, input().split())
if n == 0:
print(k)
sys.exit()
if n >= k:
n = n % k
for i in range(10**18):
if abs(k-n) < n:
n = abs(k-n)
else:
break
print(n) | import sys
n, k = map(int, input().split())
if n == 0:
print(n)
sys.exit()
if n >= k:
n = n % k
for i in range(10**18):
if abs(k-n) < n:
n = abs(k-n)
else:
break
print(n) | [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 492,453 | 492,454 | u238956837 | python |
p02719 | n,k = map(int,input().split())
ans1 = n%k
print(ans1)
if ans1 > k-ans1:
ans1 = k-ans1
print(ans1) | n,k = map(int,input().split())
ans1 = n%k
if ans1 > k-ans1:
ans1 = k-ans1
print(ans1) | [
"call.remove"
] | 492,465 | 492,466 | u386439695 | python |
p02719 |
n, k = map(int, input().split())
if n == 0:
print(k)
else:
n = n%k
print(min(n,k-n))
|
n, k = map(int, input().split())
if n == 0:
print(0)
else:
n = n%k
print(min(n,k-n))
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 492,467 | 492,468 | u506910932 | python |
p02719 |
n, k = map(int, input().split())
if k == 1 or n == 1:
print(0)
else:
n = n%k
print(min(n,k-n))
|
n, k = map(int, input().split())
if n == 0:
print(0)
else:
n = n%k
print(min(n,k-n))
| [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 492,469 | 492,468 | u506910932 | python |
p02719 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
N, K = map(int, read().split())
if N == K:
print(0)
elif N > K:
N %= K
print(min(N, abs(N - K)))
else:
print(min(K, abs(N - K)))
| import sys
read = sys.stdin.read
readline = sys.stdin.readline
N, K = map(int, read().split())
if N == K:
print(0)
elif N > K:
N %= K
print(min(N, abs(N - K)))
else:
print(min(N, abs(N - K)))
| [
"identifier.change",
"call.arguments.change",
"io.output.change"
] | 492,476 | 492,477 | u945181840 | python |
p02719 | import numpy as np
N,K = list(map(int, input().split()))
if N==K:
print(0)
if N>K:
N=N%K
if 2*N>=K:
print(K-N)
else:
print(N) | import numpy as np
N,K = list(map(int, input().split()))
if N==K:
N=0
if N>K:
N=N%K
if 2*N>=K:
print(K-N)
else:
print(N) | [
"call.arguments.change"
] | 492,480 | 492,481 | u546104065 | python |
p02719 | #Input
n, k = map(int, input().split())
#Process
mod = n % k
if(mod > abs(mod - k)):
Ans = aqbs(mod - k)
else:
Ans = mod
#Output
print(Ans) | #Input
n, k = map(int, input().split())
#Process
mod = n % k
if(mod > abs(mod - k)):
Ans = abs(mod - k)
else:
Ans = mod
#Output
print(Ans) | [
"assignment.value.change",
"identifier.change",
"call.function.change"
] | 492,486 | 492,487 | u123282507 | python |
p02719 | N, K =map(int,input().split())
r = N % K
print(min(r,abs(r-k)))
| N, K =map(int,input().split())
r = N % K
print(min(r,abs(r-K)))
| [
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,495 | 492,496 | u434311880 | python |
p02719 | n, k = map(int, input().split())
mov = n%k
ans = min(mov,abs(mov-k)) | n, k = map(int, input().split())
mov = n%k
ans = min(mov,abs(mov-k))
print(ans) | [
"call.add"
] | 492,510 | 492,511 | u323045245 | python |
p02719 | N,K = map(int, input().split())
if N<K:
print(K-N)
else:
print(min(N%K,abs(N%K-K))) | N,K = map(int, input().split())
if N<K:
print(min(K-N,N))
else:
print(min(N%K,abs(N%K-K))) | [
"call.arguments.add"
] | 492,532 | 492,533 | u585963734 | python |
p02719 | n,k=map(int,input().split())
temp=min(n,k)
for i in range(10^6):
temp=min(temp,abs(temp-k))
print(temp) | n,k=map(int,input().split())
temp=n
temp=min(n,n%k)
for i in range(10^6):
temp=min(temp,abs(temp-k))
print(temp) | [
"assignment.add",
"assignment.change"
] | 492,556 | 492,557 | u937132382 | python |
p02719 | N,K=map(int, input().split())
m=(N//K)
if m>=1:
tmp=abs(N-K*m)
res=min(tmp,abs(tmp-K))
else:
res=abs(N-K)
print(res) | N,K=map(int, input().split())
m=(N//K)
if m>=1:
tmp=abs(N-K*m)
res=min(tmp,abs(tmp-K))
else:
res=abs(N-K)
print(min(N,res)) | [
"call.add",
"call.arguments.change"
] | 492,560 | 492,561 | u830592648 | python |
p02719 | n,k=map(int,input().split())
flag=True
tmp=n-int(n/k)*k
cnt=k
while(flag):
if tmp > abs(tmp-k) :
tmp=abs(tmp-k)
cnt+=1
else:
flag=False
print(tmp) | n,k=map(int,input().split())
flag=True
tmp=n-n//k*k
cnt=k
while(flag):
if tmp > abs(tmp-k) :
tmp=abs(tmp-k)
cnt+=1
else:
flag=False
print(tmp) | [
"call.remove",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,577 | 492,578 | u586212264 | python |
p02719 | n,k=map(int,input().split())
if n>k:
large=(n-(k*(n//k-1)))-k
small=k-(n-k*(n//k))
print(large,small)
print(min(large,small))
elif n==k:
print(0)
else:
print(min(n,abs(n-k)))
| n,k=map(int,input().split())
if n>k:
large=(n-(k*(n//k-1)))-k
small=k-(n-k*(n//k))
#print(large,small)
print(min(large,small))
elif n==k:
print(0)
else:
print(min(n,abs(n-k)))
| [
"call.remove"
] | 492,581 | 492,582 | u588794534 | python |
p02719 | n,k=map(int,input().split())
if(n>k):
if(n%k==0):
print(0)
else:
print(min((n%k),(n//k+1)*k-n))
elif(n==k):
print(0)
elif(n==0):
print(k)
else:
if(k%n==0):
print(n)
else:
if(k-n)<=n:
print(k-n)
else:
print(n)
| n,k=map(int,input().split())
if(n>k):
if(n%k==0):
print(0)
else:
print(min((n%k),(n//k+1)*k-n))
elif(n==k):
print(0)
elif(n==0):
print(0)
else:
if(k%n==0):
print(n)
else:
if(k-n)<=n:
print(k-n)
else:
print(n)
| [
"identifier.replace.remove",
"literal.replace.add",
"call.arguments.change",
"io.output.change"
] | 492,592 | 492,593 | u905592208 | python |
p02719 | #!/usr/bin/env python3
import collections
import itertools as it
import math
import numpy as np
# = input()
# = int(input())
N, K = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
#
# c = collections.Counter()
if N >= K:
seimin = N - (N//K) * K
print(min(... | #!/usr/bin/env python3
import collections
import itertools as it
import math
import numpy as np
# = input()
# = int(input())
N, K = map(int, input().split())
# = list(map(int, input().split()))
# = [int(input()) for i in range(N)]
#
# c = collections.Counter()
if N >= K:
seimin = N - (N//K) * K
print(min(... | [
"call.add",
"call.arguments.change"
] | 492,610 | 492,611 | u671446913 | python |
p02719 | N,K = map(int,input().split())
if K == 1:
ans = 0
else:
if N >= K:
N -= (N//K)*K
ans = min(N,abs(N-K))
else:
min(N,abs(N-K))
print(ans)
| N,K = map(int,input().split())
if K == 1:
ans = 0
else:
if N >= K:
N -= (N//K)*K
ans = min(N,abs(N-K))
else:
ans = min(N,abs(N-K))
print(ans)
| [
"assignment.add"
] | 492,632 | 492,633 | u704284486 | python |
p02719 | n, k = map(int, input().split())
x = n%k
ans = min(x,n-x)
print(ans) | n, k = map(int, input().split())
x = n%k
ans = min(x,k-x)
print(ans) | [
"assignment.value.change",
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 492,650 | 492,651 | u852790844 | python |
p02719 | n, k = map(int, input().split())
if n == 0:
ans = n
elif n == 1 or k == 1:
ans = 0
else:
ans = min(n % k, k - n % k)
print(ans)
| n, k = map(int, input().split())
if n == 0:
ans = n
elif k == 1:
ans = 0
else:
ans = min(n % k, k - n % k)
print(ans)
| [] | 492,652 | 492,653 | u644516473 | python |
p02719 | import sys
input = sys.stdin.readline
n, k = map(int, input().split())
ans = n%k
if ans < abs(ans-k):
ans = abs(ans-k)
print(ans) | import sys
input = sys.stdin.readline
n, k = map(int, input().split())
ans = n%k
if ans > abs(ans-k):
ans = abs(ans-k)
print(ans) | [
"misc.opposites",
"expression.operator.compare.change",
"control_flow.branch.if.condition.change"
] | 492,668 | 492,669 | u366269356 | python |
p02720 | def main():
k = int(input())
hp = [i for i in range(k+4)]
r, w = 1, 10
while w < k:
n = hp[r]
r += 1
nm = n % 10
val = n * 10 + nm
if nm != 0:
hp[w] = val - 1
w += 1
hp[w] = val
w += 1
if nm != 9:
... | def main():
k = int(input())
hp = [i for i in range(k+4)]
r, w = 1, 10
while w <= k:
n = hp[r]
r += 1
nm = n % 10
val = n * 10 + nm
if nm != 0:
hp[w] = val - 1
w += 1
hp[w] = val
w += 1
if nm != 9:
... | [
"expression.operator.compare.change",
"control_flow.loop.condition.change"
] | 492,712 | 492,713 | u091307273 | python |
p02720 | k = int(input())
L = []
def lunlun(d,v,L):
L.append(v)
if d == 4:
return
for i in range(-1,2):
t = v%10 + i
#print(v)
if 0 <= t <=9:
lunlun(d+1,v*10+t,L)
#lunlun(1,1,L)
for v in range(1,10):
lunlun(1,v,L)
print(sorted(L)[k-1]) | k = int(input())
L = []
def lunlun(d,v,L):
L.append(v)
if d == 10:
return
for i in range(-1,2):
t = v%10 + i
#print(v)
if 0 <= t <=9:
lunlun(d+1,v*10+t,L)
#lunlun(1,1,L)
for v in range(1,10):
lunlun(1,v,L)
print(sorted(L)[k-1]) | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 492,725 | 492,726 | u252828980 | python |
p02720 | k = int(input())
cand = [[1,2,3,4,5,6,7,8,9]]
for i in range(9):
tmp = []
for val in cand[-1]:
if val % 10 != 0:
tmp.append(val*10 + (val%10 - 1))
tmp.append(val*10 + (val % 10))
if val % 10 != 9:
tmp.append(val*10 + (val%10 + 1))
cand.append(tmp)
ans = []
for j in range(len(cand)):
for... | k = int(input())
cand = [[1,2,3,4,5,6,7,8,9]]
for i in range(9):
tmp = []
for val in cand[-1]:
if val % 10 != 0:
tmp.append(val*10 + (val%10 - 1))
tmp.append(val*10 + (val % 10))
if val % 10 != 9:
tmp.append(val*10 + (val%10 + 1))
cand.append(tmp)
ans = []
for j in range(len(cand)):
for... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 492,751 | 492,752 | u228303592 | python |
p02720 | k = int(input())
cand = [[1,2,3,4,5,6,7,8,9]]
for i in range(9):
tmp = []
for val in cand[-1]:
if val % 10 != 0:
tmp.append(val*10 + (val%10 - 1))
tmp.append(val*10 + (val % 10))
if val % 10 != 9:
tmp.append(val*10 + (val%10 + 1))
cand.append(tmp)
ans = []
for j in range(len(cand)):
f... | k = int(input())
cand = [[1,2,3,4,5,6,7,8,9]]
for i in range(9):
tmp = []
for val in cand[-1]:
if val % 10 != 0:
tmp.append(val*10 + (val%10 - 1))
tmp.append(val*10 + (val % 10))
if val % 10 != 9:
tmp.append(val*10 + (val%10 + 1))
cand.append(tmp)
ans = []
for j in range(len(cand)):
for... | [
"identifier.change",
"variable_access.subscript.index.change"
] | 492,753 | 492,752 | u228303592 | python |
p02720 | import queue
k = int(input)
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x = q.get()
if not x%10 == 0:
q.put(10*x+(x%10)-1)
q.put(10*x+(x%10))
if not x%10 == 9:
q.put(10*x+(x%10)+1)
print(x)
| import queue
k = int(input())
q = queue.Queue()
for i in range(1,10):
q.put(i)
for i in range(k):
x = q.get()
if not x%10 == 0:
q.put(10*x+(x%10)-1)
q.put(10*x+(x%10))
if not x%10 == 9:
q.put(10*x+(x%10)+1)
print(x)
| [
"call.add"
] | 492,754 | 492,755 | u169350228 | python |
p02720 | import sys
# from collections import defaultdict
# from collections import Counter
from queue import Queue
# sys.setrecursionlimit(2000000)
def main():
K = int(input())
queue = Queue()
for i in [ 1, 2, 3, 4, 5, 6, 7, 8, 9, ]:
queue.put(i)
for i in range(1, K+1):
lunlun = queue.get()
... | import sys
# from collections import defaultdict
# from collections import Counter
from queue import Queue
# sys.setrecursionlimit(2000000)
def main():
K = int(input())
queue = Queue()
for i in [ 1, 2, 3, 4, 5, 6, 7, 8, 9, ]:
queue.put(i)
for i in range(1, K+1):
lunlun = queue.get()
... | [
"call.remove",
"call.add"
] | 492,768 | 492,769 | u558528117 | python |
p02720 | import sys
sys.setrecursionlimit(500000)
K = int(input())
ans_list = []
def dfs(A):
if len(A)!=0 and int("".join(A))<=10**6:
ans_list.append(int("".join(A)))
elif len(A)!=0 and int("".join(A))>10**6:
return
if len(A)==0:
for i in range(1, 10, 1):
A.append(str(i))
... | import sys
sys.setrecursionlimit(500000)
K = int(input())
ans_list = []
def dfs(A):
if len(A)!=0 and int("".join(A))<=10**10:
ans_list.append(int("".join(A)))
elif len(A)!=0 and int("".join(A))>10**10:
return
if len(A)==0:
for i in range(1, 10, 1):
A.append(str(i))
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 492,770 | 492,771 | u492447501 | python |
p02720 | import sys
sys.setrecursionlimit(500000)
K = int(input())
ans_list = []
def dfs(A):
if len(A)!=0 and int("".join(A))<=10**5:
ans_list.append(int("".join(A)))
elif len(A)!=0 and int("".join(A))>10**5:
return
if len(A)==0:
for i in range(1, 10, 1):
A.append(str(i))
... | import sys
sys.setrecursionlimit(500000)
K = int(input())
ans_list = []
def dfs(A):
if len(A)!=0 and int("".join(A))<=10**10:
ans_list.append(int("".join(A)))
elif len(A)!=0 and int("".join(A))>10**10:
return
if len(A)==0:
for i in range(1, 10, 1):
A.append(str(i))
... | [
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 492,772 | 492,771 | u492447501 | python |
p02720 | from collections import deque
K = int(input())
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
runrun = q.popleft()
rem = runrun % 10
if rem == 0:
q.append(runrun * 10)
q.append(runrun * 10 + rem + 1)
elif rem == 9:
q.append(runrun * 10 + rem - 1)
q.append(run... | from collections import deque
K = int(input())
q = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
runrun = q.popleft()
rem = runrun % 10
if rem == 0:
q.append(runrun * 10)
q.append(runrun * 10 + rem + 1)
elif rem == 9:
q.append(runrun * 10 + rem - 1)
q.append(run... | [
"expression.operation.binary.add"
] | 492,779 | 492,780 | u636290142 | python |
p02720 | # https://atcoder.jp/contests/abc161/tasks/abc161_d
import sys
# sys.setrecursionlimit(100000)
import heapq
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = int(input())
if n ... | # https://atcoder.jp/contests/abc161/tasks/abc161_d
import sys
# sys.setrecursionlimit(100000)
import heapq
def input():
return sys.stdin.readline().strip()
def input_int():
return int(input())
def input_int_list():
return [int(i) for i in input().split()]
def main():
n = int(input())
if n ... | [
"control_flow.return.add"
] | 492,791 | 492,792 | u397496203 | python |
p02720 | K = int(input())
a = []
def DFS(n):
if n > 3234566667:
return
a.append(n)
l = n % 10
if l == 0:
DFS(10 * n)
DFS(10 * n + 1)
elif l == 9:
DFS(10 * n)
DFS(10 * n + 8)
else:
DFS(10 * n + l)
DFS(10 * n + l + 1)
DFS(10 * n + l - 1)
for... | K = int(input())
a = []
def DFS(n):
if n > 3234566667:
return
a.append(n)
l = n % 10
if l == 0:
DFS(10 * n)
DFS(10 * n + 1)
elif l == 9:
DFS(10 * n + 9)
DFS(10 * n + 8)
else:
DFS(10 * n + l)
DFS(10 * n + l + 1)
DFS(10 * n + l - 1)
... | [
"expression.operation.binary.add"
] | 492,795 | 492,796 | u990726146 | python |
p02720 | from collections import deque
K = int(input())
que = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
num = que.popleft()
if i == K-1:
print(num)
break
if num%10 == 0:
que.append(num*10 + num%10)
que.append(num*10 + num%10 + 1)
elif num%10 == 9:
que.append(nu... | from collections import deque
K = int(input())
que = deque([1, 2, 3, 4, 5, 6, 7, 8, 9])
for i in range(K):
num = que.popleft()
if i == K-1:
print(num)
break
if num%10 == 0:
que.append(num*10 + num%10)
que.append(num*10 + num%10 + 1)
elif num%10 == 9:
que.append(nu... | [
"call.remove",
"call.add"
] | 492,797 | 492,798 | u006880673 | python |
p02720 | #!/usr/bin/env python3
from heapq import *
a = [*range(1, 10)]
heapify(a)
i = 0
k = int(input())
c = 0
while True:
t = str(heappop(a))
i += 1
if i == k:
break
if t[-1] != "0":
heappush(a, int(t + str(int(t[-1]) - 1)))
heappush(a, int(t + t[-1]))
if t[0] != "9":
heappush(... | #!/usr/bin/env python3
from heapq import *
a = [*range(1, 10)]
heapify(a)
i = 0
k = int(input())
c = 0
while True:
t = str(heappop(a))
i += 1
if i == k:
break
if t[-1] != "0":
heappush(a, int(t + str(int(t[-1]) - 1)))
heappush(a, int(t + t[-1]))
if t[-1] != "9":
heappush... | [
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change",
"expression.operation.unary.add"
] | 492,812 | 492,813 | u094999522 | python |
p02720 | from collections import deque
k = int(input())
if k < 10:
print(k)
# exit()
q = deque()
lun = []
for i in range(1, 10):
q.append(i)
lun.append(i)
cnt = 9
while cnt < k:
x = q.popleft()
if x % 10 == 0:
nx = 10 * x
q.append(nx)
lun.append(nx)
nx = 10 * x + 1
... | from collections import deque
k = int(input())
if k < 10:
print(k)
exit()
q = deque()
lun = []
for i in range(1, 10):
q.append(i)
lun.append(i)
cnt = 9
while cnt < k:
x = q.popleft()
if x % 10 == 0:
nx = 10 * x
q.append(nx)
lun.append(nx)
nx = 10 * x + 1
... | [
"call.add"
] | 492,824 | 492,825 | u612975321 | python |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.