qyliang/CodeNanoFix huggingface dataset:
Buggy code:
# def makelist(n, m):
# 	return [[0 for i in range(m)] for j in range(n)]

# n = int(input())
# a, b = map(int, input().split())
# s = input()


n = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))

Tsa = [0]*n
Asa = [0]*n

if n == 1:
	if T[0] != A[0]:
		print(0)
	else:
		print(1)
elif T[0] != A[-1]:
	print(0)
else:
	##
	dai = T[0]
	shou = T[0]
	Tsa[0] = (shou, dai)

	for i in range(1, n):
		if T[i] == dai:
			Tsa[i] = (shou, dai)
		else:
			shou = dai
			dai = T[i]
			Tsa[i] = (dai, dai)

	##
	dai = A[-1]
	shou = A[-1]
	Asa[-1] = (shou, dai)

	for i in reversed(range(-n, -1)):
		if A[i] == dai:
			Asa[i] = (shou, dai)
		else:
			shou = dai
			dai = A[i]
			Asa[i] = (dai, dai)

	ans = 1
	for i in range(n):
		d = max(Tsa[i][0], Asa[i][0])
		u = min(Tsa[i][1], Asa[i][1])

		if d > u:
			ans = 0
			break
		else:
			ans *= u - d + 1
	print(ans)


Fixed code:
# def makelist(n, m):
# 	return [[0 for i in range(m)] for j in range(n)]

# n = int(input())
# a, b = map(int, input().split())
# s = input()

MOD = int(1e9) + 7
n = int(input())
T = list(map(int, input().split()))
A = list(map(int, input().split()))

Tsa = [0]*n
Asa = [0]*n

if n == 1:
	if T[0] != A[0]:
		print(0)
	else:
		print(1)
elif T[-1] != A[0]:
	print(0)
else:
	##
	dai = T[0]
	shou = T[0]
	Tsa[0] = (shou, dai)

	for i in range(1, n):
		if T[i] == dai:
			Tsa[i] = (1, dai)
		else:
			dai = T[i]
			Tsa[i] = (dai, dai)

	##
	dai = A[-1]
	shou = A[-1]
	Asa[-1] = (shou, dai)

	for i in reversed(range(-n, -1)):
		if A[i] == dai:
			Asa[i] = (1, dai)
		else:
			dai = A[i]
			Asa[i] = (dai, dai)

	##
	ans = 1
	for i in range(n):
		d = max(Tsa[i][0], Asa[i][0])
		u = min(Tsa[i][1], Asa[i][1])

		if d > u:
			ans = 0
			break
		else:
			ans *= u - d + 1
			ans %= MOD
	print(ans)
Buggy code:
n = int(input())
t=list(map(int, input().split()))
a = list(map(int, input().split()))

h = [0 for i in range(n)]
h[0] = t[0]
h[n-1] = a[n-1]
p = [False for i in range(n)]
p[0] = True
p[n-1] = True
for i in range(1,n):
    if t[i] > t[i-1]:
        p[i] = True
    h[i] = t[i]
for i in range(n-2,-1,-1):
    if a[i] > a[i+1]:
        p[i] = True
    h[i] = min(t[i],a[i])

mod = 10**9+7
total = 1
for i in range(n):
    if not p[i]:
        total = (total * h[i]) % (mod)
print(total)
    


Fixed code:
n = int(input())
t = list(map(int, input().split()))
a = list(map(int, input().split()))
if n==1 and t[0] != a[0]:
    print(0)
    exit()
p = [False for i in range(n)]
p[0] = True
p[n - 1] = True

for i in range(1, n):
    if t[i] > t[i - 1]:
        p[i] = True
        if a[i] < t[i]:
            print(0)
            exit()

for i in range(n - 2, -1, -1):
    if a[i] > a[i + 1]:
        p[i] = True
        if t[i] < a[i]:
            print(0)
            exit()
h=[min(t[i],a[i]) for i in range(n)]
mod = 10**9 + 7
total = 1
for i in range(n):
    if not p[i]:
        total = (total * h[i]) % mod
print(total)
Buggy code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**10
mod = 10**9 + 7


def f():
    n = int(input())
    t = list(map(int, input().split()))
    a = list(map(int, input().split()))
    r = 0

    if a[-1] > t[-1] or a[0] < t[0]:
        return 0

    for i in range(1,n):
        if m > a[i]:
            m = a[i]
        if (t[i-1] < t[i] and t[i] > m) or t[i] < t[i-1]:
            return 0
    for i in range(n-2,-1,-1):
        if (a[i+1] < a[i] and a[i] > t[i]) or a[i] < a[i+1]:
            return 0

    r = 1
    for i in range(1,n-1):
        if t[i] != t[i-1] or a[i] != a[i+1]:
            continue
        if t[i] < a[i]:
            r = r * t[i] % mod
        else:
            r = r * a[i] % mod

    return r


print(f())


Fixed code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**10
mod = 10**9 + 7


def f():
    n = int(input())
    t = list(map(int, input().split()))
    a = list(map(int, input().split()))
    r = 0

    if a[-1] > t[-1] or a[0] < t[0]:
        return 0

    for i in range(1,n):
        if (t[i-1] < t[i] and t[i] > a[i]) or t[i] < t[i-1]:
            return 0

    for i in range(n-2,-1,-1):
        if (a[i+1] < a[i] and a[i] > t[i]) or a[i] < a[i+1]:
            return 0

    r = 1
    for i in range(1,n-1):
        if t[i] != t[i-1] or a[i] != a[i+1]:
            continue
        if t[i] < a[i]:
            r = r * t[i] % mod
        else:
            r = r * a[i] % mod

    return r


print(f())
Buggy code:
pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))



Fixed code:
import collections

pen = list(map(str,input().split()))

print(len(collections.Counter(pen)))
Buggy code:
semi_ans = set(map(int, input().split()))
len(semi_ans)

Fixed code:
semi_ans = set(map(int, input().split()))
print(len(semi_ans))
Buggy code:
a,b,c = map(int.input().split())
if a=b and b=c:
  print(1)
elif (a=b or b=c or a=c):
  print(2)
else:
  print(3)


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

if a!=b and b!=c and a!=c:
    print(3)
elif (a==b and b!=c) or (b==c and c!=a) or (a==c and a!=b):
    print(2)
else:
    print(1)
Buggy code:
a,b,c = int(input().split())
if a=b=c:
  print(1)
elif (a=b or b=c or a=c):
  print(2)
else:
  print(3)


Fixed code:
a,b,c = map(int,input().split())
if a==b and b==c:
  print(1)
elif a==b or b==c or a==c:
  print(2)
else:
  print(3)
Buggy code:
a, b, c = map(int, input().split())
m = set([a, b, c])）
print(len(m)

Fixed code:
a, b, c = map(int, input().split())
m = set([a, b, c])
print(len(m))
Buggy code:
a, b, c = list(map(int, input().split()))
A = [a, b, c]
A.sort()
if A[0] == A[2]:
	print(3)
elif A[0] == A[1] or A[1] == A[2]:
	print(2)
else:
	print(1)

Fixed code:
a, b, c = list(map(int, input().split()))
A = [a, b, c]
A.sort()
if A[0] == A[2]:
	print(1)
elif A[0] == A[1] or A[1] == A[2]:
	print(2)
else:
	print(3)
Buggy code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif a == b and b != c or b == c and a != b or a==c and a!=b
    print(2)
else:
    print(3)

Fixed code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif a == b and b != c or b == c and a != b or a==c and a!=b:
    print(2)
else:
    print(3)
Buggy code:
a = input().split()
s = {a[0]}
for i in a:
    s = s.union(i)
print(len(s))

Fixed code:
a = input().split()
s = {a[0]}
for i in a:
    s |= {i}
print(len(s))
Buggy code:
a = int(input().split())

print(len(list(set(a)))    


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

print(len(list(set(a))))
Buggy code:
c = list(input().split())
print(len(set(c))

Fixed code:
c = list(input().split())
ans = len(set(c))
print(ans)
Buggy code:
p = list(map(int,input()split()))
if p[0] != p[1] and p[1] != p[2] and p[2] != p[0]:
  print(3)
elif p[0] = p[1] and p[1] = p[2]:
  print(1)
else:
  print(2)

Fixed code:
p = list(map(int,input().split()))
if p[0] != p[1] and p[1] != p[2] and p[2] != p[0]:
  print(3)
elif p[0] == p[1] == p[2]:
  print(1)
else:
  print(2)
Buggy code:
nums = list(map(int, input().split()))
n = 1
if nums[0] != nums[1]:
	n++
if nums[1] != nums[2] and nums[0] != nums[2]:
	n++
print(n)


Fixed code:
nums = list(map(int, input().split()))
n = 1
if nums[0] != nums[1]:
	n+=1
if nums[1] != nums[2] and nums[0] != nums[2]:
	n+=1
print(n)
Buggy code:
def solve():
    n = [int(i) for i in input().split()][:3]
    print(n)

    c1 = n.count(n[0])
    c2 = n.count(n[1])
    c3 = n.count(n[2])
    print(c1, c2, c3)

    if(c1 == 3):
        print(1)
    elif(c1 == c2 == c3 == 1):
        print(3)
    else:
        print(2)


if __name__ == '__main__':
    solve()


Fixed code:
def solve():
    n = [int(i) for i in input().split()][:3]


    c1 = n.count(n[0])
    c2 = n.count(n[1])
    c3 = n.count(n[2])


    if(c1 == 3):
        print(1)
    elif(c1 == c2 == c3 == 1):
        print(3)
    else:
        print(2)


if __name__ == '__main__':
    solve()
Buggy code:
iro = list(map(int, input().split()))
shu = 1
iro.sort()
for i in range(1, len(iro)):
  if iro[i - 1] != iro[i]:
    shu += 1
print(iro)

Fixed code:
iro = list(map(int, input().split()))
shu = 1
iro.sort()
for i in range(1, len(iro)):
  if iro[i - 1] != iro[i]:
    shu += 1
print(shu)
Buggy code:
nums = list(input().split())

print(set(nums))

Fixed code:
nums = list(input().split())

print(len(set(nums)))
Buggy code:
a = input().split()
set(a)
print(len(a))

Fixed code:
a = input().split()
a = set(a)
print(len(a))
Buggy code:
a=list(map(int, input().split()))
if a[0]==a[1]:
  print(1)
elif a[0]!=a[1] and a[1]!=a[2] and a[2]!=a[0]:
  print(3)
else:
  print(2)

Fixed code:
a=list(map(int, input().split()))
if a[0]==a[1]==a[2]:
  print(1)
elif a[0]!=a[1] and a[1]!=a[2] and a[2]!=a[0]:
  print(3)
else:
  print(2)
Buggy code:
a,b,c = map(int,input().split())
d=[a,b,c]
d =list(set(d))
print(d)

Fixed code:
a,b,c = map(int,input().split())
d=[a,b,c]
d =list(set(d))
print(len(d))
Buggy code:
a = [int(i) for i in input().split()]
print(len(set(a))

Fixed code:
a = [int(i) for i in input().split()]
print(len(set(a)))
Buggy code:
a,b,c = map(int, input).split()

ans = 3

if a == b:
  if a == c:
    ans = 1
  else:
    ans = 2
elif a == c:
  ans = 2

print(ans)

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

ans = 3

if a == b:
  if a == c:
    ans = 1
  else:
    ans = 2
elif a == c:
  ans = 2
elif b == c:
  ans = 2

print(ans)
Buggy code:
a = [int(i) for i in input().split()]
if a == b == c :
    print (1)
elif a == b or b == c :
    print (2)
else :
    print (3)

Fixed code:
a,b,c=[int(i) for i in input().split()]
if a==b==c:
  print("1")
elif a==b or b==c or c==a:
  print("2")
else:
  print("3")
Buggy code:
l = list(map(int,input().split()))
k = 1
if l[0]==l[1]:
    k+=1
if l[1]==l[2]:
    k+=1
if l[2]==l[0]:
    k+=1
if k>3:
    k=3
print('{}'.format(k))


Fixed code:
l = list(map(int,input().split()))
k=0
if l[0]== l[1]==l[2]:
    k+=1
if l[0]!=l[1]:
    k+=1
if l[1]!=l[2]:
    k+=1
if l[2]!=l[0]:
    k+=1
if k>3:
    k=3
print('{}'.format(k))
Buggy code:
li ~ list(map(int,input().split()))
cnt = 3
if li[0] == li[1]:
	cnt -= 1
if li[0] == li[2]:
	cnt -= 1
if li[1] == li[2]:
	cnt -= 1
if li[0] == li[1] and li[1] == li[2]:
	cnt = 1
print(cnt)

Fixed code:
li = list(map(int,input().split()))
cnt = 3
if li[0] == li[1]:
	cnt -= 1
if li[0] == li[2]:
	cnt -= 1
if li[1] == li[2]:
	cnt -= 1
if li[0] == li[1] and li[1] == li[2]:
	cnt = 1
print(cnt)
Buggy code:
a,b,c=map(int, input().split())
print(max((a!=b)+(b!=c)+(c!=a),1)

Fixed code:
a,b,c=map(int, input().split())
print(max((a!=b)+(b!=c)+(c!=a),1))
Buggy code:
x = list(map(int,input().split()))
len(set(x))

Fixed code:
x = list(map(int,input().split()))
print(len(set(x)))
Buggy code:
lis = list(map(int, input().split()))
unique_list = []
for i in range(len(lis)):
    if lis[i] in unique_list or lis[i] in lis[:i] + lis[i+1:] :
        continue
    unique_list.append(lis[i])
print(len(unique_list))

Fixed code:
lis = list(map(int, input().split()))
unique_list = []
for i in range(len(lis)):
    if lis[i] in lis[:i] + lis[i+1:] and lis[i] in unique_list:
        continue
    unique_list.append(lis[i])
print(len(unique_list))
Buggy code:
a, b, c = map(int, input().split())
print(len(set(a, b, c)))


Fixed code:
a = list(map(int,input().split()))
b = set(a)
c = list(b)
print(len(c))
Buggy code:
#!C:\Users\daichi\Anaconda3/python.exe
# -*- coding: utf-8 -*-

C = input().split()
a = C[0]
b = C[1]
c = C[1]

if(a == b and a == c):
    k = 3
if(a == c and a != b):
    k = 2 
if(a != b and c != b):
    k = 1

print(k)

Fixed code:
#!C:\Users\daichi\Anaconda3/python.exe
# -*- coding: utf-8 -*-

C = input().split()
a = C[0]
b = C[1]
c = C[2]

k=3
if(a == b and b == c):
    k = 1
elif(a == b and b != c):
    k = 2
elif(a == c and b != c):
    k = 2
elif(b == c and a != c):
    k = 2
else:
    k=3
print(k)
Buggy code:
colors = list(map(int, input().split()))

kinds = set(colors)
print(kinds)

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

kinds = len(set(colors))
print(kinds)
Buggy code:
l = set(list(map, input().split()))
print(len(l))

Fixed code:
l = set(list(map(int, input().split())))
print(len(l))
Buggy code:
A, B, C = map(int, input().split())
if A==B and B==C :
  print(1)

elif A==B and B!=C :
  print(2)

elif B==C and B!=A :
  print(2)

elif A==C and A!=B :
  print(2)

else :
  print(1)

Fixed code:
A, B, C = map(int, input().split())
if A==B and B==C :
  print(1)

elif A==B and B!=C :
  print(2)

elif B==C and B!=A :
  print(2)

elif A==C and A!=B :
  print(2)

else :
  print(3)
Buggy code:
a, b, c = list(map(int, input().split()))
if a == b and b == c and c == a:
    print(0)
elif a != b and b != c and c == a:
    print(2)
elif a == b and b != c and c != a:
    print(2)
elif a != b and b == c and c != a:
    print(2)
else:
    print(1)

Fixed code:
a, b, c = list(map(int, input().split()))
if a == b and b == c and c == a:
    print(1)
elif a != b and b != c and c == a:
    print(2)
elif a == b and b != c and c != a:
    print(2)
elif a != b and b == c and c != a:
    print(2)
else:
    print(3)
Buggy code:
A = [int(i) for i in input().split()]

set(A)
list(A)
print(len(A))

Fixed code:
A = [int(i) for i in input().split()]

A = set(A)

print(len(A))
Buggy code:
x = list(map(int, input().split()))

print(len(set(x))

Fixed code:
x = list(map(int, input().split()))
 
print(len(set(x)))
Buggy code:
sample = input()
sample_list = sample.split(" ")
count = 0
flag = 0
for i in range(len(sample_list)):
  for j in range(1, i):
    if sample_list[i] == sample_list[j]:
      flag = 1
    if flag == 0:
      count += 1
    flag = 0
print(count)


Fixed code:
sample = input()
sample_list = sample.split(" ")
count = 0
flag = 0
i = 0
j = 1
for i in range(len(sample_list)):
  for j in range(i):
    if sample_list[i] == sample_list[j]:
      flag = 1
  if flag == 0:
    count += 1
  flag = 0
print(count)
Buggy code:
s = set(map(int,input.split()))
print(len(s))

Fixed code:
s = list(set(map(int,input().split())))
print(len(s))
Buggy code:
ho=input().split()
if(int(ho[0]) == int(ho[1]) == int(ho[2])):
    print(1)
elif (int(ho[0]) == int(ho[1]) or int(ho[1]) == int(ho[2]) or int(ho[2]) == int(ho[0])):
    print(2)
else:
    print(1)

Fixed code:
ho=input().split()
if(int(ho[0]) == int(ho[1]) == int(ho[2])):
    print(1)
elif (int(ho[0]) == int(ho[1]) or int(ho[1]) == int(ho[2]) or int(ho[2]) == int(ho[0])):
    print(2)
else:
    print(3)
Buggy code:
a,b,c = (int(x) for x in input().split())
if a == b:
  if a == c:
    print (1)
  else:
    pritn (2)
else:
  if a == c:
    print (2)
  else:
    print (3)


Fixed code:
a,b,c = (int(x) for x in input().split())
if a == b:
  if a == c:
    print (1)
  else:
    print (2)
else:
  if a == c:
    print (2)
  else:
    if b == c:
      print (2)
    else:
      print (3)
Buggy code:
a,b,c=input().split()
d=list[a,b,c]
for i in range(2):
    if d.count(d[i])!=1:
        del d[i]
print(len(d))


Fixed code:
a,b,c=input().split()
d=[a,b,c]
for i in range(2):
    if d.count(d[i])!=1:
        del d[i]
print(len(d))
Buggy code:
list = (input().split())

A=set(list)

print(A)

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

A=set(list)

print(len(A))
Buggy code:
a, b, c = map(int,input().split())
if a == b == c:
    print(3)
elif a == b or b == c or a == c:
    print(2)
else:
    print(1)

Fixed code:
a, b, c = map(int,input().split())
if a == b == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)
Buggy code:
# coding: utf-8

colors = input().split()

bef = 0
count = 0
colors.sort()

for c in colors:
    print(c)
    if bef == 0:
        count += 1
        bef = c
    else:
        if c > bef:
            count += 1
            bef = c

print(count)


Fixed code:
# coding: utf-8

colors = input().split()

bef = 0
count = 0
colors.sort()

for c in colors:
    if bef == 0:
        count += 1
        bef = c
    else:
        if c > bef:
            count += 1
            bef = c

print(count)
Buggy code:
a, b, c = map(int, input().split())
count = 1
if a != b:
    count += 1
if b != c:
    count += 1
if c != a:
    count += 1
print(count)


Fixed code:
a, b, c = map(int, input().split())
count = 1
if a != b:
    count += 1
if b != c and c != a:
    count += 1
print(count)
Buggy code:
a, b, c = int(input().split())

if a == b == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)

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

if a == b == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)
Buggy code:
print(len(set(list(map(int,input().split()))))


Fixed code:
print(len(set(map(int,input().split()))))
Buggy code:
total = set(list(map(int, input().split)))

print(len(total))

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

print(len(total))
Buggy code:
cols = map( int, input().split() )
cols set = set( cols )

print( len( cols set ) )

Fixed code:
cols = set( map( int, input().split() ) )
 
print( len( cols ) )
Buggy code:
A,B,C = map(int,input().split())
ans =1
if A != B:
  ans += 1
if A != C and B != C:
  ans += 1
print(ANS)

Fixed code:
A,B,C = map(int,input().split())
ans =1
if A != B:
  ans += 1
if A != C and B != C:
  ans += 1
print(ans)
Buggy code:
a, b, c = map(int, input().split())

if a == b == c:
  print(3)
elif a == b or b == c or c == a:
  print(2)
else:
  print(1)

Fixed code:
a,b,c=map(int,input().split())
if a == b == c:
  print(1)
elif a == b or b == c or c == a:
  print(2)
else:
  print(3)
Buggy code:
a, b, c = map(int, (input()))

if a == b and a == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)


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

if a == b and a == c:
    print(1)
elif a == b or a == c or b == c:
    print(2)
else:
    print(3)
Buggy code:
# coding: UTF8

#input = "30 30 30"
#l = map(int, input.split())
l = list(map(int, input().split()))
l.sort()
a = l[0]
b = l[1]
c = l[2]

if a == b == c:
	print("3")
elif a == b or b == c:
	print("2")
else:
	print("1")

Fixed code:
# coding: UTF8

#input = "30 30 30"
#l = map(int, input.split())
l = list(map(int, input().split()))
l.sort()
a = l[0]
b = l[1]
c = l[2]

if a == b == c:
	print("1")
elif a == b or b == c:
	print("2")
else:
	print("3")
Buggy code:
def iroha():
    a, b, c = map(int, input().split())
    if a == b and b == c and a == c:
        print(1)
    elif a != b and b != c and a != c:
        print(3)
    elif else:
        print(2)

if __name__ == "__main__":
    iroha()



Fixed code:
def iroha():
    a, b, c = map(int, input().split())
    if a == b and b == c and a == c:
        print(1)
    elif a != b and b != c and a != c:
        print(3)
    else:
        print(2)

if __name__ == "__main__":
    iroha()
Buggy code:
a, b, c = map(int, input().split())
    if a == b == c:
        print(1)
    elif a != b != c:
        print(3)
    else:
        print(2)



Fixed code:
a,b,c=map(int,input().split())
 
if a==b==c:
  print(1)
elif a==b or b==c or c==a:
  print(2)
else:
  print(3)
Buggy code:
a,b,c = map(int,input().split())
if a == b == c:
  print(1)
elif a == b or b == c or c == a:
  print(2)
elif:
  print(3)

Fixed code:
a,b,c = map(int,input().split())
if a == b == c:
  print(1)
elif a == b or b == c or c == a:
  print(2)
else:
  print(3)
Buggy code:
a=map(int,input().split())
a.sort()
print(1 if a[0]==a[2] else 2 if a[0]==a[1] or a[1]==a[2] else 3)

Fixed code:
a=list(map(int,input().split()))
a.sort()
print(1 if a[0]==a[2] else 2 if a[0]==a[1] or a[1]==a[2] else 3)
Buggy code:
j = int(input())

x = j.split()
y = []

for i in x:
  if(i not in y):
    y.append(i)
print(len(y))


Fixed code:
j = (input())

x = j.split()
y = []

for i in x:
  if(i not in y):
    y.append(i)
print(len(y))
Buggy code:
a = map(int, input().split())
print(set(a))

Fixed code:
a = map(int, input().split())
print(len(set(a)))
Buggy code:
# coding: utf-8

a,b,c=list(map(int,input().split()))

if a==b or b==c or c==a:
    if a==b==c:
        print("3")
    else:
        print("2")
else:
    print("1")

Fixed code:
# coding: utf-8

a,b,c=list(map(int,input().split()))

if a==b==c:
    print(1)
elif a==b or b==c or c==a:
    print(2)
else:
    print(3)
Buggy code:
a,b,c=map(int,input().split())
if a=b=c :
    print(1)
elif a=b and not b=c:
    print(2)
elif b=c and not a=c :
    print(2)
elif c=a and not a=b :
    print(2)
else :
    print(3)


Fixed code:
a,b,c=map(int,input().split())
if a==b==c :
    print(1)
elif a==b and not b==c:
    print(2)
elif b==c and not a==c :
    print(2)
elif c==a and not a==b :
    print(2)
else :
    print(3)
Buggy code:
a,b,c=map(int, input().split())
list=[a,b,c]
list.sort()
if list[0]==list[1]==list[2]:
    print(3)
elif list[1]==list[0] or list[1]==list[2]:
    print(2)
else:
    print(1)



Fixed code:
a,b,c=map(int, input().split())
list=[a,b,c]
list.sort()
if list[0]==list[1]==list[2]:
    print(1)
elif list[1]==list[0] or list[1]==list[2]:
    print(2)
else:
    print(3)
Buggy code:
n = map(int, input().split())
i = 3

if n[0] == n[1] :
    i -= 1

if n[0] == n[2] :
    i -= 1

elif n[1] == n[2] :
    i -= 1

print(i)


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

if n[0] == n[1] :
    i -= 1

if n[0] == n[2] :
    i -= 1

elif n[1] == n[2] :
    i -= 1

print(i)
Buggy code:
a,b,c = map(int, input().split())
if a==b==c:
  print(1)
elif a==b/=c:
  print(2)
elif a==c/=b:
  print(2)
elif c==b/=a:
  print(2)
else:
  print(3)

Fixed code:
a,b,c = map(int, input().split())
if a==b==c:
  print(1)
  exit()
if a==b:
  print(2)
elif a==c:
  print(2)
elif b==c:
  print(2)
else:
  print(3)
Buggy code:
a=input().split()
a.sort()
cnt=0
while len(s)>0:
    i=a.count(a.pop(0))
    for j in range(i):
        a.pop(0)
    cnt+=1
print(cnt)

Fixed code:
a=input().split()
a.sort()
cnt=0
while len(a)>0:
    i=a.count(a.pop(0))
    for j in range(i):
        a.pop(0)
    cnt+=1
print(cnt)
Buggy code:
a,b,c=map(int,input().split())
if a=b=c:
    print(1)
elif a=b!=c:
    print(2)
elif a!=b=c:
    print(2)
elif a=c!=b:
    print(2)
else:
    print(3)

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

if a == b == c:
  out = 1
elif a == b:
  out = 2
elif b == c:
  out = 2
elif c == a:
  out = 2
else:
  out = 3
print(out)
Buggy code:
a,b,c=map(int,input().split())
if a==b==C:
    print(1)
elif a==b or b==c or c==a:
    print(2)
else:
    print(3)


Fixed code:
a,b,c = map(int,input().split())
if a == b and b == c:
    print(1)
elif a == b or b == c or a == c:
    print(2)
else:
    print(3)
Buggy code:
s = list(input().split())
print(len(set(s))

Fixed code:
s = list(input().split())
print(len(set(s)))
Buggy code:
a,b,c = sorted(list(map(int,input().split())))
if a == c:
    print("1")
elif a == b | b == c:
    print("2")
else:
    print("3")



Fixed code:
a,b,c = sorted(list(map(int,input().split())))
if a == c:
    print("1")
elif a == b or b == c:
    print("2")
else:
    print("3")
Buggy code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif (a != b and b == c) or (a == b or b != c):
    print(2)
else:
    print(3)

Fixed code:
a, b, c = map(int, input().split())
if a == b and b == c:
    print(1)
elif (a != b and b == c) or (a == b and b != c) or (a == c and a != b):
    print(2)
else:
    print(3)
Buggy code:
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] = l[1] and l[1] = l[2]:
    s = s + 1
print(s)

Fixed code:
l = list(map(int, input().split()))
s = 3
for i in range(3):
    for j in range(i + 1, 3):
        if l[i] == l[j]:
            s = s - 1
if l[0] == l[1] and l[1] == l[2]:
    s = s + 1
print(s)
Buggy code:
a,b,c=map(int,input())
dic={}
dic[a]=1
dic[b]=1
dic[c]=1
print(len(list(dic)))

Fixed code:
a,b,c=map(int,input().split())
dic={}
dic[a]=1
dic[b]=1
dic[c]=1
print(len(list(dic)))
Buggy code:
list = str(input()).split()
if int(list[0]) = int(list[1]):
   if int(list[1]) = int(list[2]):
      print(1)
   else print(2)
elif int(list[0]) = int(list[2]):
   print(2)
elif int(list[1]) = int(list[2]):
   print(2)
else:
   print(3)

Fixed code:
list = str(input()).split()
if int(list[0]) == int(list[1]):
   if int(list[1]) == int(list[2]):
      print(1)
   else :
      print(2)
elif int(list[0]) == int(list[2]):
   print(2)
elif int(list[1]) == int(list[2]):
   print(2)
else:
   print(3)