problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02584 | s602024972 | Accepted | import sys
read = sys.stdin.readline
import time
from heapq import heappush, heappop
import math
import itertools as it
def inp():
return int(input())
def inpl():
return list(map(int, input().split()))
start_time = time.perf_counter()
# ------------------------------
x, k, d = inpl()
t = abs(x) // d
if k <= t:
print(abs(x)-k*d)
sys.exit()
k -= t
if k % 2 == 1:
print(d - abs(x) % d)
else:
print(abs(x) % d)
# -----------------------------
end_time = time.perf_counter()
print('time:', end_time-start_time, file=sys.stderr)
|
p02584 | s157177000 | Accepted | X, K, D = map(int, input().split())
if abs(X) // D > K:
print(abs(X) - K * D)
exit()
mod = abs(X) % D
if (K - (abs(X) // D)) % 2 == 0:
print(mod)
else:
print(abs(mod - D))
|
p02584 | s182418241 | Accepted | X,K,D = map(int,input().split())
if X > 0:
if X // D >= K:
ans = X - D*K
else:
K -= X//D
X = X%D
if K%2 == 0:
ans = X
else:
ans = abs(X -D)
if X < 0:
if -1*X // D >= K:
ans = abs(X + D*K)
else:
K -= (-1*X)//D
X = (-1*X)%D
if K%2 == 0:
ans = X
else:
ans = abs(X -D)
if X == 0:
if K%2==0:
ans = 0
else:
ans = D
print(ans)
|
p02584 | s341670196 | Accepted | # cook your dish here
x,k,d=map(int,input().split())
l=0
r=k
while (l<r-1):
m=l+(r-l)//2
if(x-k*d+2*m*d>0): r=m
else: l=m
ans1=x-k*d+2*l*d;
ans2=x-k*d+2*r*d;
print(min(abs(ans1),abs(ans2))) |
p02584 | s655917483 | Accepted | x, k, d = map(int, input().split())
x = abs(x)
if x >= k * d:
print(x - k * d)
else:
cnt = x // d
if cnt % 2 == k % 2:
point = x - x // d * d
else:
point = x - (x // d + 1) * d
print(abs(point))
|
p02584 | s562116038 | Accepted | def main():
X,K,D=map(int,input().split())
zero_flag=0
if abs(X)>=K*D:
zero_flag=1
if zero_flag==0:
d=abs(X)%D
d_=abs(X)//D
if (K-d_)%2==1:
print(abs(D-d))
else:
print(abs(X)-abs(D*d_))
else:
print(abs(X)-K*D)
if __name__=="__main__":
main() |
p02584 | s737376588 | Accepted | x,k,d=map(int,input().split())
x=x if x>0 else -x
print(x-k*d if k<=x//d else (d-x%d if (k-x//d)%2 else x%d))
|
p02584 | s229040059 | Accepted | #!python3
import sys
iim = lambda: map(int, sys.stdin.readline().rstrip().split())
def resolve():
X, K, D = iim()
r = 1
if X < 0:
r = -1
X = -X
a, b = divmod(X, D)
diff = K - a
if diff <= 0:
print(abs(r*(X - K*D)))
return
if diff & 1:
b -= D
print(abs(r*b))
if __name__ == "__main__":
resolve()
|
p02584 | s059160700 | Accepted | #!/usr/bin/env python3
def main():
X, K, D = map(int, input().split())
res = abs(X) // D
if res <= K:
K -= res
if K % 2:
print(abs(abs(X) % D - D))
else:
print(abs(X) % D)
else:
print(abs(X) - D * K)
if __name__ == '__main__':
main()
|
p02584 | s686906099 | Accepted | xkd = input().split()
X = int(xkd[0])
K = int(xkd[1])
D = int(xkd[2])
X = abs(X)
ans = 0
times = int(X/D)
oneMore = False
if X%D > abs(D-X%D):
times+=1
if times > K:
ans = X - (D*K)
else:
if (times%2) == (K%2):
ans = min(X%D, (D-X%D))
else:
ans = max(X%D, (D-X%D))
print(ans) |
p02584 | s229856791 | Accepted | x, k, d = map(int, input().split())
x = abs(x)
# x > 0のとき
left = abs(x - d * (x // d + 1))
right = abs(x - d * (x // d))
if k < x // d:
print(x - d * k)
exit()
if (k - (x // d)) % 2 == 0:
print(right)
else:
print(left)
|
p02584 | s467145750 | Accepted | import math
x, k, d = map(int, input().split())
p = math.floor(abs(x/d))
if x > 0:
if p >= k: print(abs(x-k*d))
elif (k-p)%2==1: print(abs(x-(p+1)*d))
else: print(abs(x-p*d))
else:
if p >= k: print(abs(x+k*d))
elif (k-p)%2==1: print(abs(x+(p+1)*d))
else: print(abs(x+p*d))
|
p02584 | s922955296 | Accepted | x,k,d = map(int,input().split())
x = abs(x)
i = int(x / d)
if k < i:
print(x - k * d)
exit()
if (k - i) % 2 == 0:
print(x - i * d)
exit()
print(abs(x - (i + 1) * d)) |
p02584 | s482594952 | Accepted | x, k, d = map(int, input().split())
x = abs(x)
if x >= k*d:
ans = x - k*d
elif k&1:
ans = min((x-d)%(2*d), 2*d - (x-d)%(2*d) )
else:
ans = min(x%(2*d), 2*d - x%(2*d))
print(ans) |
p02584 | s835910735 | Accepted | X,K,D=map(int,input().split())
if X < 0:
X=-X
a=X//D
if a >= K:
print(X-D*K)
else:
if X%D<D-X%D:
if (K-a)%2 == 0:
print(X%D)
else:print(D-X%D)
else:
if (K-(a+1))%2==0:
print(D-X%D)
else:print(X%D)
|
p02584 | s146768906 | Accepted | X,k,d = map(int,input().split())
x = abs(X)
if x >= k*d:
print(x - d*k)
else:
e = x//d
k -= e
x %= d
if k % 2 == 0:
print(x)
else:
print(d-x)
|
p02584 | s116633626 | Accepted | x, k, d = list(map(int, input().split()))
x = abs(x)
if k * d <= x:
print(x - k * d)
else:
k -= x//d
x %= d
if k % 2 == 0:
print(x)
else:
print(abs(x-d))
|
p02584 | s721185880 | Accepted | X, K, D = map(int,input().split())
XX = abs(X)
if K > XX // D:
if (K - (XX // D)) % 2 == 0:
ans = XX - (XX // D) * D
print(abs(ans))
else:
ans = (XX - (XX // D) * D) - D
print(abs(ans))
else:
ans = XX - D * K
print(abs(ans)) |
p02584 | s029387519 | Accepted | X,K,D=map(int,input().split())
if abs(X)>=K*D:
print(abs(X)-K*D)
else:
if K%2==abs(X)//D%2:
print(abs(X)%D)
else:
print(D-abs(X)%D) |
p02584 | s322417178 | Accepted | X, K, D = map(int,input().split())
res = 0
X = abs(X)
if X >= K * D:
res = X - K * D
else:
i = X // D
j = K - i
if j % 2 == 0:
res = X - D * i
else:
res = X - D * (i + 1)
print(abs(res)) |
p02584 | s900364671 | Accepted | from sys import exit, stdin
# import copy
# from collections import deque,Counter
# import numpy as np
input = stdin.readline
X, K, D = map(int, input().split())
if abs(X) >= K * D:
print((abs(X) - K * D))
else:
A1 = abs(X) % D
A2 = abs(A1 - D)
n = int((abs(X) - A1)/D)
if (K - n) % 2 == 0:
print(A1)
else:
print(A2)
|
p02584 | s744713449 | Accepted | x, k, d = map(int, input().split())
cur = abs(x) # 座標を正にしてしまいます
rem = k # 残りの移動回数です
cnt = min(cur // d, k) # 0に向かって移動する回数です
cur -= d * cnt
rem -= cnt
# 0 % 2 = 0なので、残り回数の場合分けをする必要はないのですが、一応
if rem > 0:
if rem % 2 == 1:
cur = cur - d
ans = abs(cur)
print(ans) |
p02584 | s033513861 | Accepted | x,k,d = map(int, input().split())
x = abs(x)
div,mod = divmod(x,d)
cnt = min(k,div)
k -= cnt
ans = x - cnt * d
if k > 0:
ans -= (k%2) * d
print(abs(ans)) |
p02584 | s276131437 | Accepted | from sys import stdin
def main():
input = lambda: stdin.readline()[:-1]
X, K, D = map(int, input().split())
d, m = divmod(X, D)
if abs(d) >= K:
print(abs(abs(X) - (K * D)))
else:
if (K - d) % 2:
print(D - m)
else:
print(m)
main()
|
p02584 | s413659779 | Accepted | x, k, d = map(int, input().split())
if x < 0:
x = -x
t = x // d
if k <= t:
print(x - k*d)
exit()
x -= t * d
k -= t
if k%2 == 1:
print(abs(x - d))
else:
print(x)
|
p02584 | s002469624 | Accepted |
X, K, D = map(int, input().split())
if K * D < abs(X):
print(abs(X)-K*D)
exit(0)
new_X = abs(X) % D
new_K = K - abs(X) // D
if new_K % 2 == 0:
print(new_X)
else:
print(abs(new_X-D))
|
p02584 | s905423426 | Accepted | x,k,d=map(int,input().split())
x=abs(x)
if x>k*d:
print(x-k*d)
else:
p=x//d
if p%2==k%2:
print(x-p*d)
else:
print(abs(x-(p+1)*d)) |
p02584 | s657163550 | Accepted | import math
x,k,d=map(int,input().split())
x1=abs(x)
if k*d<x1:
print(x1-k*d)
else:
a=math.ceil(x1/d)
if (k-a)%2==0:
print(abs(x1-d*a))
else:
print(abs(x1-d*(a-1))) |
p02584 | s511805000 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
a = int(X/D)
ans = 0
if a>=K:
ans = X-(D*K)
else:
if K%2==0:
if a%2==0: ans = X-(D*a)
else: ans = X-(D*a)-D
else:
if a%2==0: ans = X-(D*a)-D
else: ans = X-(D*a)
ans = int(abs(ans))
print(ans)
|
p02584 | s809104588 | Accepted | Xd, K, D = map(int,input().split())
X = abs(Xd)
if X > K*D or abs(X-K*D)<=D:
print(abs(X-K*D))
exit()
if (K - Xd//D)%2==0:
print(Xd%D)
else:
print(abs(Xd%D-D))
|
p02584 | s674253600 | Accepted | X,K,D = (int(x) for x in input().split())
X=abs(X)
if X>K*D:
print(X-K*D)
else:
s=X//D
X-=s*D
K-=s
if K%2==0:
print(X)
else:
print(abs(X-D)) |
p02584 | s755109658 | Accepted | x,k,d=map(int,input().split())
x=abs(x)
cnt=abs(x)//d
if cnt>=k:
print(x-d*k)
else:
k-=cnt
if k%2==0:
print(abs(x-d*cnt))
else:
print(abs(x-d*(cnt+1)))
|
p02584 | s725334541 | Accepted | x, k, d = map(int, input().split())
ans = 0
if k * d < abs(x):
if x >= 0:
ans = x - k*d
else:
ans = x + k*d
print(abs(ans))
exit()
xd = x // (2*d)
if k % 2:
tmp = x - 2*d*xd
l = [abs(tmp-d), abs(tmp+d), abs(tmp+3*d)]
ans = min(l)
else:
tmp = x - 2*d*xd
l = [abs(tmp-2*d), abs(tmp), abs(tmp+2*d)]
ans = min(l)
print(ans) |
p02584 | s438251216 | Accepted | it = lambda: list(map(int, input().strip().split()))
def solve():
X, K, D = it()
X = abs(X)
if X - K * D >= 0:
return X - K * D
K = K - X // D
X = X - X // D * D
assert K >= 0
assert X >= 0
return abs(X) if K % 2 == 0 else abs(X - D)
if __name__ == '__main__':
ans = solve()
print(ans) |
p02584 | s999803454 | Accepted | x,k,d = map(int,input().split())
c = abs(x)//d
if c < k:
if (k-c) % 2 == 0:
print(abs(x)%d)
else:
print(min(abs(abs(x)%d+d),abs(abs(x)%d-d)))
else:
print(abs(x)-d*k) |
p02584 | s864533466 | Accepted | input_line = input().split()
x = int(input_line[0])
k = int(input_line[1])
d = int(input_line[2])
x = abs(x)
y = int(x/d)
if y < k:
x -= y * d
if (k-y) % 2 == 1:
x -= d
else:
x -= k*d
print(abs(x))
|
p02584 | s259555993 | Accepted | x, k, d = map(int, input().split())
if abs(x) > k * d:
print(abs(x) - (k * d))
else:
a = abs(x) // d
b = abs(x) - (a * d)
c = k - a
if c % 2 == 1:
print(abs(b - d))
else:
print(b) |
p02584 | s390913944 | Accepted | X, K, D = map(int, input().split())
ans = None
if K*D <= abs(X):
print(abs(X)-abs(K*D))
else:
times0 = abs(X) // D
X = abs(X) - times0 * D
K -= times0
if K % 2 == 0:
print(X)
else:
print(abs(X-D)) |
p02584 | s345131070 | Accepted | X, K, D = map(int,input().split())
ans = 0
ref = abs(X) // D
if ref >= K:
ans = abs(X) - K * D
else:
ans = abs(X) - ref * D
K = K - ref
if K % 2 == 1:
ans = abs(ans - D)
else:
pass
print(ans) |
p02584 | s012809409 | Accepted | x, k, d = list(map(int, input().split()))
minimum = x - d * k
maximum = x + d * k
if minimum >= 0:
print(minimum)
elif maximum <= 0:
print(-maximum)
else:
c1 = maximum % (2*d)
c2 = c1 - 2*d
print(min(abs(c1), abs(c2)))
|
p02584 | s590685577 | Accepted | x,k,d = map(int,input().split())
x = abs(x)
q,mod = divmod(x,d)
if k <= q:
ans = x - k*d
else:
ans = mod
ans -= (k-q)%2*d
print(abs(ans)) |
p02584 | s345923800 | Accepted | x,k,d=map(int,input().split())
x=abs(x)
c=x//d
if k<=c:
print(abs(x-k*d))
else:
f=x-c*d
k-=c
if f>0:
if k%2==1:
print(abs(f-d))
else:
print(abs(f))
if f<0:
if k%2==1:
print(abs(f+d))
else:
print(abs(f))
if f==0:
if k%2==1:
print(abs(f+d))
else:
print(0) |
p02584 | s170558217 | Accepted | x,k,d=map(int, input().split())
x=abs(x)
if x/k >= d:
print(x-d*k)
elif (k-int(x/d))%2==0:
print(abs(x-int(x/d)*d))
else:
print(abs(x-int(x/d)*d-d))
|
p02584 | s068324877 | Accepted | x,k,d = map(int,input().split())
x = abs(x)
if x//d > k:
print(x-k*d)
elif (k-x//d)%2 == 0:
print(x%d)
else:
print(d-x%d) |
p02584 | s713669853 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
if X // D > K:
ans = X - D * K
else:
if (K - X // D) % 2 == 0:
ans = X % D
else:
ans = abs(X % D - D)
print(ans) |
p02584 | s211298457 | Accepted |
startX, countK, distanceD = map(int, input().split())
n = int(abs(startX) / distanceD)
ans = abs(startX) % distanceD
if n > countK:
ans += distanceD * (n - countK)
else:
if (countK - n) % 2 == 1:
ans= abs(ans - distanceD)
print(ans)
|
p02584 | s225088431 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
K_main = X // D
K_sub = K - K_main
if (K_sub < 0):
print(abs(X - D * K))
else:
answer = abs(X - D * K_main)
if (K_sub % 2 == 0):
print(answer)
else:
print(abs(answer -D)) |
p02584 | s490026734 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
k = X // D
if abs(X - k * D) <= abs(X - (k + 1) * D):
best_k = k
else:
best_k = k + 1
if K < best_k:
print(abs(X - K * D))
elif (K - best_k) % 2 == 0:
print(abs(X - best_k * D))
else:
print(min(abs(X - best_k * D + D), abs(X - best_k * D - D)))
|
p02584 | s671220836 | Accepted | X,K,D = map(int,input().split())
X=abs(X)
q=X//D
mod=X%D
if q <= K:
if (K-q)%2==0:
ans=mod
else:
ans=D-mod
else:
ans=X-K*D
print(ans)
|
p02584 | s064957362 | Accepted | X,K,D=map(int,input().split())
X=max(X,-X)
mostL=X-K*D
if 0<=mostL:
print(mostL)
else:
K-=X//D
X%=D
if K%2==1:
print(abs(X-D))
else:
print(X)
|
p02584 | s419441093 | Accepted | x, k, d = map(int, input().split())
x = abs(x)
if x >= k * d:
print(x - k * d)
else:
div, mod = divmod(x, d)
if (k - div) % 2 == 0:
print(mod)
else:
print(abs(mod - d)) |
p02584 | s305785001 | Accepted | x, k, d = map(int, input().split())
if x >= 0:
if x//d >= k:
print(abs(x - k*d))
else:
if (k - x//d)%2 == 0:
print(abs(x%d))
else:
print(abs(x%d - d))
else:
if abs(x)//d >= k:
print(abs(x + k*d))
else:
if (k - abs(x)//d)%2 == 0:
print(abs(x)%d)
else:
print(d - abs(x)%d) |
p02584 | s072500231 | Accepted | def main():
x, k, d = map(int, input().split())
y = abs(x) // d
if y == k:
print(abs(x) % d)
elif y < k:
if (k-y) % 2 == 0:
print(abs(x) % d)
else:
print(min(abs(abs(x) % d - d), abs(abs(x) % d + d)))
else:
print(min(abs(abs(x)-d*k), abs(abs(x)+d*k)))
if __name__ == '__main__':
main()
|
p02584 | s417990819 | Accepted | X,K,D=map(int,input().split())
X=abs(X)
if X-K*D>=0:
print(X-K*D)
else:
d,m=divmod(X,D)
if (K-d)%2==0:
print(m)
else:
print(abs(m-D)) |
p02584 | s233378667 | Accepted | x,k,d=map(int,input().split())
x=abs(x)
if x>=k*d:
print(x-k*d)
else:
cnt=x//d
if (k-cnt)%2==0:
print(x-cnt*d)
else:
print(abs(x-(cnt+1)*d)) |
p02584 | s796716766 | Accepted | L=list(map(int,input().split()))
X,K,D = abs(L[0]),L[1],L[2]
Y = X-K*D
W = (K-X//D)%2
if Y >= 0:
Z = Y
elif Y < 0:
if W == 1:
Z = D - X % D
else:
Z = X % D
print(Z) |
p02584 | s262795526 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
if K * D <= X:
ans = X - K * D
else:
k = K - X // D
if k % 2 == 0:
ans = X % D
else:
ans = abs(X % D - D)
print(ans) |
p02584 | s119066739 | Accepted | x, k, d = map(int, input().split())
if abs(x) - k * d > 0:
print(abs(x) - k * d)
else:
kk = abs(x) // d
l = (k - kk) % 2
print(abs(abs(x) - (kk + l) * d)) |
p02584 | s461300391 | Accepted | x,k,d = map(int,input().split())
n = abs(x)//d
if n>k:
ans = min(abs(x-k*d),abs(x+k*d))
else:
ans = min(abs(x+min(k,n)*d),abs(x-min(k,n)*d))
if (k-n)%2:
ans = min(abs(ans-d),abs(ans+d))
print(ans) |
p02584 | s774276047 | Accepted | x,k,d=map(int,input().split())
x=abs(x)
ans=10**15
r=x//d
if x>=d*k:
ans=x-d*k
else:
k-=r
if k%2==0:
ans=abs(x-d*r)
else:
ans=abs(x-d*(r+1))
print(ans)
|
p02584 | s318195282 | Accepted | x,k,d = map(int,input().split())
min_p = abs(x)//d
min_n = min_p + 1
rest_p = abs(x)- d*min_p
rest_n = rest_p - d
if k < min_p:
print(abs(x) - k*d)
elif (k-min_p) % 2 == 0:
print(rest_p)
else:
print(abs(rest_n))
|
p02584 | s766469653 | Accepted | x, k, d = map(int, input().split())
if x < 0:
flag = -1
else:
flag = 1
if abs(x) >= k * d:
ans = x - k * d * flag
else:
k -= abs(x) // d
x = abs(x) % d * flag
ans = x if k % 2 == 0 else x - d * flag
print(abs(ans))
|
p02584 | s560590135 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
ans = 0
if X - K*D >= 0:
ans = X - K*D
else:
count = X // D
K = K - (X // D)
if K % 2 == 0:
ans = X - count*D
else:
ans = D - (X - count*D)
print(ans) |
p02584 | s188271459 | Accepted | import math
start, kai, step = map(int, input().split(" "))
if 0 <= abs(start) - (kai * step):
print(abs(start) - (kai * step))
exit()
ans1 = start % step
ans2 = abs(ans1 - step)
if (kai - abs(start // step)) % 2 == 0:
print(abs(ans1))
else:
print(abs(ans2))
|
p02584 | s177813912 | Accepted | import sys
input = sys.stdin.readline
x, k, d = map(int, input().split())
tmp = abs(x) // d
if k < tmp:
result = abs(abs(x) - d*k)
elif tmp%2 == k%2:
result = abs(abs(x) - d*tmp)
else:
a = result = abs(abs(x) - d*tmp)
result = abs(abs(a) - d)
print(result)
|
p02584 | s998633717 | Accepted | x,k,d = map(int,input().split())
x = abs(x)
if x <= k * d:
k -= x//d
x %= d
if k % 2 == 1:
print(d-x)
else:
print(x)
else:
print(x-k*d) |
p02584 | s477029645 | Accepted | X,K,D=map(int,input().split())
if D*K<abs(X):
print(abs(X)-D*K)
else:
K2=abs(X)//D
if K2>K:
K2=K
if (K-K2)%2==0:
print(abs(X)-K2*D)
else:
ans=min(abs(X)-(K2-1)*D, (K2+1)*D-abs(X))
print(ans) |
p02584 | s738582466 | Accepted | X, K, D = [int(x) for x in input().split()]
X = abs(X)
straight = min(K, X // D)
K -= straight;
X -= straight * D;
if K % 2 == 0:
print(X)
else:
print(D - X)
|
p02584 | s017149646 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
a, b = divmod(X, D)
# print(f'{a=}, {b=}')
if a >= K:
ans = X - K * D
ans = abs(ans)
print(ans)
exit()
_K = K - a
# print(f'{_K=}')
if _K % 2 == 0:
ans = b
else:
ans = abs(b - D)
print(ans)
|
p02584 | s956664052 | Accepted | X, K, D = map(int, input().split())
num = abs(X)//D
if num >= K:
X = abs(X) - K*D
else:
if num%2 == K%2:
X = abs(X) - D*num
else:
X = abs(X) - D*(num+1)
print(abs(X)) |
p02584 | s472426327 | Accepted | x, k, d = map(int,input().split())
if x < 0: x = -x
mv = x // d
if mv >= k:
# なるべく0に近づけば良い
print(abs(x)-d*k)
else:
nearest = x % d
if (k - mv) % 2 == 1:
print(abs(nearest - d))
else:
print(nearest)
|
p02584 | s954329448 | Accepted | x,k,d = map(int,input().split())
ab = abs(x)//d
ab_1 = ab +1
koho1 = abs(x) - abs(d*ab)
koho2 = abs(abs(x) -abs(d*ab_1))
tmp = k-ab
koho_s = []
if(tmp > 0):
if(tmp%2 == 0):
ans = koho1
else:
ans = koho2
elif(tmp == 0):
ans = koho1
else:
ans = abs(x) - abs(d*k)
print(ans)
|
p02584 | s479403813 | Accepted | import math
import sys
X, K, D = map(int, input().split())
a = X - K * D
if a > 0:
print(a)
sys.exit()
if a + 2 * K * D < 0:
print(abs(a + 2 * K * D))
sys.exit()
else:
b = a / (-2 * D)
p = math.floor(b)
q = math.ceil(b)
r = -(a + 2 * D * p)
s = a + 2 * D * q
print(min(r,s))
sys.exit() |
p02584 | s681026033 | Accepted | X, K, D = map(int, input().split())
s = (abs(X) // D)
t = abs(abs(X) - D*s)
u = abs(abs(X) - D*(s+1))
if abs(X) > (K*D):
print(abs(X) - K*D)
else:
if (K-s) % 2 == 0:
print(t)
else:
print(u) |
p02584 | s620009812 | Accepted | x,k,d=map(int,input().split())
x=abs(x-0)
if (x-(k*d))>0:
print((x-(k*d)))
else:
k1=0
k1=x//d
k-=k1
a=(x-(k1*d))
if k%2==0:
print(a)
else:
print(abs(a-d))
|
p02584 | s238892495 | Accepted | X, K, D = map(int, input().split())
if X == 0:
if K % 2 == 0:
print(0)
else:
print(abs(D))
exit(0)
X = abs(X)
if X > 0:
k = X - K * D
if k >= 0:
print(k)
else:
kouho1 = X % D
kouho2 = abs(kouho1 - D)
sho = X // D
if (K - sho) % 2 == 0:
print(kouho1)
else:
print(kouho2)
exit(0)
|
p02584 | s223979174 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
k = X // D
print(abs(X - D * (k + (1 if (K - k) % 2 == 1 else 0))) if k <= K else X - D * K) |
p02584 | s412681462 | Accepted | x, k, d = map(int, input().split())
p = (x + d * k) // (2 * d)
def f(a):
return abs(x + d * (k - 2 * a))
if p > k or p < 0:
print(min(f(0), f(k)))
else:
print(min(f(p), f(p + 1))) |
p02584 | s022025901 | Accepted | x,k,d=map(int,input().split())
if x<0:
x=-x
if x>=k*d:
print(x-k*d)
else:
c=x//d
x_r=x-d*c
x_l=x-d*(c+1)
k=k-c
if k%2==1:
print(abs(x_l))
else:
print(x_r) |
p02584 | s176839135 | Accepted | x,k,d=map(int,input().split())
x=abs(x)
if x>k*d:
print(x-k*d)
else:
k-=x//d
if k%2==0:
print(x%d)
else :
print(d-x%d) |
p02584 | s115746901 | Accepted | #!/usr/bin/env python3
x, k, d = map(int, input().split())
x = abs(x)
if (n := k - x // d) < 0:
print(x - k * d)
else:
print(abs(d - x % d) if n % 2 else x % d)
|
p02584 | s736542345 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
if X > K*D:
print(X-K*D)
exit()
K -= X//D
if K%2 == 0:
print(abs(X-(X//D)*D))
else:
print(abs(X-(X//D)*D-D)) |
p02584 | s113669156 | Accepted | v = input().split(" ")
x = int(v[0])
k = int(v[1])
d = int(v[2])
if (x == 0):
if (k % 2 == 0):
ans = 0
else:
ans = d
else:
if ((k * d) > abs(x)):
y = abs(x) // d
ans = abs(abs(x) - y * d)
if ((k - y) % 2 == 1):
ans = abs(d - ans)
else:
ans = abs(x) - k * d
print(ans) |
p02584 | s240395861 | Accepted | x, k, d = map(int, input().split())
x = abs(x)
a = x//d
k2 = k-a
if x-k*d > 0:
print(x-k*d)
exit()
if k2%2 == 0:
print(x%d)
else:
print(abs(x%d-d))
|
p02584 | s733441418 | Accepted | import math
X, K, D = map(int, input().split())
X = abs(X)
mini = math.ceil(X/D)
if mini >= K:
print(abs(X-D*K))
else:
if (K-mini)%2 == 0:
print(abs(X-D*mini))
else:
print(X-D*(mini-1)) |
p02584 | s635441740 | Accepted | import sys
def input(): return sys.stdin.readline().rstrip()
def ii(): return int(input())
def mi(): return map(int, input().split())
def li(): return list(mi())
from itertools import combinations
from collections import Counter as cc
def main():
x, k , d = mi()
x = abs(x)
ans = max(x%d, x-k*d)
k -= x//d
if k > 0 and k%2 == 1:
ans = abs(ans-d)
print(ans)
if __name__ == '__main__':
main() |
p02584 | s555861368 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
D = abs(D)
if X > K * D:
X = X - K*D
else:
quo = X//D
X = X - D*quo
res = K - quo
if res % 2 == 1:
X = X - D
else:
pass
print(abs(X)) |
p02584 | s546671054 | Accepted | x,k,d=map(int,input().split())
x =abs(x)
o =x//d
if (x-d*k) >=0:
print(x-d*k)
exit()
else:
if (k-o)%2==0:
print(abs(x%d))
exit()
else:
print(abs(x%d-d))
exit() |
p02584 | s337344331 | Accepted | x, k, d = map(int,input().split())
max_length = k * d
xx = abs(x)
answer = 0
if xx >= max_length:
answer = xx - max_length
else:
if (k - xx // d) % 2 == 0:
answer = xx - xx // d * d
else:
answer = xx - (xx // d + 1) * d
print(abs(answer)) |
p02584 | s218512713 | Accepted | start, num_move, distance = map(int, input().split())
# move toward
desired_move = abs(start) // distance
another_move = num_move - desired_move
if another_move <= 0:
ans_abs = abs(start) - num_move * distance
print(ans_abs)
else:
if another_move % 2 == 0:
ans_abs = abs(start) - desired_move * distance
print(ans_abs)
else:
ans_abs = abs(abs(start) - (desired_move+1) * distance)
print(ans_abs)
|
p02584 | s384231110 | Accepted | X, K, D = map(int, input().split())
sho = abs(X)//D
amari = abs(X) % D
if abs(X) > K * D:
print(abs(X) - K*D)
exit(0)
if sho % 2 == K % 2:
print(amari)
else:
print(D - amari) |
p02584 | s680374721 | Accepted | X, K, D = list(map(int, input().split()))
X = abs(X)
count = X // D
if count >= K:
answer = X - K*D
else:
if (K - count) % 2 == 0:
answer = X - count*D
else:
answer = abs(X - (count+1)*D)
print(answer) |
p02584 | s612131548 | Accepted | X, K, D = map(int, input().split())
x = abs(X)
if X == 0:
cnt = K
if cnt % 2 == 0:
ans = 0
else:
ans = D
elif x >= D:
cnt = K - x//D
if x- K*D >= 0:
ans = x - K*D
elif x - K*D < 0 and cnt % 2 == 0:
ans = abs(x%D)
else:
ans = abs(D - x%D)
elif x < D:
cnt = K
if cnt % 2 == 0:
ans = abs(x)
else:
ans = abs(x-D)
print(ans) |
p02584 | s275356514 | Accepted | def main():
x, k, d = map(int, input().split())
if x < 0: x = -x
if k * d <= x:
print(x - k*d)
return
x %= d + d
if k % 2 == 1:
x -= d
else:
x = min(abs(x-d-d), x)
print(abs(x))
main()
|
p02584 | s002551384 | Accepted | x, k ,d = map(int, input().split())
if abs(x) > k*d:
print(abs(x)-k*d)
else:
t = abs(x)%d
s = (abs(x)-t)//d
if (k-s) % 2 == 1:
print(abs(t-d))
else:
print(t)
|
p02584 | s655445728 | Accepted | X,K,D = map(int,input().split())
if X < 0:
X = -X
A = X // D
if A > K:
print(X - (K*D))
else:
B = X % D
KK = K - A
if KK % 2 == 1:
print(abs(B-D))
elif KK % 2 == 0:
print(abs(B)) |
p02584 | s661892705 | Accepted | X, K, D = map(int, input().split())
X = abs(X)
n = X//D
if K < n:
print(X-K*D)
else:
if (n-K) % 2 == 0:
print(X-n*D)
else:
print(abs(X-(n+1)*D))
|
p02584 | s636396398 | Accepted | X, K, D = map(int, input().split())
a, b = abs(X)//D, abs(X)%D
if K <= a:
if X >= 0:
ans = X - K*D
else:
ans = X + K*D
else:
K = (K - a) % 2
if X >= 0:
ans = X - a*D
else:
ans = X + a*D
if K == 1:
if abs(X+D) < abs(X-D):
ans += D
else:
ans -= D
print(abs(ans)) |
p02584 | s504799846 | Accepted | x, k, d = map(int,input().split())
x = abs(x)
if (x >= k*d):
print(x - k*d)
else:
nokori = k - x//d
if (nokori%2 == 0):
print(abs(x%d))
else:
print(abs(x%d - d))
|
p02584 | s054069643 | Accepted | def solve():
x, k, d = map(int, input().split())
l = x - k * d
r = x + k * d
if l > 0:
print(l)
return
elif r < 0:
print(-r)
return
a1 = r - r // (2 * d) * (2 * d)
a2 = a1 - (2 * d)
ans = min(abs(a1), abs(a2))
print(ans)
if __name__ == "__main__":
solve()
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.