10486: ABC105 —— A - AtCoder Crackers
[Creator : ]
Description
Takahashi has decided to distribute $N$ AtCoder Crackers to $K$ users of as evenly as possible. When all the crackers are distributed, find the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Input
Input is given from Standard Input in the following format:
```
$N$ $K$
```
```
$N$ $K$
```
Output
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
Constraints
- $1 \leq N,K \leq 100$
- All values in input are integers.
- All values in input are integers.
Sample 1 Input
7 3
Sample 1 Output
1
When the users receive two, two and three crackers, respectively, the (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user, is 1.
Sample 2 Input
100 10
Sample 2 Output
0
The crackers can be distributed evenly.
Sample 3 Input
1 1
Sample 3 Output
0