qyliang/CodeNanoFix huggingface dataset:
Buggy code:
s = input()
t = input()
count = 0

for i in 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()
i=0
for i in range(3):
  if S[i]==T[i]:
    i+=1
print(i)
 

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

ans = 0

if S[0] == T[0] :
	ans += 1

elif S[1] == T[1] :
	ans += 1

elif S[2] == T[2] :
	ans += 1

print(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()
print(sum([1 for i in range(3) if S[i] == R[i]]))

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

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

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

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

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

print(ans)

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

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

print(ans)
Buggy code:
from sys import stdin

a,b=  stdin.readline().rstrip().split()

count = 0
for i,j in zip(a,b):
    if i ==j:
        count += 1



print(count)

Fixed code:
from sys import stdin

a=  stdin.readline().rstrip()
b=  stdin.readline().rstrip()

count = 0
for i,j in zip(a,b):
    if i ==j:
        count += 1



print(count)
Buggy code:

pre = input().rstrip()
sur = input().rstrip()
num = len([n for n in range(len(pre)) if pre[n] = sur[n]])
print(num)

Fixed code:
pre = input().rstrip()
sur = input().rstrip()
num = len([n for n in range(len(pre)) if pre[n] == sur[n]])
print(num)
Buggy code:
import sys

s = sys.stdin.gets()
t = sys.stdin.gets()

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

Fixed code:
import sys

s = sys.stdin.readline()
t = sys.stdin.readline()

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

Fixed code:
s = input()
t = input()
cnt = 0
if s[0] == t[0]:
  cnt += 1
if s[1] == t[1]:
  cnt +=1
if s[2] == t[2]:
  cnt += 1
print(cnt)
Buggy code:
print(sum(c is d for c, d in input(), input()))

Fixed code:
print(sum(c is d for c, d in zip(input(), input())))
Buggy code:
S=input()
T=input()
ans=0
for x 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()
count = 0
if s[0] == t[0]:
    count = count + 1
if s[1] == t[1]:
    count = count +1
if s[2] == t[2]:
    count = coiunt +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()
ans=0
for i in range(3)
if S[i]==T[i]:
  ans+=1
print(ans)

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

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

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

Fixed code:
a = []
for i in range(2):
    a.append(input())

c = 0
for i in range (3):
  if a[0][i] == a[1][i]:
    c += 1
print(c)
Buggy code:
def compare(a, b):
  	c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
x = input()
y = input()
compare(x,y)

Fixed code:
def compare(a, b):
    c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
    return c
x = input()
y = input()
print(compare(x,y))
Buggy code:
s = input()
t = input()

x = 0

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

print(x)

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

x = 0

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

print(x)
Buggy code:
S = list(input())
T = list(input())
cnt = 0

for i in range(2):
    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()
c = 0
for s,t in zip(S,T):
  if s = t: c+=1
print(c)

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

Fixed code:
S = str(input())
T = str(input())
ans = 0
for i in range(3):
  if S[i] == T[i]:
    ans +=1
print(ans)
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()

c = 0
for i in range(3):
    if S[i] == T[i]:
        c += 1
print(c)
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:
predict = input()
real = input()
cnt = 0

for i,j in zip(predict, real):
  if i == j:
    cnt += 1
    
print(cnt
  

Fixed code:
predict = input()
real = input()
cnt = 0
 
for i,j in zip(predict, real):
  if i == j:
    cnt += 1
    
print(cnt)
Buggy code:
*A, = input()
*B, = input()
ans = 0
if A[0] == B[0]:
  ans += 1
elif A[1] == B[1]:
  ans += 1
elif A[2] == B[2]:
  ans += 1
print(ans)

Fixed code:
*A, = input()
*B, = input()
ans = 0
if A[0] == B[0]:
  ans += 1
if A[1] == B[1]:
  ans += 1
if A[2] == B[2]:
  ans += 1
print(ans)
Buggy code:
a = input()
b = input()
c = 0
for i in range(3):
  if a[a] == b[i]:
    c += 1
print(c)

Fixed code:
a = input()
b = input()
cnt = 0
for i in range(3):
    if a[i] == b[i]:
      cnt+=1
print(cnt)
Buggy code:
s = input("")                                                                                                           t = input("")                                                                                                           s_list = list(s)                                                                                                        t_list = list(t)                                                                                                        n = 0                                                                                                                                                                                                                                           for i in range(3):                                                                                                          if s_list[i] == t_list[i]:                                                                                                  n += 1                                                                                                                                                                                                                                  print(n)  s = input("")                                                                                                           t = input("")                                                                                                           s_list = list(s)                                                                                                        t_list = list(t)                                                                                                        n = 0                                                                                                                                                                                                                                           for i in range(3):                                                                                                          if s_list[i] == t_list[i]:                                                                                                  n += 1                                                                                                                                                                                                                                  print(n)  

Fixed code:
s = input("")
t = input("")
s_list = list(s)
t_list = list(t)
n = 0

for i in range(3):
    if s_list[i] == t_list[i]:
        n += 1

print(n)
Buggy code:
# -*- coding: utf-8 -*-
# @Author: WA_King
# @Date:   2019-04-03 19:35:31
# @Last Modified by:   lcw
# @Last Modified time: 2019-09-02 13:50:55
a=input()[:-1]
b=input()[:-1]
ans=0
for i in range(len(a)):
	if a[i]==b[i]:
		ans+=1
print(ans)

Fixed code:
# -*- coding: utf-8 -*-
# @Author: WA_King
# @Date:   2019-04-03 19:35:31
# @Last Modified by:   lcw
# @Last Modified time: 2019-09-02 13:50:55
a=''.join(input().split())
b=''.join(input().split())
ans=0
for i in range(len(a)):
	if a[i]==b[i]:
		ans+=1
print(ans)
Buggy code:
S = input()
T = input()
ans = 0
for x in range(0,3):
    if S[x] == T[x]:
        ans = ans + 1

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

count = 0
if s[0]==t[0]:
    count += 1
if s[1]==t[1]:
    count += 1
if s[2]==t[2]:
    count += 1
print(3)

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

count = 0
if s[0]==t[0]:
    count += 1
if s[1]==t[1]:
    count += 1
if s[2]==t[2]:
    count += 1
print(count)
Buggy code:
S = int(input())
T = int(input())

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

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

cnt=0
for i in range(len(S)):
    if S[i]==T[i]:
        cnt+=1
print(cnt)
Buggy code:
s = input()
t = input()
ans = 0
for i in range(3):
  if s[i] == t[i]:
    ans +=1
ptiny(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 = list(input())
T = list(input())
c = 0
for i in range(2):
    if S[i] == T[i]:
        c += 1
print(c)


Fixed code:
S = list(input())
T = list(input())
c = 0
for i in range(3):
    if S[i] == T[i]:
        c += 1
print(c)
Buggy code:
# Template 1.0
import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Fixed code:
# Template 1.0
import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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()
ans = 0
for i in range(3):
	if s[i] == t[i]:
    	ans += 1
print(ans)

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

cnt = 0

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

pirn(cnt)
  

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

cnt = 0

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

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


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


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


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


Fixed code:
s = input()
t = input()
c = 0
for i in range(3):
    if s[i] == t[i]:
        c += 1
print(c)
Buggy code:
A = sys.stdin.readline()
B = sys.stdin.readline()
ans = 0

for i in range(3):
  if A[i] == B[i]:
    ans += 1
    
print(ans)

Fixed code:
import sys

A = sys.stdin.readline()
B = sys.stdin.readline()
ans = 0

for i in range(3):
  if A[i] == B[i]:
    ans += 1
    
print(ans)
Buggy code:
S = list(input())
T = list(input())

i = 0
ans_cnt = 0

while i < len(S):
    i += 1
    if S[i] == T[i]:
        ans_cnt += 1

print(ans_cnt)


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

i = 0
ans_cnt = 0

while i < len(S):
    if S[i] == T[i]:
        ans_cnt += 1
    i += 1

print(ans_cnt)
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()

days = 0
for i in range(3):
    if S[i] == T[i]:
        days = days + 1
print(days)
Buggy code:
def test_a():
    S=list(input())
    T=list(input())
    c=0
    print(S)
    for i in range(3):
        if S[i]==T[i]:
            c+=1
    print(c)

test_a()


Fixed code:
def test_a():
    S=list(input())
    T=list(input())
    c=0
    for i in range(3):
        if S[i]==T[i]:
            c+=1
    print(c)

test_a()
Buggy code:
S = input()
T = input()
print(sum([1 if S[i]==T[i] else 0 for i in range(3)))

Fixed code:
S = input()
T = input()
print(sum([1 if S[i]==T[i] else 0 for i in range(3)]))
Buggy code:
S = str(input())
T = str(input())
ans = 0

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

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

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


Fixed code:
S = list(str(input()))
T = list(str(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:
a = str(input())
b = str(input())

ans = 0

for i in range(len(a)-1):
  for j in range(len(b)-1):
    if a[i] == b[j]:
      ans +=1

print(ans)

Fixed code:
a = str(input())
b = str(input())

ans = 0

for i in range(len(a)):
  if a[i] == b[i]:
    ans +=1

print(ans)
Buggy code:
s=input()
t=input()
num=0

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

num

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

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

print(num)
Buggy code:
l = input()
t = input().sprit()
c = 0
for i in range(0,3):
  if l[i] == t[i]:
    c = c+1
  else:
    continue

print(c)


Fixed code:
l = input()
t = input()
c = 0
for i in range(0,3):
  if l[i] == t[i]:
    c = c+1
  else:
    continue

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


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

for i, j in s, t:
    if i == j:
        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 = input()
n = input()
ans = 0
for i in range(n):
  if s[0] == n[i]:
    ans += 1
print(ans)
  
  

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

ans = 0
for i in 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:
s = input()
t = s[1]
s = s[0]
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().split()
T = input().split()

sl = []
tl = []
ans = 0
for s in S:
  sl.append(s)

for t in T:
  tl.append(t)

for i in range(3):
  if sl[i] == tl[i]:
    ans += 1
print(ans)

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

sl = []
tl = []
ans = 0
for s in S:
  sl.append(s)

for t in T:
  tl.append(t)

for i in range(3):
  if sl[i] == tl[i]:
    ans += 1
print(ans)
Buggy code:
a = input()
b = input()
s = 0
for i in range(2):
  if a[i] == b[i]:
    s += 1
print(s)

Fixed code:
a = input()
b = input()
s = 0
for i in range(3):
  if a[i] == b[i]:
    s += 1
print(s)
Buggy code:
yk  = input()
js  = input()
def caonima(yk, js):
    res = 0
    if len(yk) != len(js):
        return
    for i in range(len(yk)):
        if yk[i] == js[i]:
            res += 1
    return res
caonima(yk,js)

Fixed code:
yk  = input()
js  = input()
def caonima(yk, js):
    res = 0
    if len(yk) != len(js):
        return
    for i in range(len(yk)):
        if yk[i] == js[i]:
            res += 1
    return res
c = caonima(yk,js)
print(c)
Buggy code:
S=int(input())
T=int(input())

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

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

count=0
for s,t in zip(S,T):
    if s==t:
        count+=1
print(count)
Buggy code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

al = inpl()
bl = intp()
ans = 0
for i in range(0, 3):
    if(al[i] == bl[i]):
        ans++
print(ans)

Fixed code:
import sys, bisect, math, itertools, string, queue, copy
# import numpy as np
# import scipy
# from collections import Counter,defaultdict,deque
# from itertools import permutations, combinations
# from heapq import heappop, heappush
# # input = sys.stdin.readline
# sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

al = input()
bl = input()
ans = 0
for i in range(0, 3):
    if(al[i] == bl[i]):
        ans += 1
print(ans)
Buggy code:
s=list(input())
t=list(input())
count=0
for i im 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(3):
  if s[i]==t[i]:
    count+=1
print(count)
Buggy code:
yohou = list(input())
tenki = list(input())

cnt = 0
for i in range(0,2):
    if yohou[i]==tenki[i]:
        cnt = cnt+1
    else:
        pass
print(cnt)

Fixed code:
yohou = list(input())
tenki = list(input())

cnt = 0
for i in range(0,3):
    if yohou[i]==tenki[i]:
        cnt = cnt+1
    else:
        pass
print(cnt)
Buggy code:
S = input().split()
T = input().split()

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

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

flag= 0
for i in range(len(S)):
    if S[i] == T[i]:
        flag+=1
    else:
        flag+=0
print(flag)
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 = list(str(input()))
t = list(str(input()))

ans = 0

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

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

Fixed code:
a = input()
b = input()
c = 0
for i in range(3):
    if a[i] == b[i]:
    
        c +=1
print(c)
Buggy code:
a = input()
b = input()
n = 0
for i in range(2):
  if a[i] == b[i]:
    n += 1
print(n)


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

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

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

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

print(result)
Buggy code:
s,t=inut(),input()
print(len([1 for i in range(3) if s[i]==t[i]]))

Fixed code:
s,t=input(),input()
print(len([1 for i in range(3) if s[i]==t[i]]))
Buggy code:
s,d = map(str, open(0).read().split())
ss = list(s)
dd = list(d)
a = 0
for i in range(ss):
  if(ss[i] == dd[i]):
    a += 1
    
print(a)

Fixed code:
s,d = map(str, open(0).read().split())
ss = list(s)
dd = list(d)
a = 0
for i in range(len(ss)):
  if(ss[i] == dd[i]):
    a += 1
    
print(a)
Buggy code:
S = input()
T = input()
cnt = 0
for i in range(len(s)):
    if S[i]==T[i]:
        cnt += 1
print(cnt) 

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

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

Fixed code:
S=list(str(input()))
T=list(str(input()))
p=0

for i in range(3):
	if (S[i]==T[i]):
		p+=1
print(p)
Buggy code:
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:
s = list(input())
t = list(input())
num = 0
for i in range(3):
    if s[i] == t[i]:
        num += 1
        break
print(num)

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

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

Fixed code:
S = input()
T = input()
p_count = 0
for i in range(3):
  if S[i] == T[i]:
    p_count += 1
print(p_count)
Buggy code:
S = input()
T = input()
c = 0
for i in range(2):
  if S[i]==T[i]:
    c = 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)