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

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

Submission status: Accepted

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

i = 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: Accepted

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

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

print(n)

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

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

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

Submission status: Accepted

Solution code:
S=input()
T=input()
#N=list(map(int,input().split()))

count=0

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


print(count)

Submission status: Accepted

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

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:
print(sum(a == b for a, b in zip(list(input()), list(input()))))

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

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

Submission status: Accepted

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

result = 0

print(sum(1 if _s == _t else 0 for _s, _t in zip (s, t)))

Submission status: Accepted

Solution code:
x = list(input())
y = list(input())

i = 0
count = 0

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

Submission status: Accepted

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

print(answer)

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

Solution code:
sus = input()
tru = input()
cnt = 0

for i in range(3):
  if sus[i] == tru[i]:
    cnt += 1

print(cnt)

Submission status: Accepted

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

print(k)

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

a = list(a)
b = list(b)

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

print(result)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    S, T = [input() for _ in range(2)]
    print(len([True for s, t in zip(S, T) if s == t]))

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 = input()
b = input()
print([a[i] == b[i] for i in range(len(a))].count(True))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter, defaultdict
import sys
sys.setrecursionlimit(10 ** 5 + 10)
# input = sys.stdin.readline
from math import factorial
import heapq, bisect
import math
import itertools





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

Submission status: Accepted

Solution code:
from sys import exit, stderr, stdin
input = stdin.readline
# setrecursionlimit(10**7)

def debug(var, name="hoge"):
    print(name +":" + str(type(var)) + " = " + repr(var), file=stderr)
    return


def main():

    # N = int(input())
    # a = [int(input()) for _ in range(N)]
    S = str(input())[:-1]
    T = str(input())[:-1]
    ans = 0
    for i in range(len(S)):
        if (S[i] == T[i]):
            ans += 1
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

s = list(s)
t = list(t)

ans = 0

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
x=input()
y=input()
ans=0
if(x[0]==y[0]):
  ans+=1
if(x[1]==y[1]):
  ans+=1
if(x[2]==y[2]):
  ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# submission # - User: herp_sy
# https://atcoder.jp/contests/

import math
import statistics

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(c)

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()
ans=0
for i in range(3):
  ans+=1 if S[i]==T[i] else 0
  
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:
import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

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

import sys
import copy
import math

sys.setrecursionlimit(1000000)

# input = sys.stdin.readline

# ~~~~~~~~~~~~~~~~~~~~~_(＾～＾ ｣ ∠)_~~~~~~~~~~~~~~~~~~

S = input().rstrip()
T = input().rstrip()

ans = 0

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

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:
# -*- coding: utf-8 -*-
# @Author: WA_King
# @Date:   2019-04-03 19:35:31
# @Last Modified by:   lcw
# @Last Modified time: 2019-09-02 13:50:55
a=''.join(input().split())
b=''.join(input().split())
ans=0
for i in range(len(a)):
	if a[i]==b[i]:
		ans+=1
print(ans)

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:
S=input()
print(sum([S[i]==x for i,x in enumerate(input())]))

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

Submission status: Accepted

Solution code:
yohou=list(input())
kekka=list(input())
cnt=0
for yo, ke in zip(yohou,kekka):
  if yo == ke:
    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, t = input(), input()
print(sum([x == y for x, y in zip(s, t)]))

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

Submission status: Accepted

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

ai = list(a)
bi = list(b)

j = 0
for i in range(3):
    if ai[i] == bi[i]:
        j += 1

print(j)

Submission status: Accepted

Solution code:
a,b=open(0);c=0
for i in range(3):
	c+=bool(a[i]==b[i])
print(c)

Submission status: Accepted

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

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, b = input(), input()
cnt = 0
if a[0] == b[0]:
    cnt += 1
if a[1] == b[1]:
    cnt += 1
if a[2] == b[2]:
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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()
a = 0
if S[0] == T[0]:
    a +=1
if S[1] == T[1]:
    a += 1
if S[2] == T[2]:
    a += 1
print(a)

Submission status: Accepted

Solution code:
S = input()
T = input()
cnt = 0
for ind,s in enumerate(S):
    if(s==T[ind]):
        cnt+=1
print(cnt)

Submission status: Accepted

Solution code:


yoho = list(input())
tenki = list(input())
ans = 0
if yoho[0] == tenki[0]:
    ans += 1
if yoho[1] == tenki[1]:
    ans += 1
if yoho[2] == tenki[2]:
    ans += 1

#print(yoho)
#print(tenki)
print(ans)

Submission status: Accepted

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

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

cnt = 0
for k,v in zip(n,t):
    if k == v:
        cnt +=1

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

c=0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print([x == y for x, y in zip(s, t)].count(True))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def iread():
    return int(input())


def sread():
    return input()


def aread(t="int"):
    if t == "int":
        ret = [int(i) for i in input().split()]
    elif t == "str":
        ret = list(input())
    return ret


def scan():
    return list(map(int, input().split()))


def main():
    forecast = sread()
    wethar = sread()
    cnt = 0
    for i in range(3) :
        if forecast[i] == wethar[i]:
            cnt += 1
    print(cnt)
    

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum(i==j for i,j in zip(*open(0)))-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
forecast = raw_input().strip()
real = raw_input().strip()
assert len(forecast) == len(real)
print sum([1 for i in xrange(len(forecast)) if forecast[i] == real[i]])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = 0
for a,b in zip(input(),input()):
  if a == b:
    c += 1
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count=0

for i in range(3):
    if t[i]==s[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:
#Tenki

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

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

print(ctr)

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = 0
for i,j in zip(S,T):
    ans += i==j

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()
T = input()
print(list(S[i] == T[i] for i in range(3)).count(True))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop
from collections import deque,defaultdict,Counter
import itertools
from itertools import permutations
import sys
import bisect
import string
sys.setrecursionlimit(10**6)
def SI():
    return input().split()
def MI():
    return map(int,input().split())
def I():
    return int(input())
def LI():
    return [int(i) for i in input().split()]
YN=['Yes','No']
mo=10**9+7

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:
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
    print(res)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

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:
def main():
    s = list(input())
    t = list(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:
pred = list(input().strip())
real = list(input().strip())

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

print(ans)

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:
one = []
two = []

a = input()
b = input()

for i in a:
  one.append(i)

for o in b:
  two.append(o)

count = 0

if one[0] == two[0]:
  count += 1
if one[1] == two[1]:
  count += 1
if one[2] == two[2]:
  count += 1
  
print(count)

Submission status: Accepted

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

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:
x,y,z=input()
a,b,c=input()
print((x==a) + (y==b) + (z==c))

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
print(sum([1 if a==b else 0 for a,b in zip(s,t)]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input().strip()
    t = input().strip()

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

    print(count)

        
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = str(input())
t = str(input())
st = tuple(s)
tt = tuple(t)

cnt = 0

for i in range(len(st)):
  if st[i] == tt[i]:
    cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(map(str,input()))
t = list(map(str,input()))
c = 0

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

print(c)

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

S = str(input().rstrip())
T = str(input().rstrip())

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Correct = 0
Count = 0

for i in S :
    if i == T[Count] :
        Correct += 1
    Count += 1

print(Correct)

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:
a,b = input(),input()
c = 0 
for i,j in zip(a,b):
    if i==j:
        c+=1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
forecasted_weather = input()
actual_weather = input()

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

Submission status: Accepted

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

s = input().strip()
t = input().strip()
print(0 + (s[0] == t[0]) + (s[1] == t[1]) + (s[2] == t[2]))

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

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 ind,s in enumerate(S):
    if(s==T[ind]):
        cnt+=1
print(cnt)

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

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:
pred = [i for i in input()]
data = [i for i in input()]
cnt = 0

for i in range(3):
  if pred[i] == data[i]:
    cnt += 1

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
import sys
weather_forecast = input()
weather_real = input()
weather_forecast_s = list(weather_forecast)
weather_real_s = list(weather_real)
hit = 0
for i in range(3):
    if weather_forecast_s[i] == weather_real_s[i]:
        hit+=1
print(hit)

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=str(input())
s=[c for c in s]
t=str(input())
t=[c for c in t]
x=0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 0

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

print(ans)

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

C = 0

for i in range(3):
    if N[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:
a = input()
b = input()
n = 0
for i in range(3):
  if a[i] == b[i]:
    n += 1
print(n)

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:
s1 = input()
s2 = input()
for i in range(0):
    a[i] = list(map(int, input().split()))
count = 0
for i in range(3):
    if(s1[i]==s2[i]):
        count+=1
print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#入力
S = input()
T = input()

#比較
p = 0

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

#出力
print(p)

Submission status: Accepted

Solution code:
s = input()
t = input()
cnt = 0
for x, y in zip(s, t):
    if x == y:
        cnt += 1
print(cnt)

Submission status: Accepted

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

x = 0
if S[0] == T[0]:
  x += 1
if S[1] == T[1]:
  x += 1
if S[2] == T[2]:
  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:
S = input()
T = input()
S = str(S)
T = str(T)

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

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0 

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

print(count)

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

yohou_list = list(yohou)

tenki = str(input())

tenki_list = list(tenki)

hi = 0

onaji = 0

while hi < 3 :
    if yohou_list[hi] == tenki_list[hi] :
        onaji+=1
    hi+=1

print(onaji)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Q = list(input())
Ans = list(input())
count = 0

for i in range(3):
    if Q[i] == Ans[i]:
        count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
weather_report = input()
weather_now = input()
match_result = 0
split_weather_report = []
split_weather_now = []

for i in weather_report:
    split_weather_report += i
for j in weather_now:
    split_weather_now += j

for i in range(3):
    if (split_weather_report[i] in split_weather_now[i]):
        match_result += 1

print(match_result)

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)