qyliang/CodeNanoFix huggingface dataset:
Buggy code:
# coding:utf-8
n,m,q=map(int,input().split())
dp = [[0 for i in range(n)] for j in range(n)]
for i in range(m):
    l,r=map(int,input().split())
    l-=1
    r-=1
    dp[l][r]+=1
for i in range(n):
    for j in range(n-1):
        dp[i][j+1]+=dp[i][j]
for j in range(n):
    for i in range(n-1,0,-1):
        dp[i-1][j]+=dp[i][j]
print(dp)
for i in range(n):
    p,q=map(int,input().split())
    p-=1
    q-=1
    if q==n-1:
        print(dp[p][q])
    else :
     print(dp[p][q]-dp[q][q])


Fixed code:
# coding:utf-8
n,m,qq=map(int,input().split())
dp = [[0 for i in range(n+5)] for j in range(n+5)]
for i in range(m):
    l,r=map(int,input().split())
    l-=1
    r-=1
    dp[l][r]+=1
for i in range(n):
    for j in range(n-1):
        dp[i][j+1]+=dp[i][j]
for j in range(n):
    for i in range(n-1,0,-1):
        dp[i-1][j]+=dp[i][j]
for i in range(qq):
    p,q=map(int,input().split())
    p-=1
    q-=1
    if q==n-1:
        print(dp[p][q])
    else :
     print(dp[p][q]-dp[q+1][q])
Buggy code:
n, k = map(int, input().split(" "))
if n%k=0:
    print("0")
else:
    print("1")


Fixed code:
n, k = map(int, input().split(" "))
if n%k==0:
    print("0")
else:
    print("1")
Buggy code:
N,K=map(int,input().split())
if K%N==0:
    print(0)
else:
        print(1)

Fixed code:
N, K = map(int, input().strip().split())
if N % K == 0:
    print(0)
else:
    print(1)
Buggy code:
N, K = map(int, input().split())

if N % K == 0:
  print(1)
  
else:
  print(0)

Fixed code:
N,K = map(int,input().split())
if N%K:
        print("1")
else:
        print("0")
Buggy code:
n, i = map(int, input().split())
if n%k == 0:
    print(0)
else:
    print(1)

Fixed code:
n,k = map(int,input().split())
if n%k == 0:
    print(0)
else:
    print(1)
Buggy code:
N, K = map(int, input().split())
if K % N == 0:
  print(0)
else:
  print(1)

Fixed code:
N ,K = map(int,input().split())
if N%K == 0:
  print(0)
else:
  print(1)
Buggy code:
a,b=list(map(int,input().split()))
if a/b>0:
  print(1)
else:
  print(0)

Fixed code:
a,b=list(map(int,input().split()))
if a%b>=1:
  print(1)
else:
  print(0)
Buggy code:
# cook your dish here
n,k=list(map(int,input().split()))
if n>k:
    print(n%k)
else:
    print(1)
    
    

Fixed code:
# cook your dish here
n,k=list(map(int,input().split()))
if n%k==0:
    print(0)
else:
    print(1)
Buggy code:
N, K = map(int,input().split())
if(N%K == 0)
  print(0)
else:
  print(1)

Fixed code:
N,K=map(int, input().split())

if N%K==0:
  print(0)
  
else:
  print(1)
Buggy code:
n, k = list(map(int, input().split()))
print(0 if n%k else 1)



Fixed code:
n, k = list(map(int, input().split()))
print(0 if n%k==0 else 1)
Buggy code:
n,k = map(int, input().split())
print(0 if n%k else 1)

Fixed code:
n, k = map(int, input().split())
if (n % k == 0):
  print(0)
else:
  print(1)
Buggy code:
import math as ma
import sys
from sys import exit
from decimal import Decimal as dec
from itertools import permutations

def li():
	return list(map(int , input().split()))

def num():
	return map(int , input().split())

def nu():
	return int(input())

def find_gcd(x , y):
	while (y):
		x , y = y , x % y
	return x

n,k=num()
if(n%k==0):
	print(n//k,n//k)
else:
	print((n-n%k)//k,(n-n%k)//k+1)

Fixed code:
import math as ma
import sys
from sys import exit
from decimal import Decimal as dec
from itertools import permutations

def li():
	return list(map(int , input().split()))

def num():
	return map(int , input().split())

def nu():
	return int(input())

def find_gcd(x , y):
	while (y):
		x , y = y , x % y
	return x

n,k=num()
if(n%k==0):
	print(0)
else:
	print(1)
Buggy code:
N,K = map(int,input().split())
if N > K:
    print(1)
else:
    if K%N == 0:
        print(0)
    else:
        print(1)

Fixed code:
N, K = map(int, input().split() )
if N%K == 0:
  print(0)
else:
  print(1)
Buggy code:
n, k = map(int, input().split())
print(n%k!=0)

Fixed code:
n, k = map(int, input().split())
print(int(n%k!=0))
Buggy code:
a,b=map(int,input().split());print("01"[b%a>0])

Fixed code:
a,b=map(int,input().split());print("01"[a%b>0])
Buggy code:
numSenbei, numPeople = [int(i) for i in str(input()).split()]

if numSenbei % numPeople == 0:
    print(1)
else:
    print(0)

Fixed code:
numSenbei, numPeople = [int(i) for i in str(input()).split()]

if numSenbei % numPeople == 0:
    print(0)
else:
    print(1)
Buggy code:
n,k=map(int,input().split())
if n%k:
  print(0)
else:
  print(1)

Fixed code:
n,k = map(int, input().split())
if n % k == 0: print(0)
else: print(1)
Buggy code:
a,b=map(int,input().split());print(a%b>0)

Fixed code:
a,b=map(int,input().split());print((a%b>0)+0)
Buggy code:
n,k=map(int,input().split())

if n%k==0:
    print("0")
else
    print("1")

Fixed code:
n,k = map(int,input().split())
if n % k == 0:
    print("0")
else:
    print("1")
Buggy code:
N,K = (int,input().split(" "))
if N%K == 0:
  print(0)
else:
  print(1)

Fixed code:
N, K = map(int, input().split())
if N % K == 0:
  print("0")
else:
  print("1")
Buggy code:
I = input().split()

N = int(I[0])
K = int(I[1])

if N % K == 0:
  print(1)
else:
  print(0)

Fixed code:
I = input().split()

N = int(I[0])
K = int(I[1])

if N % K == 0:
  print(0)
else:
  print(1)
Buggy code:
N,K=map(int,input(),split())
if N%K==0:
	print(0)
else:
	print(1)


Fixed code:
N, K=map(int, input(). split())
if N%K==0:
	print(0)
else:
	print(1)
Buggy code:
result = 0

N, K=map(int,input().strip().split(' '))

if N mod K != 0:
  result = 1

print(result)

Fixed code:
result = 0

N, K=map(int,input().strip().split(' '))

if N % K != 0:
  result = 1

print(result)
Buggy code:
n,k=map(int,input().split())
print("1" if n%k == 0 else "0")

Fixed code:
n,k=map(int,input().split())
print("0" if n%k == 0 else "1")
Buggy code:
n,k = map(int,input().split())
if k%n ==0:
    print(0)
else:
    print(1)

Fixed code:
n,k = map(int,input().split())
if n%k==0:
    print("0")
else:
    print("1")
Buggy code:
a,b=map(int,input().split())
print((int)a%b==0)

Fixed code:
a,b=map(int,input().split())
print(int(a%b!=0))
Buggy code:
n = str(input())
[n, k] = list(n.split(" "))
if n % k == 0:
    print(0)
else:
    print(1)

Fixed code:
n = str(input())
[n, k] = list(map(int,n.split(" ")))
if n % k == 0:
    print(0)
else:
    print(1)
Buggy code:
N, K = map(int input().split())
if N % K == 0:
  print(0)
else:
  print(1)

Fixed code:
N,K = map(int,input().split())
print(0 if N%K==0 else 1)
Buggy code:
N, K = map(int input().split())
if N == K:
  print(0)
else:
  print(1)

Fixed code:
N,K = map(int,(input().split()))
if N%K == 0:
    print(0)
else:
    print(1)
Buggy code:
n,k = map(int(), input().split())
if n%k==0:
    print(0)
else:
    print(1)

Fixed code:
n, k = map(int, input().split())
if n % k:
    print(1)
else:
    print(0)
Buggy code:
n = input().split() 

a = n[0]
b = n[1]

if (int(a) / int(b)) % 2 == 0:
    print(0)
else:
    print(1)


Fixed code:
n = input().split() 

a = n[0]
b = n[1]

if int(a) % int(b) == 0:
    print(0)
else:
    print(1)
Buggy code:
N, K = map(input().split())

if N % K > 1:
    print(1)
else:
    print(0)

    

Fixed code:
N, K = map(int, input().split())

if N % K >= 1:
    print(1)
else:
    print(0)
Buggy code:
N,K=map(int,input().split())

if N/K==1:
    print(0)
else:
    print(int(N/K)+1-int(N/K))

Fixed code:
N,K=map(int,input().split())

if N%K==0:
    print(0)
else:
    print(int(N/K)+1-int(N/K))
Buggy code:
N, K = map(int, input().split())
div = N // K
mod = N % K

if mod == 0:
    print(0)
else:
    print(K-mod)


Fixed code:
N, K = map(int, input().split())
div = N // K
mod = N % K

if mod == 0:
    print(0)
else:
    print(1)
Buggy code:
n, k = map(int, input().split())
if k % n == 0:
    print(0)
else:
    print(1)

Fixed code:
n,k=map(int,input().split())
if n%k==0:
    print('0')
else:
    print('1')
Buggy code:
#!/usr/bin/env python3

def solve(N: int, K: int):
    d = int(N % K)
    if d == 0:
      print(d)
    elif:
      print(1)
    return

def main():
    N, K = map(int, input().split())
    solve(N, K)

if __name__ == '__main__':
    main()

Fixed code:
#!/usr/bin/env python3

def solve(N: int, K: int):
    d = int(N % K)
    if d == 0:
      print(d)
    else:
      print(1)
    return

def main():
    N, K = map(int, input().split())
    solve(N, K)

if __name__ == '__main__':
    main()
Buggy code:
n, k = map(int, input().split())
if k == 1:
  print(0)
print(int(n % k != 0))

Fixed code:
n, k = map(int, input().split())
if k == 1:
  print(0)
  exit()
print(int(n % k != 0))
Buggy code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N, K = MAP()

print(N//K - N%K)


Fixed code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

N, K = MAP()

print(ceil(N/K)-N//K)
Buggy code:
n,k=map(int,input().split())
print(n%k==0:
    print(0)
else:
    print(1)


Fixed code:
n,k=map(int,input().split())

if n%k==0 :
    print(0)
else:
    print(1)
Buggy code:
n,k=map(int,input().split())
rem=0 if n%k!=0 else 1
print(rem)

Fixed code:
n, k = map(int, input().split())
print(1 if n % k != 0 else 0)
Buggy code:
A,B=map(int,input().split())
if(B%A):
  print(1)
else:
  print(0)

Fixed code:
A,B=map(int,input().split())
if(A%B):
  print(1)
else:
  print(0)
Buggy code:
N, K = map(int, input().split())
if N % 2 == 0:
  print(0)
  exit()
A = N // K
B = A + 1
print(B - A)

Fixed code:
N, K = map(int, input().split())
if N % K == 0:
  print(0)
  exit()
A = N // K
B = A + 1
print(B - A)
Buggy code:
n,k=map(int,input().split())
print(0 if k%n==0 else 1)

Fixed code:
n,k= map(int,input().split())
if n%k==0:
  print(0)
else:
  print(1)
Buggy code:
n,k=map(int,input().split())
if n%2!=0:
  print('1')
else:
  print('0')

Fixed code:
n,k=map(int,input().split())
if n%k!=0:
  print('1')
else:
  print('0')
Buggy code:
a = map(int,input().split())
if a%b == 0:
  print(0)
else:
  print(1)

Fixed code:
a,b = list(map(int,input().split()))

if a % b == 0:
  print(0)
else:
  print(1)
Buggy code:
n,k=map(int,input().split())
if n==k:
  print('0')
else:
  print('1')

Fixed code:
n, k = map(int, input().split())
if n%k==0:
    print("0")
else:
    print("1")
Buggy code:
N,K = map(int,input().split())

if K % N == 0:
	print(0)
else:
	print(1)

Fixed code:
N, K = map(int, input().split())
if N % K==0:
    print(0)
else:
    print(1)
Buggy code:
n, k = map(int,input().split())
if k % n == 0:
    print(0)
else:
    print(1)

Fixed code:
n,k=map(int,input().split())

if n%k==0:
	print(0)
else:
	print(1)
Buggy code:
N, K = map(int(input().split()))
if N % K == 0:
    print("0")
else:
    print("1")


Fixed code:
N, K = map(int, input().split())
if N % K == 0:
	print(0)
else:
	print(1)
Buggy code:
N, K = int(input().split())
if N % K == 0:
    print("0")
else:
    print("1")


Fixed code:
N, K = map(int, (input().split()))
if N % K == 0:
    print("0")
else:
    print("1")
Buggy code:
N, K = map(int, input().split())
print(int(N%K==0))

Fixed code:
N, K = map(int, input().split())
print(int(N%K!=0))
Buggy code:
N, K = map(int,input().split())

A=N%K

if A<=K:
    print("1")

else:
    print(A)


Fixed code:
N, K = map(int,input().split())

A=N%K

if A==0:
    print(A)

elif A<=K:
    print("1")

else:
    print(A)
Buggy code:
n,k = map(int,input().split())
if n%k == 0:
    print(0)
else:
    prinnt(1)

Fixed code:
n,k = map(int,input().split())

if n % k == 0:
    print(0)
else:
    print(1)
Buggy code:
n,k = list(map(int,input().split()))
if n%k == 0:
    pirnt(0)
else:
    print(1)

Fixed code:
n,k = list(map(int,input().split()))
if n%k == 0:
    print(0)
else:
    print(1)
Buggy code:
n, k = [int(i) - 1 for i in input().split()]
print(int(n % k != 0))

Fixed code:
n, k = [int(i) for i in input().split()]
print(int(n % k != 0))
Buggy code:
n, k = map(int, input.split())
if n % k:
  print(1)
else:
  print(0)

Fixed code:
n, k = map(int, input().split())

print(0 if n%k == 0 else 1)
Buggy code:
n,k = (int(i) for i in input().split())

if(n%2==0):
    print("0")
else:
    print("1")

Fixed code:
n,k = (int(i) for i in input().split())

if(n%k==0):
    print("0")
else:
    print("1")
Buggy code:
N, K = map(int, input().split())
print(1 if N % K == 0 else 1)

Fixed code:
N,K = map(int,input().split())
if(N%K == 0):
    print(0)
else:
    print(1)
Buggy code:
n, k = map(int, input().split())
if n % k = 0:
    print(0)
else:
    print(1)

Fixed code:
n,k=map(int,input().split())
if n % k != 0:
    print(1)
else:
    print(0)
Buggy code:
numbers = input()
number_list = numbers.splist(" ")
N = int(number_list[0])
K = int(number_list[1])
if N%K == 0:
  print 0
else:
  print 1
  

Fixed code:
numbers = input()
number_list = numbers.split(" ")
N = int(number_list[0])
K = int(number_list[1])
if N%K == 0:
  print(0)
else:
  print(1)
Buggy code:

N, K=map(int,input().split())

A = N % K

if A==0:
  print(1)
else:
  print(0)



Fixed code:
N, K=map(int,input().split())
 
A = N % K
 
if A==0:
  print(0)
else:
  print(1)
Buggy code:
N, K = input().split()
if N%K == 0:
    print(0)
else :
    print(1)

Fixed code:
N, K = input().split()
if int(N) % int(K) == 0:
    print(0)
else :
    print(1)
Buggy code:
N, K = input().split()
N=int()
K=int()
if N % K == 0:
    print(0)
else :
    print(1)

Fixed code:
N,K = map(int,input().split())

if N % K == 0:
  print(0)
else:
  print(1)
Buggy code:
# ABC105a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n, k = map(int, input().split())
print(1 if n % k == 0 else 1)


Fixed code:
# ABC105a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

n, k = map(int, input().split())
print(0 if n % k == 0 else 1)
Buggy code:
n,k = map(int,input().split())
if n%k = 0 :
  print(0)
else:
  print(1)

Fixed code:
n,k = map(int, input().split())


print(1 if n % k else 0)
Buggy code:
n,k = map(int,input().split())
if n == k:
  print(0)
else:
  print(1)

Fixed code:
n,k = map(int,input().split())
if n % k == 0 :
  print(0)
else:
  print(1)
Buggy code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(n[0]%n[1]=0):
  print(0)
else:
  print(1)

Fixed code:
#coding:utf-8
n=[int(i) for i in input().split()]
if(n[0]%n[1]==0):
  print(0)
else:
  print(1)
Buggy code:
a,b = map(int,input().split())
if a%b == 0:
    print(b)
else:
    print(1)

Fixed code:
a,b = map(int,input().split())
print(0 if a % b == 0 else 1)
Buggy code:
nk = input()
n = int(nk.split([1]))
k = int(nk.split([2]))

if n % k == 0 :
  print(0)
elif n % k > 0:
  print(1)

Fixed code:
nk = input()
nk_lis = nk.split()
n = int(nk_lis[0])
k = int(nk_lis[1])

if n % k == 0 :
  print(0)
elif n % k > 0:
  print(1)
Buggy code:
n,k = map(int,input().split())
print((n % k) != 0)

Fixed code:
n,k = map(int,input().split())
print(int((n % k) != 0))
Buggy code:
N, K = [int(i) for i in input()]
print(0) if N % K == 0 else print(1)

Fixed code:
N, K = [int(i) for i in input().split()]
print(0) if N % K == 0 else print(1)
Buggy code:
N,K=(int(i) for i in input().split())

res=list()

for i in range(0,K):
    res.append(0)

print(res)
j=0
i=0

while N>0:
    j=0
    while j<len(res):
        if N<=0:
            break
        res[j]=res[j]+1
        N=N-1
        j+=1
        #print(str(N)+"::"+str(res))


MinCount=min(res)

MaxCount=max(res)

print(MaxCount-MinCount)


Fixed code:
N,K=(int(i) for i in input().split())

res=list()

for i in range(0,K):
    res.append(0)

j=0
i=0

while N>0:
    j=0
    while j<len(res):
        if N<=0:
            break
        res[j]=res[j]+1
        N=N-1
        j+=1
        #print(str(N)+"::"+str(res))


MinCount=min(res)

MaxCount=max(res)

print(MaxCount-MinCount)
Buggy code:
N, K = map(int, input().split())
A = N % K
if A == 0:
    print(0)
else:
    else(1)

Fixed code:
# A

N, K = map(int, input().split())
if N % K == 0:
    print(0)
else:
    print(1)
Buggy code:
a,b=map(int,input().split());print([1,0][a%b==0]))

Fixed code:
a,b=map(int,input().split());print([1,0][a%b==0])
Buggy code:
n,k=input().split()
if n%k==0:
  print(0)
else:
  print(1)

Fixed code:
n,k=input().split()
if int(n)%int(k)==0:
  print(0)
else:
  print(1)
Buggy code:
a, b = (int(i) for i in input().split())  
print(a)
print(b)
if a % b == 0:
  print(0)
else:
  print(1)


Fixed code:
a, b = (int(i) for i in input().split())  

if a % b == 0:
  print(0)
else:
  print(1)
Buggy code:
num = [int(e) for e in input().split()]
N=num[0]
K=num[1]
if B%A==0:
    print(0)
else:
    print(1)

Fixed code:
num = [int(e) for e in input().split()]
N=num[0]
K=num[1]
if N%K==0:
    print(0)
else:
    print(1)
Buggy code:
n, k = map(int, input().split())

if n % K == 0:
    print(0)
else:
    print(1)

Fixed code:
n, k =map(int, input().split())
if n%k==0:
  print(0)
else:
  print(1)
Buggy code:
n, k = (int(i) for in input().split())
print(0) if n % k == 0 else print(1)

Fixed code:
n, k = (int(i) for i in input().split())
print(0) if n%k == 0 else print(1)
Buggy code:
n, k = map(int, input().split())

if n%0==0:
	print(0)
else:
	print(1)

Fixed code:
n, k = map(int,input().split())
print(0 if n % k == 0 else 1)
Buggy code:
n,k = [int(x) for x in input().split()]
if n % k == 0:
  prtint(0)
else :
  print(1)

Fixed code:
n,k = [int(x) for x in input().split()]
if n % k == 0:
  print(0)
else :
  print(1)
Buggy code:
"""AtCoder"""

import sys
input = sys.stdin.readline

A, B = map(int, input().split())

if A == B:
    print(0)
else:
    print(1)


Fixed code:
"""AtCoder"""

import sys
input = sys.stdin.readline

A, B = map(int, input().split())

if A% B==0:
    print(0)
else:
    print(1)
Buggy code:
N,K=map(int,input().split())

if N%K==0:
	print(0)
	else:
		print(1)

Fixed code:
N,K = map(int,input().split())
if N % K ==0:
    print('0')
else:
    print('1')
Buggy code:
n, k = map(int, input().split())
if n // k % 0:
    print("0")
else:
    print("1")

Fixed code:
n, k = map(int, input().split())
if n % k == 0:
    print("0")
else:
    print("1")
Buggy code:
N,K=map(int,input().split())
if N%K==0:
  print(1)
else:
  print(0)

Fixed code:
N, K = list(map(int,input().split()))
if N % K == 0:
    print(0)
else:
    print(1)
Buggy code:
n, k = map(int, input().split())
if n%k:
    print(0)
else:
    print(1)


Fixed code:
n, k = map(int, input().split())
if n%k:
    print(1)
else:
    print(0)
Buggy code:

n,k=map(int,input().split())

print("1" if n % k == 0 else "0")

Fixed code:
n, k = map(int, input().split())

if n % k == 0:
	print('0')
else:
	print('1')
Buggy code:
n,k = map(int, input().split())

if n %k !=0:
  print(0)
else:
  print(1)

Fixed code:
n,k = map(int, input().split())

if n %k :
  print(1)
else:
  print(0)
Buggy code:
# -*- coding: utf-8 -*-

n,k = map(int,input().split())

if k % n != 0:
    print("1")
else:
    print("0")


Fixed code:
# -*- coding: utf-8 -*-

n,k = map(int,input().split())

if n % k != 0:
    print("1")
else:
    print("0")
Buggy code:
#coding:utf-8
n,k = map(int,input().split())
print (int(n%k==0))


Fixed code:
#coding:utf-8
n,k = map(int,input().split())
print (int(n%k!=0))
Buggy code:
n,k=map(int,input().split())
print("1" if n%k==0 else "1")

Fixed code:
n,k = list(map(int,input().split()))
print("0" if n % k == 0 else "1")
Buggy code:
n, k=map(int,input().split());print(0 if n%k==o else 1)

Fixed code:
n, k=map(int, input().split());print(0 if n%k==0 else 1)
Buggy code:
n , k = map(int, input().split())

if n % k == 0:
    print("0"):
else:
    print("1")


Fixed code:
n , k = map(int, input().split())

if n % k == 0:
    print("0")
else:
    print("1")
Buggy code:
n,k=map(int,input().split())

res=1

if k%n==0:
	res=0

print(res)

Fixed code:
n,k=map(int,input().split())

res=1

if n%k==0:
	res=0

print(res)
Buggy code:
N,K=map(int, input().split())

if K%N==0:
  print(0)
else:
  print(1)

Fixed code:
N,K=map(int, input().split())

if N%K==0:
  print(0)
else:
  print(1)
Buggy code:
n,k= int(input().split())
print(0 if n%k=0 else 1)

Fixed code:
n,k= map(int,input().split())
print(0 if n%k==0 else 1)
Buggy code:
N,K = map(int,input().split())

print(N%K!=0)

Fixed code:
N,K = map(int,input().split())
 
print(int(N%K!=0))
Buggy code:
n,k=map(int(input().split()))
if n%k==0:
    print(0)
else:
    print(1)

Fixed code:
n,k = map(int,input().split())
if n % k == 0:
    print(0)
else:
    print(1)
Buggy code:
#105

N, K = map(int, input().rstrip().split()):
    if N%K == 0:
        print(0)
    else:
        print(1)

Fixed code:
#105

N, K = map(int, input().rstrip().split())
if N%K == 0:
    print(0)
else:
    print(1)
Buggy code:
N,K=map(int,input().split())
if(N%K==0):
  print(0)
 else:
  print(1)

Fixed code:
N, K = map(int,input().split())
if N%K == 0:
    print("0")
else:
    print("1")
Buggy code:
tmp = input().split(" ")
N = int(tmp[0])
K = int(tmp[1])

print(0) if N % K else print(1)

Fixed code:
tmp = input().split(" ")
N = int(tmp[0])
K = int(tmp[1])

print(1) if N % K else print(0)
Buggy code:
N, K = map(int, input().split())

if N % K != 1:
  print(1)
else:
  print(0)

Fixed code:
N, K = map( int, input().split())

if( N % K == 0):
  print(0)
  
else:
  print(1)
Buggy code:
def cracker(n, k):
    return 0 if k / n == 0 else 1

n, k = map(int, input().split())
print(cracker(n, k))


Fixed code:
def cracker(n, k):
    return 0 if n % k == 0 else 1

n, k = map(int, input().split())
print(cracker(n, k))
Buggy code:
n,k = map(int, input().split())
if k%n:
  print(1)
else:
  print(0)

Fixed code:
n,k = map(int, input().split())
if n%k==0:
  print(0)
else:
  print(1)
Buggy code:
N, K = int(input().split())
if N % K == 0:
  print(0)
else :
  print(1)

Fixed code:
N,K=map(int,input().split())
if N%K==0:
	print(0)
else:
	print(1)
Buggy code:
n,k = map(int, input(), split())

if n%k==0:
  print(0)
  
else:
  print(1)

Fixed code:
n,k = map(int,input().split())
if n%k==0:
    print(0)
else:
    print(1)
Buggy code:
N, K = int(input().split())
if N % K == 0:
  print("0")
else :
  print("1")


Fixed code:
N, K = map(int, input().split())
if N % K == 0:
  print("0")
else :
  print("1")
Buggy code:
n,k=map(int,input().split())
if n%k==0:
    print(1)
else:
    print(0)


Fixed code:
n,k = map(int, input().split())

if n % k == 0:
    print(0)
else:
    print(1)
Buggy code:
N,K=map(int, input().split())
if N % K = 0:
 print(0)
else:
 print(1)

Fixed code:
N,K = map(int, input().split())

if(N%K==0):	print(0)
else:	print(1)
Buggy code:
n.k = map(int,input().split())
if n%k ==0:
  print(0)
else:
  print(1)

Fixed code:
n, k = list(map(int, input().split()))
if n % k == 0: print(0)
else: print(1)
Buggy code:
n,k = map(int, input().split())
print(n%k!=0)

Fixed code:
n,k = map(int, input().split())
print(int(n%k!=0))
Buggy code:
n,k=map(int,input().split())
print(0 if n%k=0 else 1)

Fixed code:
n,k=map(int,input().split())

if(n%k==0):
  print(0)
else:
  print(1)
Buggy code:
from sys import stdin

N, K = [int(x) for x in stdin.readline().rstrip()]

if N % K == 0:
    print('0')
else:
    print('1')


Fixed code:
from sys import stdin

N, K = [int(x) for x in stdin.readline().rstrip().split()]

if N % K == 0:
    print('0')
else:
    print('1')
Buggy code:
n = list(map(int, input().split()))
print(n)

if(n[0] % n[1] == 0):
    print("0")
else:
    print("1")


Fixed code:
n = list(map(int, input().split()))

if(n[0] % n[1] == 0):
    print("0")
else:
    print("1")
Buggy code:
import math
n,k = map(int,input().split())
if n/k == 0:
    print(0)
else:
    print(1)

Fixed code:
import math
n,k = map(int,input().split())
if n%k == 0:
    print(0)
else:
    print(1)