qyliang/CodeNanoFix huggingface dataset:
Buggy code:
S = list(input())
T = list(input())
ans = 0

for i in range(3):
  if S[i] = T[i]:
    ans += 1

print(ans)

Fixed code:
S = list(input())
T = list(input())

cnt =0
for i in range(3):
    if S[i] == T[i]:
        cnt += 1

print(cnt)
Buggy code:
s = [i for i in input().split()]
t = [i for i in input().split()]

counter = 0

for i in range(3):
  if s[i] == t[i]:
    counter += 1

print(counter)

Fixed code:
s = [i for i in input()]
t = [i for i in input()]

counter = 0

for i in range(3):
    if s[i] == t[i]:
        counter += 1

print(counter)
Buggy code:
# -*- coding: utf-8 -*-
S = str(input())
T = str(input())

counter = 0
for i in range(S):
    if S[i] == T[i]:
        counter += 1

print(counter)

Fixed code:
# -*- coding: utf-8 -*-
S = str(input())
T = str(input())

counter = 0
for i in range(len(S)):
    if S[i] == T[i]:
        counter += 1

print(counter)
Buggy code:
a=input()
b=input()
count=0
for i in range(3):
  if a[i]=b[i]:
    count+=1
print(count)

Fixed code:
a=input()
b=input()
s=0
for i in range(3):
  if a[i]==b[i]:
    s+=1
    
print(s)
Buggy code:
s,t=open(0).read().split();print(sum([j==i for i in s for j in t]))

Fixed code:
s,t=open(0).read().split();print(sum([j==i for i,j in zip(s,t)]))
Buggy code:
a=input()
b=input()
c=1
for i in range(len(a)):
  if a[i]==b[i]:
    c+=1
print(c)

Fixed code:
a=input()
b=input()
c=0
for i in range(len(a)):
  if a[i] == b[i]:
    c+=1
print(c)
Buggy code:
s = input() 
t = input()

ans = 0

for i in range(3):
	if s[i]=t[i]:
		ans += ans

print(ans)

Fixed code:
s = list(input())
t = list(input())

ans = 0
for i in range(3):
	if s[i] == t[i]:
		ans += 1


print(ans)
Buggy code:
s = [si for si in input()]
t = [ti for ti in input()]


cnt = 0
for i in range(3):
    if s[i] == t[i]:
        print(s[i])
        cnt += 1

print(cnt)



Fixed code:
s = [si for si in input()]
t = [ti for ti in input()]


cnt = 0
for i in range(3):
    if s[i] == t[i]:
        cnt += 1

print(cnt)
Buggy code:
s = list(input())
t = list(input())
count = 0
for i in range(2):
  if s[i]=t[i]:count+=1
print(count)

Fixed code:
s = list(input())
t = list(input())
count = 0
for i in range(3):
  if s[i] == t[i]:
    count+=1
print(count)
Buggy code:
s = list(input())
t = list(input())
count = 0
for i in range(3):
  if s[i]=t[i]:
    count+=1
print(count)

Fixed code:
s = list(input())
t = list(input())
count = 0

for i in range (0,3):
    if s[i] == t[i]:
        count = count + 1
print (count)
Buggy code:
s = input()
t = input()
ans = 0
for i,j in zip(s,t):
  if s == t:
    ans += 1:
print(ans)

Fixed code:
s = input()
t = input()
ans = 0
for i,j in zip(s,t):
  if i == j:
    ans += 1
print(ans)
Buggy code:
S = list(input())
T = list(input())
count = 0

for i in range(3):
  if S[i] == T[i]:
    count += 1

Fixed code:
S = list(input())
T = list(input())
count = 0

for i in range(3):
  if S[i] == T[i]:
    count += 1
  else:
    count = count
print(count)
Buggy code:
S = str(input())
T = str(input())

s = list(S)
t = list(T)

ans = 0

for i in range(2):
    if s[i] == t[i]:
        ans += 1
        
print(ans)

Fixed code:
S = str(input())
T = str(input())

s = list(S)
t = list(T)

ans = 0

for i in range(3):
    if s[i] == t[i]:
        ans += 1
        
print(ans)
Buggy code:
forecast = input()
real = input()

a = 0

for i in range(0,2)
  if forecast[i] == real[i]:
    a += 1
    
print(a)

Fixed code:
forecast = input()
real = input()

a = 0

for i in range(0,3):
  if forecast[i] == real[i]:
    a += 1
    
print(a)
Buggy code:
s=input()
t=input()
c=0
for i in range(2):
  if s[i]==t[i]:
    c+=1
print(c)

Fixed code:
s=input()
t=input()
c=0
for i in range(3):
  if s[i]==t[i]:
    c+=1
print(c)
Buggy code:
s = input()
t = input()
ans = 0
for i in range(3):
    if(s[i]!=t[i]):
        ans+=1
print(ans)

Fixed code:
s = input()
t = input()
ans = 0
for i in range(3):
    if(s[i]==t[i]):
        ans+=1
print(ans)
Buggy code:
S = input()
T = input()

judgelist = []

if S[0] == T[0]:
    judgelist.append(1)
if S[1] == T[1]:
    judgelist.append(1)
if S[2] == S[2]:
    judgelist.append(1)

print(sum(judgelist))

Fixed code:
S = input()
T = input()

judgelist = [0]

if S[0] == T[0]:
    judgelist.append(1)
if S[1] == T[1]:
    judgelist.append(1)
if S[2] == T[2]:
    judgelist.append(1)

print(sum(judgelist))
Buggy code:
S = input()
T = input()

cnt, i = 0, 0

for s in S:
    if s != T[i]:
        cnt += 1
    i += 1

print(cnt)

Fixed code:
S = input()
T = input()

cnt, i = 0, 0

for s in S:
    if s == T[i]:
        cnt += 1
    i += 1

print(cnt)
Buggy code:
S = input()
T = input()
print(len([1 for i in range(3) if S[i]==T[i]])

Fixed code:
S = input()
T = input()
print(len([1 for i in range(3) if S[i]==T[i]]))
Buggy code:
c = 0

for i in range(0,3):
  if S[i:i+1] == T[i:i+1]:
    c += 1
  
print(c)

Fixed code:
S = input()
T = input()
c = 0
for i in range(0,3):
  if S[i:i+1] == T[i:i+1]:
    c += 1
print(c)
Buggy code:
s = input()
t = input()
for i in range(3):
	if s[i] == t[i]:
		ans += 1
		
print(ans)

Fixed code:
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans += 1
print(ans)
Buggy code:
a = input()
b = input()
print(sum(a[i] == b[i] for i in range[3]))

Fixed code:
a = input()
b = input()
print(sum(a[i] == b[i] for i in range(3)))
Buggy code:
S=str(input())
T=str(input())

count=0
for i in range(3):
    if S[i]==S[j]:
        count+=1

print(count)

Fixed code:
S=str(input())
T=str(input())

count=0
for i in range(3):
    if S[i]==T[i]:
        count+=1

print(count)
Buggy code:
s = input()
t = input()

count = 0

for i in range(3)
	if s[i] == t[i]
	count += 1  
  	print(count)

Fixed code:
s = input()
t = input()
 
count = 0
 
for i in range(3):
		if s[i] == t[i]:
			count += 1  
    
print(count)
Buggy code:
    S=input()
    T=input()
    a=0
    for i in range(3):
        if S[i]==T[i]:
            a+=1
    print(a)

Fixed code:
S = input()
T = input()

count = 0

for i in range(3):
	if S[i] == T[i]:
		count += 1

print(count)
Buggy code:
s = input()
t = input()
 
count = 0
 
for i in range(3):
	if s[i] == t[i]
	count += 1  
  	print(count)

Fixed code:
s=input()
t=input()
c=0
for i in range(3) :
    if s[i] == t[i] :
        c = c +1
print(c)
Buggy code:
S = str(input())
T = str(input())

Sum = 0

for i in range(S):
    if S[i] == T[i]:
        Sum += 1
        
print(Sum)

Fixed code:
S = str(input())
T = str(input())

Sum = 0

for i in range(len(S)):
    if S[i] == T[i]:
        Sum += 1
        
print(Sum)
Buggy code:
s,t=input(),input() print((s[0]==t[0])+(s[1]==t[1])+(s[2]==t[2]))

Fixed code:
s,t=input(),input() 
print((s[0]==t[0])+(s[1]==t[1])+(s[2]==t[2]))
Buggy code:
s = input()
t = input()
x = 0
for i in 3:
  x += s[i-1]!=t[i-1]
print(x)

Fixed code:
s = input()
t = input()
x = 0
for i in range(3):
  x += s[i-1]==t[i-1]
print(x)
Buggy code:
S=list(input())
T=list(input())

a=0
for i in range(2):
    if S[i]==T[i]:
        a+=1

print(a)

Fixed code:
S=list(input())
T=list(input())

a=0
for i in range(3):
    if S[i]==T[i]:
        a+=1

print(a)
Buggy code:
s = input()
t = input()

print(sum[1 for i in range(3) if s[i] == t[i]])

Fixed code:
s = input()
t = input()

print(sum([1 for i in range(3) if s[i] == t[i]]))
Buggy code:
result = 0
for i in range(3):
  if T[i] == S[i]:
    result +=1
print(result)

Fixed code:
S = input()
T = input()
result = 0
for i in range(3):
  if T[i] == S[i]:
    result +=1
print(result)
Buggy code:
    forecasts = list(input())
    actuals = list(input())
    ex_count = 0
    for x in range(3):
        if forecasts[x] == actuals[x]:
            ex_count = ex_count + 1
    print("{}".format(ex_count))

Fixed code:
forecasts = list(input())
actuals = list(input())
ex_count = 0
for x in range(3):
    if forecasts[x] == actuals[x]:
        ex_count = ex_count + 1
print("{}".format(ex_count))
Buggy code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	S = IS()
	T = IS()
	ans = 0
	for i in range(3):
		if(S[i]==T(i)):
			ans+=1
	print(ans)

if __name__ == '__main__':
	main()

Fixed code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	S = IS()
	T = IS()
	ans = 0
	for i in range(3):
		if(S[i]==T[i]):
			ans+=1
	print(ans)

if __name__ == '__main__':
	main()
Buggy code:
s = input()
t = input()

count = 0
for x in range(2):
  if s[x]==t[x]:
    count+=1
    
print(count)

Fixed code:
s = input()
t = input()

count = 0
for x in range(3):
  if s[x]==t[x]:
    count+=1
    
print(count)
Buggy code:
s=input()
t=input()
ans=0
for i in range(2):
    if s[i]==t[i]:ans+=1
print(ans)

Fixed code:
s = input()
t = input()

ans = 0
for i in range(len(s)):
  if s[i] == t[i]:
    ans += 1

print(ans)
Buggy code:
S = list(input())
T = list(input())

count = 0

for i in range(2):
    if S[i] == T[i]:
        count += 1

print(count)


Fixed code:
S = list(input())
T = list(input())

count = 0

for i in range(3):
    if S[i] == T[i]:
        count += 1

print(count)
Buggy code:
 S = input()
 T = input()
count = 0

for i in range(3):
  if S[i] == T[i]:
    count += 1
    
 print(count)

Fixed code:
S = input()
T = input()
answer = 0
for i in range(3):
    if S[i] == T[i]:
        answer += 1
print(answer)
Buggy code:
s=input()
t=input()
a=0
for i in range (0,2):
    if s[i]=t[i]
    a=a+1
print(a)

Fixed code:
s=input()
t=input()
a=0
for i in range (0,3):
    if s[i]==t[i]:
        a=a+1
print(a)
Buggy code:
S = list(input().split())
T = list(input().split())

ans =  0
for i in range(3):
    if S[i] == T[i]:
        ans += 1

print(ans)

Fixed code:
S = list(input())
T = list(input()) 

ans =  0
for i in range(3):
    if S[i] == T[i]:
        ans += 1

print(ans)
Buggy code:
S = list(input())
T = list(input()) 

ans =  0
print(S)
for i in range(3):
    if S[i] == T[i]:
        ans += 1

print(ans)

Fixed code:
S = list(input())
T=list(input())
cnt=0
for i in range(3):
  if( S[i] == T[i] ) :
    cnt+=1
print(cnt)
Buggy code:
S = str(input())
T = str(input())

a = 0

for x in range(2):
    if S[x] == T[x]:
        a += 1
    else:
        pass

print(a)

Fixed code:
S = str(input())
T = str(input())

a = 0

for x in range(3):
    if S[x] == T[x]:
        a += 1
    else:
        pass

print(a)
Buggy code:
S = input()
T = input()
count = 0
for i in range(3):
  if S[i]=T[i]:
    count += 1
print(count)

Fixed code:
S = input()
T = input()
counter = 0

for i in range(3):
    if S[i] == T[i]:
        counter += 1

print(counter)
Buggy code:
S=input()
T=input()
count=0
for i in range(3):
  if S[i]==T[i]:
    count+=1
  else:
    pass
    

Fixed code:
S=input()
T=input()
count=0
for i in range(3):
  if S[i]==T[i]:
    count+=1
  else:
    pass

print(count)
Buggy code:
S = input()
T = input()
cnt = 0
for i in S:
  if S[i] == T[i]:
    cnt += 1
print(cnt)

Fixed code:
S = input()
T = input()
cnt = 0
loop = 0
for i in S:
  if i == T[loop]:
    cnt += 1
  loop += 1
print(cnt)
Buggy code:
s1=input()
s2=input()
c=0
for i in range(3):
  for j in range(3):
    if s1[i]==s2[j]:
      c+=1
print(c)


Fixed code:
s1=input()
s2=input()
c=0
for i,j in zip(range(3),range(3)):
    if s1[i]==s2[j]:
      c+=1
print(c)
Buggy code:
f = inout()
r = input()

cnt = 0
for i in range(3):
  if f[i] == r[i]:
    cnt += 1
print(cnt)

Fixed code:
f = input()
r = input()
 
cnt = 0
for i in range(3):
  if f[i] == r[i]:
    cnt += 1
print(cnt)
Buggy code:
s = input()
t = input()

count = 0
for i in range(s):
  if s[i] == t[i]:
    count += 1
    
print(count)

Fixed code:
s = input()
t = input()

count = 0
for i in range(len(s)):
  if s[i] == t[i]:
    count += 1
    
print(count)
Buggy code:
import sys
input = sys.stdin.readline

S = str(input())
T = str(input())

ans = 0
for s, t in zip(S, T):
    if s == t:
        ans += 1
print(ans)

Fixed code:
import sys
input = sys.stdin.readline

S = str(input().rstrip())
T = str(input().rstrip())

ans = 0
for s, t in zip(S, T):
    if s == t:
        ans += 1
print(ans)
Buggy code:
S=input()
T=input()
flag=0
for i in range(3):
  if S[i]==T[i]:
    flag+=1
    print(flag)

Fixed code:
S=input()
T=input()
count=0
for i in range(3):
  if S[i]==T[i]:
    count+=1
print(count)
Buggy code:
ss = input()
tt = input()

print(sum([s==t for s, t in zip(s,t)]))

Fixed code:
ss = input()
tt = input()

print(sum([s==t for s, t in zip(ss,tt)]))
Buggy code:
s = input()
t = input()

count = 0

for i in range(3);:
    if s[i] == t[i]:
        count += 1
        
print(count)

Fixed code:
s = input()
t = input()

count = 0

for i in range(3):
    if s[i] == t[i]:
        count += 1
        
print(count)
Buggy code:
s=input()
t=input()
print(sum(1 for i in range(len(s)) if s[i] == l[i]))

Fixed code:
s=input()
t=input()
print(sum(1 for i in range(len(s)) if s[i] == t[i]))
Buggy code:
s=str(input())
n=str(input())
count=0
for i in range(3):
  if s[i]==t[i]:
    count+=1
print(count)

Fixed code:
s = input()
t = input()

count = 0
for i in range(3):
    if s[i] == t[i]:
        count += 1
print(count)
Buggy code:
pred = [i for i in input()]
data = [i fpr i in input()]
cnt = 0

for i in range(3):
  if pred[i] == data[i]:
    cnt += 1

print(cnt)

Fixed code:
pred = [i for i in input()]
data = [i for i in input()]
cnt = 0

for i in range(3):
  if pred[i] == data[i]:
    cnt += 1

print(cnt)
Buggy code:
S=input()
T=input()

output=0

for i in range(3):
    if S[0,i]==T[0,i]:
        output=output+1
    else :
        pass
    
print(output)
        

Fixed code:
S=input()
T=input()

output=0

for i in range(3):
    if S[i]==T[i]:
        output=output+1
    else :
        pass
    
print(output)
Buggy code:
S=input()
T=input()
ans=0
for i in range(3):
	if S[i] == T[i]:
  	ans += 1
print(ans)

Fixed code:
S = input()
T = input()

result = 0
for i in range(3):
  if S[i] == T[i]:
    result += 1

print(result)
Buggy code:
forecast = input()
actual = input()
count = 0

for i in range(len(forecast)):
  if forcast[i] = actual[i]:
    count += 1
print(count)

Fixed code:
forecast = input()
actual = input()
count = 0
 
for i in range(len(forecast)):
  if forecast[i] == actual[i]:
    count += 1
print(count)
Buggy code:
a = str(input())
b = str(input())
count = 0
for i in renge(3)
	if a[i] == b[i]:
    	count += 1
print(count)


Fixed code:
a = str(input())
b = str(input())
count = 0
for i in range(3):
	if a[i] == b[i]:
		count += 1
        
print(count)
Buggy code:
S = input()
T = input()
count = 0
for i in range(3):
  if S[3] == T[3]:
    count += 1
print(count)   
  

Fixed code:
S = input()
T = input()

count = 0

for i in range(0, 3):
    if S[i] == T[i]:
        count = count + 1

print(count)
Buggy code:
a=list(input())
b=list(input())
count=0
for i in range (2):
  if a[i]==b[i]:
    count+=1
print(count)

Fixed code:
a=list(input())
b=list(input())
count=0
for i in range (3):
  if a[i]==b[i]:
    count+=1
    
print(count)
Buggy code:
x = input()
y = input()
ans = 0
for i in range(len(x)):
  for j in range(len(y)):
    if i == j:
      if li[i] != li[j]:
        ans += 1
print(ans)

Fixed code:
x = input()
y = input()
ans = 0
for i in range(len(x)):
  for j in range(len(y)):
    if i == j:
      if x[i] == y[j]:
        ans += 1
print(ans)
Buggy code:
S=input()
T=input()
ans=0
if S[0]==T[0]:
	ans += 1
if S[1]==T[1]
	ans += 1
if S[2]==T[2]
	ans += 1
ans

Fixed code:
S=input()
T=input()
ans=0
if S[0]==T[0]:
    ans+=1
if S[1]==T[1]:
    ans+=1
if S[2]==T[2]:
    ans+=1
print(ans)
Buggy code:
S = input()
T = input()
count = 0
for i in range(3):
    if S[i] == T[i]:
        ++count
print(count)

Fixed code:
S = input()
T = input()

count = 0

for i in range(0, 3):
    if S[i] == T[i]:
        count += 1

print(count)
Buggy code:
S = input().split()
T = input().split()
c = 0
for i in range(len(S)):
  if S[i]==T[i]:
    c+=1
print(c)

Fixed code:
S = input()
T = input()
c = 0
for i in range(len(S)):
  if S[i]==T[i]:
    c+=1
print(c)
Buggy code:
i=input()
j=input()
count_num=0
for k in range(3):
  if i[k]==j[k]:
    count_num+=1
print(conut_num)

Fixed code:
i=input()
j=input()
count_num=0
for k in range(3):
  if i[k]==j[k]:
    count_num+=1
print(count_num)
Buggy code:
predict = input()
actual  = input()

a = 0
for i in range(3):
	if(predict[i] == actual[i]):
    	a = a + 1
print(a)

Fixed code:
predict, actual = input(),input()
a = 0
for i in range(3):
    if(predict[i] == actual[i]):
        a = a + 1
print(a)
Buggy code:
s = input()
t = input()

c

for i in range(3):
    if s[i] == t[i]:
        c +=1

print(c)

Fixed code:
s = input()
t = input()

c = 0

for i in range(3):
    if s[i] == t[i]:
        c +=1

print(c)
Buggy code:
s = input()
t = input()
l = 0
for i in range(len(s)):
    if s[i]!=t[i]:
        l+=1
print(l)

Fixed code:
s = input()
t = input()
l = 0
for i in range(len(s)):
    if s[i]==t[i]:
        l+=1
print(l)
Buggy code:
S = input()
T = input()
count = 0
if S[0] == T[0]:
  count = count+1
if S[1] == T[1]:
  count = count+1
if S[2] == T[2]:
  count == count+1
print(count)

Fixed code:
S = input()
T = input()
count = 0
if S[0] == T[0]:
  count = count+1
if S[1] == T[1]:
  count = count+1
if S[2] == T[2]:
  count = count+1
print(count)
Buggy code:
S = input()
T = input()
S = [i for i in S]
T = [i for i in T]

for i in range(3):
  if S[i]==T[i]:
    cnt+=1

print(cnt)

Fixed code:
S = input()
T = input()
S = [i for i in S]
T = [i for i in T]
cnt=0

for i in range(3):
  if S[i]==T[i]:
    cnt+=1

print(cnt)
Buggy code:
S=list(input())
T=list(input())
c=0
for u,v = zip(S,T):
    if u==v:
        c+=1
print(c)

Fixed code:
S=list(input())
T=list(input())
c=0
for u,v in zip(S,T):
    if u==v:
        c+=1
print(c)
Buggy code:
a = input()
b = input()
count = 0
for i in range (2):
  if a[i]==b[i]:
    count +=1
print(count)

Fixed code:
a = input()
b = input()
count = 0
for i in range (3):
  if a[i]==b[i]:
    count +=1
print(count)
Buggy code:
S=list(input())
T=list(input())
if S[0]==T[0] and S[1]==T[1] and S[2]==T[2]:
  print(3)
elif S[0]==T[0] or S[1]==T[1] or S[2]==T[2]:
  print(1)
elif S[0]!=T[0] and S[1]!=T[1] and S[2]!=T[2]:
  print(0)
else:
  print(2)

Fixed code:
S=list(input())
T=list(input())
if S[0]==T[0] and S[1]==T[1] and S[2]==T[2]:
  print(3)
elif S[0]==T[0] and S[1]!=T[1] and S[2]!=T[2]:
  print(1)
elif S[0]!=T[0] and S[1]==T[1] and S[2]!=T[2]:
  print(1)
elif S[0]!=T[0] and S[1]!=T[1] and S[2]==T[2]:
  print(1)
elif S[0]!=T[0] and S[1]!=T[1] and S[2]!=T[2]:
  print(0)
else:
  print(2)
Buggy code:
S=input()
T=input()
i=0
for i in range(3):
    if S[i]==T[i]:
        i+=1
print(i)

Fixed code:
S = input()
T = input()

ans = 0
for i in range(3):
    if S[i] == T[i] :
        ans += 1 
print(ans)
Buggy code:
a = [input().split() for l in range(2)]
print(a)
forecast = list(str(a[0]))
real = list(str(a[1]))

count = 0
if forecast[2] == real[2]:
  count = count + 1
if forecast[3] == real[3]:
  count = count + 1
if forecast[4] == real[4]:
  count = count + 1
 
print(str(count))


Fixed code:
a = [input().split() for l in range(2)]
forecast = list(str(a[0]))
real = list(str(a[1]))
count = 0
if forecast[2] == real[2]:
  count = count + 1
if forecast[3] == real[3]:
  count = count + 1
if forecast[4] == real[4]:
  count = count + 1
 
print(str(count))
Buggy code:
predict = input('predict')

actual = input('actual')

count = 0

for index in range(0, len(predict)):
    if predict[index] == actual[index]:
        count += 1
        
print (count)

Fixed code:
predict = input()

actual = input()

count = 0

for index in range(0, len(predict)):
    if predict[index] == actual[index]:
        count += 1

print (count)
Buggy code:
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i]==s[t]:
    ans+=1
print(ans)

Fixed code:
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i]==t[i]:
    ans+=1
print(ans)
Buggy code:
S = input()
T = input()
i = 1
for j in range(3):
    if S[j] = T[J]:
        i += 1
print(i)


Fixed code:
S = input()
T = input()
i = 0
for j in range(3):
    if S[j] == T[j]:
        i += 1
print(i)
Buggy code:
s=str(input())
l=str(input())
count=0
if s[0]=l[0]:
    count+=1
if s[1]=l[1]:
    count+=1
if s[2]=l[2]:
    count+=1
print(count)

Fixed code:
s=str(input())
l=str(input())
count=0
if s[0]==l[0]:
    count+=1
if s[1]==l[1]:
    count+=1
if s[2]==l[2]:
    count+=1
print(count)
Buggy code:
S=input()
T=input()
count=0
for i in range(3)
if S[i]=T[i]:
  count+=1
  
  print(count)
  

Fixed code:
S = input()
T = input()
rslt = 0
for i in range(3):
    if S[i] == T[i]:
        rslt += 1
print(rslt)
Buggy code:
S = list(v for v in input())
T = list(v fot v in input())

count = 0

for i in range(3):
  if S[i] == T[i]:
    count += 1

print(count)


Fixed code:
S = list(v for v in input())
T = list(v for v in input())
 
count = 0
 
for i in range(3):
  if S[i] == T[i]:
    count += 1
 
print(count)
Buggy code:
S = input()
T = input()

count = 0
for i in range(0, 2):
  if S[i] == T[i]:
    count += 1
print(count)

Fixed code:
S = input()
T = input()

count = 0
for i in range(0, 3):
  if S[i] == T[i]:
    count += 1
print(count)
Buggy code:

cnt = 0
for i in range(3):
    if S[i] == T[i]:
        cnt += 1
print(cnt)

Fixed code:
S = list(input())
T = list(input())
cnt = 0
for i in range(3):
    if S[i] == T[i]:
        cnt += 1
print(cnt)
Buggy code:
s = input()
t = input()

hit = 0
for i in range(3):
  if s[i] == t[i]:
    hit += 1

Fixed code:
s = input()
t = input()

hit = 0
for i in range(3):
  if s[i] == t[i]:
    hit += 1
print(hit)
Buggy code:
s=list(input())
t=list(input())
ans = 0
for i in range(2):
  if s[i]==t[i]:
    ans+=1
print(ans)

Fixed code:
s=list(input())
t=list(input())
ans = 0
for i in range(3):
  if s[i]==t[i]:
    ans+=1
print(ans)
Buggy code:
s = input()
t = input()
count = 0
 for i,j in zip(s,t):
  if i==j:
     count += 1
print(count)

Fixed code:
s = input()
t = input()
count = 0
for i,j in zip(s,t):
  if i==j:
    count += 1
print(count)
Buggy code:
s = input()
t = input()
cnt = 0
for i in range(3):
  if(s[i]==t[i]):
    cnt += 1
prirnt(cnt)

Fixed code:
s = input()
t = input()
cnt = 0
for i in range(3):
  if(s[i]==t[i]):
    cnt += 1
print(cnt)
Buggy code:
S = list(input())
T = list(input())
l = 0
for i in range(len(s)):
  if S[i] == T[i]:
    l += 1
print(l)

Fixed code:
S = list(input())
T = list(input())
l = 0
for i in range(len(S)):
  if S[i] == T[i]:
    l += 1
print(l)
Buggy code:
s=list(int(input()))
t=list(int(input()))
count = 0
for i in range(len(s)):
  if s[i] == t[i]:
    count += 1
print(int(count))

Fixed code:
s=list(input())
t=list(input())
count = 0
for i in range(len(s)):
  if s[i] == t[i]:
    count += 1
print(int(count))
Buggy code:
T = input()
count = 0

for i in range(len(S)):
  if S[i]==T[i]:
    count += 1
    
print(count)

Fixed code:
S = input()
T = input()
count = 0

for i in range(len(S)):
  if S[i]==T[i]:
    count += 1
    
print(count)
Buggy code:
S = input()
T = input()

ans = 0
for i in range(len(S)):
  if S[i]!=T[i]:
    ans+=1

print(ans)

Fixed code:
S = input()
T = input()

ans = 0
for i in range(len(S)):
  if S[i]==T[i]:
    ans+=1
print(ans)
Buggy code:
days = list(str(input()))
days_real = list(str(input()))
for i in range(3):
  if days[i] == days_real[i]:
    count += 1
print(count)

Fixed code:
days = list(str(input()))
days_real = list(str(input()))
count = 0
for i in range(3):
  if days[i] == days_real[i]:
    count += 1
print(count)