Score : 100 points
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 is given from Standard Input in the following format:
N K
Print the minimum possible (absolute) difference between the largest number of crackers received by a user and the smallest number received by a user.
7 3
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.
100 10
0
The crackers can be distributed evenly.
1 1
0