output_description: Print the minimum possible (absolute) difference between the largest number of
  crackers received by a user and the smallest number received by a user.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N K
attempt: n = map(int, input())
  
  
  def basen(n):
      a = []
      while n != 0:
          r = n % 2
          if r < 0:
              r += 2
  
          n = (n - r) // (-2)
          a.append(r)
          if a == " ":
              a.append(0)
          reversed(a)
      return a
  
problem_description: Statement
  
  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.
samples: [{"input": "7 3", "output": "1\n    \n\nWhen the users receive two, two and three crackers, respectively, the\n(absolute) difference between the largest number of crackers received by a\nuser and the smallest number received by a user, is 1.\n\n* * *"}, {"input": "100 10", "output": "0\n    \n\nThe crackers can be distributed evenly.\n\n* * *"}, {"input": "1 1", "output": "0"}]