input
stringlengths 20
127k
| target
stringlengths 20
119k
| problem_id
stringlengths 6
6
|
|---|---|---|
def insert(a, data):
a.append(data)
heapinc(a, len(a)-1)
def heapinc(a, index):
parent = (index - 1) // 2
if parent >= 0:
if a[parent] < a[index]:
memo = a[parent]
a[parent] = a[index]
a[index] = memo
heapinc(a, parent)
def extract(a):
root = a[0]
a[0] = a[-1]
del a[-1]
maxheapify(a, 0)
return root
def maxheapify(a, i):
l = i*2 + 1
r = i*2 + 2
if r < len(a):
if a[l] > a[i]:
largest = l
else:
largest = i
if a[r] > a[largest]:
largest = r
if largest != i:
memo = a[i]
a[i] = a[largest]
a[largest] = memo
maxheapify(a, largest)
elif l < len(a):
if a[l] > a[i]:
largest = l
else:
largest = i
if largest != i:
memo = a[i]
a[i] = a[largest]
a[largest] = memo
maxheapify(a, largest)
a = []
while 1:
com = input().split()
if com[0] == 'insert':
insert(a, int(com[1]))
elif com[0] == 'extract':
print((extract(a)))
else:
break
|
from heapq import *
a = []
while 1:
com = input().split()
if com[0] == 'end':
break
elif com[0] == 'insert':
heappush(a, -int(com[1]))
else:
print((-heappop(a)))
|
p02289
|
n = int(eval(input()))
print((0 if n == 0 else len(str(bin(n))[2:])))
|
n = int(eval(input()))
print((0 * (n == 0) + len(str(bin(n))[2:]) * (n != 0)))
|
p01852
|
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
s = input()[:-1]
ans = [1]*(N+2)
def print_ans(l: list):
ret = ""
for a in l[1:-1]:
ret += "S" if a else "W"
print(ret)
def next(ind: int, isSame: bool, isSheep: bool)->bool:
if isSame:
if isSheep:
return ans[ind-1]
else:
return not ans[ind-1]
else:
if isSheep:
return not ans[ind-1]
else:
return ans[ind-1]
return isSame ^ isSheep ^ ans[ind-1]
def check(first: bool, last: bool)->list:
ans[0] = last
ans[1] = first
for i in range(1, N+1):
ans[i+1] = next(i, s[i-1] == "o", ans[i])
return ans[0] == ans[N] and ans[1] == ans[N+1]
for first in [True, False]:
for last in [True, False]:
if check(first, last):
print_ans(ans)
exit()
print("-1")
|
# python template for atcoder1
import sys
sys.setrecursionlimit(10**9)
input = sys.stdin.readline
N = int(eval(input()))
s = input()[:-1]
ans = [1]*(N+2)
def print_ans(l: list):
ret = ""
for a in l[1:-1]:
ret += "S" if a else "W"
print(ret)
def next(ind: int, isSame: bool, isSheep: bool)->bool:
return isSame ^ isSheep ^ ans[ind-1]
def check(first: bool, last: bool)->list:
ans[0] = last
ans[1] = first
for i in range(1, N+1):
ans[i+1] = next(i, s[i-1] == "o", ans[i])
return ans[0] == ans[N] and ans[1] == ans[N+1]
for first in [True, False]:
for last in [True, False]:
if check(first, last):
print_ans(ans)
exit()
print("-1")
|
p03800
|
while True:
a,b,c,d,e = list(map(int,input().split()))
if a==0:
break
na,nb,nc = list(map(int,input().split()))
v=[0]*(na+nb+nc)
for i in range(na):
v[i]=a
for i in range(nb):
v[i+na]=b
for i in range(nc):
v[i+na+nb]=c
t=na+nb+nc
ans=na*a+nb*b+nc*c
if t < d:
if ans > d*e:
ans=d*e
else:
tmp = 0
for i in range(d):
tmp += v[len(v)-1-i]
if tmp >= d*e:
for i in range(len(v)):
if e < v[i]:
v[i] = e
for i in range(d):
v[len(v)-1-i] = e
ans=0
for i in range(len(v)):
ans += v[i]
print(ans)
|
while True:
a,b,c,d,e = list(map(int,input().split()))
if a==0:
break
na,nb,nc = list(map(int,input().split()))
t=na+nb+nc
ans=na*a+nb*b+nc*c
if t < d:
if ans > d*e:
ans=d*e
else:
tmp = 0
dd=d
cnt=0
if dd>=nc:
cnt+=nc*c
dd-=nc
else:
cnt+=dd*c
dd=0
if dd>=nb:
cnt+=nb*b
dd-=nb
else:
cnt+=dd*b
dd=0
if dd>=na:
cnt+=na*a
dd-=na
else:
cnt+=dd*a
dd=0
if cnt >= d*e:
if e<a:
a=e
if e<b:
b=e
if e<c:
c=e
dd=d
cnt=0
# print "cnt"
if dd>=nc:
cnt+=nc*e
dd-=nc
else:
cnt+=dd*e
cnt+=(nc-dd)*min(e,c)
dd=0
# print cnt
if dd>=nb:
cnt+=nb*e
dd-=nb
else:
cnt+=dd*e
cnt+=(nb-dd)*min(e,b)
dd=0
# 70 100 340 4 200
# 1 1 2
# print cnt
if dd>=na:
cnt+=na*e
dd-=na
else:
cnt+=dd*e
cnt+=(na-dd)*min(e,a)
dd=0
ans=cnt
print(ans)
|
p00999
|
# -*- using:utf-8 -*-
class main:
def function(x, k, d):
for i in range(k):
if abs(x + d) > abs(x - d):
x = x - d
elif abs(x + d) < abs(x - d):
x = x + d
else:
if (k - i) % 2 == 0:
return abs(x)
break
else:
return abs(x + d)
break
return abs(x)
if __name__ == "__main__":
x, k, d = list(map(int, input().split()))
x = main.function(x, k, d)
print(x)
|
# -*- using:utf-8 -*-
class main:
def function(x, k, d):
if x >= k * d:
ans = x - k * d
else:
r = x // d
n = k - r
if n % 2 == 0:
ans = x % d
else:
ans = abs(x % d - d)
return ans
if __name__ == "__main__":
x, k, d = list(map(int, input().split()))
x = abs(x)
ans = main.function(x, k, d)
print(ans)
|
p02584
|
from math import floor
def solve(X, D, lb, ub):
# min abs(X + t * D) (lb <= t <= ub) (lb, ub, t are int)
ts = [
lb,
ub,
max(min(floor(-X / D), ub), lb),
max(min(floor(-X / D) + 1, ub), lb),
]
return min([abs(X + t * D) for t in ts])
X, K, D = list(map(int, input().split()))
y1 = X - K * D
y2 = X + K * D
if (y1 > 0 and y2 > 0) or (y1 < 0 and y2 < 0): # same sign
print((min(abs(y1), abs(y2))))
else:
if K % 2 == 0:
ans = solve(X, D * 2, -(K // 2), +(K // 2))
else:
ans1 = solve(X + D, D * 2, -((K + 1) // 2), +((K - 1)) // 2)
ans2 = solve(X - D, D * 2, -((K - 1) // 2), +((K + 1)) // 2)
ans = min(ans1, ans2)
print(ans)
|
from math import floor
def solve(X, D, lb, ub):
# min abs(X + t * D) (lb <= t <= ub) (lb, ub, t are int)
ts = [
lb,
ub,
max(min(floor(-X / D), ub), lb),
max(min(floor(-X / D) + 1, ub), lb),
]
return min([abs(X + t * D) for t in ts])
X, K, D = list(map(int, input().split()))
if K % 2 == 0:
ans = solve(X, D * 2, -(K // 2), +(K // 2))
else:
ans1 = solve(X + D, D * 2, -((K + 1) // 2), +((K - 1)) // 2)
ans2 = solve(X - D, D * 2, -((K - 1) // 2), +((K + 1)) // 2)
ans = min(ans1, ans2)
print(ans)
|
p02584
|
def main():
X, K, D = list(map(int, input().split()))
for i in range(K):
if abs(X - D) > abs(X + D):
X = X + D
else:
X = X - D
if X <= 0:
if (i % 2 == 1 and K % 2 == 0) or (i % 2 == 0 and K % 2 == 1):
print((abs(X)))
return
else:
if abs(X - D) < X:
print((abs(X - D)))
return
elif abs(X + D) < X:
print((abs(X + D)))
return
print((abs(X)))
main()
|
def main():
X, K, D = list(map(int, input().split()))
def sgn(X):
if X > 0:return 1
if X < 0:return -1
return 0
if X > 0:
x_greedy = X - K * D
else:
x_greedy = X + K * D
if sgn(X) == sgn(x_greedy):
print((abs(x_greedy)))
return
x_r = X % D
x_l = x_r - D
r_parity = (abs(X - x_r) // D) % 2
if K%2 == r_parity:
print((abs(x_r)))
else:
print((abs(x_l)))
main()
|
p02584
|
def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(eval(input()))
P = 10**9+7
INF = 10**18+10
x,k,d = LMIIS()
sign = -1 if x < 0 else 1
absX = abs(x)
if k*d <= abs(x):
print((absX-k*d))
return
num = absX // d
k -= num
if k & 1:
num += 1
print((abs(absX-num*d)))
main()
|
def main():
from sys import setrecursionlimit, stdin, stderr
from os import environ
from collections import defaultdict, deque, Counter
from math import ceil, floor
from itertools import accumulate, combinations, combinations_with_replacement
setrecursionlimit(10**6)
dbg = (lambda *something: stderr.write("\033[92m{}\033[0m".format(str(something)+'\n'))) if 'TERM_PROGRAM' in environ else lambda *x: 0
input = lambda: stdin.readline().rstrip()
LMIIS = lambda: list(map(int,input().split()))
II = lambda: int(eval(input()))
P = 10**9+7
INF = 10**18+10
x,k,d = LMIIS()
absX = abs(x)
# 0にできるだけ近づいて終わり
if k*d <= abs(x):
print((absX-k*d))
return
# マイナスにならない範囲でできるだけ0に近づく
num = absX // d
k -= num
# 残りの移動回数が奇数なら、あと1回だけ移動する
if k & 1:
num += 1
print((abs(absX-num*d)))
main()
|
p02584
|
import sys
input = sys.stdin.readline
from collections import *
def f(x):
return 2*D*x+X-K*D
X, K, D = list(map(int, input().split()))
if f(0)==0 or f(K)==0:
print((0))
exit()
if f(0)>0:
print((f(0)))
elif f(K)<0:
print((abs(f(K))))
else:
m = (K*D-X)//(2*D)
ans = 10**18
for i in range(m-100, m+100):
if 0<=i<=K:
ans = min(ans, abs(f(i)))
print(ans)
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X-D*K>=0:
print((X-D*K))
else:
p = X%D
c = (X-p)//D
if (K-c)%2==0:
print(p)
else:
print((-(p-D)))
|
p02584
|
x,k,d = list(map(int,input().split()))
#偶数回前後に移動したら0
#偶数回一方向に移動したら2D
for i in range(k):
x = abs(x) - d
if x < 0:
break
if (k-i+1) % 2 == 0:
#そのまま
ans = abs(x)
else:
ans = min(abs(x-d),abs(x+d))
print(ans)
|
x,k,d = list(map(int,input().split()))
#偶数回前後に移動したら0
#偶数回一方向に移動したら2D
if x >= 0:
capa_iter = x // d
if capa_iter < k:
if (k - capa_iter) % 2 == 0:
print((x - capa_iter*d))
else:
print((min([abs(x - capa_iter*d-d),x - capa_iter*d+d])))
exit()
ans =x-d*k
print(ans)
if x < 0:
capa_iter = abs(-x // d)
if capa_iter < k:
if (k - capa_iter) % 2 == 0:
print((abs(x + capa_iter*d)))
else:
print((min([abs(x + capa_iter*d+d),abs(x + capa_iter*d - d)])))
exit()
ans =abs(x+d*k)
print(ans)
|
p02584
|
X, K, D = list(map(int, input().split()))
if X < 0:
X = -X
step = 0
while X > D and not K == 0:
step += 1
X -= D
K -= 1
if K == 0:
print(X)
exit()
if K % 2 == 0:
print(X)
else:
print((abs(X-D)))
|
X, K, D = list(map(int, input().split()))
if X < 0:
X = -X
step = X//D
X -= D*step
K -= step
if K <= 0:
print((X-K*D))
exit()
if K % 2 == 0:
print(X)
else:
print((abs(X-D)))
|
p02584
|
x,k,d = list(map(int, input().split()))
y = x
for i in range(k):
if x > 0:
x -= d
y = min(abs(y),abs(x))
elif x < 0:
x += d
y = min(abs(y),abs(x))
else:
if (k-i)%2 == 1:
y = d
else:
y = 0
break
print(y)
|
x,k,d = list(map(int, input().split()))
x = abs(x)
if k <= x//d:
y = x-k*d
else:
if (k-x//d)%2 == 0:
y = x%d
else:
y = min(abs(x%d-d),abs(x%d+d))
print(y)
|
p02584
|
def WalkingTakahashi():
data = list(map(int,input().split()))
position = data[0]
if data[0] == data[2] and data[1]%2 == 0:
print((data[2]))
elif data[0] == data[2] and data[1]%2 == 1:
print((0))
else:
for i in range(data[1]):
if abs(position + data[2]) < abs(position - data[2]):
position = position + data[2]
else:
position = position - data[2]
print((abs(position)))
if __name__ == '__main__':
WalkingTakahashi()
|
def WalkingTakahashi():
data = list(map(int,input().split()))
position = abs(data[0])
m = min(data[1], position//data[2])
position = position - data[2]*m
data[1] = data[1] - m
data[1] %= 2
position = position - data[2]*data[1]
print((abs(position)))
if __name__ == '__main__':
WalkingTakahashi()
|
p02584
|
X, K, D = list(map(int, input().split()))
ogpos = True
if X > 0:
ogpos = True
else:
ogpos = False
old = X
newpos = ogpos
while newpos == ogpos and K>0:
K -= 1
if X > 0:
X -= D
elif X < 0:
X += D
else:
if ogpos == True:
X -= D
else:
X += D
if X>0:
newpos = True
elif X<0:
newpos = False
if (K%2) == 0:
print((abs(X)))
else:
if newpos == True:
print((abs(X-D)))
else:
print((abs(X+D)))
|
X, K, D = list(map(int, input().split()))
X = abs(X)
cuts = X//D
if cuts>=K:
print((X-(K*D)))
else:
remainingcuts = K-cuts
r = X-cuts*D
if remainingcuts%2 == 1:
print((abs(r-D)))
else:
print(r)
|
p02584
|
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
x,k,d=nii()
dist=abs(x)
num=dist//d
if num>k:
print((abs(dist-d*k)))
exit()
else:
k-=num
dist1=dist-d*num
if k>=1:
dist2=abs(dist1-d)
if dist2<=dist1:
k-=1
dist1=dist2
if k%2==0:
print(dist1)
else:
print((min(abs(dist1+d),abs(dist1-d))))
|
from sys import stdin
nii=lambda:list(map(int,stdin.readline().split()))
lnii=lambda:list(map(int,stdin.readline().split()))
x,k,d=nii()
dist=abs(x)
num=dist//d
if num>k:
print((abs(dist-d*k)))
exit()
else:
k-=num
dist-=d*num
if k%2==0:
print(dist)
else:
print((min(abs(dist+d),abs(dist-d))))
|
p02584
|
x,k,d=list(map(int,(input().split())))
zx=x
#zzx=zx
for i in range(k):
xm=abs(x+d)
xu=abs(x-d)
x=min(xm,xu)
k-=1
if zx+x==d:
if k%2!=0:
x=zx
break
else:
# x=zx
break
# zzx=zx
zx=x
print(x)
|
x,k,d=list(map(int,(input().split())))
x=abs(x)
zx=x
if x<d*k:
wk,x=divmod(abs(x),d)
k-=wk
else:
x-=d*k
k=0
for i in range(k):
xm=abs(x+d)
xu=abs(x-d)
x=min(xm,xu)
k-=1
if zx+x==d:
if k%2!=0:
x=zx
break
else:
break
zx=x
print(x)
|
p02584
|
#!/usr/bin/env python3
import math
# スペース区切りの整数の入力
X, K, D = list(map(int, input().split()))
cross = abs(-(-X//D))
if cross >= K:
for i in range(K):
if X >= 0:
X -= D
else:
X += D
print((abs(X)))
else:
for i in range(cross):
if X >= 0:
X -= D
else:
X += D
if (K-cross)%2 == 0:
print((abs(X)))
else:
if X >= 0:
print((abs(X-D)))
else:
print((abs(X+D)))
|
#!/usr/bin/env python3
import math
# スペース区切りの整数の入力
X, K, D = list(map(int, input().split()))
cross = abs(-(-X//D))
if cross >= K:
if X >= 0:
X -= D*K
else:
X += D*K
print((abs(X)))
else:
if X >= 0:
X -= D*cross
else:
X += D*cross
if (K-cross)%2 == 0:
print((abs(X)))
else:
if X >= 0:
print((abs(X-D)))
else:
print((abs(X+D)))
|
p02584
|
x,k,d=list(map(int,input().split()))
if k%2==0:
ans=min(abs(x),abs(x+2*d),abs(x-2*d),abs(x+4*d),abs(x-4*d),abs(x+k*d),abs(x-k*d),abs(x+(k-2)*d),abs(x-(k-2)*d),abs(x+(k-4)*d),abs(x-(k-4)*d))
else:
if k==1:
ans=min(abs(x+d),abs(x-d))
else:
ans=min(abs(x+d),abs(x-d),abs(x+3*d),abs(x-3*d),abs(x+k*d),abs(x-k*d),abs(x+(k-2)*d),abs(x-(k-2)*d),abs(x+(k-4)*d),abs(x-(k-4)*d))
if k>=abs(x)//d:
if (k-(abs(x)//d))%2==0:
ans=min(ans,abs(x+(abs(x)//d)*d),abs(x-(abs(x)//d)*d))
else:
ans=min(ans,abs(x+(abs(x)//d)*d+d),abs(x-(abs(x)//d)*d+d),abs(x+(abs(x)//d)*d-d),abs(x-(abs(x)//d)*d-d))
print(ans)
|
x,k,d=list(map(int,input().split()))
x=abs(x)
ans=0
if x-d*k>=0:
ans=x-d*k
else:
e=x//d
k-=e
x-=e*d
if k%2==1:
ans=abs(x-d)
else:
ans=x
print(ans)
|
p02584
|
X, K, D = list(map(int, input().rstrip().split()))
before = X
if abs(X)//D>=K:
print((abs(X)-D*K))
else:
for i in range(K):
buf = X
if X<0:
X += D
else:
X -= D
if X == before:
if (K-i)%2 == 0:
if X<0:
X += D
else:
X -= D
else:
X = before
break
before=buf
print((abs(X)))
|
x,k,d = list(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
|
x,k,d=list(map(int,input().split()))
def counta(x,k,d):
#xcnt=0
x=abs(x)
if d<2*x:
while x>=d:
x-=d
k-=1
if k==0:
print((abs(x)))
return
if k%2==0:
print(x)
return
else:
print((abs(x-d)))
return
else:
if k%2==0:
print(x)
return
else:
print((abs(x-d)))
return
counta(x,k,d)
|
x,k,d=list(map(int,input().split()))
def counta(x,k,d):
#xcnt=0
x=abs(x)
if d<2*x:
ans=x//d
#amari=x%d
if ans>k:
print((abs(x-k*d)))
return
k=k-ans
x=x-ans*d
if k%2==0:
print(x)
return
else:
print((abs(x-d)))
return
else:
if k%2==0:
print(x)
return
else:
print((abs(x-d)))
return
counta(x,k,d)
|
p02584
|
X,K,D = list(map(int,input().split()))
if X < 0:
X = -X
cnt = 0
for i in range(K):
X -= D
cnt += 1
if X <= 0:
break
else:
continue
remain = K-cnt
if remain == 0:
print((abs(X)))
else:
if remain % 2 == 0:
print((abs(X)))
else:
print((abs(X+D)))
|
X,K,D = list(map(int,input().split()))
if X < 0:
X = -X
cnt = 0
Q = X//D
R = X%D
if K < Q:
print((X-K*D))
else:
if (K - Q)%2 == 0:
print((abs(R)))
else:
print((abs(R-D)))
|
p02584
|
x,k,d=list(map(int,input().split()))
if x==0:
if d%2==0:
print((0))
else:
print(d)
else:
cou=0
ok=True
if x>0:
while x>0:
cou+=1
x-=d
if cou==k:
ans=x
ok=False
break
xx=x+d
if ok:
if cou%2==0 and k%2==0:
ans=x
elif cou%2==0 and k%2==1:
ans=xx
elif cou%2==1 and k%2==0:
ans=xx
else:
ans=x
if x<0:
while x<0:
cou+=1
x+=d
if cou==k:
ans=x
ok=False
break
xx=x-d
if ok:
if cou%2==0 and k%2==0:
ans=x
elif cou%2==0 and k%2==1:
ans=xx
elif cou%2==1 and k%2==0:
ans=xx
else:
ans=x
print((abs(ans)))
|
x,k,d=list(map(int,input().split()))
if x==0:
if d%2==0:
print((0))
else:
print(d)
else:
cou=0
ok=True
if x>0:
xx=x
while x>0:
if xx-k*d>0:
ans=x-k*d
ok=False
break
cou+=1
x-=d
xx=x+d
if ok:
if cou%2==0 and k%2==0:
ans=x
elif cou%2==0 and k%2==1:
ans=xx
elif cou%2==1 and k%2==0:
ans=xx
else:
ans=x
if x<0:
xx=x
while x<0:
if xx+k*d<0:
ans=xx+k*d
ok=False
break
cou+=1
x+=d
xx=x-d
if ok:
if cou%2==0 and k%2==0:
ans=x
elif cou%2==0 and k%2==1:
ans=xx
elif cou%2==1 and k%2==0:
ans=xx
else:
ans=x
print((abs(ans)))
|
p02584
|
x,k,d = list(map(int,input().split()))
dis = x
cnt = 0
def zet(x):
if x >= 0:
return x
else:
return -x
while cnt<k:
if zet(dis)<d:
recnt = k -cnt
if recnt%2==0:
pass
else:
dis = d-zet(dis)
break
elif dis>=0:
dis = dis - d
else:
dis = dis + d
cnt += 1
print((zet(dis)))
|
x,k,d = list(map(int,input().split()))
x = abs(x)
point =x % d
num = x//d
if num<k:
rest = k - num
if rest%2==0:
pass
else:
point = d -point
else:
point = x - k*d
print(point)
|
p02584
|
x,k,d=list(map(int,input().split()))
x=abs(x)
ans=0
if x>k*d:
ans=x-(k*d)
else:
if k%2==(x//d)%2:
ans=x%d
else:
ans=min(abs(x%d-d),abs(x%d+d))
print(ans)
|
x,k,d=list(map(int,input().split()))
x=abs(x)
ans=0
if x>k*d:
ans=x-(k*d)
else:
if k%2==(x//d)%2:
ans=x%d
else:
ans=abs(x%d-d)
print(ans)
|
p02584
|
X, K, D = list(map(int, input().split()))
i = 0
nokori = 0
if X > 0 :
while X > 0 and i < K:
X -= D
i += 1
nokori = K - i
if nokori % 2 == 1 :
X += D
else :
while X <= 0 and i < K:
X += D
i += 1
nokori = K - i
if nokori % 2 == 1 :
X -= D
print((abs(X)))
|
X, K, D = list(map(int, input().split()))
X = abs(X)
aa = X // D
if K < aa :
X -= K * D
else :
if (K - aa) % 2 == 1 :
X -= (aa+1) * D
else :
X -= aa * D
print((abs(X)))
|
p02584
|
X,K,D=list(map(int,input().split()))
kai = 0
xy = abs(X)
ds = D
if xy >= K*D:
kotae = abs(xy-(K*D))
if xy < K*D:
while xy >ds:
ds=ds+D
kai = kai+1
ds = ds-D
if (K-kai)%2==0:
kotae = abs(xy-ds)
if (K-kai)%2!=0:
kouho1 = abs(xy-ds-D)
kouho2 = abs(xy-ds+D)
if kouho1>=kouho2:
kotae = kouho2
if kouho1<kouho2:
kotae = kouho1
print(kotae)
|
X,K,D=list(map(int,input().split()))
kai = 0
xy = abs(X)
if xy >= K*D:
kotae = abs(xy-(K*D))
if xy < K*D:
kai, mod = divmod(xy, D)
ds = kai*D
if (K-kai)%2==0:
kotae = abs(xy-ds)
if (K-kai)%2!=0:
kouho1 = abs(xy-ds-D)
kouho2 = abs(xy-ds+D)
if kouho1>=kouho2:
kotae = kouho2
if kouho1<kouho2:
kotae = kouho1
print(kotae)
|
p02584
|
X,K,D=list(map(int,input().split()))
X=abs(X)
a=min(K,X//D)
X-=a*D
K-=a
#print(X,K)
if K%2:
X=abs(X-D)
ans=X
print(ans)
|
X,K,D=list(map(int,input().split()))
X=abs(X)
a=min(K,X//D)
ans=X-a*D
if (K-a)%2:
ans=D-ans
print(ans)
|
p02584
|
x, k, d = list(map(int, input().split()))
cnt = abs(x) // d
x = abs(x)
if k % 2 == cnt % 2:
ans = min(abs(x - d * min(k,cnt)), abs(x + d * min(k,cnt)))
elif k % 2 != cnt % 2:
ans = min(abs(x - d * min(k,(cnt + 1))), abs(x - d * min(k,(cnt + 1))))
print(ans)
|
x, k, d = list(map(int, input().split()))
x, cnt = abs(x), abs(x) // d
if k % 2 == cnt % 2:
ans = abs(x - d * min(k,cnt))
elif k % 2 != cnt % 2:
ans = abs(x - d * min(k,(cnt + 1)))
print(ans)
|
p02584
|
x, k, d = list(map(int, input().split()))
x, cnt = abs(x), abs(x) // d
if k % 2 == cnt % 2:
ans = abs(x - d * min(k,cnt))
elif k % 2 != cnt % 2:
ans = abs(x - d * min(k,(cnt + 1)))
print(ans)
|
x, k, d = list(map(int, input().split()))
x, cnt = abs(x), abs(x) // d
ans = abs(x - d * min(k, cnt + (k % 2 != cnt % 2)))
print(ans)
|
p02584
|
def main():
x, k, d = list(map(int, input().split()))
x = abs(x)
count = x // d
if count > k:
ans = x - (k*d)
else:
if k % 2 == count % 2:
ans = x - (count*d)
else:
ans = x - (count+1) * d
print((abs(ans)))
if __name__ == '__main__':
main()
|
def main():
x, k, d = list(map(int, input().split()))
x = abs(x)
count = x // d
if count > k:
ans = x - (k*d)
else:
# if k % 2 == count % 2:
if (k - count) % 2 == 0:
ans = x - (count*d)
else:
ans = x - (count+1) * d
print((abs(ans)))
if __name__ == '__main__':
main()
|
p02584
|
import math
y, k, d = list(map(int, input().split()))
if y >= 0:
x = y
else:
x = -y
i = math.floor(x / d)
if i >= k:
p = x - k * d
elif i == x / d:
if i + k == 2 * int((i + k) / 2):
p = 0
else:
p = d
else:
if (2 * i + 1) * d == 2 * x:
p = x - i * d
else:
if i + k == 2 * int((i + k) / 2):
p = x - i * d
else:
p = (i + 1) * d - x
print((int(p)))
|
y, k, d = list(map(int, input().split()))
x = abs(y)
i = int(x / d)
if i >= k:
p = x - k * d
elif i == x / d:
if (i + k) % 2 == 0:
p = 0
else:
p = d
else:
if ((2 * i + 1) * d == 2 * x) or ((i + k) % 2 == 0):
p = x - i * d
else:
p = (i + 1) * d - x
print((int(p)))
|
p02584
|
X, K, D = list(map(int, input().split(" ")))
X = abs(X)
now = X
over_zero_step = 0
over_zero = 0
not_over_zero = now
flg = 0
for i in range(1, K+1):
if X < abs(K * D):
nxt = now - D
# print(nxt, i)
if nxt < 0:
over_zero = nxt
not_over_zero = now
over_zero_step = i
break
now = nxt
else:
remaining_step = 0
nearest_point = X - K * D
flg = 1
if flg == 0:
if abs(over_zero) <= not_over_zero:
nearest_point = over_zero
nearest_point_step = over_zero_step
next_nearest_point = not_over_zero
remaining_step = K - nearest_point_step
else:
nearest_point = not_over_zero
nearest_point_step = over_zero_step - 1
next_nearest_point = over_zero
remaining_step = K - nearest_point_step
#print("rem", remaining_step)
if remaining_step % 2 == 0:
print((abs(nearest_point)))
else:
print((abs(next_nearest_point)))
|
X, K, D = list(map(int, input().split(" ")))
X = abs(X)
now = X
over_zero_step = 0
over_zero = 0
not_over_zero = now
flg = 0
if X < abs(K * D):
q = X // D
now = X - q * D
now = abs(now)
# print(now, q)
for i in range(q+1, K+1):
nxt = now - D
if nxt < 0:
over_zero = nxt
not_over_zero = now
over_zero_step = i
break
now = nxt
else:
remaining_step = 0
nearest_point = X - K * D
flg = 1
if flg == 0:
if abs(over_zero) <= not_over_zero:
nearest_point = over_zero
nearest_point_step = over_zero_step
next_nearest_point = not_over_zero
remaining_step = K - nearest_point_step
else:
nearest_point = not_over_zero
nearest_point_step = over_zero_step - 1
next_nearest_point = over_zero
remaining_step = K - nearest_point_step
#print("rem", remaining_step)
if remaining_step % 2 == 0:
print((abs(nearest_point)))
else:
print((abs(next_nearest_point)))
|
p02584
|
X, K, D = list(map(int, input().split()))
if int(abs(X) / D) < K:
if abs(X) < abs(X) % D:
if K % 2 == 0:
print((abs(X)))
else:
print((min(abs(X - D), abs(X + D))))
else:
if int(K - int(abs(X) / D)) % 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))
|
X, K, D = list(map(int, input().split()))
if int(abs(X) / D) < K:
if int(K - int(abs(X) / D)) % 2 == 0:
print((abs(X) % D))
else:
print((abs(abs(X) % D - D)))
else:
print((abs(X) - D * K))
|
p02584
|
x, k, d = list(map(int, input().split()))
for i in range(k):
if abs(x+d) < abs(x-d):
if abs(x)<abs(x+d):
if (k-i)%2 == 0:
break;
else:
x = x+d
break
x = x+d
else:
if abs(x)<abs(x-d):
if (k-i)%2 == 0:
break;
else:
x = x-d
break
x = x-d
print((abs(x)))
|
x, k, d = list(map(int, input().split()))
x = abs(x)
s = int(x/d)
ans = x%d
if k < s:
print((x-d*k))
else:
if ans < -ans+d:
if (k-s)%2 == 0:
print(ans)
else:
print((-ans+d))
else:
if (k-s)%2 == 0:
print(ans)
else:
print((-ans+d))
|
p02584
|
x, k, d = list(map(int, input().split()))
cur = abs(x) # 座標を正にしてしまいます
rem = k # 残りの移動回数です
cnt = min(cur // d, k) # 0に向かって移動する回数です
cur -= d * cnt
rem -= cnt
# 残り回数が0回の場合分けをする必要はないのですが、一応
if rem > 0:
if rem % 2 == 1:
cur = abs(cur - d)
print(cur)
|
x, k, d = list(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
|
# -*- coding: utf-8 -*-
X,K,D=list(map(int,input().split()))
for ii in range(K):
if abs(X)<=D:
if (K-ii)%2==1:
if X>=0:
X-=D
else:
X+=D
break
elif X>=0:
X-=D
else:
X+=D
print((abs(X)))
|
# -*- coding: utf-8 -*-
X,K,D=list(map(int,input().split()))
X=abs(X)
ii=int(X/D)
if K<=ii:
X-=K*D
else:
X-=ii*D
if (K-ii)%2==1:
X-=D
print((abs(X)))
|
p02584
|
x,k,d=input().split()
x=int(x)
k=int(k)
d=int(d)
if(abs(x)>k*d):
print((abs(x)-k*d))
else:
for i in range(k):
x=abs(x)-d
if(x<1):
break
k=k-i-1
if(k==0):
print((abs(x)))
elif(k%2==0):
print((abs(x)))
else:
print((abs(x+d)))
|
x,k,d=input().split()
x=int(x)
k=int(k)
d=int(d)
if(abs(x)>k*d):
print((abs(x)-k*d))
else:
i=abs(x)//d
a=abs(x)%d
k=k-i
if(k==0):
print(a)
elif(k%2==0):
print(a)
else:
print((abs(a-d)))
|
p02584
|
x, k, d = list(map(int, input().split()))
# if x == 0:
# if k % 2 == 0:
# print(0)
# else:
# print(d)
if x >= 0:
if x >= k * d:
print((x - k * d))
else:
q, mod = divmod(x, d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
elif x < 0:
if abs(x) >= k * d:
print((abs(x + k * d)))
else:
q, mod = divmod(abs(x), d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
|
x, k, d = list(map(int, input().split()))
if x >= 0:
if x >= k * d:
print((x - k * d))
else:
q, mod = divmod(x, d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
else:
if abs(x) >= k * d:
print((abs(x) - k * d))
else:
q, mod = divmod(abs(x), d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
|
p02584
|
x, k, d = list(map(int, input().split()))
if x >= 0:
if x >= k * d:
print((x - k * d))
else:
q, mod = divmod(x, d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
else:
if abs(x) >= k * d:
print((abs(x) - k * d))
else:
q, mod = divmod(abs(x), d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
|
x, k, d = list(map(int, input().split()))
# if x >= 0:
if abs(x) >= k * d:
print((abs(x) - k * d))
else:
q, mod = divmod(x, d)
k -= q
if k % 2 == 0:
print(mod)
else:
print((abs(mod - d)))
# else:
# if abs(x) >= k * d:
# print(abs(x) - k * d)
# else:
# q, mod = divmod(abs(x), d)
# k -= q
# if k % 2 == 0:
# print(mod)
# else:
# print(abs(mod - d))
|
p02584
|
X,K,D = list(map(int, input().split()))
x = 0
if X == 0:
if K%2 == 0:
print((0))
else:
print((abs(D)))
x =1
elif X < 0:
if abs(X) >= K*D:
print((abs(X+K*D)))
x = 1
if x == 0:
for i in range (K):
X += D
if X >= 0:
if (K-i-1)%2 == 0:
print((abs(X)))
else:
print((abs(X-D)))
x = 1
break
else:
if X >= K*D:
print((X-K*D))
x = 1
if x == 0:
for i in range (K):
X -= D
if X < 0:
if (K-i)%2 == 0:
print((abs(X+D)))
else:
print((abs(X)))
x = 1
break
|
X,K,D = list(map(int, input().split()))
x = 0
if X == 0:
if K%2 == 0:
print((0))
else:
print((abs(D)))
x =1
elif X < 0:
if abs(X) >= K*D:
print((abs(X+K*D)))
else:
K = K-(-1*X//D)
X = X+(-1*X//D)*D
if K%2 == 0:
print((abs(X)))
else:
print((abs(X+D)))
else:
if X >= K*D:
print((X-K*D))
else:
K = K-(X//D)
X = X-(X//D)*D
if K%2 == 0:
print((abs(X)))
else:
print((abs(X-D)))
|
p02584
|
def abc175_c_2():
x, k, d = list(map(int, input().split()))
def solve(x, k, d):
# Xを絶対値でプラスの値にし、0に近づける問題に置き換える
x = abs(x)
# (x // d)は0の手前まで移動するのに必要な回数。kの方が小さい場合はk回移動してしまえばよい
if k < (x // d):
return x - (k * d)
# kのほうが大きい場合はそこから数回移動が必要
else:
# xからとりあえずx//d回は移動してOK
current_x = x - d * (x // d)
k = k - (x // d)
# 結局ここをfor文で探索すると時間がかかるので終わらない。(10**30回とか探索しちゃう。)
if (k % 2) == 0:
# 残りの移動回数が偶数回なら移動を繰り返してその場所に戻ってくる
return current_x
else:
# 奇数回の場合、偶数回移動を繰り返した後、もう一回だけ移動する。
# この時、current_xは0以上なので、マイナス方向に動けばOK
return abs(current_x - d)
ans = solve(x, k, d)
print(ans)
if __name__ == '__main__':
abc175_c_2()
|
def abc175_c_3():
x, k, d = list(map(int, input().split()))
def solve(x, k, d):
"""
https://atcoder.jp/contests/abc175/editorial/52
"""
x = abs(x)
straight = int(min(k, x / d))
k -= straight
x -= straight * d
if k % 2 == 0:
return x
else:
return abs(x - d)
ans = solve(x, k, d)
print(ans)
if __name__ == '__main__':
abc175_c_3()
|
p02584
|
[x,k,d] = [int(i) for i in input().split()]
tmp_diff = abs(x)
while tmp_diff > d and k > 0:
tmp_diff -= d
k -= 1
if k <= 0:
print(tmp_diff)
else:
if k % 2 == 0:
print(tmp_diff)
else:
print((d - tmp_diff))
|
[x,k,d] = [int(i) for i in input().split()]
x = abs(x)
if k < x//d:
print((x - k * d))
else:
k -= x // d
x -= (x // d) * d
if k % 2:
print((abs(x-d)))
else:
print(x)
|
p02584
|
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
def li():
return [int(x) for x in input().split()]
X, K, D = li()
if X < 0:
X *= -1
ans = 0
if K * D < X:
#print("A")
ans = X - K * D
else:
over_K = X // D + 1
#print(over_K)
if (K - over_K) % 2 == 1:
#print("B")
ans = X % D
else:
#print("C")
ans = D - (X % D)
print(ans)
|
def li():
return [int(x) for x in input().split()]
x, k, d = li()
x = abs(x)
if k * d < x:
ans = x - k * d
print(ans)
exit()
xr = x % d
xl = xr - d
r_parity = (x - xr) // d % 2
k_parity = k % 2
if r_parity == k_parity:
print(xr)
else:
print((abs(xl)))
|
p02584
|
X, K, D = list(map(int, input().split()))
X = abs(X)
while X >= D and K > 0 :
X -= D
K -= 1
if K % 2 == 0:
print(X)
else:
print((abs(X - D)))
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X >= K * D:
print((X - K * D))
elif X == D:
if K % 2 == 0:
print(X)
else:
print((abs(X - D)))
else:
K -= X // D
X = X % D
if K % 2 == 0:
print(X)
else:
print((abs(X - D)))
|
p02584
|
X,K,D = list(map(int,input().split()))
List = []
if abs(X) > K*D:
print((abs(X) - K*D))
elif K == 1:
print((min(abs(X-D),abs(X+D))))
elif K == 2:
print((min(abs(X+D+D),abs(X-D-D),abs(X))))
elif K == 3:
print((min(abs(X+D+D+D),abs(X+D),abs(X-D),abs(X-D-D-D))))
else:
for i in range(3):
if abs(X - D) >= abs(X+D):
List.append(abs(X+D))
X = X+D
else:
List.append(abs(X-D))
X = X-D
for i in range(K-3):
if List[i] == List[i+2]:
if K%2 == i%2:
print((List[i+1]))
else:
print((List[i]))
break
else:
if abs(X - D) >= abs(X+D):
List.append(abs(X+D))
X = X+D
else:
List.append(abs(X-D))
X = X-D
if len(List) == K:
print((List[K-1]))
else:
pass
|
X,K,D = list(map(int,input().split()))
t = abs(X) // D
s = abs(X) % D
if abs(X) > K*D:
print((abs(X) - K*D))
elif t%2 == K%2:
print(s)
else:
print((D-s))
|
p02584
|
def main():
X, K, D = list(map(int, input().split()))
if abs(X) > K * D:
print((abs(X) - K * D))
elif abs(X) <= K * D:
s = abs(X) // D
if abs(X) % D == 0:
if s % 2 == 0 and K % 2 == 0:
print((0))
elif s % 2 == 0 and K % 2 == 1:
print(D)
elif s % 2 == 1 and K % 2 == 0:
print(D)
elif s % 2 == 1 and K % 2 == 1:
print((0))
else:
if s % 2 == 0 and K % 2 == 0:
print((abs(X) - s * D))
elif s % 2 == 0 and K % 2 == 1:
print((abs(abs(X) - s * D - D)))
elif s % 2 == 1 and K % 2 == 0:
print((abs(abs(X) - s * D - D)))
elif s % 2 == 1 and K % 2 == 1:
print((abs(X) - s * D))
if __name__ == "__main__":
main()
|
def main():
X, K, D = list(map(int, input().split()))
ans = 0
if abs(X) >= K * D: # 0にたどり着かない or ちょうど0にたどり着く
ans = abs(X) - K * D
else: # 0を通り過ぎて往復する
s = abs(X) // D
if (K - s) % 2 == 0:
ans = abs(X) - s * D # abs(X) - s * D - 0
else:
ans = -abs(X) + (s + 1) * D # 0 - (abs(X) - (s + 1) * D)
print(ans)
if __name__ == "__main__":
main()
|
p02584
|
x,k,d = list(map(int,input().split()))
def judge():
if x > 0:
for r in range(d):
if (x - r)/d == (x - r)//d:
i = (x - r)//d
if (k - i)%2 == 0:
print(r)
else:
print((d-r))
exit()
else:
l = -x
for r in range(d):
if (l - r)/d == (l - r)//d:
i = (l - r)//d
if (k - i)%2 == 0:
print(r)
else:
print((d-r))
exit()
if x == 0:
if k%2 == 0:
print((0))
else:
print(d)
elif x < 0:
if k*d + x > 0:
judge()
else:
print((abs(k*d + x)))
else:
if x - k*d < 0:
judge()
else:
print((abs(x - k*d)))
|
x,k,d = list(map(int,input().split()))
def judge():
l = x if x > 0 else -x
i = l//d
r = l%d
if (k - i)%2 == 0:
print(r)
else:
print((d - r))
'''
if x > 0:
for r in range(d):
if (x - r)/d == (x - r)//d:
i = (x - r)//d
if (k - i)%2 == 0:
print(r)
else:
print(d-r)
exit()
else:
l = -x
for r in range(d):
if (l - r)/d == (l - r)//d:
i = (l - r)//d
if (k - i)%2 == 0:
print(r)
else:
print(d-r)
exit()
'''
if x == 0:
if k%2 == 0:
print((0))
else:
print(d)
elif x < 0:
if k*d + x > 0:
judge()
else:
print((abs(k*d + x)))
else:
if x - k*d < 0:
judge()
else:
print((abs(x - k*d)))
|
p02584
|
x,k,d=input().split()
x=int(x)
k=int(k)
d=int(d)
i=1
while i*d<=abs(x):
i+=1
if k<=i-1:
print((abs(x)-d*k))
else:
if (k-(i-1))%2==0:
print((abs(x)-d*(i-1)))
else:
print((abs(abs(x)-d*(i))))
|
x,k,d=input().split()
x=abs(int(x))
k=int(k)
d=int(d)
a=x//d
b=x-a*d
c=(x-b)/d
i=int(c)
if k<=i:
print((abs(x)-d*k))
else:
if (k-(i))%2==0:
print((abs(x)-d*(i)))
else:
print((abs(abs(x)-d*(i+1))))
|
p02584
|
x,k,d=list(map(int,input().split()))
x=abs(x)
sa=x//d
ans=x
pbk,mbk=0,0
bk1,bk2,bk3=1,1,1
mansbk,pansbk=0,0
if sa>=k:
ans=x-d*k
else:
ans=x-d*sa
k=k-sa
for i in range(k):
mansbk=abs(ans-d)
pansbk=abs(ans+d)
if mansbk!=pansbk:
ans=min(mansbk,pansbk)
if bk3!=1:
bk1=min(mansbk,pansbk)
bk2=max(mansbk,pansbk)
ans=1 if (k-i)%2==1 else bk1
break
elif ans==1:
bk3=max(mansbk,pansbk)
elif 2*x==d:
ans=0 if (k-i)%2==1 else x
break
else:
ans=0 if (k-i)%2==0 else d
break
pbk=max(mansbk,pansbk)
mbk=min(mansbk,pansbk)
print(ans)
|
x,k,d=list(map(int,input().split()))
x=abs(x)
sa=x//d
ans=x
pbk,mbk=0,0
bk1,bk2,bk3=1,1,1
mansbk,pansbk=0,0
if sa>=k:
ans=x-d*k
else:
ans=x-d*sa
k=k-sa
for i in range(k):
mansbk=abs(ans-d)
pansbk=abs(ans+d)
if mansbk!=pansbk:
ans=min(mansbk,pansbk)
if bk3!=1:
bk1=min(mansbk,pansbk)
bk2=max(mansbk,pansbk)
ans=mbk if (k-i)%2==0 else bk1
break
else:
bk3=max(mansbk,pansbk)
else:
ans=0 if (k-i)%2==0 else d
break
pbk=max(mansbk,pansbk)
mbk=min(mansbk,pansbk)
print(ans)
|
p02584
|
x,k,d=list(map(int,input().split()))
x=abs(x)
sa=x//d
ans=x
pbk,mbk=0,0
bk1,bk2,bk3=1,1,1
mansbk,pansbk=0,0
if sa>=k:
ans=x-d*k
else:
ans=x-d*sa
k=k-sa
for i in range(k):
mansbk=abs(ans-d)
pansbk=abs(ans+d)
if mansbk!=pansbk:
ans=min(mansbk,pansbk)
if bk3!=1:
bk1=min(mansbk,pansbk)
bk2=max(mansbk,pansbk)
ans=mbk if (k-i)%2==0 else bk1
break
else:
bk3=max(mansbk,pansbk)
else:
ans=0 if (k-i)%2==0 else d
break
pbk=max(mansbk,pansbk)
mbk=min(mansbk,pansbk)
print(ans)
|
x,k,d=list(map(int,input().split()))
x=abs(x)
m=min(k,x//d)
x-=d*m
k-=m
k%=2
x-=d*k
print((abs(x)))
|
p02584
|
X, K, D = list(map(int, input().split()))
X=abs(X)
if D>=X and K%2==0:
ans=X
elif D>=X and K%2==1:
ans=D-X
elif D<X and K*D<X:
ans=X-K*D
else:
ans=min(X,K*D-X)
for i in range(0,K):
ans=ans-D
if ans<0 and (K-i)%2==0:
ans=ans+D
break
elif ans<0 and (K-i)%2==1:
ans=-ans
break
print(ans)
|
X, K, D = list(map(int, input().split()))
X=abs(X)
if D>=X and K%2==0:
ans=X
elif D>=X and K%2==1:
ans=D-X
elif D<X and K*D<X:
ans=X-K*D
else:
ans=X%D
if (X-ans)%2!=K%2:
ans=D-ans
print(ans)
|
p02584
|
X,K,D = list(map(int, input().split()))
co = 0
ans = abs(X)
while abs(ans) > D/2 and (K - co) > 0:
ans = abs(ans) - D
co += 1
if (K - co) % 2 == 0:
print((abs(ans)))
else:
ans = abs(ans) - D
print((abs(ans)))
|
X,K,D = list(map(int, input().split()))
co,ans = divmod(abs(X),D)
if (K - co) > 0:
if (K - co) % 2 == 0:
pass
else:
ans = abs(ans) - D
else:
ans = abs(X) - K*D
print((abs(ans)))
|
p02584
|
import sys
input = sys.stdin.readline
def main():
x, k, d = list(map(int, input().split()))
if x < 0:
step = abs(x) // d
if step >= k:
ans = abs(x + k*d)
else:
residue = k - step
residue %= 2
ans = abs(x + (step+residue)*d)
elif x == 0:
k %= 2
ans = k * d
else:
step = abs(x) // d
if step >= k:
ans = abs(x - k*d)
else:
residue = k - step
residue %= 2
ans = abs(x - (step+residue)*d)
print(ans)
if __name__ == "__main__":
main()
|
import sys
input = sys.stdin.readline
def main():
x, k, d = list(map(int, input().split()))
x = abs(x)
step = x // d
if step >= k:
ans = x - d * k
print(ans)
return
k -= step
x = x - step * d
k %= 2
ans = abs(x - d*k)
print(ans)
if __name__ == "__main__":
main()
|
p02584
|
[_x, _k, _d] = list(map(int, input().split(" ")))
_x = abs(_x)
while _k > 0:
if _x >= _d:
_x = abs(_x - _d)
_k -= 1
else:
if _k % 2 == 1:
_x = abs(_x - _d)
_k = 0
print(_x)
|
[_x, _k, _d] = list(map(int, input().split(" ")))
_x = abs(_x)
if _x >= _d:
_y = _x//_d
if _k < _y:
_y = _k
_x = abs(_x - _d * _y)
_k -= _y
if _k % 2 == 1:
_x = abs(_x - _d)
print(_x)
|
p02584
|
x, k, d = list(map(int, input().split()))
x_pre = x
while k > 0:
if x >= 0:
x -= d
else:
x += d
if abs(x) >= abs(x_pre):
if k % 2 == 0:
print((abs(x_pre)))
exit()
else:
print((abs(abs(x_pre) - d)))
exit()
else:
x_pre = x
k -= 1
print((abs(x_pre)))
|
x, k, d = list(map(int, input().split()))
x_pre = x
y = abs(x) - k*d
if y >= 0:
print(y)
exit()
while k > 0:
if x >= 0:
x -= d
else:
x += d
if abs(x) >= abs(x_pre):
if k % 2 == 0:
print((abs(x_pre)))
exit()
else:
print((abs(abs(x_pre) - d)))
exit()
else:
x_pre = x
k -= 1
print((abs(x_pre)))
|
p02584
|
import sys
def input():
return sys.stdin.readline().rstrip()
def main():
X,K,D =list(map(int,input().split()))
ans =10**19
if X >= K*D:
print((X-K*D))
elif -X>= K*D:
print((-X - K*D))
else:
X =abs(X)
c =X//D
if (K-c)%2 ==0:
print((X-c*D))
else:
print((D*(c+1)-X))
if __name__ == "__main__":
main()
|
import sys
def input():
return sys.stdin.readline().rstrip()
def main():
X,K,D =list(map(int,input().split()))
X= abs(X)
if X >= K*D:
print((X-K*D))
else:
c =X//D
if (K-c)%2 ==0:
print((X-c*D))
else:
print((D*(c+1)-X))
if __name__ == "__main__":
main()
|
p02584
|
x,k,d=list(map(int,input().split()))
if x<=0:
x=x*(-1)
if d>=x:
if k%2==0:
print(x)
exit()
else:
print((d-x))
exit()
else:
if x//d>=k and x>d:
print((x-k*d))
exit()
elif x<=d:
if k%2==0:
print(x)
exit()
else:
print((d-x))
exit()
else:
if (x//d)%2==k%2:
print((x%d))
exit()
else:
print((d-x%d))
exit()
|
x,k,d=list(map(int,input().split()))
if x<=0:
x*=-1
mi=x//d
if mi>=k:
print((x-k*d))
exit()
else:
if (mi-k)%2==0:
print((x-mi*d))
else:
print((abs(x-mi*d-d)))
|
p02584
|
X,K,D=list(map(int,input().split()))
a=round(abs(X/D))
if K<a:
print((abs(abs(X)-K*abs(D))))
elif (K-a)%2==0:
l=[]
l.append(abs(abs(X)-a*abs(D)))
l.append(abs(abs(X)-(a+2)*abs(D)))
l.append(abs(abs(X)-(a-2)*abs(D)))
print((min(l)))
elif (K-a)%2!=0:
l=[]
l.append(abs(abs(X)-(a+1)*abs(D)))
l.append(abs(abs(X)-(a-1)*abs(D)))
print((min(l)))
|
x,k,d=list(map(int,input().split()))
if abs(x) >= k*d:
print((abs(x)-k*d))
else:
just=abs(x)//d
if (k-just)%2==0:
print((min(abs(abs(x)-just*d),abs(abs(x)-(just+2)*d))))
else:
print((min(abs(abs(x)-(just+1)*d),abs(abs(x)-(just-1)*d))))
|
p02584
|
x, k, d = list(map(int, input().split()))
mind = 1000000000000000
c = 0
while k > 0:
k -= 1
if abs(x - d - 0) <= abs(x + d - 0):
x -= d
else:
x += d
if abs(x) == mind:
break
mind = min(mind, abs(x))
if k%2 == 0 or k == 0:
print((abs(mind - 0)))
else:
mind = min(abs(mind + d - 0), abs(mind - d - 0))
print(mind)
|
x, k, d = list(map(int, input().split()))
x = abs(x)
if (x - k*d) >= 0:
x -= k*d
else:
k -= int(x/d)
x -= int(x/d) * d
if (k%2) != 0:
x -= d
print((abs(x)))
|
p02584
|
X, K, D = list(map(int, input().split()))
ans = 1000000000000007
prev = 1000000000000007
if K % 2 == 0:
i = K // 2
for k in range(0, i+1):
mn = abs(X + k * D * 2)
if prev < mn:
break
prev = mn
ans = abs(min(mn, ans))
prev = 1000000000000007
for k in range(0, i+1):
mn = abs(X - k * D * 2)
if prev < mn:
break
prev = mn
ans = abs(min(mn, ans))
else:
for k in range(1, K+1, 2):
mn = abs(X + k * D)
if prev < mn:
break
prev = mn
ans = abs(min(mn, ans))
prev = 1000000000000007
for k in range(1, K+1, 2):
mn = abs(X - k * D)
if prev < mn:
break
prev = mn
ans = abs(min(mn, ans))
print(ans)
|
X,K,D = list(map(int,input().split()))
if X<0:
X *= -1
n = X//D
m = min(K,n)
X -= m*D
K -= m
if K%2:
print((abs(X-D)))
else:
print(X)
|
p02584
|
x, k, d = list(map(int, input().split()))
x = abs(x)
if x > k * d:
print((x - k * d))
else:
g = k - int(x / d)
if g > 0:
if g % 2 == 1:
g -= 1
k = k - g
for i in range(k):
if x < 0:
x += d
else:
x -= d
print((abs(x)))
|
x, k, d = list(map(int, input().split()))
x = abs(x)
if x > k * d:
print((x - k * d))
else:
f = int(x / d)
x = x - f * d
g = (k - f) % 2
if g == 1:
x = x - d
print((abs(x)))
|
p02584
|
x,k,d = list(map(int,input().split()))
an = x
if x < 0:
x = -x
if x-d*k >= 0:
an = x-d*k
else:
for i in range(k):
if x > 0:
x -= d
else:
x += d
if an > abs(x) or i==0:
an = x
else:
if (k-i-1)%2 == 0:
an = x
break
print((abs(an)))
|
x,k,d = list(map(int,input().split()))
an = x
if x < 0:
x = -x
if k <= x/d:
an = x-d*k
else:
if (k-x//d)%2==0:
an = x-d*(x//d)
else:
an = x-d*(x//d)-d
print((abs(an)))
|
p02584
|
X, K, D = list(map(int, input().split()))
X_a = abs(X)
if X_a - K * D > D:
print((X_a - K * D))
else:
while X_a >= D:
X_a -= D
K -= 1
if K % 2 == 0:
print(X_a)
else:
print((abs(X_a-D)))
|
X, K, D = list(map(int, input().split()))
X_a = abs(X)
if X_a - K * D > D:
print((X_a - K * D))
else:
K -= X_a // D
X_a = X_a % D
while X_a >= D:
X_a -= D
K -= 1
if K % 2 == 0:
print(X_a)
else:
print((abs(X_a-D)))
|
p02584
|
import sys
si = sys.stdin.readline
def main():
[x, k, d] = [int(e) for e in si().split()]
if x == 0:
if k % 2 == 0:
print((0))
else:
print((abs(d)))
elif x < 0:
while x < 0 and k:
x += d
k -= 1
if k > 0:
if k % 2:
print((abs(x-d)))
else:
print(x)
else:
print((abs(x)))
else:
while x > 0 and k:
x -= d
k -= 1
if k > 0:
if k % 2:
print((x+d))
else:
print((abs(x)))
else:
print((abs(x)))
if __name__ == '__main__':
main()
|
import sys
si = sys.stdin.readline
def main():
[x, k, d] = [int(e) for e in si().split()]
if x == 0:
if k % 2 == 0:
print((0))
else:
print((abs(d)))
elif x < 0:
mul = (0-x)//d
if k <= mul:
x += d*k
print((abs(x)))
return
else:
x += d*mul
k -= mul
while x < 0 and k:
x += d
k -= 1
if k > 0:
if k % 2:
print((abs(x-d)))
else:
print(x)
else:
print((abs(x)))
else:
mul = (x-0)//d
if k <= mul:
x -= d*k
print(x)
return
else:
x -= d*mul
k -= mul
while x > 0 and k:
x -= d
k -= 1
if k > 0:
if k % 2:
print((x+d))
else:
print((abs(x)))
else:
print((abs(x)))
if __name__ == '__main__':
main()
|
p02584
|
l=list(map(int,input().split()))
x=l[0]
k=l[1]
d=l[2]
x1=abs(x)
cou=0
while x1>0:
x1-=d
cou+=1
if k<cou:
x2=abs(x)-k*d
print(x2)
# if x<=0:
# x3=x2*(-1)
# print(x3)
# else:
# print(x2)
else:
a=cou%2
b=k%2
x4=x1*(-1)
if a==b:
print((abs(x1)))
if a!=b:
print((x1+d))
|
l=list(map(int,input().split()))
x=l[0]
k=l[1]
d=l[2]
x1=abs(x)
cou=x1//d
cou+=1
x1=x1-d*cou
# while x1>0:
# x1-=d
# cou+=1
if k<cou:
x2=abs(x)-k*d
print(x2)
else:
a=cou%2
b=k%2
x4=x1*(-1)
if a==b:
print((abs(x1)))
if a!=b:
print((x1+d))
|
p02584
|
X,K,D = list(map(int,input().split()))
X = abs(X)
cnt = 0
if X == 0:
if K%2==0:
ans = 0
elif K%2==1:
ans = D
elif X >= K*D:
ans = X-K*D
else:
while K > cnt:
X = X - D
cnt += 1
if X<=0:
if (K-cnt)%2 == 0:
ans = abs(X)
break
elif (K-cnt)%2 == 1:
ans = abs(X+D)
break
ans = X
print((abs(ans)))
|
X,K,D = list(map(int,input().split()))
X = abs(X)
if X >= K*D:
ans = X-K*D
else:
x = X//D
if (K - x)%2 == 0:
ans = X - x*D
else:
ans = abs(X - x*D -D)
print(ans)
|
p02584
|
x, k, d = list(map(int, input().split()))
# print(x,k,d)
x = abs(x)
if x <= d:
if k%2:
print((d-x))
else:
print(x)
exit()
c = min(x//d, k)
x -= d*c
k -= c
if k%2:
print((abs(d-x)))
else:
print(x)
|
x, k, d = list(map(int, input().split()))
x = abs(x)
if x > d:
c = min(x//d, k)
x -= d*c
k -= c
if k%2: x = d - x
print(x)
|
p02584
|
x, k, d = list(map(int, input().split()))
if x == 0:
if k % 2 == 0:
print((0))
else:
print(d)
else:
a = abs(x) // d
b = abs(x) % d
if a >= k:
print((abs(x) - (d * k)))
else:
if (k - a) % 2 == 0:
print((abs(b)))
else:
print((abs(b - d)))
|
x, k, d = list(map(int, input().split()))
a = abs(x) // d
b = abs(x) % d
if a >= k:
print((abs(x) - (d * k)))
else:
if (k - a) % 2 == 0:
print((abs(b)))
else:
print((abs(b - d)))
|
p02584
|
x,k,d = list(map(int, input().split()))
lists = []
x = abs(x)
step = int(x/d)
if step >= k:
answer = x - k * d
elif step < k:
k_left = k - int(step)
if k_left % 2 == 0:
answer = x % d
if k_left % 2 == 1:
answer = abs(x - step * d - d)
print(answer)
|
x,k,d = list(map(int, input().split()))
lists = []
x = abs(x)
step = int(x/d)
if step >= k:
answer = x - k * d
elif step < k:
k_left = k - int(step)
if k_left % 2 == 0:
answer = x % d
if k_left % 2 == 1:
answer = min(abs(x % d - d), abs(x % d + d))
print(answer)
|
p02584
|
Xa, K, D = list(map(int, input().split()))
X = abs(Xa)
Xs = X // D
Xm = X % D
if K < Xs:
# print("A")
print((abs(X-K*D)))
# elif Xa == 0:
# if K % 2 == 0:
# print(0)
# else:
# print(D)
# elif Xm == 0:
# if K % 2 == 0:
# print(D)
# else:
# print(0)
elif ((K-Xs) % 2 == 0):
print((abs(Xm)))
else:
print((abs(D-Xm)))
# else:
# # print(abs(D-K))
# if ((K-Xs) % 2 == 0):
# print(abs(D-K))
# else:
# print(abs(D-Xm))
|
X, K, D = list(map(int, input().split()))
Xa = abs(X)
Xs = Xa // D
Xm = Xa % D
if (K <= Xs):
print((abs(Xa-D*K)))
elif (K-Xs) % 2 == 0:
print((abs(Xm)))
else:
print((abs(D-Xm)))
|
p02584
|
X,K,D=list(map(int,input().split()))
x=min(K,abs(X)//D)
if X>0:
X_=X-(D*x)
else:
X_=X+(D*x)
k=K-x
if k%2!=0:
ans=min(abs(X_-D),abs(X_+D))
else:
ans=abs(X_)
print(ans)
|
X,K,D=list(map(int,input().split()))
X=abs(X)
k=min(K,X//D)
X_=X-(k*D)
K_=K-k
if K_%2!=0:
ans=min(abs(X_-D),abs(X_+D))
else:
ans=abs(X_)
print(ans)
|
p02584
|
x,k,d = list(map(int, input().split()))
line = [x]
if abs(x) >= k*d:
print((abs(x) - k*d))
else:
for i in range(k):
if x > 0:
x -= d
else:
x += d
line.append(x)
if i != 0:
if line[i-1] == line[i+1]:
if (k - i + 1) % 2 == 0:
x = line[i+1]
break
else:
x = line[i]
break
print((abs(x)))
|
x,k,d = list(map(int, input().split()))
count = abs(x) // d
if count >= k:
print((abs(x)-k*d))
else:
if (k - count) % 2 == 0:
print((abs(x)-count*d))
else:
print((abs(abs(x)-(count+1)*d)))
|
p02584
|
X, K, D = list(map(int, input().split()))
if X == D:
if K % 2 != 0:
print('0')
else:
print(D)
else:
if K * D < X:
print((X - K * D))
else:
for i in range(K):
if X >= 0:
X = X - D
else:
X = X + D
print((abs(X)))
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X == D:
if K % 2 != 0:
print('0')
else:
print(D)
else:
span = X // D
if span < K:
if (K - span) % 2 == 0:
print((X % D))
else:
print((abs(X % D - D)))
else:
print((X - K * D))
|
p02584
|
def resolve():
X, K, D = list(map(int, input().split()))
count = min(abs(X//D), K)
for i in range(count):
if X > 0:
X -= D
else:
X += D
K -= 1
if K > 0:
if K%2 == 0:
print((abs(X)))
else:
print((D-abs(X)))
else:
print((abs(X)))
resolve()
|
def resolve():
X, K, D = list(map(int, input().split()))
count = min(abs(X//D), K)
if X > 0:
X -= D*count
else:
X += D*count
K -= count
if K > 0:
if K%2 == 0:
print((abs(X)))
else:
print((D-abs(X)))
else:
print((abs(X)))
resolve()
|
p02584
|
X , K ,D = list(map(int, input().split()))
if X>0:
for k in range(K):
bx = X
X-=D
if X<=0:
break
else:
for k in range(K):
bx = X
X+=D
if X>=0:
break
if K == k + 1 or (K-k-1)%2==0:
print((abs(X)))
else:
print((abs(bx)))
|
X , K ,D = list(map(int, input().split()))
if X>0:
S = int(abs(X) / D)
aX = X -D * S
if S>=K:
print((X-D*K))
elif (K-S)%2==0:
print((abs(aX)))
else:
print((abs(aX-D)))
else:
S = int(abs(X) / D)
aX = X + D * S
if S>=K:
print((abs(X+D*K)))
elif (K-S)%2==0:
print((abs(aX)))
else:
print((abs(aX+D)))
|
p02584
|
X, K, D = list(map(int, input().split()))
if X == 0 and K%2 == 0:
print((0))
elif X == 0 and K%2 == 1:
print((abs(D)))
elif X > 0 and X - D*K >= 0:
print((X - D*K))
elif X < 0 and X + D*K <= 0:
print((abs(X + D*K)))
else:
i = abs(X)//D
if (K - i) % 2 == 0:
print((abs(X)%D))
else:
print((abs(abs(X)%D-D)))
|
X, K, D = list(map(int, input().split()))
if abs(X) - D*K >= 0:
print((abs(X) - D*K))
else:
i = abs(X)//D
if (K - i) % 2 == 0:
print((abs(X)%D))
else:
print((abs(abs(X)%D-D)))
|
p02584
|
X, K, D = list(map(int, input().split()))
if(X > 0):
if(X-K*D >= 0):
print((X-K*D))
else:
while(X >= 0):
X = X-D
K -= 1
if(K % 2 == 0):
print((abs(X)))
else:
print((abs(X+D)))
elif(X < 0):
if((X+K*D) <= 0):
print((abs(X+K*D)))
else:
while(X <= 0):
X = X+D
K -= 1
if(K % 2 == 0):
print((abs(X)))
else:
print((abs(X-D)))
else:
if(K % 2 == 0):
print((0))
else:
print((abs(D)))
|
X, K, D = list(map(int, input().split()))
if(X > 0):
if(X-K*D >= 0):
print((X-K*D))
else:
l = X//D
X = X-D*(l+1)
K = K-l-1
if(K % 2 == 0):
print((abs(X)))
else:
print((abs(X+D)))
elif(X < 0):
if((X+K*D) <= 0):
print((abs(X+K*D)))
else:
l = -X//D
X = X + D*(l+1)
K = K-l-1
if(K % 2 == 0):
print((abs(X)))
else:
print((abs(X-D)))
else:
if(K % 2 == 0):
print((0))
else:
print((abs(D)))
|
p02584
|
[X, K, D] = list(map(int, input().split()))
X = abs(X)
Y = K%2
for i in range(K):
X -= D
if X<0:
if (i+1)%2 != Y:
X += D
else:
X = abs(X)
break
print(X)
|
[X, K, D] = list(map(int, input().split()))
X = abs(X)
Y = K%2
if X//D < K:
if (X//D)%2 == Y:
X = X%D
else:
X = D-X%D
else:
X=X-K*D
print(X)
|
p02584
|
X, K, D = list(map(int, input().split()))
X = abs(X)
for i in range(K):
X_ = min(X, abs(X-D))
if X == X_:
X = abs(X_ - (K - i)%2*D)
break
X = X_
print(X)
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X // D <= K:
print((min(abs(X % D - (K - (X // D))%2*D), abs(X % D + (K - (X // D))%2*D))))
else:
print((min(abs(X - K*D), abs(X + K*D))))
|
p02584
|
s = input().split()
X=int(s[0])
K=int(s[1])
D=int(s[2])
q, mod = divmod(X, D)
if q < 0:
q = -q
if 2*mod < D:
if K < q:
if X > 0:
m = X - D*K
else:
m = X + D*K
else:
restmovement = (K-q)%2
if restmovement==0:
m = mod
else:
m = D - mod
else:
if X > 0:
if K < q+1:
m = X - D*K
else:
restmovement = (K - q - 1)%2
if restmovement==0:
m = D - mod
else:
m = mod
else:
if K < q-1:
m=X - D*K
else:
restmovement = (K+1-q)%2
if restmovement==0:
m = D-mod
else:
m = mod
if m < 0:
print((-m))
else:
print(m)
|
X, K ,D = input().split()
X = abs(int(X))
K = int(K)
D = int(D)
Q, mod = divmod(X, D)
if K < Q:
ans = X - K*D
else:
Rest = (K - Q)%2
if Rest == 0:
ans = mod
else:
ans = D - mod
print(ans)
|
p02584
|
# AtCoder Beginner Contest 175
# C - Walking Takahashi
X,K,D =list(map(int,input().split()))
KOE=K%2
A=abs(X)//D
M=abs(X)%D
# print(A)
if K<=A:
print((abs(X)-K*D))
exit()
else :
if A%2==KOE:
print(M)
else :
print((min(abs(M+D),abs(M-D))))
|
# AtCoder Beginner Contest 175
# C - Walking Takahashi
X,K,D =list(map(int,input().split()))
X=abs(X)
A=X//D
M=X%D
if K<=A:
print((X-K*D))
exit()
else :
if A%2==K%2:
print(M)
else :
print((min(abs(M+D),abs(M-D))))
|
p02584
|
dates = [int(i) for i in input().split(" ")]
X = dates[0]
K = dates[1]
D = dates[2]
if X >= 0:
while X > 0 and K > 0:
X -= D
K -= 1
else:
while X <= 0 and K > 0:
X += D
K -= 1
if X >= 0:
if K % 2 == 0:
print((abs(X)))
else:
print((abs(X - D)))
else:
if K % 2 == 0:
print((abs(X)))
else:
print((abs(X + D)))
|
import math
dates = [int(i) for i in input().split(" ")]
X = dates[0]
K = dates[1]
D = dates[2]
numDiv = math.ceil(abs(X) / D)
if numDiv < K:
if X >= 0:
X -= numDiv * D
K -= numDiv
else:
X += numDiv * D
K -= numDiv
else:
if X >= 0:
X -= K * D
K = 0
else:
X += K * D
K = 0
if X >= 0:
if K % 2 == 0:
print((abs(X)))
else:
print((abs(X - D)))
else:
if K % 2 == 0:
print((abs(X)))
else:
print((abs(X + D)))
|
p02584
|
from collections import deque
X, K, D = list(map(int, input().split()))
# loopに入ったらおしまい
record = deque([X,])
finished = False
while K > 0:
if X > 0:
X -= D
else:
X += D
record.append(X)
if len(record) > 3:
record.popleft()
if record[0] == record[-1]:
if K % 2 == 0:
print((abs(record[1])))
else:
print((abs(record[0])))
finished = True
break
K -= 1
if not finished:
print((abs(X)))
|
from collections import deque
X, K, D = list(map(int, input().split()))
# まずは何回目で符号が逆転するかを算出
num_reverse = abs(X) // D + 1
if num_reverse > K:
print((abs(X) - (K * D)))
else:
K -= num_reverse
ans = abs(X) - (num_reverse * D)
if K % 2 == 0:
print((abs(ans)))
else:
print((abs(abs(ans) - D)))
|
p02584
|
x,k,d=list(map(int,input().split()))
x=abs(x)
if x-k*d>=0:
print((x-k*d))
else:
a=x
while a>d:
a-=d
k-=1
if k%2==0:
print((min(a,2*d-a)))
else:
print((min(d-a,a+d)))
|
x,k,d=list(map(int,input().split()))
x=abs(x)
if x-k*d>=0:
print((x-k*d))
else:
n=x//d
k-=n
a=x-n*d
if k%2==0:
print((min(a,2*d-a)))
else:
print((min(d-a,a+d)))
|
p02584
|
# ABC172 C - Walking Takahashi
X,K,D=list(map(int,input().split()))
q=abs(X)//D
if q>K:
print((abs(X)-K*D))
else:
if (K-q)%2==0:
print((abs(X)-q*D))
else:
print((abs(abs(X)-(q+1)*D)))
|
# ABC172 C - Walking Takahashi
X,K,D=list(map(int,input().split()))
X=abs(X)
q=X//D
if q>K:
print((X-K*D))
else:
if (K-q)%2==0:
print((X-q*D))
else:
print((-X+(q+1)*D))
|
p02584
|
x, k, d = list(map(int, input().split()))
if x < 0:
x *= -1
cnt = 0
while x > 0 and cnt < k:
x -= d
cnt += 1
if abs(x) < x+d:
x += d
cnt -= 1
x -= d * ((k-cnt)%2)
else:
x += d * ((k-cnt)%2)
print((abs(x)))
|
x, k, d = list(map(int, input().split()))
if x < 0:
x *= -1
cnt = min(k, x//d+1)
x -= cnt * d
if abs(x) < x+d:
x += d
cnt -= 1
x -= d * ((k-cnt)%2)
else:
x += d * ((k-cnt)%2)
print((abs(x)))
|
p02584
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X >= D * K:
print((X - D * K))
else:
K -= int(X / D)
for i in range(0, int(X/D)):
X -= D
if K % 2:
print((D - X))
else:
print(X)
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X >= D * K:
print((X - D * K))
else:
K -= int(X / D)
# for i in range(0, int(X/D)):
# X -= D
X %= D
if K % 2:
print((D - X))
else:
print(X)
|
p02584
|
x, k, d = list(map(int, input().split()))
# 0をまたぐかで場合わけ
if x == 0:
if k % 2 == 0:
print((0))
else:
print(d)
exit()
x = abs(x)
if x-k*d <= 0:
# 0をまたぐ
a, b = divmod(x, d)
if (k-a) % 2 == 0:
print(b)
else:
print((min(b+d, d-b)))
else:
# 0をまたがない
print((x-k*d))
|
x, k, d = list(map(int, input().split()))
x = abs(x)
MIN = x-k*d
if 0 <= MIN:
print(MIN)
else:
a, R = divmod(x, d)
L = d-R
cnt = k-a
if cnt % 2 == 0:
print(R)
else:
print(L)
|
p02584
|
# import sys
# import math #sqrt,gcd,pi
# import decimal
# import queue # queue
# import bisect
# import heapq # priolity-queue
# import time
# from itertools import product,permutations,\
# combinations,combinations_with_replacement
# 重複あり順列、順列、組み合わせ、重複あり組み合わせ
# import collections # deque
# from operator import itemgetter,mul
# from fractions import Fraction
# from functools import reduce
mod = int(1e9+7)
# mod = 998244353
INF = 1<<50
def readInt():
return list(map(int,input().split()))
def main():
x,k,d = readInt()
count = abs(x) // d
mn = 0
if count>k:
mn = abs(x) - (d * k)
print(mn)
return
else:
mn = abs(x) % d
ans = INF
if (k-count)%2==0:
ans = mn
else:
ans = abs(mn-d)
print(ans)
return
if __name__=='__main__':
main()
|
X,K,D = list(map(int,input().split()))
# 原点に近い位置までの移動回数を求める
count = abs(X) // D
ans = 0
if count>K:
ans = abs(X) - D * K
else:
if (K-count)%2==0:
ans = abs(X) % D
else:
ans = abs(abs(X) % D - D)
print(ans)
|
p02584
|
X, K, D = list(map(int, input().split()))
if abs(X) <= D * K:
for i in range(K):
a = abs(X) - (D * (i + 1))
b = abs(X) - (D * i)
if a < 0:
break
if abs(a) < abs(b):
c = K - (i + 1)
if c % 2 == 0:
if 0 <= X:
goal = a
else:
goal = -a
else:
if 0 <= X:
goal = b
else:
goal = -b
if abs(b) <= abs(a):
c = K - i
if c % 2 == 0:
if 0 <= X:
goal = b
else:
goal = -b
else:
if 0 <= X:
goal = a
else:
goal = -a
else:
if 0 <= X:
goal = X - D * K
else:
goal = X + D * K
print((abs(goal)))
|
X, K, D = list(map(int, input().split()))
if abs(X) < (K * D):
a = abs(X) % D
b = abs(D - a)
c = abs(X) // D + 1
if (K - c) % 2 == 0:
goal = b
else:
goal = a
else:
goal = abs(X) - ( D * K )
print(goal)
|
p02584
|
X,K,D = list(map(int,input().split()))
X = abs(X)
if X-K*D>=0:
print((X-K*D))
else:
while(X > 0 and K > 0):
K = K-1
X = X-D
if K % 2 == 0:
print((abs(X)))
else:
X = X+D
print(X)
|
X,K,D = list(map(int,input().split()))
X = abs(X)
N = X//D
if N>K:
N=K
X = X-N*D
K -= N
if K%2 == 0:
print(X)
else:
X -= D
print((abs(X)))
|
p02584
|
x, k, d = list(map(int, input().split()))
past1_x = 0
past2_x = 0
result = 0
for i in range(k):
past2_x = past1_x
past1_x = x
if x > 0:
x -= d
else:
x += d
if (past2_x == x and i != 0) or i == k - 1:
if (k - i) % 2 == 0:
result = abs(past1_x)
else:
result = abs(x)
break
print(result)
|
x, k, d = list(map(int, input().split()))
result = 0
abs_x = abs(x)
firstNearestIterNum = abs_x // d
if firstNearestIterNum >= k:
result = abs_x - (d * k)
else:
if (k - firstNearestIterNum) % 2 == 1:
result = abs_x - (d * (firstNearestIterNum + 1))
else:
result = abs_x - d * firstNearestIterNum
print((abs(result)))
|
p02584
|
X, K, D = list(map(int, input().split()))
X = abs(X)
final = -1
for n in range(K):
X = abs(X - D)
if X <= D / 2:
if (K-n) % 2 == 0:
final = abs(X-D)
break
else:
final = X
break
if final >= 0:
print(final)
else:
print(X)
|
X, K, D = list(map(int, input().split()))
X = abs(X)
final = -1
q, n = X % D, X // D
if n >= K:
print((X - K * D))
else:
if q <= X / 2:
if (K - n) % 2 == 0:
print(q)
else:
print((D - q))
else:
if (K - n) % 2 == 0:
print(q)
else:
print((D - q))
|
p02584
|
import sys
X,K,D= list(map(int,input().split()))
temp = X
for t in range(K):
# 絶対値の小さい方に移動
if abs(temp - D) < abs(temp + D):
temp = temp-D
else:
temp = temp+D
# 移動幅より小さくなったとき
if abs(temp) < D:
if (K-t-1) % 2 == 0:
print((abs(temp)))
sys.exit()
else:
if abs(temp - D) < abs(temp + D):
temp = temp-D
print((abs(temp)))
sys.exit()
else:
temp = temp+D
print((abs(temp)))
sys.exit()
print((abs(temp)))
|
import sys
X,K,D= list(map(int,input().split()))
temp = X
if abs(X) > K*D:
print((abs(X)-K*D))
sys.exit()
for t in range(K):
# 絶対値の小さい方に移動
if abs(temp - D) < abs(temp + D):
temp = temp-D
else:
temp = temp+D
# 移動幅より小さくなったとき
if abs(temp) < D:
if (K-t-1) % 2 == 0:
print((abs(temp)))
sys.exit()
else:
if abs(temp - D) < abs(temp + D):
temp = temp-D
print((abs(temp)))
sys.exit()
else:
temp = temp+D
print((abs(temp)))
sys.exit()
print((abs(temp)))
|
p02584
|
X, K, D = list(map(int, input().split()))
if X == 0:
print((0 if K % 2 == 0 else D))
elif X < 0:
div = abs(X) // D
tmp = X + D*div
if div >= K:
print((abs(X + D*K)))
elif div < K:
K -= div
print((abs(tmp) if K % 2 == 0 else abs(tmp+D)))
else:
div = abs(X) // D
tmp = X - D*div
if div >= K:
print((abs(X - D*K)))
elif div < K:
K -= div
print((abs(tmp) if K % 2 == 0 else abs(tmp-D)))
|
X, K, D = list(map(int, input().split()))
X = abs(X)
ans = 0
if X // D > K:
ans = X - D*K
else:
e = X // D
K -= e
X -= D * e
if K % 2 == 1: X = abs(X-D)
ans = X
print(ans)
|
p02584
|
X, K, D = list(map(int, input().split()))
X = abs(X)
ans = 0
if X // D > K:
ans = X - D*K
else:
e = X // D
K -= e
X -= D * e
if K % 2 == 1: X = abs(X-D)
ans = X
print(ans)
|
X, K, D = list(map(int, input().split()))
X = abs(X)
if X // D >= K:
print((X - D*K))
else:
e = X // D
K -= e
X -= D*e
if K % 2 == 1:
X = abs(X-D)
print(X)
|
p02584
|
x,k,d = list(map(int,input().split()))
tmp = abs(x) % d
cal = abs(x) // d
if tmp > abs(tmp - d):
cal += 1
tmp = abs(tmp - d)
if cal == k:
print(tmp)
elif cal > k:
print((abs(x) - k*d))
else:
if (k - cal) % 2 == 0:
print(tmp)
else:
print((min(abs(tmp-d),abs(tmp+d))))
|
x,k,d = list(map(int,input().split()))
ans = abs(x) % d
cal = abs(x) // d
if ans > abs(ans - d):
cal += 1
ans = abs(ans - d)
if cal > k:
ans = abs(x) - k*d
else:
if (k - cal) % 2 == 1:
ans = min(abs(ans-d),abs(ans+d))
print(ans)
|
p02584
|
X, K, D = list(map(int ,input().split()))
if K * D < abs(X):
ans = abs(X) - K * D
else:
if abs(X) // D % 2 == 0:
if K % 2 == 0:
ans = abs(X) % D
else:
ans = abs(abs(X) % D - D)
else:
if K % 2 == 0:
ans = abs(abs(X) % D - D)
else:
ans = abs(X) % D
print(ans)
|
X, K, D = list(map(int ,input().split()))
X = abs(X)
if K * D < X:
ans = X - K * D
else:
if X // D % 2 == 0:
if K % 2 == 0:
ans = X % D
else:
ans = abs(X % D - D)
else:
if K % 2 == 0:
ans = abs(X % D - D)
else:
ans = X % D
print(ans)
|
p02584
|
X, K, D = list(map(int ,input().split()))
X = abs(X)
if X // D > K:
ans = X - K * D
else:
if X // D % 2 == 0:
if K % 2 == 0:
ans = X % D
else:
ans = abs(X % D - D)
else:
if K % 2 == 0:
ans = abs(X % D - D)
else:
ans = X % D
print(ans)
|
X, K, D = list(map(int ,input().split()))
X = abs(X)
if X // D > K:
ans = X - K * D
else:
if X // D % 2 == K % 2:
ans = X % D
else:
ans = abs(X % D - D)
print(ans)
|
p02584
|
a = list(input().split(" "))
x = int(a[0])
if x < 0:
x *= -1
k = int(a[1])
d = int(a[2])
for i in range(k):
x -= d
if x <= 0:
if (k - i) % 2 == 1:
x *= -1
break
else:
x += d
break
print(x)
|
a = list(input().split(" "))
x = int(a[0])
if x < 0:
x *= -1
k = int(a[1])
d = int(a[2])
c = x // d
if c >= k:
x -= d * k
else:
x -= d * c
if (k - c) % 2 == 1:
x = (x - d) * -1
print(x)
|
p02584
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.