{"raw_statement":[{"iden":"problem statement","content":"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."},{"iden":"constraints","content":"*   $1 \\leq N,K \\leq 100$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $K$"},{"iden":"sample input 1","content":"7 3"},{"iden":"sample output 1","content":"1\n\nWhen 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$."},{"iden":"sample input 2","content":"100 10"},{"iden":"sample output 2","content":"0\n\nThe crackers can be distributed evenly."},{"iden":"sample input 3","content":"1 1"},{"iden":"sample output 3","content":"0"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}