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

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

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

Submission status: Runtime Error

Solution code:
x = input()
y = input()
ans = 0
for i in range(len(x)):
  for j in range(len(y)):
    if i == j:
      if li[i] == li[j]:
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
x = input()
y = input()
ans = 0
for i in range(len(x)):
  for j in range(len(y)):
    if i == j:
      if li[i] != li[j]:
        ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
a=list(input())
b=list(input())
print(len(list(set(a)a&set(b))))

Submission status: Runtime Error

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

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

Solution code:
import numpy as np
N = int(input())
n = [x for x in range(1, N+1)]
m = n[1:]
m.append(n[0])
n = np.array(n)
m = np.array(m)
x = n % m
print(sum(x))

Submission status: Runtime Error

Solution code:
s1 = list(map(str, input().split()))
s2 = list(map(str, input().split()))
ans = 0
for i in range(3):
  if s1[i] == s2[i]:
    ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())
ans = (n-1)*n*0.5
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

A,B = map(int,input().split())

print((B+A-3)//(A-1))

Submission status: Runtime Error

Solution code:
#copy

s = chr(input())
t = chr(input())

ans = 0

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

Submission status: Runtime Error

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

def main():
    n = int(input())
    ai = list(map(int, input().split()))
    assert len(ai) == n

    mi = 999999
    for a in ai:
        mi = min(mi, fact_of_two(a))

    print(mi)

def fact_of_two(i):
    for j in range(10000):
        if i % (2 ** j) != 0:
            break
    assert j >= 1
    return j - 1

if __name__ == "__main__":
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
A,B = map(int, input().split())
cnt = 1
ans = 0
while cnt < B:
    cnt += A-1
    ans += 1
print(ans)

Submission status: Runtime Error

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

ans = 0

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

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split())
c = 1
while A+(c-1)*(A-1) < B:
    c += 1
print(c)

Submission status: Runtime Error

Solution code:
from sys import stdin
import queue
import sys

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

Submission status: Runtime Error

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

n = int(input())
a = []
for _ in range(n):
	a.append(tuple(map(int,input().split())))
a = tuple(a)

play = [0 for _ in range(n)]
flag = [True for _ in range(n)]
count = 0
ans = 0
while True:
	break_flag = True
	for i in range(n):
		if flag[i]:
			num = a[i][play[i]]-1
			if flag[num] and a[num][play[num]]-1 == i:
				play[num] += 1
				play[i] += 1
				flag[num] = False
				flag[i] = False
				break_flag = False
				count += 1
	if break_flag:
		print(-1)
		sys.exit()
		break
	ans += 1
	if count == n*(n-1)//2:
		break
	for i in range(n):
		if play[i] < n-1:
			flag[i] = True
		else:
			flag[i] = False

if ans == 0:
	print(-1)
else:
	print(ans)

Submission status: Runtime Error

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

cnt = 0

for i in range(3)

if S[i] == T[i]:
  cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
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 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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
ans=0
c=1
while c<b:
    c-=1
    c+=a
    ans+=1
print(ans)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a,b=input().split()
if a==b:
    print(3)
elif a[0]=b[0] and a[1]=b[1] and a[2]!=b[2]:
    print(2)
elif a[0]=b[0] and a[1]!=b[1] and a[2]=b[2]:
    print(2)
elif a[0]!=b[0] and a[1]=b[1] and a[2]=b[2]:
    print(2)
elif a[0]!=b[0] and a[1]!=b[1] and a[2]!=b[2]:
    print(0)
else :
    print(1)

Submission status: Runtime Error

Solution code:
a,b=minput().split()
if a==b:
    print(3)
elif a!=b:
    print(0)
elif a[0]=b[0] and a[1]=b[1] and a[2]!=b[2]:
    print(2)
elif a[0]=b[0] and a[1]!=b[1] and a[2]=b[2]:
    print(2)
elif a[0]!=b[0] and a[1]=b[1] and a[2]=b[2]:
    print(2)
else:
    print(1)

Submission status: Runtime Error

Solution code:
a,b=map(input().split())
if a==b:
    print(3)
elif a!=b:
    print(0)
elif a[0]=b[0] and a[1]=b[1] and a[2]!=b[2]:
    print(2)
elif a[0]=b[0] and a[1]!=b[1] and a[2]=b[2]:
    print(2)
elif a[0]!=b[0] and a[1]=b[1] and a[2]=b[2]:
    print(2)
else:
    print(1)

Submission status: Runtime Error

Solution code:
S,T = input().split()

count=0

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

Submission status: Runtime Error

Solution code:

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

Submission status: Runtime Error

Solution code:
n=int(input())
print((n-1)*n//2)

Submission status: Runtime Error

Solution code:
s,t=map(int,open(0).read().split());print(sum([j==i for i in s for j in t]))

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split())

n = 1
c = 0

while n < B:
	n = n + A -1
	c = c+1
    
print(c)

Submission status: Runtime Error

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

score=0

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

print(score)

Submission status: Runtime Error

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

csore = 0
if S[0] == T[0]: 
	score = score + 1
elif S[1] == T[1]: 
	score = score + 1
elif S[2] == T[2]: 
	score = score + 1

print(score)

Submission status: Runtime Error

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

score = 0
if S[0]==T[0]:
	score = score +1
  
if S[1]==T[1]:
    score=score+1
    
if S[2]==T[2]:
	score=score*1

print(score)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())

print(int(N * (N - 1) // 2))

Submission status: Runtime Error

Solution code:
S = input()
T = input()
S = [i for i in S]
T = [i for i in T]

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

print(cnt)

Submission status: Runtime Error

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

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

print(ans)S = input()
T = input()

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

print(ans)

Submission status: Runtime Error

Solution code:
def compare(a, b):
  	c=0
    for x, y in zip(a, b):
        if x == y:
          c += 1
x = input()
y = input()
compare(x,y)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = input().split()
m = input().split()
cnt = 0
for i in range(3):
    if l[i] == m[i]:
        cnt += 1
print(cnt)

Submission status: Runtime Error

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

for x in range(2):
    if s[x] == t[x]:
        ing_total+=1
    else:
        ing_total+=0
     print(ing_total)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())

cnt = 0
p = 1

while p < b:
    p += a - 1
    cnt += 1
    
print(cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

cnt = 0

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

pirn(cnt)

Submission status: Runtime Error

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

cnt = 0

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

pirn(cnt)

Submission status: Runtime Error

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

cnt = 0

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

pirn(cnt)

Submission status: Runtime Error

Solution code:
S, T = list(input().split())

count = 0

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

Submission status: Runtime Error

Solution code:
S, T = list(input().split())

count = 0

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

Submission status: Runtime Error

Solution code:
import math
a,b = map(int,input().split())
print(math.ceil((b - 1) / (a - 1)))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
a,b =map(int, input().split())
print(math.ceil((b-1)/(a-1)))

Submission status: Runtime Error

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

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

if __name__ == '__main__':
	main()

Submission status: Runtime Error

Solution code:
n=int(input())
H=list(map(int,input().split()))

ans = 0
i = 0
cnt = 0
for i in range(N-1):
    if H[i] >= H[i+1]:
       cnt += 1
    else:
        ans = max(ans, cnt)
        cnt = 0
ans = max(ans, cnt)
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math


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


a, b = map(int, input().split())
tap = 0
sasikomi = 1

while sasikomi < b:
    sasikomi += a-1
    tap += 1
print(tap)

Submission status: Runtime Error

Solution code:
N = int(input())
H = list(map(int,input().split()))

l = len(H)
L = [0]
for i in range(l-1):
    if H[i] < H[i+1]:
        L.append(i)

L.append(l-1)

jump = [L[i+1] - L[i] - 1 for i in range(len(L)-1)]
print(max(jump))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
A,B=map(int,input().split())
res=-(-B//A)
print(res)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Solution code:
A, B = map(int, input().split())
q = B-1//A-1
mod = B-1 % A-1
 
if mod == 0:
  print(q)
else:
  print(q+1)

Submission status: Runtime Error

Solution code:
A, B = map(int, input().split())
q = -((-B+1)//(A-1))
 
print(q)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s,t=list(input()),list(input())
print(sum(s==t))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
print((N*(N-1))/2)

Submission status: Runtime Error

Solution code:
N=int(input())
print(N*(N-1)/2)

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
i=0
if b!=1:



    while True:
        if a + (a-1)*i < b:
            i+=1
        else :
            break

print(i)

Submission status: Runtime Error

Solution code:
print(sum([int(i) for i in range(int(input()))]))

Submission status: Runtime Error

Solution code:
A,B = map(int, input().split())
n =1
while True:
    if B == 1:
        print(0)
        break
    if B <= n*(A-1)+1:
        print(n)
        break
    else:
        n += 1

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
using namespace std;
int main() {
  string s,t;
  cin >> s >> t;
  int ans=0;
  for(int i=0; i<3; i++){
    if(s[i]==t[i]){
      ans++;
    }
  }
  cout << ans << endl;
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

print(ans)

Submission status: Runtime Error

Solution code:
x,y,z = input().split()
a,b,c = input().split()
lst1 = [x,y,z]
lst2 = [a,b,c]
num = 0
for i in range(3):
    if lst1[i] == lst2[i]:
        num = num + 1
    else:
        num = num
print(num)

Submission status: Runtime Error

Solution code:
a,b=map(int, input().split())

count=0
tmp=0

for i in range(1,21):
    if (a-1)*i+1 >= b:
        print(i)
        break

Submission status: Runtime Error

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

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

print(count)

Submission status: Runtime Error

Solution code:
n=int(input())-1;print(n*(n+1)//2)

Submission status: Runtime Error

Solution code:
CSS
CSR

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
if a <= b:
    print(1)
else:
    for i in range(20):
        if (a * i - 1) >= b:
            break
    print(i)

Submission status: Runtime Error

Solution code:
a,b = map(int, input().split())
i=1
sum = a
if sum<=b:
	while sum<=b:
		sum+=a-1
		i+=1
print(i)

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())

if b==1:
    tmp = 0

else:
    tmp = 1

    while tmp*a-tmp+1 < b:
        tmp += 1

print(tmp)

Submission status: Runtime Error

Solution code:
from sys import stdin

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

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



print(count)

Submission status: Runtime Error

Solution code:
a=list(map(input().split()))
b=list(map(input().split()))
if a[0]==b[0]:
  A=1
else:
  A=0
if a[1]==b[1]:
  B=1
else:
  B=0
if a[2]==b[2]:
  C=1
else:
  C=0
print(A+B+C)

Submission status: Runtime Error

Solution code:
a,b,c=map(input().split())
d,e,f=map(input().split())
if a==d:
  A=1
else:
  A=0
if b==e:
  B=1
else:
  B=0
if c==f:
  C=1
else:
  C=0
print(A+B+C)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b=map(int,input().split())
if b==1:
    print(0)
elif a>=b:
    print(1)
else:
    i=2
    while 1:
        if (a-1)*(i-1)+a>=b:
            break
        else:
            i+=1
    print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
S, T = map(str, input().split())
list_S = list(S)
list_T = list(T)
count = 0
for i in range(3):
    if list_S(i) == list_T(i):
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
S, T = map(str, input().split())
list_S = list(S)
list_T = list(T)
count = 0
for i in 3:
    if list_S(i) == list_T(i):
        count += 1
print(count)

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
cnt = 0
soc = 1
while soc < b:
    soc += a - 1
    cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
cnt = 0
soc = 1
while soc < b:
    soc += a - 1
    cnt += 1
print(cnt)

Submission status: Runtime Error

Solution code:
N = int(input())
print(N*(N-1)//2)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

def main():
    n = int(input())
    h = map(int, input().split())

    ans, bef, cnt = 0, 0, 0

    for i in h:
        if i <= bef:
            cnt += 1
        else:
            ans = max(ans, cnt)
            cnt = 0
        bef = i
    print(max(ans, cnt))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

count = 0

for i in range(3)

if s[i] == t[i]:
  count += 1

print(count)

Submission status: Runtime Error

Solution code:
fore, real = input().split()

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

print(ct)

Submission status: Runtime Error

Solution code:
 S = input().split()
 T = input().split()
cnt = 0

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

print(cnt)

Submission status: Runtime Error

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

counter = 0

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

print(counter)

Submission status: Runtime Error

Solution code:
a=int(input())
b=[i for i in range(a)]
c=int(sum(b))
print(c)

Submission status: Runtime Error

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

Sum = 0

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

Submission status: Runtime Error

Solution code:
A,B = map(int,input().split())
    
ans = 0
if B / A == 1:
    ans = 1
else:
    ans = 1 + -(-(B - A) // (A - 1))
print(ans)

Submission status: Runtime Error

Solution code:
    A,B = map(int,input().split())
     
    ans = 0
    if B / A == 1:
        ans = 1
    else:
        ans = 1 + -(-(B - A) // (A - 1))
    print(ans)

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())

count_p = 0
count = 0

if b = 1:
    print(count)

while True:
    if count == 0:
        count_p += a
    
    else:
        count_p += a-1
    
    count += 1
    
    if count_p >= b:
        break

print(count)

Submission status: Runtime Error

Solution code:
s = [input() for i in range(2)]
#出力['s_1', 's_2']

x=s[0].split(',')
y=s[1].split(',')

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

Submission status: Runtime Error

Solution code:
s = [input() for i in range(2)]
#出力['s_1', 's_2']

x=s[0].split(',')
y=s[1].split(',')

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input_list = list(map(int, input().split()))
a = input_list[0]
b = input_list[1]
taps = 0
count = 0
taps += a
count += 1

while taps < b:
    taps += a-1
    count += 1
print(count)

Submission status: Runtime Error

Solution code:
s = input()
t = input()
x = 0
for i in 3:
  x += s[i-1]!=t[i-1]
print(x)

Submission status: Runtime Error

Solution code:
s=list(input().split())
t=list(input().split())
if s[0]==t[0]:
  ans1=1
else:
  asn1=0
if s[1]==t[1]:
  ans2=1
else:
  asn2=0
if s[2]==t[2]:
  ans3=1
else:
  asn3=0
print(asn1+asn2+asn3)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
print(int(N * (N-1) / 2))

Submission status: Runtime Error

Solution code:
N = int(input())
print(N * (N-1) // 2)

Submission status: Runtime Error

Solution code:
def calculate(n):
    return n * (n-1) // 2

N = int(input())
print(calculate(N))

Submission status: Runtime Error

Solution code:
def calculate(n):
    return n * (n-1) // 2

N = int(input())
print(int(calculate(N)))

Submission status: Runtime Error

Solution code:
def calculate(n):
    return ((n-1) * n) / 2

N = int(input())
print(int(calculate(N)))

Submission status: Runtime Error

Solution code:
a = input()
b = input()
for i in range(0,3):
  if a[i] == 'S':
    a[i] = '1'
  elif a[i] == 'C':
    a[i] = '2'
  else:
    a[i] = '3'
for j in range(0,3):
  if b[j] == 'S':
    b[j] = '1'
  elif b[j] == 'C':
    b[j] = '2'
  else:
    b[j] = '3'
out = 0
for k in range(0,3):
  if int(a[k])-int(b[k]) == 0:
    out = out + 1
print(out)

Submission status: Runtime Error

Solution code:
a = input()
b = input()
for i in range(0,3):
  if a[i] == 'S':
    a[i] = '1'
  elif a[i] == 'C':
    a[i] = '2'
  else:
    a[i] = '3'
for j in range(0,3):
  if b[j] == 'S':
    b[j] = '1'
  elif b[j] == 'C':
    b[j] = '2'
  else:
    b[j] = '3'
out = 0
for k in range(0,3):
  if int(a[k]-b[k]) == 0:
    out = out + 1
print(out)

Submission status: Runtime Error

Solution code:
n=int(input())
print(long(n*(n-1)/2)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
a=(n-1)*n/2
print(int(a))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N=int(input())
H=list(map(int, input().split()))

can_move = 0
move = 0

for i in range(N):
    if i == N-1:
        break
    elif H[i] >= H[i+1]:
        move += 1
        if can_move <= move:
            can_move = move
    else:
        move = 0

print(can_move)

Submission status: Runtime Error

Solution code:
A = sys.stdin.readline()
B = sys.stdin.readline()
ans = 0

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

Submission status: Runtime Error

Solution code:
A , B = map(int , input().split())

plug = 1
tap = 0

for i in range():
    if plug >= B:
        break
    else:
        prug += A - 1
        tap += 1

print(tap)

Submission status: Runtime Error

Solution code:
A , B = map(int , input().split())

plug = 1
tap = 0

for i in range(20):
    if plug >= B:
        break
    else:
        prug += A - 1 and tap += 1

print(tap)

Submission status: Runtime Error

Solution code:
n=int(input())  
h=list(map(int, input().split()))
count = 0
max_count = 0
for i in range(n-1):
    if h[i+1] <= h[i]:
        count = count + 1
    else:
        max_count = max(max_count,count)
        count = 0
print(max(max_count,count))

Submission status: Runtime Error

Solution code:
n=int(input())  
h=list(map(int, input().split()))
count = 0
max_count = 0
for i in range(n-1):
    if h[i+1] < h[i]:
        count = count + 1
    else:
        max_count = max(max_count,count)
        count = 0
print(max(max_count,count))

Submission status: Runtime Error

Solution code:
n=int(input())  
h=list(map(int, input().split()))
count = 0
max_count = 0
for i in range(n-1):
    if h[i+1] <= h[i]:
        count = count + 1
    elif max_count < count:
        max_count = count
        count = 0
    else:
        count = 0
      
print(max(max_count,count))

Submission status: Runtime Error

Solution code:
n=int(input())  
h=list(map(int, input().split()))
count = 0
max_count = 0
for i in range(n-1):
    if h[i+1] <= h[i]:
        count = count + 1
    else:
        max_count = max(max_count,count)
        count = 0
print(max(max_count,count))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s=list(map(input().split()))
t=list(map(input().split()))
x=0
for i in range(0,2):
  if s[i]==t[i]:
    x+=1
print(x)

Submission status: Runtime Error

Solution code:
s=list(map(input().split()))
t=list(map(input().split()))
x=0
for i in range(0,2):
  if s[i]=t[i]:
    x+=1
print(x)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b = map(int, input().split())
an = 1
ans = 0
while an < b:
    if ans == 0:
        an = a
    else:
        an = an - 1 + a  
    ans += 1

print(ans)