Problem:
 Score : 100 points    Problem Statement You will be given a string S of length 3 representing the weather forecast for three days in the past.  The i -th character (1 \leq i \leq 3) of S represents the forecast for the i -th day. S , C , and R stand for sunny, cloudy, and rainy, respectively.  You will also be given a string T of length 3 representing the actual weather on those three days.  The i -th character (1 \leq i \leq 3) of S represents the actual weather on the i -th day. S , C , and R stand for sunny, cloudy, and rainy, respectively.  Print the number of days for which the forecast was correct.      Constraints  S and T are strings of length 3 each.  S and T consist of S , C , and R .         Input Input is given from Standard Input in the following format:  S  T       Output Print the number of days for which the forecast was correct.        Sample Input 1 CSS
CSR      Sample Output 1 2   For the first day, it was forecast to be cloudy, and it was indeed cloudy.  For the second day, it was forecast to be sunny, and it was indeed sunny.  For the third day, it was forecast to be sunny, but it was rainy.   Thus, the forecast was correct for two days in this case.       Sample Input 2 SSR
SSR      Sample Output 2 3       Sample Input 3 RRR
SSS      Sample Output 3 0

Solution (Python):
s_=input()
t_=input()
s=list(s_)
t=list(t_)

cnt=0

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

Solution (Python):
s1=input()
s2=input()
a=0
if s1[0]==s2[0]:
    a+=1
if s1[1]==s2[1]:
    a+=1
if s1[2]==s2[2]:
    a+=1
print(a)

Solution (Python):
S = input()
T = input()

cnt = 0

if S[0] == T[0]:
    cnt = cnt + 1
if S[1] == T[1]:
    cnt = cnt + 1
if S[2] == T[2]:
    cnt = cnt + 1

print(cnt)

Solution (Python):
S = str(input())
T = str(input())
k = 0
for i in range(3):
    if S[i] == T[i]:
        k += 1
print(k)

Solution (Python):
s=input()
t=input()
sa=list(s)
ta=list(t)
x=0
if sa[1]==ta[1]:
  x=x+1
if sa[2]==ta[2]:
  x=x+1
if sa[0]==ta[0]:
  x=x+1
print(x)

Solution (Python):

S = list(input())
T = list(input())

count = 0

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

print(count)

Solution (Python):
S = input()
T = input()

count = 0

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

Solution (Python):
S = input()
T = input()
A = 0


if S[0] == T[0]:
    A +=1
if S[1] == T[1]:
    A +=1
if S[2] == T[2]:
    A +=1
print(A)

Solution (Python):
s=list(input())
t=list(input())
p=0
ans=0
while p<3:
  for i in range(3):
    if s[i] == t[i]:
      ans+=1
      p+=1
    else:
      p+=1
print(ans)

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

if __name__ == '__main__':
    main()

Solution (Python):
s = list(input())
t = list(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)

Solution (Python):
s = input()
c = input()

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

print(ans)

Solution (Python):
S=input()
T=input()

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

Solution (Python):
s = input()
t = input()
equal = 0
for i in range(3):
    if s[i] == t[i]:
        equal += 1

print(equal)

Solution (Python):
yohou = input()
result = input()

count = 0
for i in range(len(yohou)):
    if yohou[i] == result[i]:
        count+=1
print(count)

Solution (Python):
input_yohou = input()
yohou = list(input_yohou)
input_tenki = input()
tenki = list(input_tenki)
num = 0
if yohou[0] == tenki[0]:
  num = num + 1
if yohou[1] == tenki[1]:
  num = num + 1
if yohou[2] == tenki[2]:
  num = num + 1
print(num)

Solution (Python):
a = str(input())
b = str(input())

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

Solution (Python):
S = input()
T = input()
count = 0
for i in range(0,len(S)):
    if S[i] == T[i]:
        count += 1
print(count)

Solution (Python):

def main():
    S = list(input())
    T = list(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)

if __name__ == '__main__':
    main()

Solution (Python):
s=list(input())

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

Solution (Python):
s = list(input())
t = list(input())
cnt = 0
for i in range(len(s)):
	if s[i]==t[i]:
		cnt += 1
print(cnt)

Solution (Python):
S = input()
T = input()

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

print(cnt)

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

Solution (Python):
s = input()
t = input()

ans = 0

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

print(ans)

Solution (Python):
x = list(input())
y = list(input())
i = 0
for n in range(3):
	if x[n] == y[n]:
		i += 1

print(i)

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

Solution (Python):
A = str(input())
B = str(input())
X = 0
for i in range(3):
  if A[i] == B[i] :
    X += 1
  else : 
    X += 0
print(X)

Solution (Python):
a = input()
b = input()
point = 0
for i, j in zip(a, b):
    if i == j:
        point += 1
print(point)

Solution (Python):
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)

Solution (Python):
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)

Solution (Python):
S = input()
T = input()
hit = 0
for i in range(len(S)):
    if S[i] == T[i]:
        hit += 1
print(hit)

Solution (Python):
s = input()
t = input()

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

Solution (Python):
s = input()
t  = input()
answer  = 0
for i in range(len(s)):
    if s[i] == t[i]:
        answer += 1

print(answer)

Solution (Python):
S = str(input())
T = str(input())

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


print(cor)

Solution (Python):
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)

Solution (Python):
S = input()
L = input()
n = 0
for i in range(3):
  if S[i] == L[i]:
    n += 1
print(n)

Solution (Python):
S = input()
T = input()
c = 0

for s,t in zip(S,T):
  if s == t:
    c += 1

print(c)

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

Solution (Python):
s1=input()
s2=input()
cnt=0
for i in range(len(s2)):
    if s2[i]==s1[i]:
        cnt+=1
print(cnt)

Solution (Python):
S = list(input())
T = list(input())

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

print(count)

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

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

Solution (Python):
s = input()
t = input()
counter = 0
for i in range(0, 3):
    if s[i]==t[i]:
        counter+=1
print(counter)

Solution (Python):
S = input()
T = input()

count = 0

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

print(count)

Solution (Python):
S = input()
T = input()
A = 0
for i in range(3):
	if S[i] == T[i]:
		A += 1
	else:
		continue
print(A)

Solution (Python):
S = input()
T = input()
print(sum(S[i] == T[i] for i in range(3)))

Solution (Python):
S=input()
T=input()
count = int(S[0]==T[0]) + int(S[1]==T[1]) + int(S[2]==T[2])
print(count)

Solution (Python):
s=input()
t=input()
c=0
if s[0]==t[0]:
  c+=1
if s[1]==t[1]:
  c+=1
if s[2]==t[2]:
  c+=1
print(c)

Solution (Python):
S = input()
C = input()
cnt = 0
 
for i in range(3):
  if S[i] == C[i]:
  	cnt += 1
print(cnt)

Solution (Python):
a,b,c = input()
d,e,f = input()
count = 0
if a == d:
    count+= 1
if b == e:
    count+= 1
if c == f:
    count+= 1
print(count)

Solution (Python):


S = input()
T = input()

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

print(count)

Solution (Python):

y = input()
t = input()
ylist = list(y)
tlist = list(t)
seikai = 0
for i in range(3):
  if ylist[i] == tlist[i]:
    seikai += 1
    
print(seikai)

Solution (Python):
A = input()
B = input()

bingo = 0
for i in range(0,3):
    if A[i] == B[i]:
        bingo += 1

print(bingo)

Solution (Python):
def main():
    S=input()
    T=input()

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

main()

Solution (Python):
s = input()
t = input()

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

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

Solution (Python):
S=list(input())
T=list(input())
flag=0
for i,s in enumerate(S):
  if T[i]==s:
    flag+=1
print(flag)

Solution (Python):
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)

Solution (Python):
S=input()
T=input()

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

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

Solution (Python):
l1 = input()
l2 = input()

line1 = [l1[i] for i in range(len(l1))]
line2 = [l2[i] for i in range(len(l2))]

count = 0

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

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

print(ans)

Solution (Python):
s = input()
t = input()

sl = []
for i in s:
    sl.append(i)
tl = []
for j in t:
    tl.append(j)

count = 0
if sl[0] == tl[0]:
    count += 1
if sl[1] == tl[1]:
    count += 1
if sl[2] == tl[2]:
    count += 1
print(count)

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

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

Solution (Python):
s = input()
t = input()
l = len(s)
count = 0
for i in range(l):
	if s[i]==t[i]:
		count+=1
print(count)

Solution (Python):
actual = list(input())
predict = list(input())
count = 0
for i, s in enumerate(actual):
  if s == predict[i]:
    count += 1
print(count)

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

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

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

Solution (Python):
yosoku=input()
kekka=input()

result=0
for i in range(3):
  if yosoku[i] == kekka[i]:
    result+=1
print (result)

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

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

print(ans)

Solution (Python):
s=input()
t=input()

a=list(s)
b=list(t)
z=0
for i in range(3):
    if a[i]==b[i]:
        z=z+1
    
print(z)

Solution (Python):
S = list(input())
T = list(input())

res = 0

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

print(res)

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

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

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

Solution (Python):
S = input()
T = input()

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

print(count)

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

Solution (Python):
S = list(input())
T = list(input())
ans = 0

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

print(ans)

Solution (Python):
s = input()
r = input()
c = 0
for i,j in zip(s,r):
    if i == j:
        c += 1
    else:
        pass
print(c)

Solution (Python):
s=input()
t=input()
k=0
for i,j in zip(s,t):
  if i==j:
    k+=1
print(k)

Solution (Python):
print(sum(s == t for s, t in zip(input(), input())))

Solution (Python):
S = list(input())
T = list(input()) 

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

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline

S = input()
T = input()

count = 0

for a, b in zip(S, T):
    if a == b:
        count += 1

print(count-1)

Solution (Python):
S = input()
T = input()

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

Solution (Python):
S = input()
T = input()

r = 0
for i,j in zip(S,T):
    if i==j:
        r += 1

print(r)

Solution (Python):
s = input()
t = input()
n = 0
for i in range(len(list(s))):
    if s[i] == t[i]:
        n += 1
print(n)

Solution (Python):

a = input()
b = input()

count = 0

for i in range(3):
    if(a[i]==b[i]):
        count += 1

print(count)

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

Solution (Python):
s = input()
t = input()
print(sum([si == ti for si, ti in zip(s, t)]))

Solution (Python):


import sys

def readline():
	return sys.stdin.readline().rstrip()
def read(f=int):
	return f(readline())
def reads(f=int):
	return [f(s) for s in readline().split()]

S = read(str)
T = read(str)

print(sum([1 if s == t else 0 for s, t in zip(S, T)], 0))

Solution (Python):


s = input()
t = input()

ans = 0
for _s, _t in zip(s, t):
    if _s == _t:
        ans += 1

print(ans)

Solution (Python):
S = input()
T = input()

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

print(ans)

Solution (Python):
li=input()
li2=input()

result=0

for i in range(len(li)):
  if li[i]==li2[i]:
    result+=1
print(result)

Solution (Python):


pred = input()
acctual = input()
counter = 0
for p,c in zip(pred,acctual):
    if p==c:
        counter +=1

print(counter)

Solution (Python):
S = input()
T = input()
count = 0

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

Solution (Python):
s = input()
t = input()
print(int(s[0]==t[0]) + int(s[1]==t[1]) + int(s[2]==t[2]))

Solution (Python):
S = input()
T = input()
s = 0
for i, j in zip(S, T):
  if i == j:
    s += 1
print(s)

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

Solution (Python):

s = input()
t = input()
res = 0
for ss, tt in zip(s,t):
    if ss==tt: res += 1
print(res)

Solution (Python):
S = input().strip()
T = input().strip()

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

print(ans)

Solution (Python):
s = str(input())
t = str(input())

ans = 0

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

print(ans)

Solution (Python):
a=input()
b=input()
sum=0
for i in range(3):
  if a[i]==b[i]:
    sum+=1
print(sum)

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

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

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

Solution (Python):
S = input()
T = input()

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

Solution (Python):
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''

gi = lambda : list(map(int,input().split()))
s, t = input(), input()
print(sum([1 if s[k] == t[k] else 0 for k in range(3)]))

Solution (Python):




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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

S = list(input().strip())
T = list(input().strip())

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

print(ans)

Solution (Python):
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)

Solution (Python):
str1 = input()
str2 = input()

count=0
for i in range(0,3):
    if(str1[i] == str2[i]):
        count+=1
print(count)

Solution (Python):
a, b, c= input()
d, e, f = input()

count = 0

if a == d:
    count += 1
 
if b == e:
    count += 1

if c == f:
    count += 1

print(count)

Solution (Python):
s = input()
t = input()

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

print(len(c))

Solution (Python):
S1 = input()
S2 = input()

cnt = 0

for i in range(3):
    if S1[i] == S2[i]:
        cnt += 1

print(cnt)

Solution (Python):
s = input()
t= input()

s = list(s)
t=list(t)
a=0
for i in range(3):

 		if s[i]==t[i]:
 			a+=1



print(a)

Solution (Python):
S = input()
T = input()

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

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

if S[2:3] == T[2:3]:
    ans +=1

print(ans)

Solution (Python):
forcast = input()
reality = input()

count = 0
for f, r in zip(forcast, reality):
  if f == r:
    count = count+1
print(count)

Solution (Python):
import math

tenki = input()
tenki2 = input()

result = 0
for i in range(0,len(tenki)):
    if tenki[i] == tenki2[i]:
        result += 1
print(result)

Solution (Python):
S=input()
T=input()
an=0
for i in range(3):
    if S[i]==T[i]:
        an+=1
print(an)

Solution (Python):
import sys
input = sys.stdin.readline

c1 = list(input())
c2 = list(input())

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

print(count)

Solution (Python):
s = input()
t = input()
cnt = 0
for i,j in zip(s,t):
  if i==j:
    cnt += 1
print(cnt)

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

Solution (Python):
S=list(input())
T=list(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)

Solution (Python):
S = input()
T = input()

ans = 0

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

print(ans)

Solution (Python):


if __name__ == "__main__":
    S = input()  
    T = input()
    c = 0  
    for s,t in zip(S,T):
        if s == t: c += 1
    print(c)

Solution (Python):
s=input()
t=input()

ret=0

for a,b in zip(s,t):
    if a is b:
        ret+=1

print(ret)

Solution (Python):


def main():
    S = input()
    T = input()

    print(sum(1 if s == t else 0 for s, t in zip(S, T)))



if __name__ == '__main__':
    main()

Solution (Python):
n = input()
l = input()
cnt = 0

for i in range(3):
  if n[i] == l [i]:
    cnt += 1

print(cnt)

Solution (Python):

I0 = lambda :map(int,input().split())
I1 = lambda :int(input())
I2 = lambda :list(map(int,input().split()))


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

Solution (Python):
S = list(input())
T = list(input())

cnt = 0

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

print(cnt)

Solution (Python):
s=input()
t=input()

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

Solution (Python):
li = list(input())
li2 = list(input())
ans=0
for i in range(3):
    if li[i]==li2[i]:
        ans += 1 
print(ans)

Solution (Python):
s=list(input())
t=list(input())
counter = 0
for i in range(len(s)):
  if s[i] == t[i]:
    counter += 1
print(counter)

Solution (Python):
import sys
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()))

counter = 0
S= input()
T= input()

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

print(counter)

Solution (Python):
tenkikyohou = input()
tenki = input()

ans = 0

for i in range(3):
    if tenkikyohou[i] == tenki[i]:
        ans += 1

print(ans)

Solution (Python):
S = input()
T = input()
counter = 0
for i in range(3):
    if S[i] == T[i]:
        counter += 1
print(counter)

Solution (Python):
import sys

S=sys.stdin.readline().rstrip()
T=sys.stdin.readline().rstrip()

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)

Solution (Python):
S = input()
T = input()
c = 0
for s,t in zip(S,T):
  if s == t: c+=1
print(c)

Solution (Python):


''' 
------------------------
author : iiou16
------------------------
'''

def main():
    S = input()
    T = input()

    count = 0

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


if __name__ == '__main__':
    main()

Solution (Python):
yohou=input()
real=input()
count=0
for i in range(3):
    if(str(yohou[i])==str(real[i])):
        count=count+1

print(count)

Solution (Python):
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)

Solution (Python):
S = list(input())
T = list(input())

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

Solution (Python):
s = input()
t = input()
s_l = list(s)
t_l = list(t)
c = 0
for i in range(len(s)):
    if s_l[i] == t_l[i]:
        c += 1
print(c)

Solution (Python):
S = input()
T = input()

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

print(cnt)

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

Solution (Python):
s = input()
t = input()

cnt = 0
for a, b in zip(s, t):
    if a == b:
        cnt += 1
    
print(cnt)

Solution (Python):
s_list = list(input())
c_list = list(input())
count = 0

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

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

Solution (Python):

"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect
import heapq


def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   

def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())


dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')


ABT = zip(A, B, totAB)
result = 0

sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)


(x >> i) & 1


dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break

add = 1 
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)


li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    


org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)




    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


S = input()
T = input()
    
def main(): 
    res = 0
    for n in range(len(S)):
        if S[n] == T[n]:
            res+=1
    print(res)
                
                
                
            
            
                

    
if __name__ == '__main__':
    main()

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

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

print(count)

Solution (Python):
s1=input()
s2=input()
c=0
for i in range(3):
    if s1[i]==s2[i]:
        c+=1
print(c)

Solution (Python):
S = input()
T = input()
print(sum([S[k]==T[k] for k in range(3)]))

Solution (Python):
a = input()
b = input()
c = 0
if a[0] == b[0]:
    c+=1
if a[1] == b[1]:
    c+=1
if a[2] == b[2]:
    c+=1
print(c)

Solution (Python):

s = input()
t = input()

cnt = 0

for i, j in zip(s, t):
    if i == j:
        cnt += 1

print(cnt)

Solution (Python):
S = list(input())
T = list(input())

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

print(i)

Solution (Python):
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)

Solution (Python):
S = input()
T = input()
S_list = list(S)
T_list = list(T)

count = 0

for i in range(3):
    if S_list[i] == T_list[i]:
        count += 1

print(count)

Solution (Python):

S = input()
T = input()
ans = 0
if S[0:1] == T[0:1]:
    ans += 1
    
if S[1:2] == T[1:2]:
    ans += 1
    
if S[2:3] == T[2:3]:
    ans += 1
    
print(ans)

Solution (Python):
yosoku = list(input())
jissai = list(input())

correct = 0
for i in range(3):
    if yosoku[i] == jissai[i]:
        correct += 1

print(correct)

Solution (Python):


s = input()
t = input()

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

print(a)

Solution (Python):
import sys




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

Solution (Python):
s=input()
t=input()
s1=list(s)
t1=list(t)
c=0
for i in range(len(s1)):
    if s1[i]==t1[i]:
        c=c+1
print(c)

Solution (Python):
a=input()
b=input()
x=0
if a[0]==b[0]:
  x+=1
if a[1]==b[1]:
  x+=1
if a[2]==b[2]:
  x+=1
print(x)

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

Solution (Python):
S=list(input())
T=list(input())

ans=0

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

Solution (Python):
S = input()
T = input()

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

print(match)

Solution (Python):
def solve():
    S = input()
    T = input()
    print(sum(s==t for s,t in zip(S,T)))
    
solve()

Solution (Python):
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)

Solution (Python):
s = input()
t = input()

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

print(cnt)

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

Solution (Python):
x=input()
y=input()
c=0
for i in range (len(x)):
  if x[i]==y[i]:
    c+=1
print(c)

Solution (Python):
S = input()
T = input()
ans = 0

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

print(ans)

Solution (Python):




 
from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul,itemgetter
from bisect import* 
from heapq import* 
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)

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

Solution (Python):
S=input()
T=input()
answer=0
for i in range(3):
  if S[i]==T[i]:
    answer+=1
print(answer)

Solution (Python):
from sys import stdin

f = stdin.readline().rstrip()
t = stdin.readline().rstrip()

point = 0

for i in range(3):
    if f[i] == t[i]:
        point += 1
print(point)

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

Solution (Python):
s = input()
t = input()
count = 0

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

print(count)

Solution (Python):
ss = input()
tt = input()

c = 0
for s, t in zip(ss, tt):
    if s == t and (s == 'R' or s == 'C' or s == 'S'):
       c += 1

print(c)

Solution (Python):


S = input()
T = input()

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

Solution (Python):
S = input()
T = input()
match = 0
for i in range(3):
    if S[i] == T[i]: match += 1
print(match)

Solution (Python):
s=input()
t=input()

slis=s[::]
tlis=t[::]
count=0

for i in range(3):
    if slis[i]==tlis[i]:
        count+=1

print(count)

Solution (Python):
s = input()
t = input()

count = 0

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

print(count)

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

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

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

Solution (Python):
S = str(input())
T = str(input())

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

print(count)

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

Solution (Python):
S = str(input())
T = str(input())
n = 0
for s, t in zip(S, T):
  if s == t:
    n += 1
print(n)

Solution (Python):
S = list(input())
T = list(input())
counter = 0
for i in range(len(S)):
  if S[i] == T[i]:
    counter += 1
    
print(counter)

Solution (Python):
ls1 = input()
ls2 = input()
c = 0
for i in range(3):
  if ls1[i]==ls2[i]:
    c+=1
print(c)

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