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

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 = input()
b = input()
ans = 0

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

print(str(ans))

Submission status: Accepted

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

x = 0

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

print(x)

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    s=STR()
    t=STR()
    ct=0
    for i in range(3):
        if s[i]==t[i]:
            ct+=1
    print(ct)
if __name__ == '__main__':
    do()

Submission status: Accepted

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


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

correct = 0
for i, x in enumerate(S):
  if T[i] == x:
    correct += 1
print(correct)

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

Submission status: Accepted

Solution code:
pre = input()
fact = input()
ans = 0

for i in range(3):
    if pre[i] == fact[i]:
        ans += 1

print(ans)

Submission status: Accepted

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

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 += 1
if s[1] == t[1]:
    count += 1
if s[2] == t[2]:
    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:
def main():
	# n,m = map(int,input().split())
	# n,k = map(int,input().split())
	# n = int(input())
	# a = list(map(int,input().split()))
	# rsp = list(str(input()))
	# l = [list(map(int, input().split())) for _ in range(n)]
	# s = list(s)
	
	yoho = list(str(input()))
	jissai = list(str(input()))

	# print(yoho,jissai)
	ans = 0
	for i in range(len(yoho)):
		if yoho[i] == jissai[i]:
			ans += 1

	print(ans)


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

Submission status: Accepted

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

Submission status: Accepted

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

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

r = 0
for i, x in enumerate(S):
    if x == T[i]:
        r += 1
print(r)

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
 
import math
import itertools
import sys
import copy
 
# 入力
#N, W = map(int, input().split())
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:
s = input()
t = input()
s = list(s)
t = list(t)
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()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
S = input().strip()
T = input().strip()
N = len(S)
c = 0

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

print(c)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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:
s1 = input()
s2 = input()
ans = 0
for i, j in zip(s1, s2):
    if i == j:
        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 = [s for s in input()]
T = [t for t in 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:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    print(sum(s==t for s,t in zip(input(),input())))
resolve()

Submission status: Accepted

Solution code:
from sys import stdin

a=  stdin.readline().rstrip()
b=  stdin.readline().rstrip()

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



print(count)

Submission status: Accepted

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

res = 0
for s, t in zip(S, T):
    if s==t:
        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=input()
b=input()
if a[0]==b[0]:
  A=1
else:
  A=0
if a[1]==b[1]:
  B=1
else:
  B=0
if a[2]==b[2]:
  C=1
else:
  C=0
print(A+B+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:
forecast=input()
weather=input()
cnt=0

for k in range(3):
    
    if forecast[k]==weather[k]:
        cnt+=1
        
print(cnt)

Submission status: Accepted

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

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 = list( str( input() ) )
T = list( str( input() ) )
match = [ S[x] == T[x] for x in range(3) ]
print( sum( match ) )

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

Submission status: Accepted

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

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

print(cnt)

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

if s[0] == t[0]:
    a = 1
else:
    a = 0

if s[1] == t[1]:
    b = 1
else:
    b = 0

if s[2] == t[2]:
    c = 1
else:
    c = 0

print(a + b + c)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

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

print(len([1 for i in range(3) if S[i] == T[i]]))

Submission status: Accepted

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

count = len(s)

ans = 0

for i in range(count):
    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:

import numpy as np
def main():
    s = input().split()
    t = input().split()
   
    ans = 0
    for i in range(3):
        if s[0][i] == t[0][i]:
            ans += 1

    print(ans)

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [i for i in input()]
b = [i for i in 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()

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

Submission status: Accepted

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

def main():
    s, t = input(), input()
    print(sum([1 for i in range(3) if s[i] == t[i]]))

if __name__ == '__main__':
    main()

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

ct = 0
for i in range(len(fore)):
  if fore[i] == real[i]:
    ct += 1
 
print(ct)

Submission status: Accepted

Solution code:
S = str(input())
T = str(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] and S[2]!=T[2]:
    print("2")
elif S[0]==T[0] and S[1]!=T[1] and S[2]==T[2]:
    print("2")
elif S[0]!=T[0] and S[1]==T[1] and S[2]==T[2]:
    print("2")
elif S[0]==T[0] and S[1]!=T[1] and S[2]!=T[2]:
    print("1")
elif S[0]!=T[0] and S[1]==T[1] and S[2]!=T[2]:
    print("1")
elif S[0]!=T[0] and S[1]!=T[1] and S[2]==T[2]:
    print("1")
else:
    print("0")

Submission status: Accepted

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

Submission status: Accepted

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

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:
print(sum(map(lambda x: int(x[0] == x[1]), zip(list(input()), list(input())))))

Submission status: Accepted

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

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

Submission status: Accepted

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

counter = 0

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

print(counter)

Submission status: Accepted

Solution code:
s = [i for i in input()]
t = [i for i in input()]

counter = 0

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

print(counter)

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = 0
if S[0] == T[0]:
    ans = 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:
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:
yo = list(input())
ji = list(input())
a = 0
if yo[0] == ji[0]:
    a += 1
if yo[1] == ji[1]:
    a += 1
if yo[2] == ji[2]:
    a += 1

print(a)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
pred = input()
aw = input()

counter = 0
for i in range(len(pred)):
    if pred[i] == aw[i]:
        counter += 1
        
print(counter)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input());p=list(input())
st=0
list=0,2,4
for i in range(3):
    if s[i]==p[i]:
        st+=1
print(st)

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(g)

Submission status: Accepted

Solution code:
s1=input()
s2=input()
count=0
if s1[0]==s2[0]:
  count+=1
if s1[1]==s2[1]:
  count+=1
if s1[2]==s2[2]:
  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:
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=list(input())
t=list(input())
count=0
for i,j in zip(s,t):
    if i==j:
        count+=1
print(count)

Submission status: Accepted

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

sum = 0

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

print(sum)

Submission status: Accepted

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

Sum = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

print(cnt)

Submission status: Accepted

Solution code:
import numpy as np
S = np.array(list(input()))
T = np.array(list(input()))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = [input() for i in range(2)]
 
ans=0
for a,b in zip(s[0],s[1]):
  if a==b:
    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()
ans = sum([si == ti for si, ti in zip(s, t)])
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
S = np.array(list(input()))
T = np.array(list(input()))
print((S == T).sum())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = str(input())
T = str(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=list(map(str,input()))
T=list(map(str,input()))
count=0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

cnt = 0

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

print(cnt)

Submission status: Accepted

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

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,T=[input() for _ in range(2)]
sum=0
for i in range(3):
  sum+=S[i]==T[i]
print(sum)

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 = list(input())
t = list(input())
c = 0
if s[0] == t[0]:
    c+=1
if s[1] == t[1]:
    c+=1
if s[2] == t[2]:
    c+=1
print(c)

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

s = raw_input()
t = raw_input()

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

print ans

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, T = [input() for _ in range(2)]

correct = sum(a == b for a, b in zip(S, T))

print(correct)

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

Submission status: Accepted

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

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

print(buf)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [c for c in input()]
b = [c for c in input()]
print(sum(1 for c, z in zip(a, b) if c == z))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(score)

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

Submission status: Accepted

Solution code:
S = input()
T = input()
count =0
for i,x in enumerate(S):
    if x == 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+=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:
import sys
from operator import itemgetter #sortedの対象を決めたい
from fractions import gcd #最大公約数求めたい
from math import ceil, floor, sqrt #小数点切り上げ、切り捨て、平方根求めたい
from copy import deepcopy #参照で影響されないコピーが作られる
from collections import Counter, deque #要素ごとの出現回数を数える。双方向アクセス可能データ型
import heapq
from functools import reduce
sys.setrecursionlimit(200000)

input = sys.stdin.readline
# template


s = input()
c = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2019-11-17 20:44:23(JST)
import sys
# import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
# import operator as op
# import re
# import heapq
# import array
# from scipy.misc import comb # (default: exact=False)
# import numpy as np 


def main():
    s, t = sys.stdin.read().split()

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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