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



Sample input:
CSS
CSR


Sample output:
2

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
print(sum(map(lambda x, y:x==y, input(), input())))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import exit, stdin
S = stdin.readline().rstrip()
T = stdin.readline().rstrip()
ans = 0
for i in range(3):
    if S[i] == T[i]:
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
days = 0
for index, s in enumerate(s1):
  if s2[index] == s:
    days +=1
print(days)

Submission status: Accepted

Solution code:
tmp = list(input())
tmp2 = list(input())

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

print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
# 出力
A = 0

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

print(A)

Submission status: Accepted

Solution code:
S = str(input())
T = str(input())
# 出力
A = 0

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

print(A)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = input()
T = input()
right = 0

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

Submission status: Accepted

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

c = 0

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()
s1_list = list(s1)
s2_list = list(s2)
ans = 0
for i in range(3):
    if(s1_list[i] == s2_list[i]):
        ans += 1
print(ans)

Submission status: Accepted

Solution code:
f = input()
r = input()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import numpy as np

def main():
    forecast = input()
    real = input()

    ans = 0

    for i in range(3):
        if forecast[i] == real[i]:
            ans += 1

    print(ans)


main()

Submission status: Accepted

Solution code:
S = input()
R = input()
cnt = 0
for s,r in zip(S,R):
    if s==r:
        cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
# A - Tenki

exp = list(input())
act = list(input())

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

print(cnt)

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
str1 = input()
str2 = input()
result = 0
for i in range(3):
  if str1[i] == str2[i]:
    result += 1
    
print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution 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)

Submission status: Accepted

Solution 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)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0
for i, z in zip(s, t):
    if i == z :
        ans+= 1
print(ans)

Submission status: Accepted

Solution code:
res = 0

for s, t in zip(input(), input()):
    if s == t:
        res += 1

print(res)

Submission status: Accepted

Solution code:
print(sum(c is d for c, d in zip(input(), input())))

Submission status: Accepted

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

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


print (count)

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
print(sum(s[i] == t[i] for i in range(3)))

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
count = 0
for i in range(3):
	if S[i] == T[i]:
		count = count +1
print('{}'.format(count))

Submission status: Accepted

Solution 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))

Submission status: Accepted

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

Submission status: Accepted

Solution 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)

Submission status: Accepted

Solution code:
forecast = list(input())
weather = list(input())
count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
if len(S) or len(T) >3:
    exit
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)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = input()
b = input()

x =0

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

print(x)

Submission status: Accepted

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

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

print(a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
cnt = 0

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

# S=予想, T=実際
S = input().strip()
T = input().strip()

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def count_same(f, r):
    count = 0
    for i in range(len(f)):
        if f[i].upper() == r[i].upper():
            count += 1
    print(count)
forecast = input()
real = input()
if (len(forecast) == len(real)):
    count_same(forecast, real)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
pred = list(input())
fact = list(input())

i = 0
ans = 0
while i <= len(pred)-1:
  if pred[i] == fact[i]:
    ans += 1
    i += 1
  
  else:
    i += 1

print(ans)

Submission status: Accepted

Solution code:
s = list(input())
S = list(input())
p = 0
for i in range(3):
    p += 1 if s[i] == S[i] else 0
print(p)

Submission status: Accepted

Solution code:
import sys

s = input().strip()
t = input().strip()

print(sum(s_ == t_ for s_, t_ in zip(s, t)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

s = input()
t = input()

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

print(rtn)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
S = input()
T = input()
print(sum(1 for s, t in zip(S, T) if s == t))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
P = input()
f = 0
for i in range(0, 3):
    if (N[i] == P[i]):
        f += 1
print(f)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=input(),input() 
print((s[0]==t[0])+(s[1]==t[1])+(s[2]==t[2]))

Submission status: Accepted

Solution code:
forecast = input()
weather = input()

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

print(ans)

Submission status: Accepted

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


def main():
    s = input()
    t = input()
    count = 0

    for si, ti in zip(s, t):
        if si == ti:
            count += 1

    print(count)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input()
t = input()
i = 0
count = 0
while i < 3:
    if s[i] == t[i]:
        count += 1
    i += 1
print(count)

Submission status: Accepted

Solution code:
S = input()
T = input()
a = [1 for s,t in zip(S,T) if s==t]
print(sum(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

a = 0

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

Submission status: Accepted

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

flag=0

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

print(flag)

Submission status: Accepted

Solution code:
from collections import Counter,defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
mod = 10**9+7
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpl_str(): return list(sys.stdin.readline().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# your code goes here
s,t = input(), input()

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
s = [input() for i in range(2)]
predict = s[0]
result = s[1]
count = 0
for i in range(3):
    if predict[i] == result[i]:
        count += 1
print(count)

Submission status: Accepted

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

count=0
if str1[0]==str2[0]:
    count=count+1
if str1[1]==str2[1]:
    count=count+1
if str1[2]==str2[2]:
    count=count+1

print (count)

Submission status: Accepted

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

counter = 0

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

Submission status: Accepted

Solution 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)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ret)

Submission status: Accepted

Solution code:
print(len(list(filter(lambda x:x[0]==x[1],zip(input(), input())))))

Submission status: Accepted

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

x=0

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

Submission status: Accepted

Solution code:
S = input()

T = input()
count = 0

s=[]
t=[]
for i in S:
    s.append(i)
for j in T:
    t.append(j)


if s[0]==t[0]:
    count+=1
if s[1]==t[1]:
    count+=1
if s[2]==t[2]:
    count+=1

print(str(count))

Submission status: Accepted

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

print(c)

Submission status: Accepted

Solution code:
s,t=input(),input()
print((s[0]==t[0])+(s[1]==t[1])+(s[2]==t[2]))

Submission status: Accepted

Solution code:
A = input()
B = input()
a = 0
for i in range(3):
  if A[i] == B[i]:
    a += 1
print(a)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = 0
s = list(input())
t = list(input())

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

Submission status: Accepted

Solution code:
S = input().rstrip()
T = input().rstrip()
print(sum(s == t for s, t in zip(S, T)))

Submission status: Accepted

Solution code:
s=input();t=input();print(0+(s[0]==t[0])+(s[1]==t[1])+(s[2]==t[2]))

Submission status: Accepted

Solution code:
s = input()
r = input()

count = 0

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

print(count)

Submission status: Accepted

Solution code:
S = [str(x) for x in input()]
T = [str(x) for x in input()]
k = 0

for a in range(0, len(S)):
    if S[a] == T[a]:
        k = k + 1
print(k)

Submission status: Accepted

Solution code:
def tenki(F, A):
    s=0
    for i in range(len(F)):
        if F[i] == A[i]:
            s = s + 1
    return s

F=input()
A=input()
print(tenki(F,A))

Submission status: Accepted

Solution code:
# 文字列Sの入力
S = input()
# 文字列Tの入力
T = input()
# 正解数をカウントする変数
Count = 0

# 一文字ずつ比較し一致する場合はカウントアップ
for i in range(3):
  if S[i] == T[i]:
    Count = Count + 1

print("{}".format(Count))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0

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

Submission status: Accepted

Solution code:
#abc139a

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

Submission status: Accepted

Solution code:
a = input().rstrip()
b = input().rstrip()
count = 0

if(a[0]==b[0]):
  count+=1
if(a[1]==b[1]):
  count+=1
if(a[2]==b[2]):
  count+=1
print(count)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

S = input()
T = input()

# print(S)
# print(T)

count = 0

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

Submission status: Accepted

Solution code:
import numpy as np
S = list(input())
T = list(input())
F= (np.array(S) == np.array(T))
ans = 0
for i in F:
  if i == True:
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
def solve(s, t):
    return sum([a == b for a,b in zip(s, t)])

s = input()
t = input()
print(solve(s, t))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
from sys import stdin
 
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
S = list(input())
T = list(input())
cnt = 0

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s=list(input())
t=list(input())
count = int(0)

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = raw_input()
t = raw_input()
ans = 0
for i in xrange(len(s)):
  if s[i] == t[i]: ans += 1
print ans

Submission status: Accepted

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

q = 0

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

Submission status: Accepted

Solution code:
S = input()
T = input()
 
q = 0
for n in range(3):
  if S[n] ==T[n]:
    q +=1
print(q)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))

#################

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

s = [_ for _ in s]
t = [_ for _ in t]

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

Submission status: Accepted

Solution code:
exe = input()
real = input()

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

Submission status: Accepted

Solution code:
# encoding: utf-8

S=input()
T=input()

ans=0

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

print(ans)

Submission status: Accepted

Solution code:
list_s = [str(i) for i in input()]
list_t = [str(i) for i in input()]
count = 0

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

Submission status: Accepted

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

output=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from __future__ import print_function
# import numpy as np
# import numpypy as np
import sys
input = sys.stdin.readline

def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

import math
import string
import fractions
from fractions import Fraction
from fractions import gcd

def lcm(n,m):
    return int(n*m/gcd(n,m))

import re
import array
import copy
import functools
import operator

import collections
import itertools
import bisect
import heapq


from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace

from queue import PriorityQueue as pq

def reduce(p, q):
    common = fractions.gcd(p, q)
    return (p//common , q//common )
# from itertools import accumulate
# from collections import deque

import random


def main():
    S=input().strip()
    T=input().strip()
    cnt=0
    for i in range(len(S)):
        if S[i]==T[i]:
            cnt+=1
    print(cnt)
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
forecast = input()
actual = input()

i = 0
match = 0

while i < 3:
    if forecast[i] == actual[i]:
        match += 1  
    i += 1

print(match)

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
s = list(input())
t = list(input())
cnt = 0
for i in range(3):
    if s[i] == t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

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

print(sum([i == j for i, j in zip(S, T)]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(string):
    s, t = string.split()
    return str(sum([_s == _t for _s, _t in zip(s, t)]))


if __name__ == '__main__':
    print(solve('\n'.join([input(), input()])))

Submission status: Accepted

Solution 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)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
cast = raw_input()
real = raw_input()

counter = 0
correct = 0
while counter < 3:
  if cast[counter] == real[counter]:
    correct += 1
  counter += 1
print correct

Submission status: Accepted

Solution code:
a = input()
b = input()
score = 0

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

print(score)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
yohou,tenki = input(),input()
count = 0
for i  in range(3):
    if yohou[i] == tenki[i]:
        count +=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().strip()
b = input().strip()
ans = 0
for i in range(len(a)):
    if a[i] == b[i]:
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
S = input()
c=0
for i in range(3):
	if N[i] == S[i]: c+=1
print(c)

Submission status: Accepted

Solution code:
l = input()
s = input()
total = 0
i = 0
while i < 3:
  if l[i] == s[i]:
    total = total + 1
  i = i + 1

print(total)

Submission status: Accepted

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

ans = 0
for s_, t_ in zip(s, t):
    if s_ == t_:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
print(sum(a==b for a,b in zip(input(),input())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

s = raw_input()
t = raw_input()

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

Submission status: Accepted

Solution code:
s = input()
t = input()
print(sum([x == y for x, y in zip(s, t)]))

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0

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

print(cnt)