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: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

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

print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0

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

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s,t=open(0);print(sum([i==j for i,j in zip(s,t)]))

Submission status: Wrong Answer

Solution code:
s,t=open(0);a=[i==j for i,j in zip(s,t)];print(sum(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s, t = list(input().split()), list(input().split())
print(len([s[i] == t[i] for i in range(len(s))]))

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#Tenki

S = input()
T = input()
ctr = 0

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

Submission status: Wrong Answer

Solution code:
0

Submission status: Wrong Answer

Solution code:
def main():
    s = list(input())
    t = list(input())
    assert len(s) == len(t)
    res = 0
    for i, ss in enumerate(s):
        if ss == t[i]:
            res += 1
    return res


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a,b=open(0);print(sum(i==j for i,j in zip(a,b)))

Submission status: Wrong Answer

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

S = input()
T = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s,t=open(0);print(sum([a==b for a,b in zip(s,t)]))

Submission status: Wrong Answer

Solution code:
import sys
args = []
count = 0

for x in sys.stdin:
  args.append(x)

s = args[0]
t = args[1]

for x, y in zip(s, t):
  if x == y:
    count += 1
print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

Solution code:
s,t = open(0)
cnt = 0
for si, ti in zip(s,t):
    cnt += si == ti
print(cnt)

Submission status: Wrong Answer

Solution code:
X = input()
Y = input()

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

Submission status: Wrong Answer

Solution code:
s,t=open(0)
print(sum([a==b for a,b in zip(s,t)]))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter

s = input()
t = input()

s = list(s)
#s.sort()
t = list(t)
#t.sort()

C = list((Counter(s) & Counter(t)).elements())
print(len(C))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from collections import Counter

s = input()
t = input()

s = list(s)
s.sort()
t = list(t)
t.sort()

C = list((Counter(s) & Counter(t)).elements())
print(len(C))

Submission status: Wrong Answer

Solution code:
S = list(input())
T = list(input())
i = int(0)
if S[0] == T[0]:
    i = i + 1
    if S[1] == T[1]:
        i = i + 1
        if S[2] == T[2]:
            i = i + 1
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
a=str(input())
b=str(input())
c=len(a)
i=0
for s in range(0,c):
    if a[int(s)]==b[int(i)]:
        i+=1

print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

i = 0
result = 0
for item in S:
    if S[i] == T[i]:
        result += 1
    i += 1

print(result)

Submission status: Wrong Answer

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

ans = 0

for i in [1, 2, 3]:
    if s[:i] == t[:i]:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
l1=list(map(str,input().split()))
l2=list(map(str,input().split()))
w=len(l1)
all=0
for i in range(0,w):
    if (l1[i]==l2[i]):
        all=all+1
print(all)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = 0

for c in a:
  for d in b:
    if c == d:
      i = i + 1
      
print(i)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
s = input()
t = 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] or s[2] == t[2]:
    print(2)
elif s[0] == t[0] or s[1] == t[1] or s[2] == t[2]:
    print(1)
else:
    print(0)

Submission status: Wrong Answer

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

S = input()
T = input()

ans = 0

for x in T:
    if x == S[0]:
        ans += 1
    elif x == S[1]:
        ans += 1
    elif x == S[2]:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
num=0
for i in range(2):
    if a[i] == b[i]:
        num = num + 1

print(num)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=set(list(input()))
T=set(list(input()))
print(len(S&T))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
S = input()
T = input()
c = 0
for i in range(3):
  if S[i] == T[i]:
    c +=1
print(c/3)

Submission status: Wrong Answer

Solution code:
import numpy as np


def main():
	#N, D = [int(x) for x in input().split()]
	S = input()
	T = input()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = list(input())
t = list(input())
p = []

for i in range(0,3):
    p.append(s[i] == t[1])
    
print(p.count(True))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
pred = list(input())
res = list(input())

count = 0
for i in range(2):
	if pred[i] == res[i]:
		count += 1

print(count)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
pred = input()
true = input()
cnt = 0
for i in range(len(pred)):
  if pred[i] == true[i]:
    cnt += 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
S = input()
T = input()
c = 0
for s,t in zip(S,T):
  if s == t:
    c +=1
print(c/3)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

count = 0

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
inputs = sys.stdin.readlines()

S, T = inputs[0], inputs[1]
c = 0
for s, t in zip(S, T):
    if s == t:
        c += 1
print(c)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = str(input())
t = str(input())
p = 0
res = 0
for a in s:
  if a == s[p]:
    res = res + 1
  p = p + 1
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = set(input())
t = set(input())
print(len(s&t))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in s:
    if s == t:
        cnt += 1

print(cnt)

Submission status: Time Limit Exceeded

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

ans=0
i=0
while i<len(s):

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

print(ans)

Submission status: Accepted

Solution code:
A = str(input())
P = str(input())
cnt = 0
for i in range(3):
    if A[i] == P[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:
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(len(s)):
    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):
    cnt += s[i] == t[i]

print(cnt)

Submission status: Accepted

Solution code:
import sys
def S(): return sys.stdin.readline().rstrip()


S,T = S(),S()
print(sum(S[i] == T[i] for i in range(3)))

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:
n = input()

n1 = input()

ind = 0
c = 0
for i in n1:
    if i == n[ind]:
        c += 1
    ind += 1

print(c)

Submission status: Accepted

Solution code:
#139-A

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 = str(input())
t = str(input())
cnt = 0
for i in range(len(s)):
    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:
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 = 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()
ans = 0

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

print(ans)

Submission status: Accepted

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

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

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()
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):
    ans += s[i] == t[i]
print(ans)

Submission status: Accepted

Solution code:
S, T = [input() for _ in range(2)]
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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
forecast_list = list(input())
happened_list = list(input())

hit_count = 0

for f, h in zip(forecast_list, happened_list):
    if f == h:
        hit_count += 1

print(hit_count)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = 0
for i in range(3):
  if (s[i] == t[i]):
    ans = 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:
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=str(input())
t=str(input())
cnt=0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
f=list(input())
a=list(input())
g=0
if f[0]==a[0]:
    g+=1
if f[1]==a[1]:
    g+=1
if f[2]==a[2]:
    g+=1
print(g)

Submission status: Accepted

Solution code:
S = input()
T = input()
cnt = 0
for s, t in zip(S, T):
    cnt += s == t
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:
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=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 = list(input())
T = list(input())
res = 0
for i in range(len(S)):
  if S[i] == T[i]:
    res += 1
print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC090
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 = 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()
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()
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()

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:
S = str(input())
T = str(input())

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

Submission status: Accepted

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

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

cnt, i = 0, 0

for s in S:
    if s == T[i]:
        cnt += 1
    i += 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:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

    ans = 0
    for x, y in zip(S, T):
        if x == y:
            ans += 1

    print(ans)


if __name__ == '__main__':
    main()

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 = 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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
slist = list(input())
tlist = list(input())

slist_new = [slist[0] + '0', slist[1] + '1', slist[2] + '2']
tlist_new = [tlist[0] + '0', tlist[1] + '1', tlist[2] + '2']

list02 = slist_new + tlist_new
andlist = [x for x in list02 if list02.count(x) > 1]

print(len(andlist) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

res = 0

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

print(res)

Submission status: Accepted

Solution code:
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools


sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]

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:
f = list(input())
c = list(input())

print(sum(1 for _f, _c in zip(f, c) if _f == _c))

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=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=open(0).read().split()
print(sum([S[i]==T[i] for i in range(3)]))

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    S = SS()
    T = SS()

    ans = len([(i, j) for i, j in zip(S, T) if i == j])
    print(ans)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


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

Submission status: Accepted

Solution code:
# 問題：https://atcoder.jp/contests/abc139/tasks/abc139_a

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x=list(input())
y=list(input())
z=[x[0]==y[0], x[1]==y[1], x[2]==y[2]]
print(z.count(True))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input()
    t = input()
    print(sum(i == j for i, j in zip(s, t)))

main()

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:
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:
# 天気予報
pred = input()

# 実際の天気
result = input()

# 天気予報が的中した回数をカウントする変数
count = 0

# 天気予報と実際の天気が一致したらcountを+1する
for i in range(len(pred)):
    if pred[i] == result[i]:
        count = 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()
cnt2 = 0
for cnt in range(3):
  if S[cnt] == T[cnt]:
    cnt2 += 1

print(cnt2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# S == T の数
s = input()
t = input()
ct = 0
for i in range(3):
    if s[i] == t[i]:
        ct += 1
print(ct)

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:
i=list(input())
k=list(input())
sum=0
for j in range(3):
    if i[j]==k[j]:
        sum+=1
print(sum)

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:
s1=input()
s2=input()

ans=0
for i, ss1 in enumerate(s1):
  if ss1==s2[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)