AtCoder Beginner Contest 175
翻译中…
Problem Statement
翻译中…
Takahashi, who lives on the number line, is now at coordinate $X$. He will make exactly $K$ moves of distance $D$ in the positive or negative direction.
翻译中…
More specifically, in one move, he can go from coordinate $x$ to $x + D$ or $x - D$.
翻译中…
He wants to make $K$ moves so that the absolute value of the coordinate of the destination will be the smallest possible.
翻译中…
Find the minimum possible absolute value of the coordinate of the destination.
翻译中…
Constraints
翻译中…
$-10^{15} \leq X \leq 10^{15}$$1 \leq K \leq 10^{15}$$1 \leq D \leq 10^{15}$- All values in input are integers.
翻译中…
Input
翻译中…
Input is given from Standard Input in the following format:
翻译中…
X K D翻译中…
Output
翻译中…
Print the minimum possible absolute value of the coordinate of the destination.
翻译中…
样例
Input #1
6 2 4
Output #1
2
Takahashi is now at coordinate $6$. It is optimal to make the following moves:
- Move from coordinate $6$ to ($6 - 4 =$) $2$.
- Move from coordinate $2$ to ($2 - 4 =$) $-2$.
Here, the absolute value of the coordinate of the destination is $2$, and we cannot make it smaller.
Input #2
7 4 3
Output #2
1
Takahashi is now at coordinate $7$. It is optimal to make, for example, the following moves:
- Move from coordinate $7$ to $4$.
- Move from coordinate $4$ to $7$.
- Move from coordinate $7$ to $4$.
- Move from coordinate $4$ to $1$.
Here, the absolute value of the coordinate of the destination is $1$, and we cannot make it smaller.
Input #3
10 1 2
Output #3
8
Input #4
1000000000000000 1000000000000000 1000000000000000
Output #4
1000000000000000
The answer can be enormous.
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。