input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
from copy import copy
input = sys.stdin.readline
'''
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
S = input().strip()
for test in range(int(input())):
'''
inf = 100000000000000000 # 1e17
mod = 998244353
def two(x):
return "0" * (w - len(bin(x)[2:])) + bin(x)[2:]
h, w, maxx = list(map(int, input().split()))
A = []
for i in range(h):
A.append(input().strip())
# for binary in range(1<<(w-1),(1<<(w-1))+1):
ans = inf
for binary in range(1 << (w - 1)): # every binary
S = two(binary)
B = [-1]
for i in range(len(S)):
if S[i] == "1":
B.append(i)
B.append(len(S) - 1) # every horizontal cut, contain the head and the tail
# print(B)
SUM = [0] * (len(B))
isok = 1
cut_vertical = 0
cut_horizontal = len(B) - 2
for i in range(h):
PRE = copy(SUM) # previous total numbers between every cut
for j in range(1, len(B)): # every cut
for k in range(B[j - 1] + 1, B[j] + 1):
if A[i][k] == "1":
SUM[j] += 1
flag = 0
for j in range(1, len(B)):
if SUM[j] > maxx:
flag = 1
if flag:
for j in range(1, len(B)):
SUM[j] -= PRE[j]
cut_vertical += 1
for j in range(1, len(B)):
if SUM[j] > maxx:
isok = 0
if isok == 0:
break
if isok:
ans = min(ans, cut_vertical + cut_horizontal)
print(ans)
| import sys
from copy import copy
input = sys.stdin.readline
'''
n, m = map(int, input().split())
n = int(input())
A = list(map(int, input().split()))
S = input().strip()
for test in range(int(input())):
'''
inf = 100000000000000000 # 1e17
mod = 998244353
def two(x):
return "0" * (h - 1 - len(bin(x)[2:])) + bin(x)[2:]
h, w, k = list(map(int, input().split()))
S = []
ans = inf
for i in range(h):
S.append(input().strip())
for way_cut in range(1 << (h - 1)):
way_cut = two(way_cut)
number_cut_horizontal = way_cut.count("1")
number_cut_vertical = 0
CUT = [-1]
for i in range(len(way_cut)):
if way_cut[i] == '1':
CUT.append(i)
CUT.append(len(way_cut))
SUM = [0] * (w)
PRE = [0] * (w)
for col in range(w):
for i in range(1, len(CUT)):
for between in range(CUT[i - 1] + 1, CUT[i] + 1):
SUM[i] += 1 if S[between][col] == "1" else 0
isok = True
for i in range(1, len(CUT)):
if PRE[i] + SUM[i] > k:
isok = False
if not isok:
number_cut_vertical += 1
PRE = copy(SUM)
SUM = [0]*(w) # leave out
# recheck
for i in range(1, len(CUT)):
if PRE[i] > k:
number_cut_vertical = inf
break
else:
for i in range(1, len(CUT)):
PRE[i] += SUM[i]
SUM[i] = 0
ans = min(ans, number_cut_vertical + number_cut_horizontal)
print(ans)
| p02733 |
r=range
h,*s=open(0)
h,w,k=list(map(int,h.split()))
m=9e9
for i in r(1<<h-1):
t,v,l=[],-1,1
for j in r(h):z=i>>j&1;t+=[j+1]*z;l+=z
t+=h,
c=[0]*l
for i in r(w):
b=f=g=0;u=[]
for j in r(l):d,b=sum(s[j][i]>"0"for j in r(b,t[j])),t[j];u+=d,;g|=d>k;c[j]+=d;f|=c[j]>k
v+=f
if f:c=u
if g<1:m=min(m,v+l)
print(m) | r=range
h,*s=open(0)
m=9e9
h,w,k=list(map(int,h.split()))
for i in r(1<<h-1):
t=[j+1for j in r(h)if i>>j&1]+[h];l=len(t);v=-1;c=[0]*l
for i in r(w):
b=f=g=0;u=[]
for j in r(l):d,b=sum(s[j][i]>"0"for j in r(b,t[j])),t[j];u+=d,;g|=d>k;c[j]+=d;f|=c[j]>k
v+=f
if f:c=u
if g<1:m=min(m,v+l)
print(m) | p02733 |
r=range
h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
for i in r(512):
t=[j+1for j in r(h)if i>>j&1]+[h];l=len(t);v=1;c=[0]*l
for i in r(w):
b=f=g=0;u=[]
for j in r(l):d,b=sum(s[j][i]>"0"for j in r(b,t[j])),t[j];u+=d,;g|=d>k;c[j]+=d;f|=c[j]>k
v-=f
if f:c=u
if g<1:m+=l-v,
print((min(m))) | x,*s=open(0)
h,w,k,*m=list(map(int,x.split()))
for b in range(512):
r=t=j=0;d=[0]*h
while w-j:
i=c=0
while h-i:
d[c]+=s[i][j]>'0';x=d[c]>k
if(t<j)&x:r+=1;t=j;d=[0]*h;break
r+=h*w*x;c+=b>>i&1;i+=1
else:j+=1
m+=r+bin(b).count('1'),
print((min(m))) | p02733 |
h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=512
while b:
b-=1;r=t=j=0;d=[0]*h
while w-j:
i=c=0
while h-i:
d[c]+=s[i][j]>'0';f=d[c]>k
if(t<j)&f:r+=1;t=j;d=[0]*h;break
r+=h*w*f;c+=b>>i&1;i+=1
else:j+=1
m+=r+c,
print((min(m))) | h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=512
while b:
b-=1;r=t=j=-1;d=[0]*h
while~j+w:
j+=1;i=c=0
while h-i:
d[c]+=s[i][j]>'0';f=t<j
if d[c]>k:d=[0]*h;r+=1-h*w*~-f;t=j;j-=f;break
c+=b>>i&1;i+=1
m+=r-~c,
print((min(m))) | p02733 |
h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=w
while b:
b-=1;r=t=j=-1;d=[0]*h
while~j+w:
j+=1;i=c=0
while h-i:
d[c]+=s[i][j]>'0';f=t<j
if d[c]>k:d=[0]*h;r+=1-h*w*~-f;t=j;j-=f;break
c+=b>>i&1;i+=1
m+=r-~c,
print((min(m))) | h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=w
while b:
b-=1;r=t=j=0;d=[0]*h
while w-j:
i=c=0;j+=1
while h-i:
d[c]+=s[i][~j]>'0'
if d[c]>k:d=[0]*h;f=t<j;r-=h*w*~-f-1;t=j;j-=f;break
c+=b>>i&1;i+=1
m+=r+c,
print((min(m))) | p02733 |
h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=w
while b:
b-=1;r=t=j=0;d=[0]*h
while w-j:
i=c=0;j+=1
while h-i:
d[c]+=s[i][~j]>'0';c+=b>>i&1;i+=1
if max(d)>k:d=[0]*h;r+=1;j-=1;i=h
m+=r+c,
print((min(m))) | h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=w
while b:
b-=1;r=t=j=0;d=[0]*h
while w-j:
i=c=0;j+=1
while h-i:
d[c]+=s[i][~j]>'0';c+=b>>i&1;i+=1
if max(d)>k:d=[0]*h;r+=1;t,j=j,j-(t<j);i=h
m+=r+c,
print((min(m))) | p02733 |
h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=512
while b:
b-=1;r=t=j=0;d=[0]*h
while w-j:
i=c=0;j+=1
while h-i:
d[c]+=s[i][~j]>'0';c+=b>>i&1;i+=1
if max(d)>k:d=[0]*h;r+=1;j-=t<j;t=j;i=h
m+=r+c,
print((min(m))) | h,*s=open(0)
h,w,k,*m=list(map(int,h.split()))
b=w
while b:
b-=1;r=0;t=j=w;d=[0]*h
while j:
i=c=0;j-=1
while h-i:
d[c]+=s[i][j]>'0';c+=b>>i&1;i+=1
if max(d)>k:d=[0]*h;r+=1;t,j=j,j+(t>j);i=h
m+=r+c,
print((min(m))) | p02733 |
def main():
import sys
input=sys.stdin.readline
h,w,k=list(map(int,input().split()))
S=[]
for _ in range(h):
s=list(map(int,list(input().rstrip())))
S.append(s)
ans=10**5
for i in range(2**(h-1)):
l=[0]
for j in range(h-1):
if i&1<<j:
l.append(l[-1]+1)
else:
l.append(l[-1])
ans_=l[-1]
ll=[0]*h
j=0
while j<w:
for p in range(h):
ll[l[p]]+=S[p][j]
if max(ll)>k:
ans_+=1
ll=[0]*h
else:
j+=1
ans=min(ans,ans_)
print(ans)
if __name__ == '__main__':
main() | def main():
import sys
input=sys.stdin.readline
h,w,k=list(map(int,input().split()))
S=[]
for _ in range(h):
s=list(map(int,list(input().rstrip())))
S.append(s)
ans=10**5
for i in range(2**(h-1)):
l=[0]
for j in range(h-1):
if i&1<<j:
l.append(l[-1]+1)
else:
l.append(l[-1])
ans_=l[-1]
ll=[0]*h
j=0
flag=0
while j<w:
for p in range(h):
ll[l[p]]+=S[p][j]
if max(ll)>k and flag==0:
flag=1
ans_+=1
ll=[0]*h
elif max(ll)>k and flag==1:
ans_=10**5
break
else:
j+=1
flag=0
ans=min(ans,ans_)
print(ans)
if __name__ == '__main__':
main() | p02733 |
import sys
from collections import deque
input = sys.stdin.readline
def main():
H, W, K = list(map(int, input().split()))
grid = [list(map(int, list(input().strip()))) for _ in range(H)]
white_count = sum(sum(x) for x in grid)
# 折れる箇所全部で折った数が最大値
ans = (H - 1) * (W - 1)
# 横線で割るパターン全てについて縦線での降り方を考える
for i in range(2 ** (H - 1)):
# 横方向に割った後のチョコの状態を生成
snap = 0
board = [[grid[0]]]
for j in range(H-1):
if ((i >> j) & 1):
board.append([grid[j + 1]])
snap += 1
else:
board[-1].append(grid[j + 1])
w_count_board = [[] for _ in board]
for x in range(W):
# 縦方向に折るかのフラグ
snap_flag = False
for y, hori in enumerate(board):
# その位置までおらなかった場合のチョコの個数を生成
w_choco = sum(row[x] for row in hori)
w_count_board[y].append(w_choco)
# 上限超えたらおる
if sum(w_count_board[y]) > K:
snap_flag = True
# フラグがたってたら、x -1 まではおるので無視
# チョコの個数カウントをx始まりで更新
if snap_flag:
w_count_board = [[wcb[-1]] for wcb in w_count_board]
snap += 1
ans = min(ans, snap)
print(ans)
if __name__ == "__main__":
main()
| # 足し合わせしすぎてるのでTLE
import sys
input = sys.stdin.readline
def main():
H, W, K = list(map(int, input().split()))
grid = [list(map(int, list(input().strip()))) for _ in range(H)]
# 折れる箇所全部で折った数が最大値
ans = (H - 1) * (W - 1)
# 横線で割るパターン全てについて縦線での降り方を考える
for i in range(2 ** (H - 1)):
snap = 0
hori_grid = [grid[0]]
for j in range(H - 1):
if ((i >> j) & 1):
hori_grid.append(grid[j+1])
snap += 1
else:
hori_grid[-1] = [a + b for a,b in zip(hori_grid[-1], grid[j+1])]
wc_count = [hori_grid[y][0] for y in range(snap + 1)]
# 最初の列で超えてる場合はスキップ
if max(wc_count) > K:
continue
for x in range(1, W):
now_wc_count = [hori_grid[y][x] for y in range(len(wc_count))]
next_wc_count = [a+b for a,b in zip(wc_count, now_wc_count)]
if max(next_wc_count) > K:
snap += 1
wc_count = now_wc_count
else:
wc_count = next_wc_count
ans = min(ans, snap)
print(ans)
if __name__ == "__main__":
main()
| p02733 |
def main():
import sys
inf = 100100100
ans = inf
H, W, K = list(map(int, input().split()))
S = [0]*H
for i in range(H):
S[i] = [int(x) for x in sys.stdin.readline().strip()]
for i in range(2**(H-1)):
group = [0]
g = 0
for j in range(H-1):
if (i >> j) & 1:
g += 1
group.append(g)
g += 1
c = [[0 for _ in range(W)] for __ in range(g)]
for j in range(H):
for k in range(W):
c[group[j]][k] += S[j][k]
num = g-1
now = [0]*g
def large(now):
for n in now:
if n > K:
return True
else:
return False
def v_vec(twodlis, k):
ans = []
for lis in twodlis:
ans.append(lis[k])
return ans
for k in range(W):
for n in range(len(now)):
now[n] = now[n] + v_vec(c,k)[n]
if large(now):
now = v_vec(c,k)
num += 1
if large(now):
num = inf
break
ans = min(ans, num)
print(ans)
if __name__ == "__main__":
main()
| import sys
inf = 100100100
ans = inf
H, W, K = list(map(int, input().split()))
S = [0]*H
for i in range(H):
S[i] = [int(x) for x in sys.stdin.readline().strip()]
for i in range(2**(H-1)):
group = [0]
g = 0
for j in range(H-1):
if (i >> j) & 1:
g += 1
group.append(g)
g += 1
c = [[0 for _ in range(W)] for __ in range(g)]
for j in range(H):
for k in range(W):
c[group[j]][k] += S[j][k]
num = g-1
now = [0]*g
def large(now):
for n in now:
if n > K:
return True
else:
return False
def v_vec(twodlis, k):
ans = []
for lis in twodlis:
ans.append(lis[k])
return ans
for k in range(W):
for n in range(len(now)):
now[n] = now[n] + v_vec(c,k)[n]
if large(now):
now = v_vec(c,k)
num += 1
if large(now):
num = inf
break
ans = min(ans, num)
print(ans) | p02733 |
n, k = list(map(int, input().split()))
a = []
if n % k == 0:
print((0))
else :
while n > 0 :
n -= k
a.append(n)
if len(a) == 1 :
if a[-1] * -1 > n + k :
print((n + k))
else :
print((a[-1] * -1))
else :
if (a[-1]) * -1 > a[-2] :
print((a[-2]))
else :
print(((a[-1]) * -1)) | n, k = list(map(int, input().split()))
a = []
if n % k == 0:
print((0))
elif n // k == 0 :
if -(n - k) > n :
print(n)
else :
print((-(n - k)))
else :
if n % k > (n % k) - k :
print((-((n % k) - k)))
else :
print((n % k)) | p02719 |
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N, K = list(map(int, readline().split()))
answer = N % K
while True:
new = abs(answer - K)
if new > answer:
break
answer = new
print(answer) | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
N, K = list(map(int, readline().split()))
answer = min(N % K, abs(N % K - K))
print(answer) | p02719 |
n,k = list(map(int,input().split()))
x = n
if k==1:
print((0))
else:
while x > abs(x-k):
x = abs(x-k)
print(x) | n,k = list(map(int,input().split()))
x = n
if n>=k:
x = n%k
if x >abs(x-k):
print((abs(x-k)))
else:
print(x) | p02719 |
n, k = list(map(int, input().split()))
cou = 0
i = 0
flag = 0
if k == 1:
n = 0
elif k == 0:
n = n
else:
while flag < 1:
if n < abs(n-k):
flag = 1
else:
n = abs(n-k)
i += 1
print(n) | n, k = list(map(int, input().split()))
q = n // k
mod = n % k
ans_mod = k-mod
if mod<ans_mod:
print(mod)
else:
print(ans_mod) | p02719 |
n, K = [int(x) for x in input().split()]
res = 0
pn = n
for i in range(10**18):
if n % K == 0:
res = 0
break
if abs(pn - K) > pn:
res = pn
break
else:
pn = n
n = abs(pn - K)
print (res) | n, K = [int(x) for x in input().split()]
res = 0
if n % K > abs((n % K) - K):
res = abs((n % K) - K)
else:
res = n % K
print (res) | p02719 |
N, K = list(map(int, input().split()))
r=0
if(N<K):
if(abs(N-K)<N):
r=abs(N-K)
else:
r=N
elif(K==1):
r=0
elif(K<N):
while(0<N):
r=abs(N-K)
N=N-K
print(r) | N, K = list(map(int, input().split()))
r=0
if(N<K):
if(abs(N-K)<N):
r=abs(N-K)
else:
r=N
elif(K==1):
r=0
elif(K<N):
a=N//K
N=N-K*a
while(0<N):
r=abs(N-K)
N=N-K
print(r) | p02719 |
n, k = list(map(int,input().split()))
n_min = 10**18
n_min_sb = 10**19
if k == 1:
n_min = 0
else:
while n_min != n_min_sb:
n = abs(n-k)
if n_min > n:
n_min_sb = n_min
n_min = n
if n_min < n:
n_min_sb = n_min
print(n_min) | n, k = list(map(int, input().split()))
print((min(n%k, k-n%k))) | p02719 |
N, K = list(map(int, input().split()))
while True:
if K == 1:
N=0
break
n = abs(N-K)
if n >= N:
break
else:
N = n
print(N)
| N, K = list(map(int, input().split()))
n = N % K
if n > abs(n-K):
n = abs(n-K)
print(n)
| p02719 |
N, K = list(map(int, input().split()))
import math
if N > K:
s = N // K
print((min(abs(N - s * K), abs(N - (s + 1) * K))))
elif N == K:
print((0))
else:
print((min(N, abs(N - K)))) | N, K = list(map(int, input().split()))
s = N // K
ans = min(abs(N - s * K), abs(N - (s + 1) * K))
print(ans) | p02719 |
N,K = list(map(int, input().split()))
if N > K and K == 1:
print((0))
exit(0)
while N > abs(N - K):
N = abs(N - K)
print(N) | N,K = list(map(int, input().split()))
ans = 0
if N < abs(N - K):
ans = N
elif N % K == 0:
ans = 0
else:
ans = abs(N % K - K)
print(ans) | p02719 |
import sys
input = sys.stdin.readline
from collections import *
N, K = list(map(int, input().split()))
if N<=K:
print((min(N, K-N)))
else:
M = N-(N-1)//K*K
print((min(M, K-M))) | N, K = list(map(int, input().split()))
t = N%K
print((min(t, K-t))) | p02719 |
N, K = list(map(int, input().split()))
M = abs(N - K)
mini = M + 1
if (N%K == 0):
print((0))
else:
while (M < mini):
mini = min(mini, M)
M = abs(M - K)
print(mini)
| N, K = list(map(int, input().split()))
M = abs(N - K)
mini = M + 1
if (not N < K):
if (N%K == 0):
print((0))
else:
M = (N % K)
while (M < mini):
mini = min(mini, M)
M = abs(M - K)
print(mini)
else:
while (M < mini):
mini = min(mini, M)
M = abs(M - K)
print(mini)
| p02719 |
import sys
n, k = list(map(int, input().split()))
if k == 1:
print((0))
sys.exit()
# x = n
while True:
min_n = n
n = abs(n-k)
if min_n >= n:
min_n = n
else:
break
print(min_n)
| import sys
import math
n, k = list(map(int, input().split()))
# n_start = math.floor(n / k)
# # print(n_start)
# n = n - n_start*k
# # print(n)
n = n % k
while True:
min_n = n
n = abs(n-k)
# print("n, k =", n, k)
if min_n > n:
min_n = n
else:
break
print(min_n)
| p02719 |
N, K = list(map(int, input().split()))
ans = 0
judge = True
while judge == True:
if K == 1:
N = 0
break
ans = N - K
N = abs(ans)
ans = N - K
mem = abs(ans)
if N > mem:
pass
else:
judge = False
print(N) | N, K = list(map(int, input().split()))
a = abs(N%K)
print((min(a, abs(a-K)))) | p02719 |
n, k = [int(i) for i in input().split()]
def a(x):
return abs(x - k)
if n > k:
tmp = k
while not (n - tmp) % k == 0:
tmp -= 1
n = tmp
while True:
tmp = n
n = a(n)
if tmp < n:
print(tmp)
break
| n, k = [int(i) for i in input().split()]
print((min(n % k, k - n % k))) | p02719 |
n, k = list(map(int,input().split()))
while(True):
nk_abs = abs(n - k)
if n <= k and n <= nk_abs:
break
if k == 1:
n = 0
break
n = nk_abs
print(n) | n, k = list(map(int, input().split()))
print((min(n % k, k - n % k))) | p02719 |
N, K = list(map(int, input().split()))
answer = 10**18+1
formar = 10*18+1
c_v = N
if N % K == 0:
print((0))
else:
N = N//K
while True:
if answer > c_v:
answer = c_v
n_v = abs(c_v - K)
if formar == n_v:
break
formar = c_v
c_v = n_v
print(answer)
| N, K = list(map(int, input().split()))
if N % K == 0:
print((0))
else:
N = N % K
print((min([N, abs(N-K)])))
| p02719 |
n,k=list(map(int,input().split()))
a=[]
if k==1:
print((0))
else:
while True:
n=abs(n-k)
a.append(n)
if a[0]==abs(n-k):
break
elif abs(n-k)==0:
a.append(0)
break
print((min(a))) | n,k=list(map(int,input().split()))
if k==1:
print((0))
else:
print((min(n%k,abs(n%k-k)))) | p02719 |
N, K = list(map(int, input().split()))
res = [N]
if N % K == 0:
print((0))
else:
while True:
M = abs(N - K)
if M in res:
break
elif M not in res:
N = M
res.append(N)
print((min(res))) | N, K = list(map(int, input().split()))
cand1 = N % K
cand2 = K - (N % K)
print((min(cand1, cand2))) | p02719 |
N, K = list(map(int,input().split()))
def DIF(N):
global K
return abs(N-K)
if N < DIF(N):
print(N)
else:
if N % K == 0:
print((0))
else:
while N >= DIF(N):
N = DIF(N)
print(N) | N, K = list(map(int,input().split()))
print((min(N%K,K-N%K)))
'''
def DIF(N):
global K
return abs(N-K)
if N < DIF(N):
print(N)
else:
if N % K == 0:
print(0)
else:
while N >= DIF(N):
N = DIF(N)
print(N)
''' | p02719 |
n,k=list(map(int,input().split()))
ans=n
a=[]
if k==1:
print((0))
elif abs(n-k) > n:
print(n)
else:
while len(a)==len(set(a)):
n=abs(n-k)
a.append(n)
ans=min(ans,n)
print(ans) | n,k=list(map(int,input().split()))
a=n%k
ans=min(a,k-a)
print(ans) | p02719 |
import math
N,K= list(map(int,input().split()))
Num = 10*18
while Num > 0:
if N % K ==0:
Num = 0
break
if Num > abs((N%K)-K):
Num = abs((N%K)-K)
N = Num
if N < abs((N%K)-K):
break
print(Num)
| import math
N,K= list(map(int,input().split()))
a = int(N/K)
a1 = a*K
a2 = (a+1)*K
if N % K ==0:
Num = 0
else:
if abs(N%K) < abs((N%K)-K) :
Num = abs(N%K)
else:
Num = abs((N%K)-K)
print(Num) | p02719 |
import sys
n,k=list(map(int,input().split()))
be=n
if n%k==0:
print((0))
else:
while True:
if abs(n-k)<=be:
be=abs(n-k)
else:
print(be)
sys.exit()
n=abs(n-k) | import math
n,k=list(map(int,input().split()))
be=n%k
af=abs(k-be)
print((be if be<=af else af)) | p02719 |
def solve():
N, M = list(map(int, input().split()))
if M == 1:
return 0
n = N
c = 0
while True:
n = n-M
c = (abs(n) - M)
if c <= 0:
break
return min(abs(n), abs(c))
print((solve())) | def solve():
N, M = list(map(int, input().split()))
if N % M == 0:
return 0
a = N % M
return min(a, abs(a-M))
print((solve())) | p02719 |
def MI():return list(map(int,input().split()))
def LI():return list(MI())
N,K=MI()
ans=N%K
ans2=(-N)%K
print((min(ans,ans2))) | n,k=list(map(int,input().split()))
print((min(n%k,(-n)%k))) | p02719 |
N, K = list(map(int, input().split()))
x = N
x_b = 0
if K == 1:
x = 0
else:
while True:
x_b = x
x = abs(x-K)
if abs(x-K) == x_b:
break
print((min(x_b,x)))
| N, K = list(map(int, input().split()))
a = (N // K) + 1
ans1 = -(N-K*a)
ans2 = N - (K*(N//K))
print((min(ans1,ans2))) | p02719 |
n,k=list(map(int,input().split()))
n=int(n)
k=int(k)
n = n % k
minimam = k
for i in range(k):
if n < minimam:
minimam = n
n = abs(n-k)
print(minimam) | n,k=list(map(int,input().split()))
n=int(n)
k=int(k)
n = n % k
minimam = n
record=[]
for i in range(k):
n=abs(n-k)
if n < minimam:
minimam = n
record.append(n)
if n in record:
break
print(minimam) | p02719 |
def min(a, b):
if a >= b:
res = a - b
elif a < b:
res = b - a
return res
n,k = list(map(int, input().split()))
if n%k == 0:
print((0))
quit()
min_num = float('inf')
res_list = []
while(1):
res = min(n, k)
if res < min_num:
min_num = res
if res == 0:
break
if res in res_list:
break
n = res
res_list.append(res)
print(min_num)
| def min(a, b):
if a >= b:
res = a - b
elif a < b:
res = b - a
return res
n,k = list(map(int, input().split()))
if n%k == 0:
print((0))
quit()
else:
n = n%k
min_num = float('inf')
res_list = []
while(1):
res = min(n, k)
if res < min_num:
min_num = res
if res == 0:
break
if res in res_list:
break
n = res
res_list.append(res)
print(min_num)
| p02719 |
N, K = list(map(int,input().split()))
while True:
if N%K == 0:
print((0))
break
if abs(N-K) < N:
N = abs(N-K)
else:
print(N)
break | N, K = list(map(int,input().split()))
while True:
if N%K == 0:
print((0))
break
else:
N=N%K
N = min(N,abs(N-K))
print(N)
break | p02719 |
n, k = list(map(int, input().split()))
def solve():
global n, k
n = n - (k * (n // k))
pre = n
while True:
n = min(n, abs(n-k))
if n == pre:
break
pre = n
return n
print((solve())) | n, k = list(map(int, input().split()))
n = n % k
print((min(abs(n - k), n))) | p02719 |
N,K=list(map(int,input().split()))
N=N%K
while abs(N-K)<N:
N=abs(N-K)
print(N) | N,K=list(map(int,input().split()))
N=N%K
print((min(N,abs(N-K)))) | p02719 |
n,k = list(map(int, input().split()))
a = [n]
i = 0
if n%k == 0:
print((0))
else:
while i >= 0:
n = abs(n-k)
a.append(n)
i += 1
if a[i] > a[i-1]:
print((min(a)))
break | n,k = list(map(int, input().split()))
a,b = divmod(n,k)
print((min(b,k-b))) | p02719 |
n,k = list(map(int,input().split()))
if k==1 or n%k==0:
print((0))
exit()
while n > abs(n-k):
n = abs(n-k)
print(n) | n,k = list(map(int,input().split()))
if n%k==0:
print((0))
else:
ans_a = n%k
ans_b = abs(ans_a-k)
print((min(ans_a,ans_b))) | p02719 |
N, K = list(map(int, input().split()))
# if N == K:
# print(0)
# exit(0)
# elif N < K:
# print(N)
# exit(0)
ans = []
before = abs(N - K)
N = N % K
for i in range(10000):
ze = abs(N - K)
ans.append(ze)
before = ze
N = ze
print((min(ans)))
| N, K = list(map(int, input().split()))
N = N % K
ans1 = abs(N - K)
ans2 = abs(ans1-K)
print((min(ans1, ans2)))
| p02719 |
N, K = list(map(int, input().split()))
"""
while N > K:
N = abs(N - K)
#print(N)
print(min(N, abs(N-K)))
"""
"""
m = -(-N//K)
print(abs(N - m*K))
"""
print((min(N%K, abs(N%K - K)))) | N, K = list(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)))
""" | p02719 |
N,K = list(map(int,input().split()))
if N%K==0:
print((0))
elif K%N==0:
print(N)
else:
while abs(N-K) < N:
N = abs(N-K)
print(N) | N,K = list(map(int,input().split()))
if N>=K:
N = N%K
while abs(N-K) < N:
N = abs(N-K)
print(N)
else:
if K >= 2*N:
print(N)
else:
N = K%N
print(N) | p02719 |
def getInput():
return [int(i) for i in input().rstrip().split(' ')]
def swap(x, K):
return abs(x-K)
N, K = getInput()
x = N
mins = x
while(mins > 0):
if K == 1:
mins = 0
x = swap(x, K)
if x < mins:
mins = x
else:
break
print(mins) | def getInput():
return [int(i) for i in input().rstrip().split(' ')]
N, K = getInput()
t = N % K
print((min(t, K -t))) | p02719 |
#n=int(input())
n,k=list(map(int,input().split()))
#l=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
ans=0
import fractions
newval=n%k
if n>=k:
ans=min(n%k,abs(k-n%k))
else:
ans=min(k-n,n)
print(ans) | #k=int(input())
n,k=list(map(int,input().split()))
#hl=list(map(int,input().split()))
#l=[list(map(int,input().split())) for i in range(n)]
t=n%k
print((min(t,k-t)))
| p02719 |
import sys
N, K = list(map(int, input().split()))
pre = N
while True:
if N % K == 0 and N // K > 1:
print((0))
sys.exit()
N = abs(N-K)
if pre <= N:
print(pre)
sys.exit()
else:
pre = N | import sys
N, K = list(map(int, input().split()))
pre = N
while True:
if N % K == 0 and N // K >= 1:
print((0))
sys.exit()
if N > K:
N = N % K
else:
N = abs(N-K)
if pre <= N:
print(pre)
sys.exit()
else:
pre = N | p02719 |
n, k = list(map(int, input().split()))
tmp = n % k
if n >= k:
ans = min(tmp, k - tmp)
else:
ans = min(n, k - n)
print(ans) | n, k = list(map(int, input().split()))
tmp = n % k
ans = min(tmp, k - tmp)
print(ans) | p02719 |
nums = list(map(int, input().split()))
n = nums[0]
k = nums[1]
def absolute(n,k):
return abs(n-k)
x = absolute(n, k)
if n % k == 0:
print((0))
elif n < x:
print(n)
else:
while absolute(x, k) < x:
x = absolute(x, k)
print(x)
| nums = list(map(int, input().split()))
n = nums[0]
k = nums[1]
def absolute(n,k):
return abs(n-k)
x = absolute(n, k)
if n % k == 0:
print((0))
elif n < x:
print(n)
else:
while absolute(x, k) < x:
x = x % k
x = absolute(x, k)
print(x)
| p02719 |
n,k=list(map(int,input().split()))
if n>k:
n=n-n//k*k
ans=10**18+10
for i in range(10000):
ans=min(ans,n)
n=abs(n-k)
print(ans) | n,k=list(map(int,input().split()))
print((min(n%k,k-n%k))) | p02719 |
n,k =list(map(int,input().split()))
x1,x2,cnt =n,0,0
if n%k==0:
print((0))
else:
while True:
x2 = abs(x1-k)
if min(x1,x2) ==x1:
print(x1)
break
x1=x2 | n,k =list(map(int,input().split()))
if n%k==0:
print((0))
else:
print((min(n%k,abs((n%k)-k)))) | p02719 |
n,k=list(map(int,input().split()))
ans=float('inf')
if k == 1:
print((0))
exit()
elif n < k :
print((min(n,k-n)))
else:
for i in range(n):
n=abs(n-k)
ans=min(ans,n)
print(ans) | n,k=list(map(int,input().split()))
print((min(n%k,k-n%k))) | p02719 |
N,K=list(map(int,input().split()))
while N>100000000000000000*K:
N=N-100000000000000000*K
while N>100000000000000*K:
N=N-100000000000000*K
while N>1000000000000*K:
N=N-1000000000000*K
while N>10000000000*K:
N=N-10000000000*K
while N>100000000*K:
N=N-100000000*K
while N>1000000*K:
N=N-100000*K
while N>1000*K:
N=N-1000*K
while N>100*K:
N=N-100*K
while N>10*K:
N=N-10*K
while N>K:
N=N-K
N2=N-K
if N2<0:
N2=-N2
if N<N2:
print(N)
else :
print(N2)
| N,K=list(map(int,input().split()))
N=N%K
N2=N-K
if N2<0:
N2=-N2
if N<N2:
print(N)
else :
print(N2) | p02719 |
def main():
n, k = list(map(int, input().split()))
if n - k > k:
n_k = (n-k) // k
minv = n - k * n_k
else:
minv = n
def min_x(x):
minv = x
for _ in range(2):
if abs(minv - k) < abs(minv):
minv = abs(minv - k)
else:
print(minv)
exit()
print(minv)
min_x(minv)
if __name__ == '__main__':
main() | n, k = list(map(int, input().split()))
mod = abs(n-k) % k
print((min(mod, k-mod))) | p02719 |
n,k=list(map(int, input().split()))
a=n//k
print((min(abs(n-k*a), abs(n-k*(a+1))))) | n,k=list(map(int,input().split()))
print((min(n%k, k-n%k))) | p02719 |
n, k = list(map(int, input().split()))
r = []
if n % k == 0:
print((0))
exit()
while True:
n = abs(n - k)
r.append(n)
if r.count(n) >= 2:
break
print((min(r)))
| n, k = list(map(int, input().split()))
r = []
n = n % k
if n == 0:
print((0))
exit()
while True:
n = abs(n - k)
r.append(n)
if r.count(n) >= 2:
break
print((min(r)))
| p02719 |
n,k = list(map(int,input().split()))
if k==1 :
ln=0
elif k==0 :
ln=n
else:
while 1:
ln = n
n = abs(n-k)
if ln<=n:
break
print(ln) | n,k = list(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) | p02719 |
import sys
n ,k = list(map(int, input().split()))
if n == k or k == 1:
print((0))
sys.exit()
while True:
b = abs(n-k)
if b == 0:
print((0))
sys.exit()
elif b == 1:
print((1))
sys.exit()
elif n < b:
print(n)
sys.exit()
n = b | import sys
n ,k = list(map(int, input().split()))
if n == k or k == 1:
print((0))
sys.exit()
else:
n %= k
print((min(n, abs(n-k))))
| p02719 |
n,k = list(map(int, input().split()))
if n % k == 0:
print((0))
exit()
min = 10**18
while True:
n = abs(n-k)
if min > n:
min = n
else:
break
print(min)
| n,k = list(map(int, input().split()))
n = n % k
a = abs(n-k)
if n <= a:
print(n)
else:
print(a) | p02719 |
N,K=list(map(int,input().split()))
if N==0 or K==1:
print((0))
else:
for i in range(10**18):
if N>abs(N-K):
N=abs(N-K)
else:
print(N)
break | N,K=list(map(int,input().split()))
if N==0 or K==1:
print((0))
else:
a=N//K
N=N-a*K
for i in range(10**18):
if N>abs(N-K):
N=abs(N-K)
else:
print(N)
break | p02719 |
n, k = list(map(int, input().split()))
Min = n
while True:
if k == 1:
print((0))
exit()
n = abs(n-k)
if Min == n:
break
if Min > n:
Min = n
print(Min)
| n, k = list(map(int, input().split()))
r = n%k
print((min(r, k-r))) | p02719 |
def abs_result(x,y):
tmp = abs(x-y)
return tmp
def main():
line = list(map(int,input().split()))
n,k = line[0],line[1]
# nを、nとkの差の絶対値で置き換える
if n == 0 or k == 1:
print((0))
return
com = 2
for i in range(0,10**18):
ans = abs_result(n,k)
if ans == 0:
print((0))
return
elif ans == 1:
print((1))
return
if ans <= com:
print(ans)
return
n = ans
main() | def main():
n,k = list(map(int,input().split()))
t = n % k
x = k - t
if t < x:
print(t)
else:
print(x)
main() | p02719 |
def main():
N, K = list(map(int,input().split()))
sett = set()
ans = float('inf')
if N%K==0:
print((0))
return
while N not in sett:
sett.add(N)
N = abs(N-K)
ans = min(ans,N)
print(ans)
return
main() | def main():
N, K = list(map(int,input().split()))
print((min(N%K, K-N%K)))
return
main() | p02719 |
n, k = list(map(int, input().split()))
while True:
if not n%k:
n = 0
break
num = n
n = n-k
if n < 0:
n = min(abs(n), num)
break
print(n) | n, k = list(map(int, input().split()))
a = n%k
num = min(a, abs(a-k))
print(num)
| p02719 |
N, K = list(map(int, input().split()))
while True:
if K == 1:
answer = 0
break
if N <= abs(N - K):
answer = N
break
else:
N = abs(N - K)
print(answer)
| N, K = list(map(int, input().split()))
if N % K == 0:
answer = 0
else:
if abs(N % K - K) >= N % K:
answer = N % K
else:
answer = abs(N % K - K)
print(answer)
| p02719 |
N, K = list(map(int, input().split(' ')))
def absdiff(x, K):
return abs(x - K)
def culc(N, K):
if K == 1:
print((0))
return
if N*2 == K:
print(N)
return
if N%K == 0:
print((0))
return
x = N
min = x
while min >= x:
#print(min, x)
min = x
x = absdiff(x, K)
if min == 1:
break
print(min)
return
culc(N, K)
| N, K = list(map(int, input().split(' ')))
def absdiff(x, K):
return abs(x - K)
def culc(N, K):
if K == 1:
print((0))
return
if N*2 == K:
print(N)
return
if N%K == 0:
print((0))
return
x = N % K
min = x
while min >= x:
#print(min, x)
min = x
x = absdiff(x, K)
if min == 1:
break
print(min)
return
culc(N, K)
| p02719 |
n,k=list(map(int,input().split()))
if k==1 or n%k==0:
ans=0
else:
if n/2<k:
x=abs(n-k)
y=abs(x-k)
ans=min(n,min(x,y))
else:
while 1:
x=abs(n-k)
y=abs(x-k)
n=min(n,min(x,y))
if n<k:
x=abs(n-k)
y=abs(x-k)
ans=min(n,min(x,y))
break
print(ans)
| n,k=list(map(int,input().split()))
if k==1 or n%k==0:
ans=0
else:
if n/2<k:
x=abs(n-k)
y=abs(x-k)
ans=min(n,min(x,y))
else:
x=n%k
y=abs(x-k)
ans=min(x,y)
print(ans)
| p02719 |
N, K = list(map(int, input().split()))
N = N % K
if (N == 0):
print(N)
elif (N == K):
print((0))
elif (K == 1):
print((0))
else:
while (N >= 0):
if (N > abs(N - K)):
N = abs(N - K)
else:
print(N)
break | N, K = list(map(int, input().split()))
N = N % K
if (N > abs(N - K)):
N = abs(N - K)
print(N) | p02719 |
n, k = list(map(int, input().split()))
print((min(n%k, abs(n%k - k)))) | n, k = list(map(int, input().split()))
print((min(n%k, k - n%k))) | p02719 |
N, K = list(map(int, input().split()))
result = N
if N > K:
result = min(result, N % K)
for i in range(1000):
result = min(result, abs(result - K))
print(result)
| N, K = list(map(int, input().split()))
t = N % K
print((min(t, K - t)))
| p02719 |
def resolve():
N, K = list(map(int, input().split()))
if (K == 1):
print((0))
return
if N % K == 0:
print((0))
return
x = N
memo = [N]
while True:
x = min(abs(x - K), x)
if x in memo:
print((min(memo)))
return
memo.append(x)
return
resolve()
| def resolve():
N, K = list(map(int, input().split()))
print((min(N % K, K - (N % K))))
return
resolve() | p02719 |
import sys
input = sys.stdin.readline
def binary_search_int(ok, ng, solve):
"""
:param ok: solve(x) = True を必ず満たす点
:param ng: solve(x) = False を必ず満たす点
"""
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if solve(mid):
ok = mid
else:
ng = mid
return ok, ng
##############################################################
def solve(x):
""" ある点 x を境にして True と False が二分されるような関数"""
return N - K*x >= 0
N, K = list(map(int, input().split()))
a, b = binary_search_int(0, 10**18, solve)
print((min(abs(N-a*K), abs(N-b*K)))) | import sys
input = sys.stdin.readline
def binary_search_int(ok, ng):
"""
:param ok: solve(x) = True を必ず満たす点
:param ng: solve(x) = False を必ず満たす点
"""
while abs(ok - ng) > 1:
mid = (ok + ng) // 2
if solve(mid):
ok = mid
else:
ng = mid
return ok, ng
##############################################################
def solve(x):
""" ある点 x を境にして True と False が二分されるような関数"""
return N - K*x >= 0
N, K = list(map(int, input().split()))
a, b = binary_search_int(0, 10**18)
print((min(abs(N-a*K), abs(N-b*K)))) | p02719 |
# Problem C - Replacing Integer
# input
N, K = list(map(int, input().split()))
# initialization
compare_1 = N % K
compare_2 = abs(compare_1 - K)
ans = min(compare_1, compare_2)
# output
print(ans)
| # Problem C - Replacing Integer
# input
N, K = list(map(int, input().split()))
# initialization
tmp_1 = N % K
tmp_2 = abs(tmp_1 - K)
ans = min(tmp_1, tmp_2)
# output
print(ans)
| p02719 |
N, K = list(map(int, input().split()))
ans = N
x = abs(N - K)
if N % K == 0:
print((0))
else:
while ans > x:
ans = x
x = abs(x - K)
else:
print(ans) | N, K = list(map(int, input().split()))
ans = N
a = ans // K
b = ans % K
if a > 0:
ans = N - K * a
a = ans // K
b = ans % K
if a == 0:
if ans > abs(ans - K):
print((abs(ans - K)))
else:
print(ans) | p02719 |
import sys
n,k = list(map(int, input().split()))
if n == 0 or k == 1:
print((0))
sys.exit()
while True:
ans = abs(n-k)
if ans >= n:
break
elif n > ans:
n = ans
print(n) | n, k = list(map(int, input().split()))
ans = min(n%k, k-(n%k))
print(ans) | p02719 |
N, K = map(int, input().split())
if N % K == 0:
print(0)
else:
while True:
if N // K == 0:
# print('N % K = ' + str(N % K) + ', abs(N - K) = ' + str(abs(N - K)))
print(N % K) if N % K < abs(N - K) else print(abs(N - K))
break;
else:
# print('N % K = ' + str(N % K) + ', abs(N - K) = ' + str(abs(N - K)))
N = abs(N - K * (N//K))
| N, K = map(int, input().split())
if N % K == 0:
print(0)
else:
while True:
if N // K == 0:
print(N % K) if N % K < abs(N - K) else print(abs(N - K))
break;
else:
N = abs(N - K * (N//K))
| p02719 |
N, K = list(map(int, input().split(' ')))
print((min(N % K, abs(N % K - K)))) | N, K = list(map(int, input().split(' ')))
print((min(N % K, abs((N % K) - K)))) | p02719 |
# -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
if K == 1:
N = 0
else:
while abs(N-K)<N:
N = abs(N-K)
print(N)
| # -*- coding: utf-8 -*-
N, K = list(map(int, input().split()))
if K == 1:
N = 0
else:
if N // K > 0:
i = N//K
N = N - (K * i)
while abs(N-K)<N:
N = abs(N-K)
print(N) | p02719 |
import math
N, K = list(map(int, input().split()))
var = N % K
if var == 0:
print((0))
elif var == K-1 or var == 1:
print((1))
else:
while N > K // 2:
N = abs(N-K*(N//K))
print(N) | import math
N, K = list(map(int, input().split()))
var = N % K
if var == 0:
print((0))
elif var == K-1 or var == 1:
print((1))
else:
while N >= math.ceil(K / 2):
N = abs(N-K*(N//K+1))
print(N) | p02719 |
N,K = list(map(int,input().split()))
print((min(N%K,abs(N%K-K)))) | N,K = list(map(int,input().split()))
ans = min(N%K, abs(N%K-K))
print(ans) | p02719 |
import sys
n, k = list(map(int, input().split()))
if n % k == 0:
print('0')
sys.exit(0)
n_list = [n]
while(True):
n = abs(n - k)
if n in n_list:
break
else:
n_list.append(n)
n_list.sort()
print((n_list[0])) | n, k = list(map(int, input().split()))
m = n // k
n = n - m * k
print((min(n, abs(n-k)))) | p02719 |
n, k = list(map(int, input().split()))
if n < k:
ans = min(abs(n-k), n)
else:
if n%k == 0:
ans = 0
else:
for i in range(-k,k+1):
if (i%k == n%k and i < 0):
nega = -i
elif (i%k == n%k and i >= 0):
posi = i
ans = (min(nega, posi))
print(ans) | n, k = list(map(int, input().split()))
a = n%k
b = abs(a-k)
print((min(n,a,b))) | p02719 |
n, k = list(map(int, input().split()))
a = n%k
b = abs(a-k)
print((min(n,a,b))) | n, k = list(map(int, input().split()))
a = n%k
b = abs(a-k)
print((min(a,b))) | p02719 |
N, K = list(map(int, input().split()))
ans = 10**10
while True:
temp = N % K
if temp < ans:
ans = temp
elif temp == ans:
break
ans = min(abs(ans-K), ans)
print(ans)
| # C
N, K = list(map(int, input().split()))
ans = 10**10
mod = N % K
ans = min(mod, abs(mod-K))
print(ans)
| p02719 |
x = list(map(int, input().split()))
n = x[0]
k = x[1]
y = n
while True:
temp_y = y
if temp_y % k == 0:
y = 0
break
y = abs(y - k)
if temp_y < y:
y = temp_y
break
else:
continue
print(y) | x = list(map(int, input().split()))
n = x[0]
k = x[1]
y = n % k
if y < abs(y - k):
print(y)
else:
print((abs(y - k))) | p02719 |
N, K = list(map(int, input().split()))
flag = True
min = N
if K == 1:
ans = 0
elif N % K == 0:
ans = 0
elif abs(N - K) > N:
ans = N
else:
while(flag):
if abs(min - K) < min:
min = abs(min - K)
else:
flag = False
ans = min
print(ans)
| N, K = list(map(int, input().split()))
flag = True
min = N
if K == 1:
ans = 0
elif N % K == 0:
ans = 0
elif abs(N - K) > N:
ans = N
else:
if (N % K) > (K / 2):
ans = abs((N % K) - K)
else:
ans = N % K
print(ans)
| p02719 |
N,K = list(map(int,input().split()))
if K!=1:
while True:
N=abs(N-K)
tmp=N
if abs(N-K)>tmp:
print(tmp)
exit(0)
else:
print((0)) | N,K = list(map(int,input().split()))
div =N//K
N=N-div*K
if K!=1:
while True:
N=abs(N-K)
tmp=N
if abs(N-K)>tmp:
print(tmp)
exit(0)
else:
print((0)) | p02719 |
def main():
N, K = list(map(int, input().split(' ')))
# out = min(float('inf'), N)
prev = N
isFinish = False
if N % K == 0:
print((0))
return
while not isFinish:
next = abs(prev - K)
if next >= prev:
isFinish = True
else:
prev = next
print(prev)
main() |
def main():
N, K = list(map(int, input().split(' ')))
# out = min(float('inf'), N)
prev = N % K
isFinish = False
if prev == 0:
print((0))
return
while not isFinish:
next = abs(prev - K)
if next >= prev:
isFinish = True
else:
prev = next
print(prev)
main() | p02719 |
n,k = list(map(int,input().split()))
if n == k:
print((0))
exit()
if n > k:
if n%k == 0:
print((0))
exit()
else:
m = n
while m > 0:
m -= k
if abs(m) < n%k:
print((-m))
exit()
else:
print((n%k))
exit()
if n < k:
if n > abs(n-k):
print((abs(n-k)))
exit()
else:
print(n)
exit() | n,k = list(map(int,input().split()))
if n == k:
print((0))
exit()
if n > k:
if n%k == 0:
print((0))
exit()
else:
if n%k > abs(n%k-k):
print((abs(n%k-k)))
else:
print((n%k))
if n < k:
if n > abs(n-k):
print((abs(n-k)))
exit()
else:
print(n)
exit() | p02719 |
n, k = list(map(int, input().split()))
now = n
if n % k == 0:
print((0))
exit()
while True:
n = abs(n - k)
if n >= now:
break
now = n
print(now) | n, k = list(map(int, input().split()))
now = abs((n % k) - k)
if now < n%k:
print(now)
else:
print((n%k)) | p02719 |
N, K = list(map(int, input().split()))
if N%K == 0:
print((0))
elif N<K and N<=K-N:
print(N)
elif N<K and N>K-N:
print((K-N))
elif N>K:
for i in range(18):
k = K*(10**(17-i))
while N>=k:
k=k+K*(10**(17-i))
k = k-K*(10**(17-i))
k = k+K
if k-N<N-(k-K):
print((k-N))
else:
print((N-(k-K)))
| N, K = list(map(int, input().split()))
if N%K == 0:
print((0))
elif N<K and N<=K-N:
print(N)
elif N<K and N>K-N:
print((K-N))
elif N>K:
if K-(N%K)>N%K:
print((N%K))
else:
print((K-(N%K)))
| p02719 |
import sys
N, K = list(map(int,input().split()))
ans = N % K
ans = min(ans, abs(K-ans))
print(ans) | N, K = list(map(int, input().split()))
print((min(N%K, K-N%K))) | p02719 |
import sys
n,k = [int(_) for _ in input().split()]
base = n
if n % k == 0 :
print("0")
sys.exit()
while base > abs(base - k):
base = abs(base - k)
print(base) | import sys
n,k = [int(_) for _ in input().split()]
amari = n % k
if amari == 0 :
print("0")
sys.exit()
base = amari
while base > abs(base - k):
base = abs(base - k)
print(base) | p02719 |
N, K = list(map(int, input().split()))
value = abs(N - K)
if K == 1:
print((0))
exit()
while True:
if abs(value - K) > abs(value):
break
value = abs(value - K)
print(value) | N, K = list(map(int, input().split()))
a = N // K
value = abs(N - a * K)
if K == 1:
print((0))
exit()
while True:
if abs(value - K) > abs(value):
break
value = abs(value - K)
print(value) | p02719 |
import sys
N, K = list(map(int, input().split()))
if K == 1:
print((0))
sys.exit()
while True:
x = abs(N - K)
if x > N:
break
N = min(x, N)
print(N) | N, K = list(map(int, input().split()))
t = N % K
N = min(t, K - t)
print(N) | p02719 |
n, k = list(map(int, input().split()))
a = abs(n - k)
tmp = a
if k == 1:
print((0))
elif a > n:
print(n)
else:
while n > tmp:
n = abs(n - k)
tmp = abs(n - k)
print(n) | n, k = list(map(int, input().split()))
a = n % k
b = k - a
print((min(a, b))) | p02719 |
n,k = list(map(int,input().split()))
judge = 0
if n%k==0:
judge = 1
print((0))
if judge == 0:
while n>= 0:
n -= k
if abs(n+k)<abs(n):
print((abs(n+k)))
else:
print((abs(n))) | n,k = list(map(int,input().split()))
n = n%k
if n<abs(n-k):
print(n)
else:
print((abs(n-k))) | p02719 |
import sys
n,k = list(map(int,input().split()))
x = k+(n%k)
x = n
min = sys.maxsize
while True:
if x%k == 0:
min = 0
break
x = abs(x-k)
if x == min :break
elif x < min : min = x
print(min)
| import sys
n,k = list(map(int,input().split()))
x = k+(n%k)
min = sys.maxsize
while True:
if x%k == 0:
min = 0
break
x = abs(x-k)
if x == min :break
elif x < min : min = x
print(min)
| p02719 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.