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:
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 6)
#from collections import defaultdict
#d = defaultdict(int)
#import fractions
#import math
#import collections
#from collections import deque
#from bisect import bisect_left
#from bisect import insort_left
#N = int(input())
#A = list(map(int,input().split()))
#S = list(input())
#S.remove("\n")
#N,M = map(int,input().split())
#S,T = map(str,input().split())
#A = [int(input()) for _ in range(N)]
#S = [input() for _ in range(N)]
#A = [list(map(int,input().split())) for _ in range(N)]
#import itertools
#import heapq
#import numpy as np
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 = 0

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

print(cnt)

Submission status: Accepted

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

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

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

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()
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:
#!/usr/bin/env python3

def main():
    S, T = map(str, open(0).read().split())
    cnt = 0

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

    print(cnt)


main()

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

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

Submission status: Accepted

Solution code:
#ABC139-A #Tenki                                                                                                 
a = input()
b = input()
c = 0
if a[-1]==b[-1]:
    c =	c+1
if a[-2]==b[-2]:
    c=c+1
if a[-3]==b[-3]:
    c=c+1
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
t = list(input())
l = list()
for i in range(3):
  l.append(1) if s[i] == t[i] else l.append(0)
print(sum(l))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
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()
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(s)
#print(t)
count=0
if s[0]==t[0]:
    count=count+1
if s[1]==t[1]:
    count=count+1
if s[2]==t[2]:
    count=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 = str(input())
T = str(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:
s=input()
t=input()
ans=0
for i in range(3):
  if s[i]==t[i]:
    ans+=1
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
args = [input() for _ in range(2)]

S = args[0]
T = args[1]

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

Submission status: Accepted

Solution code:
import sys
a = sys.stdin.readline().rstrip()
b = sys.stdin.readline().rstrip()
i = 0
cnt = 0
while i <= 2:
  cnt += 1 if a[i] == b[i] else 0
  i += 1
print(cnt)

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

Submission status: Accepted

Solution code:

s = input()
t = input()

print(sum([s[i] == t[i] for i in range(3)]))

Submission status: Accepted

Solution code:
stdin = open(0).read().split('\n')
S = stdin[0]
T = stdin[1]
day=0
if S[0]==T[0]:day+=1
if S[1]==T[1]:day+=1
if S[2]==T[2]:day+=1
print(day)

Submission status: Accepted

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

print(count)

Submission status: Accepted

Solution code:
#copy

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

#
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();print(sum(S[i]==T[i] for i in range(3)))

Submission status: Accepted

Solution code:
S,T=[input() for _ in range(2)];print(sum(S[i]==T[i] for i in range(3)))

Submission status: Accepted

Solution code:
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:
line = input()
line2 = input()
count = 0
if line[0] == line2[0]:
  count += 1
if line[1] == line2[1]:
  count += 1
if line[2] == line2[2]:
  count += 1
print(count)

Submission status: Accepted

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

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:
#!/usr/bin/env python3
cnt = 0
S = input()
T = input()

tekityu = 0

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

print(cnt)

Submission status: Accepted

Solution code:
import os, sys, re, math

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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
if a == d:
    cnt += 1
if b == e:
    cnt += 1
if c == f:
    cnt += 1

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
a,b,c=map(str,input())
A,B,C=map(str,input())

count=0
if a==A:
  count+=1
if b==B:
  count+=1
if c==C:
  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:
S=str(input())
T=str(input())

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

print(c)

Submission status: Accepted

Solution code:
S = input()
R = input()
cnt = 0
for i in range(3):
  if S[i] == R[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()

cnt=0

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

print(cnt)

Submission status: Accepted

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

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

S = input()
T = input()
word = list(S)
result = list(T)

j = 0
for i in range(3):
  if (word[i] == result[i]):
    j = j + 1
  else:
    pass

print(j)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
pred = input()
real = input()
tmp=0
for i in range(3):
  if pred[i] == real[i]:
    tmp += 1
print(tmp)

Submission status: Accepted

Solution code:


s = input()
t = input()
count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

sm = 0

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

print(sm)

Submission status: Accepted

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

Submission status: Accepted

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

same = [s for s, t in zip(S, T) if s == t]
print(len(same))

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

s = readline().rstrip().decode()
t = readline().rstrip().decode()
cnt = 0
for i in range(3):
    if s[i] == t[i]:
        cnt += 1
print(cnt)

Submission status: Accepted

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

from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

def YesNo(flag): print('Yes' if flag else 'No')
def yesno(flag): print('yes' if flag else 'no')

""" Input
N = int(input())
N, A, B = map(int, input().split())
A = list(map(int, input().split()))
D = [int(input()) for _ in range(N)]
"""

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

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

print(counter)

# def main():


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

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

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

Submission status: Accepted

Solution code:
from sys import stdin
import queue
import sys

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

Submission status: Accepted

Solution code:
S,T = [input() for i in range(2)]
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:
import sys
input = sys.stdin.readline

#n = int(input())
#l = list(map(int, input().split()))

'''
A=[]
B=[]
for i in range():
    a, b = map(int, input().split())
    A.append(a)
    B.append(b)'''
cnt=0
s=list(input())
t = list(input())
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:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 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 LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    s = S()
    t = S()
    c = 0
    for i in range(len(s)):
        if s[i] == t[i]:
            c += 1
    print(c)

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

print(ret)

Submission status: Accepted

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

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

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

print(sum([s[i]==t[i] for i in range(len(s))]))

Submission status: Accepted

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

Submission status: Accepted

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

print(sum([s[i]==t[i] for i in range(len(s))]))

Submission status: Accepted

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

Submission status: Accepted

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

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

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()
c = 0
for i in range(len(T)):
  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 = 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:
import sys
input = sys.stdin.readline
import math
import collections
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

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

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

print(t)

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    q1()

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

count = 0
if a[0] == b[0]:
    count+=1
if a[1] == b[1]:
    count+=1
if a[2] == b[2]:
    count+=1
print(count)

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

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

print(ans)

Submission status: Accepted

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

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(0, 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:
print(sum(s == t for s, t in zip(input(), input())))

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

print(sum([1 for x,y in zip(S,T) if x==y]))

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

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

print(answer)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#template
from collections import Counter
def inputlist(): return [int(j) for j in input().split()]
#template
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:
T = list(input())
S = list(input())
ans = 0
for i in range(len(T)):
  if T[i] == S[i]:
    ans += 1
print(ans)

Submission status: Accepted

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

for i in range(len(A)):
    if A[i] == B[i]:
        p += 1

print(p)

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

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