{"problem":{"name":"AtCoder Crackers","description":{"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 large","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc105_a"},"statements":[{"statement_type":"Markdown","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.\n\n## Constraints\n\n*   $1 \\leq N,K \\leq 100$\n*   All values in input are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $K$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc105_a","tags":[],"sample_group":[["7 3","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$."],["100 10","0\n\nThe crackers can be distributed evenly."],["1 1","0"]],"created_at":"2026-03-03 11:01:14"}}