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:
a = list(input())
b = list(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)

Submission status: Accepted

Solution code:
# ABC 139: A – Tenki
s, t = [input() for _ in range(2)]
print(sum(a == b for a, b in zip(s, t)))

Submission status: Accepted

Solution code:
# ABC 139: A – Tenki
s, t = [input() for _ in range(2)]

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()
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:
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:
S = input()
T = input()
res = sum(1 for s, t in zip(S, T) if s == t)
print(res)

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()
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]:
    print (2)
elif S[0] == T[0] and S[2] == T[2]:
    print (2)
elif S[1] == T[1] and 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: Accepted

Solution code:
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect
#pypyではscipy, numpyは使えない
#from scipy.sparse.csgraph import shortest_path, floyd_warshall, dijkstra, bellman_ford, johnson, minimum_spanning_tree
#from scipy.sparse import csr_matrix, coo_matrix, lil_matrix
#import numpy as np
from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')

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

print(sum_ans)

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:
import sys

s, t = sys.stdin.read().split()

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

Submission status: Accepted

Solution code:
import itertools
import fractions
def main():
  s = input()
  t = input()
  cnt = 0
  for i in range(3):
    if s[i] == t[i]:
      cnt += 1
  print(cnt)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = [i for i in input()]
T = [i for i in input()]

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    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, T = (input() for _ in range(2))
print(sum(s==t for s, t in zip(S, T)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
t = input()
a = list(zip(s,t))
ans = 0
for item in a:
    if item[0] == item[1]:
        ans += 1


print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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(3):
  if s[i] == t[i]:
    ans = 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()
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()
answer=0

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

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 in range(len(s)):
    if s[i] == t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

Submission status: Accepted

Solution code:
import sys
import numpy as np

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

S = np.array(list(sr()))
T = np.array(list(sr()))

print((S == T).sum())

Submission status: Accepted

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

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

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)

main()

Submission status: Accepted

Solution code:
#どっちで出すか注意, rstrip注意
#提出前に見返すこと！
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10000000)
    from collections import Counter, deque
    #from collections import defaultdict
    from itertools import combinations, permutations, accumulate
    #from itertools import product
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    #from operator import itemgetter

    #inf = 10**17
    #mod = 10**9 + 7

    S = input().rstrip()
    T = input().rstrip()
    cnt = 0
    for i in range(3):
        if S[i] == T[i]:
            cnt += 1
    print(cnt)
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#%%
import sys
def input():
    return sys.stdin.readline().rstrip()

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

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

# %%
if __name__ == '__main__':
    main()

# %%
# from atcoder_test import doTest
# doTest("abc139","a",main)

Submission status: Accepted

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

Submission status: Accepted

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

i = 0
j = 0
while i < 3:
    if S[i] == T[i]:
        j = j+1
    i = i+1

print(j)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

score=0

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

Submission status: Accepted

Solution code:
s = input()
t = 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 s,t in zip(S,T):
  if s==t:
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
s = input()
t = 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()
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:
# -*- coding: utf-8 -*-
"""
A - Tenki
https://atcoder.jp/contests/abc139/tasks/abc139_a

"""
import sys


def solve(S, T):
    return sum(a == b for a, b in zip(S, T))


def main(args):
    S = input()
    T = input()
    ans = solve(S, T)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

ans = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S1 = list(input())
S2 = list(input())

ans = 0
for s1, s2 in zip(S1, S2):
  if s1 == s2:
    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()

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(len(s)):
    if s[i] == t[i]:
        count+=1
print(count)

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

Submission status: Accepted

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

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:
# coding: utf-8

S = input()
T = input()
# print(S, T)

c = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: 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:
a = str(input())
s = str(input())
count = 0
for i in range(3):
    if a[i] == s[i]:
        count+=1
    else:
        pass
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# from math import factorial,sqrt
# from itertools import permutations as permus
# from fractions import gcd
# from collections import deque,Counter

# import numpy as np
# import scipy as scp

# 入力の受け取り
s = input()
t = input()

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

print(ans)
# print("{:.10f}".format(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
#sys.setrecursionlimit(150000)


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


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)

if __name__ == '__main__':
    main()

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, t = input(), input()
print(sum(s[i] == t[i] for i in range(3)))

Submission status: Accepted

Solution code:
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

S = input()
T = input()

print(sum(1 if S[i] == T[i] else 0 for i in range(3)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    return c

print(solve())

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:
x=list(input())
y=list(input())
t=0
for i in range(len(x)):
	if x[i]==y[i]:
		t=t+1
print(t)

Submission status: Accepted

Solution code:
import sys

S = [x for x in sys.stdin.readline().strip()]
T = [x for x in sys.stdin.readline().strip()]

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

print(result)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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()
i=0
if s[0]==t[0]:
  i+=1
elif s[0]!=t[0]:
  pass
if s[1]==t[1]:
  i+=1
elif s[1]!=t[1]:
  pass
if s[2]==t[2]:
  i+=1
elif s[2]!=t[2]:
  pass  
print(i)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

correct = 0

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

print(correct)

Submission status: Accepted

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

Submission status: Accepted

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

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()
c = 0
for i,j in zip(s,t):
    if i == j:
        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()
ans = 0
for i in range(len(S)):
    if S[i] == T[i]:
        ans = 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:
# A - Tenki
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 s, t in zip(S, T):
    if s == t:
        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
    else:
        pass

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

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

Submission status: Accepted

Solution code:
s = list(input())
t = list(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:
def compare(a, b):
    c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
    return c
x = input()
y = input()
print(compare(x,y))

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

cnt=0

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

Submission status: Accepted

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

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

print(re)

Submission status: Accepted

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

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:
a = input()
b = input()
print(sum(a[i] == b[i] for i in range(3)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum(i==j for i,j in zip(input(),input())))

Submission status: Accepted

Solution code:
input_1=input()
input_2=input()

ans=0
i=0
while i < len(input_1):
  if input_1[i]==input_2[i]:
      ans+=1
  i+=1    
print (ans)

Submission status: Accepted

Solution code:
s = input()
t = input()
ans = len([1 for si,ti in zip(s,t) if si == ti])
print(ans)

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(len(s)):
    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(0,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:
p = list(input())
r = list(input())
count = 0
for i in range(len(p)):
    if p[i] == r[i]:
        count += 1
print(count)

Submission status: Accepted

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

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

print(a)

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 s, t in zip(S,T):
  if s==t:
    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()
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()
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()

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(str(input()))
t = list(str(input()))

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

Submission status: Accepted

Solution code:
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

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

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:
s1=input()
s2=input()
ans=0
for i in range(len(s1)):
  if s1[i]==s2[i]:
    ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(str(input()))
b = list(str(input()))
count = 0
for i in range(3):
    if a[i-1] == b[i-1]:
        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=ans+1
print(ans)

Submission status: Accepted

Solution code:
predict = input()
real = input()
cnt = 0

for i in range(len(predict)):
    if (predict[i] == real[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=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:
yohou=input()
real=input()

print((1 if yohou[0] ==real[0] else 0) + (1 if yohou[1] ==real[1] else 0) + (1 if yohou[2] ==real[2] else 0))

Submission status: Accepted

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

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

print(len([x for x,y in zip(a,b) if x==y]))

Submission status: Accepted

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

a = 0

for i, (s, t) in enumerate(zip(s, t)):
    if s == t:
        a += 1
print(a)

Submission status: Accepted

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

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

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