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: # -*- coding: utf-8 -*-
  import logging
  import time
  
  
  class Solver:
      def __init__(self):
          self.n = 0
          self.k = 0
  
      # 入力
      def input_value(self):
          # self.n = int(input())
          # self.A, self.B = map(int, input().split())
          # self.A = list(map(int, input().split()))
          # self.a, self.b, self.c = map(int, [input() for i in range(4)])
          # self.t = [None] * self.n
          (
              self.n,
              self.k,
          ) = map(int, input().split())
  
      # @staticmethod
      # def can_go(t, x, y):
      # logging.debug(input_str)
  
      # logging.debug(input_str)
  
      def run(self):
          if self.n % self.k == 0:
              return 0
          return 1
  
      @staticmethod
      def test(self):
          start_time = time.time()
  
          # assert self.run(3, 1, 2), 'Error.'
  
          elapsed_time = time.time() - start_time
          logging.debug("elapsed_time: {0}".format(elapsed_time) + "[sec]")
  
  
  if __name__ == "__main__":
      logging.basicConfig(level=logging.DEBUG)
  
      solver = Solver()
  
      # solver.test()
  
      solver.input_value()
      ans = solver.run()
      # print(str(ans))
      print(str(ans))
  
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"}]