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: def getinputdata():
  
      array_result = []
      array_result.append(input().split(" "))
  
      flg = True
  
      try:
          while flg:
  
              data = input()
  
              if data != "":
  
                  array_result.append(data.split(" "))
  
                  flg = True
  
              else:
  
                  flg = False
      finally:
  
          return array_result
  
  
  arr_data = getinputdata()
  
  n = int(arr_data[0][0])
  k = int(arr_data[0][1])
  
  
  print(0 if n % k == 0 else 1)
  
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"}]