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

Submission status: Accepted

Solution code:
S = input()
T = input()
print(len([i 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:
while True:
    try:
        S = input()
        T = input()
        result = 0
        for i in range(3):
            if S[i] == T[i]:
                result += 1
        print(result)
    except EOFError:
        break

Submission status: Accepted

Solution code:
# A - Tenki

S = str(input())
T = str(input())
count = 0

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

Submission status: Accepted

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

res = 0

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC139
def main():
    S, T = open(0).read().split()
    ans = sum(s == t for s, t in zip(S, T))
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import bisect

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

def LI(): return list(map(int, sys.stdin.readline().split()))


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python

from sys import stdin, stderr

def main():
   S = stdin.readline()
   T = stdin.readline()

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

   return 0

if __name__ == '__main__': main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
# 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:
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())
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
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())

ct = 0

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

print(ct)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

res = 0

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

Submission status: Accepted

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

print sum(1 for si, ti in zip(s, t) if si == ti)

Submission status: Accepted

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

result = 0

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(sum)

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

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

Submission status: Accepted

Solution code:
# Tenki
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()
count = 0

for a, b in zip(A, B):
    if a == b:
        count += 1

print(count)

Submission status: Accepted

Solution code:
import numpy as np

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

answer = (S == T)
print(sum(answer))

Submission status: Accepted

Solution code:
# -*- coding:utf8 -*-

s = input()
t = input()
a = 0
for i, n in enumerate(s):
    if t[i] == n:
        a += 1
print(a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# abc139/abc139_a
import sys

s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in list(ss)]
ss2nnn = lambda ss: [s2nn(s) for s in list(ss)]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [i2s() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

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

main()

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:
yoho = list(input())
kekka = list(input())

a = 0

for i in range(len(yoho)):
  if yoho[i] == kekka[i]:
    a += 1
print(a)

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:
import numpy as np

s = np.array(list(input()))
t = np.array(list(input()))

print(np.count_nonzero(s==t))

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

Solution code:
s= str(raw_input())
t= str(raw_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 q,r in zip(s,t):
    if q==r:
        count+=1
print(count)

Submission status: Accepted

Solution code:
from sys import stdin, stdout
 
ii = lambda: int(stdin.readline())
mi = lambda: map(int, stdin.readline().strip().split())
li = lambda: list(mi())

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

print(ans)

Submission status: Accepted

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

import sys

debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        lines.append(input())
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    s = lines[0]
    t = lines[1]

    return (s, t)


def solve(s, t):

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


    return count


def main():
    # 出力

    print("%s" % solve(*parse_input()))

if __name__ == '__main__':

    main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

c = 0

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

print(c)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

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

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

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

n=0

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

print(n)

Submission status: Accepted

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

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

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

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

print(count)

Submission status: Accepted

Solution code:
s=[]
t=[]

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

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

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


def main():

   S = input()
   T = input()
   count = 0

   for i,j in enumerate(S):
      if T[i] == j:
         count += 1
   print(count)

      

if __name__== "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
forecast = list(input())
real = list(input())
number = 0
for i in range(3):
    if forecast[i] == real[i]:
        number += 1
    else:
        pass
print(number)

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
#import sys
S = list(input())
T = list(input())
print(sum([1 if S[i] == T[i] else 0 for i in range(len(S))]))

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:
if __name__ == '__main__':
    s = list(input())
    t = list(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(ct)

Submission status: Accepted

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

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

Submission status: Accepted

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

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()
ans=0
for i in range(3):
	if s[i] is 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()

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
S = [s for s in input()]
T = [t for t in input()]

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

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


class AtCoder:
    def main(self):
        S = input().rstrip()
        T = input().rstrip()

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


if __name__ == '__main__':
    AtCoder().main()

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

Submission status: Accepted

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

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

print(an)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def input():
    return sys.stdin.readline()[:-1]


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


if __name__ == '__main__':
    main()

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

answer = sum(1 for a, b in zip(s, t) if a == b)
print(answer)

Submission status: Accepted

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

Submission status: Accepted

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

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()
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 = input()
T = input()
cnt = sum(1 for a, b in zip(S, T) if a == b)
print(cnt)

Submission status: Accepted

Solution code:
a=input()
b=input()
c=[]
d=[]
for x in a:
    c.append(x)
for x in b:
    d.append(x)
i=0
n=0
while i<3:
    if c[i]==d[i]:
        n+=1
    i+=1
print(n)

Submission status: Accepted

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

a = 0

for i in xrange(len(s)):
    if s[i] == t[i]:
        a += 1

print a

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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:
import sys


def input():
    return sys.stdin.readline()[:-1]


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

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  s=S()
  t=S()

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

# main()
print(main())

Submission status: Accepted

Solution code:
# coding: utf-8

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:
prd = str(input())
act = str(input())
ans = 0
for i in range(3):
  if prd[i] == act[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:
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from collections import *
import math
from bisect import *
import functools
INF = float('inf')
mod = 10**9+7

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# from math import factorial
# from collections import defaultdict, deque
#  from heapq import heappush, heappop

# A, B = [int(i) for i in input().split(" ")]
# A = int(input())
# As = [int(i) for i in input().split(" ")]
# Ss = ["".join(sorted(input())) for _ in range(N)]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

S = input()
T = input()

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

print(matched)

Submission status: Accepted

Solution code:
A=input()
B=input()
count=0
if A[0]==B[0]:
    count=count+1
if A[1]==B[1]:
    count=count+1
if A[2]==B[2]:
    count=count+1
print(count)

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

    return count


if __name__ == "__main__":
    s = input()
    t = input()

    print(main(s, t))

Submission status: Accepted

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

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

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 x in range(len(S)):
    if S[x] == T[x]:
        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:
import sys


def main():
    s = sys.stdin.readline().strip()
    t = sys.stdin.readline().strip()

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

    print(ans)


main()

Submission status: Accepted

Solution code:
focusts = input()
facts = input()

result = 0
for fo, fa in zip(focusts, facts):
  if fo == fa:
    result += 1

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
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 = sys.stdin.readline()
t = sys.stdin.readline()

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

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

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

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

    print(c - 1)

if __name__ == '__main__':
    main()

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

count = 0

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

print(count)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

    ans = 0

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

    print(ans)


if __name__ == '__main__':
    p_a()

Submission status: Accepted

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

counter = 0

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

print(counter)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    S = input()
    T = input()
    print(sum(s == t for s, t in zip(S, T)))

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
cnt=0
l=list(input())
ll=list(input())

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

Submission status: Accepted

Solution code:
S=raw_input()
T=raw_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:
# -*- coding: utf-8 -*-

S = str(input())
T = str(input())

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
for si, ti in zip(s, t):
    if si == ti:
        cnt += 1

print(cnt)

Submission status: Accepted

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