Problem:


Score : 100 points

Problem Statement

You will be given a string S of length 3 representing the weather forecast for three days in the past.

The i-th character (1 \leq i \leq 3) of S represents the forecast for the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.

You will also be given a string T of length 3 representing the actual weather on those three days.

The i-th character (1 \leq i \leq 3) of S represents the actual weather on the i-th day. S, C, and R stand for sunny, cloudy, and rainy, respectively.

Print the number of days for which the forecast was correct.

Constraints

S and T are strings of length 3 each.

S and T consist of S, C, and R.

Input

Input is given from Standard Input in the following format:

S
T

Output

Print the number of days for which the forecast was correct.

Sample Input 1

CSS
CSR

Sample Output 1

2

For the first day, it was forecast to be cloudy, and it was indeed cloudy.

For the second day, it was forecast to be sunny, and it was indeed sunny.

For the third day, it was forecast to be sunny, but it was rainy.

Thus, the forecast was correct for two days in this case.

Sample Input 2

SSR
SSR

Sample Output 2

3

Sample Input 3

RRR
SSS

Sample Output 3

0



Sample input:
CSS
CSR


Sample output:
2

Submission status: Accepted

Solution code:
S = 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()
r = input()
c = 0
for i,j in zip(s,r):
    if i == j:
        c += 1
    else:
        pass
print(c)

Submission status: Accepted

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

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:
import sys
input = sys.stdin.readline

S = input()
T = input()

count = 0

for a, b in zip(S, T):
    if a == b:
        count += 1

print(count-1)

Submission status: Accepted

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

print(sum([s == t for s, t in zip(S, T)]))

Submission status: Accepted

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

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

print(r)

Submission status: Accepted

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

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()
print(sum([si == ti for si, ti in zip(s, t)]))

Submission status: Accepted

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

import sys

def readline():
	return sys.stdin.readline().rstrip()
def read(f=int):
	return f(readline())
def reads(f=int):
	return [f(s) for s in readline().split()]

S = read(str)
T = read(str)

print(sum([1 if s == t else 0 for s, t in zip(S, T)], 0))

Submission status: Accepted

Solution code:
# coding: utf-8

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):
    ans += 1 if S[i] == T[i] else 0

print(ans)

Submission status: Accepted

Solution code:
li=input()
li2=input()

result=0

for i in range(len(li)):
  if li[i]==li2[i]:
    result+=1
print(result)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 入力
pred = input()
acctual = input()
counter = 0
for p,c in zip(pred,acctual):
    if p==c:
        counter +=1
# 出力
print(counter)

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()
print(int(s[0]==t[0]) + int(s[1]==t[1]) + int(s[2]==t[2]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces
gi = lambda : list(map(int,input().split()))
s, t = input(), input()
print(sum([1 if s[k] == t[k] else 0 for k in range(3)]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力


def main():
    # s, t
    s = list(input())
    t = list(input())
    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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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

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

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

Submission status: Accepted

Solution code:
a, b, c= input()
d, e, f = input()

count = 0

if a == d:
    count += 1
 
if b == e:
    count += 1

if c == f:
    count += 1

print(count)

Submission status: Accepted

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

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

print(len(c))

Submission status: Accepted

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

cnt = 0

for i in range(3):
    if S1[i] == S2[i]:
        cnt += 1

print(cnt)

Submission status: Accepted

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

s = list(s)
t=list(t)
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
if S[0:1] == T[0:1]:
    ans +=1

if S[1:2] == T[1:2]:
    ans +=1

if S[2:3] == T[2:3]:
    ans +=1

print(ans)

Submission status: Accepted

Solution code:
forcast = input()
reality = input()

count = 0
for f, r in zip(forcast, reality):
  if f == r:
    count = count+1
print(count)

Submission status: Accepted

Solution code:
import math

tenki = input()
tenki2 = input()

result = 0
for i in range(0,len(tenki)):
    if tenki[i] == tenki2[i]:
        result += 1
print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
#-------------------------------------
c1 = list(input())
c2 = list(input())

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8

if __name__ == "__main__":
    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()

ret=0

for a,b in zip(s,t):
    if a is b:
        ret+=1

print(ret)

Submission status: Accepted

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

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

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



if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
n = input()
l = input()
cnt = 0

for i in range(3):
  if n[i] == l [i]:
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:

I0 = lambda :map(int,input().split())
I1 = lambda :int(input())
I2 = lambda :list(map(int,input().split()))
#####################################################

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

counter = 0
S= input()
T= input()

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

print(counter)

Submission status: Accepted

Solution code:
tenkikyohou = input()
tenki = input()

ans = 0

for i in range(3):
    if tenkikyohou[i] == tenki[i]:
        ans += 1

print(ans)

Submission status: Accepted

Solution code:
import sys

S=sys.stdin.readline().rstrip()
T=sys.stdin.readline().rstrip()

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

Submission status: Accepted

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

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

    count = 0

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(count)

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s_list = list(input())
c_list = list(input())
count = 0

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Sat Apr 20 20:47:47 2019

@author: Owner
"""

import numpy as np
import sys
import collections
import scipy.misc
import math
from operator import itemgetter
import itertools
import copy
import bisect
import heapq

#素因数を並べる
def prime_decomposition(n):
  i = 2
  table = []
  while i * i <= n:
    while n % i == 0:
      n /= i
      table.append(int(i))
    i += 1
  if n > 1:
    table.append(int(n))
  return table   
# 桁数を吐く
def digit(i):
    if i > 0:
        return digit(i//10) + [i%10]
    else:
        return []
    
def getNearestValueIndex(list, num):
    """
    概要: リストからある値に最も近い値のインデックスを取得する関数
    @param list: データ配列
    @param num: 対象値
    @return 対象値に最も近い値
    """

    # リスト要素と対象値の差分を計算し最小値のインデックスを取得
    idx = np.abs(np.asarray(list) - num).argmin()
    return idx

def find_index(l, x, default=False):
    if x in l:
        return l.index(x)
    else:
        return default

class UnionFind(object):
    def __init__(self, n=1):
        self.par = [i for i in range(n)]
        self.rank = [0 for _ in range(n)]
        self.size = [1 for _ in range(n)]

    def find(self, x):
        """
        x が属するグループを探索
        """
        if self.par[x] == x:
            return x
        else:
            self.par[x] = self.find(self.par[x])
            return self.par[x]

    def union(self, x, y):
        """
        x と y のグループを結合
        """
        x = self.find(x)
        y = self.find(y)
        if x != y:
            if self.rank[x] < self.rank[y]:
                x, y = y, x
            if self.rank[x] == self.rank[y]:
                self.rank[x] += 1
            self.par[y] = x
            self.size[x] += self.size[y]

    def is_same(self, x, y):
        """
        x と y が同じグループか否か
        """
        return self.find(x) == self.find(y)

    def get_size(self, x):
        """
        x が属するグループの要素数
        """
        x = self.find(x)
        return self.size[x]
    

"""
N, X = map(int, input().split())

x = list(map(int, input().split()))

P = [0]*N
Y = [0]*N
for n in range(N):
    P[n], Y[n] = map(int, input().split())

# 多次元配列の宣言（あとでintにすること。）（タプルにすること。）
dp = np.zeros((N+1, 4,4,4))
    
all(nstr.count(c) for c in '753')

# 複数配列を並び替え
ABT = zip(A, B, totAB)
result = 0
# itemgetterには何番目の配列をキーにしたいか渡します
sorted(ABT,key=itemgetter(2))
A, B, totAB = zip(*ABT)
A.sort(reverse=True)

# 2進数のbit判定
(x >> i) & 1

# dp最小化問題
dp = [np.inf]*N
for n in range(N):
    if n == 0:
        dp[n] = 0
    else:
        for k in range(1,K+1):
            if n-k >= 0:
                dp[n] = min(dp[n], dp[n-k] + abs(h[n]-h[n-k]))
            else:
                break
# 累積和
add = 1 # 問題によって決まる
res = 0
sums = [0]*(len(nums)+1)
for i in range(len(nums)):
    sums[i+1] = sums[i] + nums[i]
for i in range(0, len(nums), 2):
    left = i
    right = min(i+add, len(nums))
    tmp = sums[right] - sums[left]
    res = max(tmp, res)

#２分探索
li, ri = bisect.bisect_left(p_ac, l[i]-1), bisect.bisect_right(p_ac, r[i]-1)    

#ソート関数
org_list = [3, 1, 4, 5, 2]
new_list = sorted(org_list)
print(org_list)
print(new_list)
# [3, 1, 4, 5, 2]
# [1, 2, 3, 4, 5]

#Distance Transformation
    for h in range(0,H):
        for w in range(0,W):
            if h == 0 and w == 0:
                pass
            elif h == 0:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h-1][W-w]+1)
            elif w == 0:   
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1)
            else:
                D[H-h-1][W-w-1]= min(D[H-h-1][W-w-1], D[H-h][W-w-1]+1, D[H-h-1][W-w]+1, D[H-h][W-w]+2)
            d_max = max(D[H-h-1][W-w-1], d_max)

"""


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

    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()
print(sum([S[k]==T[k] for k in range(3)]))

Submission status: Accepted

Solution code:
a = input()
b = 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:
# -*- coding: utf-8 -*-
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 = list(input())
T = list(input())

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

print(i)

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()
S_list = list(S)
T_list = list(T)

count = 0

for i in range(3):
    if S_list[i] == T_list[i]:
        count += 1

print(count)

Submission status: Accepted

Solution code:
#A
S = input()
T = input()
ans = 0
if S[0:1] == T[0:1]:
    ans += 1
    
if S[1:2] == T[1:2]:
    ans += 1
    
if S[2:3] == T[2:3]:
    ans += 1
    
print(ans)

Submission status: Accepted

Solution code:
yosoku = list(input())
jissai = list(input())

correct = 0
for i in range(3):
    if yosoku[i] == jissai[i]:
        correct += 1

print(correct)

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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:
import sys
# sys.setrecursionlimit(1000000)
# N, Q = map(int, sys.stdin.readline().split())
# a_b = [list(map(int, sys.stdin.readline().split())) for _ in range(N-1)]
# p_x = [list(map(int, sys.stdin.readline().split())) for _ in range(Q)]
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()
s1=list(s)
t1=list(t)
c=0
for i in range(len(s1)):
    if s1[i]==t1[i]:
        c=c+1
print(c)

Submission status: Accepted

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

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
    else:
        ans+=0
print(ans)

Submission status: Accepted

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

ans=0

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

Submission status: Accepted

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

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

print(match)

Submission status: Accepted

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

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:
x=input()
y=input()
c=0
for i in range (len(x)):
  if x[i]==y[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:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix
 
from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！
 
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:
from sys import stdin

f = stdin.readline().rstrip()
t = stdin.readline().rstrip()

point = 0

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
ss = input()
tt = input()

c = 0
for s, t in zip(ss, tt):
    if s == t and (s == 'R' or s == 'C' or s == 'S'):
       c += 1

print(c)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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()
match = 0
for i in range(3):
    if S[i] == T[i]: match += 1
print(match)

Submission status: Accepted

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

slis=s[::]
tlis=t[::]
count=0

for i in range(3):
    if slis[i]==tlis[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 = input()
t = input()
ans = 0
for _ in range(3):
    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
print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ls1 = input()
ls2 = input()
c = 0
for i in range(3):
  if ls1[i]==ls2[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:
n1 = str(input())
n2 = str(input())

n3 = list(n1)
n4 = list(n2)

s1 = 0
for i in range(len(n3)):
    if n3[i] == n4[i]:
        s1 += 1

print(s1)

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

count = 0

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

Submission status: Accepted

Solution code:
s = input()

t = input()

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

print(cnt)

Submission status: Accepted

Solution code:
S = input()
T = input()
cnt = 0
for i in range(len(S)):
        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:
s1=[i for i in input()]
s2=[i for i in input()]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s1 = input()
s2 = input()

cnt = 0
for s in range(len(s1)):
  if s1[s] == s2[s]:
    cnt += 1
print(cnt)

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

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

Submission status: Accepted

Solution code:
s=str(input())
l=str(input())
count=0
if s[0]==l[0]:
    count+=1
if s[1]==l[1]:
    count+=1
if s[2]==l[2]:
    count+=1
print(count)

Submission status: Accepted

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

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

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

print(sum)

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

Submission status: Accepted

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

ans = 0

cnt = 0
for i in s:
    if i == t[cnt]:
        ans+=1
    cnt+=1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
fore = input()
res = input()
count = 0

for i in range(3):
    if fore[i] == res[i]:
        count += 1

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
count = 0
S = list(input())
T = list(input())
for i in range(len(T)):
    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(len(S)):
  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 = 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 = list(input())
T = list(input())

counter = 0

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

print(counter)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    print(sum([s == t for s, t in zip(input(), input())][:-1]))


if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

Solution code:
forecasts = [c for c in input().strip()]
weather = [c for c in input().strip()]

ans = 0
for f, w in zip(forecasts, weather):
    ans += int(f == w)

print(ans)
exit(0)

Submission status: Accepted

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

Submission status: Accepted

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

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 = str(input())
B = str(input())
result = 0
for i in range(3):
  if A[i] == B[i]:
    result += 1
  else:
    None
print(result)

Submission status: Accepted

Solution code:
import sys

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

if __name__ == '__main__':
  s = sys.stdin.readline().strip()
  t = sys.stdin.readline().strip()
  solve(s, t)

Submission status: Accepted

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

result = 0
for i, st in enumerate(S):
    if S[i] == T[i]:
        result += 1

print(result)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8
def main():
    a = list(input())
    b = list(input())
    count = 0

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

    print(count)


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:
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:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

from sys import stdin
import math

# 標準入力をスペースで区切って、intに変換 listに収納
S = stdin.readline()
T = stdin.readline()

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


print(cnt)

Submission status: Accepted

Solution code:
from sys import stdin

if __name__ == '__main__':
    S = stdin.readline().rstrip()
    T = stdin.readline().rstrip()

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