TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
from collections import defaultdict
def generate_primes(n):
    is_prime = [True] * (n + 1)
    is_prime[0] = False
    is_prime[1] = False
    for i in range(2, int(n**0.5) + 1):
        if not is_prime[i]:
            continue
        for j in range(i * 2, n + 1, i):
            is_prime[j] = False
    return [i for i in range(n + 1) if is_prime[i]]

def main():  
    n = int(input())
    A = list(map(int, input().split()))
    d = defaultdict(int)
    primes = generate_primes(max(A))
    for a in A:
        for p in primes:
            if a < p: break
            if a % p == 0:
                d[p] += 1
    d[1] = 0
    m = max(d.values())
    if m == n:
        print('not coprime')
    elif m >= 2:
        print('setwise coprime')
    else:
        print('pairwise coprime')
    

if __name__ == '__main__':
    main()



def main():
    d, t, s = map(int, input().split())  
    print('Yes' if s * t >= d else 'No')

if __name__ == '__main__':
    main()



Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d, t, s = map(int, input().split())
if d - t*s <= 0:
  print("YES")
else:
  print("NO")

d, t, s = map(int, input().split())
if d - t*s <= 0:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S = map(int,input().split())
print("Yes" if T*S <= D else "NO")

D,T,S = map(int,input().split())
print("Yes" if T*S >= D else "No")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
def main():
    N=input()
    A=list(map(int, input().split()))

    mod_value = 10**9 + 7
    sum_ = 0
    b_sum = 0
    for i in range(len(A)-1):
        b_sum = b_sum + A[len(A)-i-1]
        sum_ = sum_ + (A[len(A)- i - 2]*b_sum) % mod_value
    print(sum_%mod_value)
main()

def main():
    N=input()
    A=list(map(int, input().split()))

    mod_value = 10**9 + 7
    sum_ = 0
    for i in range(len(A)-1):
        sum_ = sum_ + A[i]*sum(A[i+1:]) % mod_value
    print(sum_ % mod_value)
main()

def main():
    D, T, S = map(int, input().split())
    if float(T) < float(D) /float(S) :
        print("No")
    else:
        print("Yes")
    #N = int(input())
    #A = [int(s) for s in input().split()]
    #

main()

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
S =input()
T =input()
min_count　=　10000

for i in range(len(S)-len(T)+1):
    count = 0
    for j in range(len(T)):
        if T[i+j] != S[j]:
            count += 1
        min_count =min(count,min_count)
        if min_count = 0:
            print(min_count)
            break

print(min_count)

D ,T, S   = map(int,input().split()) 
if (D )/ S <= T :
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
input_data = input()

D = float(input_data.split(" ")[0])
T = float(input_data.split(" ")[1])
S = float(input_data.split(" ")[2])

time = D/S

if(time <= T):
    print("YES")
else:
    print("NO")

input_data = input()

D = float(input_data.split(" ")[0])
T = float(input_data.split(" ")[1])
S = float(input_data.split(" ")[2])

time = D/S

if(time <= T):
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s=map(int,input().split())
jikan=d/s
if jikan<=t:
    print("YES")
else:
    print("NO")

d,t,s=map(int,input().split())
jikan=d/s
if jikan<=t:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D, T, S = list(map(int, input().split()))

if D - S*T >= 0:
    print("Yes")
else:
    print("No")

D, T, S = list(map(int, input().split()))

if D - S*T <= 0:
    print("Yes")
else:
    print("No")
    

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S = map(float,input().split())
R=T*S

if R<D:
    print('No')
else:
    print('yes')

D,T,S = map(float,input().split())
R=D/S

if R>T:
    print('No')
else:
    print('yes')

D,T,S = map(int,input().split())
R=D/S

if R>T:
    print('No')
else:
    print('yes')



D,T,S = map(int,input().split())
R=D/S

if R>T:
    print('No')
else:
    print('yes')

D,T,S = map(float,input().split())
R = D/S

if R>T:
    print('No')
else:
    print('Yes')

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s=int(input())
if S*t >= d:
  print("Yes")
else:
  print("No")


S=input()
T=input()
tlen = len(T)


for i in range(tlen, 1):
    for k in range(0, tlen+1-i):
        Tinclude = T[k:i]
        print(tlen-i)
        break

d,t,s=map(int,input().split())
if s*t >= d:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s = list( map( int , input().split() ))
if d <= t*s:
  return "Yes"
else:
  return "No"

d,t,s = list( map( int , input().split() ))
if d <= t*s:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s = map(int,input().split())
if d / s >= t:
  print("Yes")
else:
  print("No")

d,t,s = map(int,input().split())
if d / s > t:
  print("No")
else:
  print("Yes")


Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D, T, S = map(int, input().split())

print("YES" if S * T >= D else "NO")





D, T, S = map(int, input().split())

print("Yes" if S * T >= D else "No")





Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d, t, s = map(int, input().split())
if s * d => t
    print(Yes)
else:
    print(No) 


d, t, s = map(int, input().split())
if s * t => d
    print(Yes)
else:
    print(No) 


d, t, s = map(int, input().split( ))
if d/s <= t:
    print(Yes)
else:
    print(No) 


d, t, s = map(int, input().split())
if d/s <= t:
    print(Yes)
else:
    print(No) 


d, t, s = map(int, input().split( ))
if d/s <= t:
    print('Yes')
else:
    print('No') 


Verdicts: Runtime Error

Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s=input().split()
if d/s<t :
    print("Yes")
else:
    print("No")

d,t,s=map(int,input().split())
if d/s<=t :
    print("Yes")
else:
    print("No")

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S = map(int , input().split().split())

if D > S * T:
  print("no")
  
else:
  print("yes")

a,b,c = (int(x) for x in input().split())

if a > b * c:
  print("No")
  
else:
  print("Yes")

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
import sys
import math
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())
def NIJIGEN(H): return [list(input()) for i in range(H)]
D,T,S=MAP()
if T*S<=D:
  print("Yes")
else:
  print("No")

import sys
import math
sys.setrecursionlimit(10 ** 7)
def input() : return sys.stdin.readline().strip()
def INT()   : return int(input())
def MAP()   : return map(int,input().split())
def LIST()  : return list(MAP())
def NIJIGEN(H): return [list(input()) for i in range(H)]
D,T,S=MAP()
if T*S>=D:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
2000 20 100

d, t, s = [list(map(int, s.split())) for s in open(0)][0]
if t >= d/s:
    print('Yes')
else:
    print('No')

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S=int(input())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
  if (D/S)>T:
    print("He will be late")
  else:
    print("Yes")

D,T,S=map(int,input().split())
if 1<=D<=10000 and 1<=T<=10000 and 1<=S<=10000:
  if (D/S)>T:
    print("No")
  else:
    print("Yes")

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s = int(input().split())
if d/s <= t: 
    print("Yes")
else:
    print("No") 

d,t,s = input().split()
if d/s <= t: 
    print("Yes")
else:
    print("No") 

d,t,s = input().split()
if int(d)/int(s) <= int(t): 
    print("Yes")
else:
    print("No") 

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s = map(int,input().split())

print("Yes" if s*t >= d else "No)

d,t,s = map(int,input().split())
if s*t >= d:
    print("Yes")
else:
    print("No")


Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S=[int(input()) for i in range(3)]
if D/S<=T:
    print('Yes')
else:
    print('No')


D,T,S= map(int, input().split())
if D/S<=T:
    print('Yes')
else:
    print('No')


Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d,t,s=map(int,input().split())

if d-s*t <= 0:
	print("YES")

else:
	print("NO")

d,t,s=map(int,input().split())

if d-s*t <= 0:
	print("Yes")

else:
	print("No")

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
inp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')
if inp[0]/inp[2]<inp[1]:
  print('Yes')
else:
  print('No')

inp = np.fromstring(sys.stdin.read(), dtype=np.int64, sep=' ')
if inp[0]/inp[2]<inp[1]:
	print('Yes')
else:
	print('No')

inp = list(map(int, input().split()))
if inp[0]/inp[2]<=inp[1]:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
d, t, s = map(int, input().split())
print(d, t, s)
if s * t >= d:
    print('Yes')
else:
    print('No')

d, t, s = map(int, input().split())
if s * t >= d:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
import sys

try:
    d = int(input('D: '))
    t = int(input('T: '))
    s = int(input('S: '))
except ValueError:
    print('エラー：整数以外を入力しないでください')
    sys.exit(1)

if 1 <= d <= 10000 and 1 <= t <= 10000 and 1 <= s <= 10000:
    take_time = d / s
    if take_time <= t:
        print("Yes")
    else:
        print("No")
else:
    print('エラー：各入力は1～10000までの整数です')

import sys

try:
    #d = int(input('D: '))
    #t = int(input('T: '))
    #s = int(input('S: '))
    nums = [int(e) for e in input().split()]
except ValueError:
    print('エラー：整数以外を入力しないでください')
    sys.exit(1)

if 1 <= nums[0] <= 10000 and 1 <= nums[1] <= 10000 and 1 <= nums[2] <= 10000:
    take_time = nums[0] / nums[2]
    if take_time <= nums[1]:
        print("Yes")
    else:
        print("No")
else:
    print('エラー：各入力は1～10000までの整数です')

Verdicts: Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
a,b,c = map(int, input().split())
print("Yes" if b*c<=a else "No")

a,b,c = map(int, input().split())
if b*c >=a:
    print('Yes')
else:
    print('No')



Verdicts: Wrong Answer

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S=int(input().split())
if D/S<=T:
  print('Yes')
else:
  Print('No')

D,T,S=int(input().split())
if D/S<=T:
  print('Yes')
else:
  print('No')

D,T,S=int(input().split())
if D/S=<T:
  print('Yes')
else:
  print('No')

D,T,S=map(int,input().split())
if D/S<=T:
  print('Yes')
else:
  print('No')

Verdicts: Runtime Error

Runtime Error

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
D,T,S=input().split()
if(float(D)==(float(S)*float(T))):
  print("Yes")
else:
  print("No")

D,T,S=input()
if(D==(S*T)):
  print("Yes")
else:
  print("No")

D,T,S=input().split()
if(float(T)>=(float(D)/float(S))):
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Runtime Error

Accepted
Problem: Takahashi is meeting up with Aoki.  They have planned to meet at a place that is D meters away from Takahashi's house in T minutes from now.  Takahashi will leave his house now and go straight to the place at a speed of S meters per minute.  Will he arrive in time?

Submission attempts (in order):
s=input()
t=input()

if len(s)==len(t):
  num=0
  for i,j in zip(s,t):
    if i!=j:
      num+=1
else:
  for i in range(len(s)-len(t)+1):
    a=s[i:len(t)+i]
    num=0
    for i,j in zip(t,a):
      if i!=j:
        num+=1
    num=min(1000,num)

print(num)
    
    

d,t,s=map(int,input().split())

num=t*s

if num>=d:
  print("Yes")
else:
  print("No")

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = str(input())
T = str(input())

suma=0
sumb=0
sumc=0

for i in range(len(T)):
    A = T[i:]
    B = T[:i+1]
    if A in S:
        pass
    else:
        suma+=1

    if B in S:
        pass
    else:
        sumb+=1

    if A in S:
        if B in S:
            pass
    else:
        sumc+=1


suma = min(suma, sumb)
suma = min(suma, sumc)
print(suma)
~             

#!/usr/bin/env python3
import sys


def solve(S: str, T: str):
    length = len(T)
    s_list =[]
    for i in range(len(S)-length+1):

        s = S[i:i+length]
        s_list.append(s)

    ans = length

    for s in s_list:
        counter = 0
        for i in range(ans):
            print(T)
            if s[i] != T[i]:
                counter+=1

    ans = min(ans, counter)


    return print(ans)


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)

if __name__ == '__main__':
    main()


#!/usr/bin/env python3
import sys


def solve(S: str, T: str):
    length = len(T)
    s_list =[]
    counter = length
    ans = 0

    for i in range(len(S)-length+1):
        s = S[i:i+length]
        for i in range(length):
            #print(s[i], T[i])
            if s[i] != T[i]:
                ans+=1

        counter = min(ans, counter)

        ans = 0

    return print(counter)


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    solve(S, T)

if __name__ == '__main__':
    main()


Verdicts: Runtime Error

Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S=input()
T=input()
lenS=len(S)
lenT=len(T)
count=[]

for i in range(lenS-lenT+1):
    c=0
    for j in range(lenT):
        if T[j]!=S[i+j]:
            c=c+1
        j=j+1
        print(c)
    count.append(c)
    i=i+1
print(min(count))

S=input()
T=input()
lenS=len(S)
lenT=len(T)
count=[]

for i in range(lenS-lenT+1):
    c=0
    for j in range(lenT):
        if T[j]!=S[i+j]:
            c=c+1
        j=j+1
    count.append(c)
    i=i+1
print(min(count))

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()

s_len = len(s)
t_len = len(t)

ans = s_len
for i in range(s_len - t_len + 1):
    c = 0
    for j in range(t_len):
        if s[i+j] == t[j]:
            c += 1
    ans = max(ans, c)
print(t_len - ans)

S = input()
T = input()
ans = 0
for i in range(len(S) - len(T) + 1):
  count = 0
  for j in range(len(T)):
    if S[i+j] == T[j]:
      count += 1
  ans = max(ans, count)
print(len(T) - ans)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()
ans = len(t)


for start in range(len(s)-len(t)+1):
    l = 0
    for j in range(len(t)):
        if s[j+start] != t[j]:
            l += 1
        print(start,j)
    ans = min(ans,l)
print(ans)

s = input()
t = input()
ans = len(t)


for start in range(len(s)-len(t)+1):
    l = 0
    for j in range(len(t)):
        if s[j+start] != t[j]:
            l += 1
    ans = min(ans,l)
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input() # all
t = input() # substring

def calc_length(str1, str2):
    print(str1)
    print(str2)
    length = 0
    for i in range(len(str1)):
        if str1[i] != str2[i]:
            length += 1
    return length

min_length = len(t)
for i in range(len(s)- len(t) + 1):
    l = calc_length(s[i:i+len(t)], t)
    if l < min_length:
        min_length = l

print(min_length)

s = input() # all
t = input() # substring

def calc_length(str1, str2):
    length = 0
    for i in range(len(str1)):
        if str1[i] != str2[i]:
            length += 1
    return length

min_length = len(t)
for i in range(len(s)- len(t) + 1):
    l = calc_length(s[i:i+len(t)], t)
    if l < min_length:
        min_length = l

print(min_length)


Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = input()
T = input()
ans = len(T)
for i in range(len(S)):
    if len(S)-i >= len(T):
        for s,t in zip(S[i:i+len(T)],T):
            tmp = len(T)
            if t == s:
                tmp -= 1
        ans = min(ans,tmp)
else:
    print(ans)

S = input()
T = input()
ans = len(T)
for i in range(len(S)):
    for s,t in zip(S[i:i+len(T)],T):
        tmp = len(T)
        if t == s:
            tmp -= 1
    ans = min(ans,tmp)
else:
    print(ans)

S = input()
T = input()
ans = len(T)
for i in range(len(S)):
    tmp = len(T)
    if len(S)-i >= len(T):
        for s,t in zip(S[i:i+len(T)],T):
            if t == s:
                tmp -= 1
        ans = min(ans,tmp)
else:
    print(ans)

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S=list(map(str,input()))
T=list(map(str,input()))
X=[]
Z=0
for I in range(len(S)-len(T)):
    Y=S[I:I+len(T)]
    Z=0
    for J in range(len(T)):
        if Y[J]==T[J]:
            Z=Z+1
    X.append(Z)
if X ==True:
    print(len(T)-max(X))
elif S==T:
    print(0)
else:
    print(len(T))

S=list(map(str,input()))
T=list(map(str,input()))
X=[]
Z=0
for I in range(len(S)-len(T)+1):
    Y=S[I:I+len(T)]
    Z=0
    for J in range(len(T)):
        if Y[J]==T[J]:
            Z=Z+1
    X.append(Z)
if not X==[]:
    print(len(T)-max(X))
elif S==T:
    print(0)
else:
    print(len(T))

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
Sr = input()
Tg = input()

ans = 10000
for i in range(len(Sr)-len(Tg)+1):
  mat = 0
  trimmedSr = Sr[i:i + len(Tg)]
  for j in range(len(Tg)):
    if trimmedSr != Tg[j]:
      mat++;
  ans = min(mat, ans)
print(ans)

from sys import stdin

S = input()
T = input()

ans  =10000

for i in range(len(S) - len(T) + 1):
    
    mat = 0
    
    U = S[i:i + len(T)]
    for j in range(len(T)):
        
        if U[j] != T[j]:
            mat += 1
    
    ans = min(ans, mat)

print(ans)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = str(input().split())
T = str(input().split())
import numpy as numpy
len_S = len(S)
len_T = len(T)
count = numpy.zeros(len_S-len_T+1)
for i in range(len_S-len_T+1):
  for j in range(len_T):
    if not S[i+j] == T[j]:
      count[i] +=1
print(int(min(count)))

S = str(input())
T = str(input())
import numpy as numpy
len_S = len(S)
len_T = len(T)
count = numpy.zeros(len_S-len_T+1)
for i in range(len_S-len_T+1):
  for j in range(len_T):
    if not S[i+j] == T[j]:
      count[i] +=1
print(int(min(count)))

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
ans = []

for i in range(M-N+1):

    num = 0

    substring = input_list[0][i:i+N]

    for j in range(len(substring)):

        if substring[j] != input_list[1][j]:

            num += 1

    ans.append(num)

print(min(ans))


S = input()
T = input()

S_len = len(S)
T_len = len(T)

ans = T_len

for i in range(S_len - T_len + 1):

    diff = 0

    for j in range(T_len):

        if T[j] != S[i+j]:

            diff += 1

    ans = min(ans, diff)

print(ans)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = input()
T = input()

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

S = input()
T = input()

res = 0
for i in range(len(S)-len(T)+1):
    cnt = 0
    for j in range(len(T)):
        if S[j+i] == T[j]:
            cnt += 1
    res = max(res, cnt)
print(len(T) - res)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()

ans = len(t)
for i in range(len(s)-len(t)+1):
  tmp=0
  for j in range(len(t)):
    if t[j] == s[i+j]:
      tmp+=1
  ans = min(tmp,ans)
  
print(ans)

s = input()
t = input()

ans = len(t)
for i in range(len(s)-len(t)+1):
  tmp=0
  for j in range(len(t)):
    if t[j] != s[i+j]:
      tmp+=1
  ans = min(tmp,ans)
  
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()
result = len(t)
for i in range(len(s) - len(t) + 1):
  box = 0
  for j in range(len(t)):
    if t[j] == s[i + j]:
      box += 1
  if result > box :
    result = box
print(result)

s = input()
t = input()
result = len(t)
for i in range(len(s) - len(t) + 1):
  box = 0
  for j in range(len(t)):
    if t[j] != s[i + j]:
      box += 1
  if result > box :
    result = box
print(result)


Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = input()
T = input()
lis1 = list(T)
lis2 = list(S)
ans_list = []
ch = True
for i in range(len(T)):
  for j in range(len(S)):
    if lis1[i] == lis2[j]:
      ans = 1
      ch = True
      if len(S) - j < len(S) - i or j < i:
        continue
      else:
        while ch == True:
          p = i
          q = j
          if p+1 < len(T) and q+1 < len(S) and lis1[p + 1] == lis2[q + 1]:
            ans += 1
            p += 1
            q += 1
          else:
            ch = False
            ans_list.append(len(T)-ans)
if ans_list == []:
  print(len(T))
else:
  print(max(ans_list))

S = input()
T = input()
x,y = len(S),len(T)
A = [0] * (x-y+1)
for i in range(0, x-y+1):
  count = 0
  j = 0
  for k in range(i, i+y):
    if S[k] != T[j]:
      count += 1
    j += 1
  A[i] = count
print(min(A))

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S,T = input().split()
mm = 0
for i in range(len(S)-len(T)):
    a = S[i:i+len(T)]
    mm_now = sum([x == y for x,y in [*zip(a,T)]])
    mm = max(mm_now, mm)
print(len(T) - mm)


S = input()
T = input()
mm = 0
for i in range(len(S)-len(T)+1):
    a = S[i:i+len(T)]
    mm_now = sum([x == y for x,y in [*zip(a,T)]])
    mm = max(mm_now, mm)
print(len(T) - mm)


Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = [x for x in input()]
T = [x for x in input()]
cmin = 1000
t = 0
for i in range(len(S)):
    c = 0
    t = i

    for j in range(len(T)):
        if t == len(S):
            exit()
        if S[t] != T[j]:
            c += 1
        else:
            if c < cmin:
                cmin = c
        t += 1
        
print(cmin)

S = list(input())
T = list(input())
cmin = 1000

for i in range(len(S)-len(T)+1):
    c = 0
    s = S[i:i+len(T)]
    for j in range(len(T)):
        if s[j] != T[j]:
            c += 1
    cmin = min(c,cmin)

print(cmin)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()

c = 0
u = []
for i in range(len(s)-len(t)+1):
    for j in range(len(t)):
        if t[j]!=s[j+i]:
            c+=1
    u.append(c)
print(min(u))

s = input()
t = input()

c = 0
u = []
for i in range(len(s)-len(t)+1):
    c = 0
    for j in range(len(t)):
        if t[j]!=s[j+i]:
            c+=1
    u.append(c)
print(min(u))

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = str(input())
T = str(input())
tempcount = 0
mincount = 0

if S in T:
    print("0")
    exit

for i in range(len(S) - len(T)+1):
    for j in range(len(T)+1):
        if S[i + j] != T[j]:
            tempcount += 1
    if i == 0:
        mincount = tempcount
    elif tempcount < mincount:
        mincount = tempcount
    tempcount = 0
    
print(mincount)



S = str(input())
T = str(input())
tempcount = 0
mincount = 0

for i in range(len(S) - len(T)+1):
    for j in range(len(T)):
        if S[i + j] != T[j]:
            tempcount += 1
    if i == 0:
        mincount = tempcount
    elif tempcount < mincount:
        mincount = tempcount
    tempcount = 0
    
print(mincount)



Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s=input()
l=input()
len_s=len(s)
len_l=len(l)
a=len_s-len_l
ans=1001
for i in range(len_s-len_l+!):
    cnt=0
    for j in range(len_l):
        if l[j]!=s[i+j]:
            cnt+=1
    ans=min(ans,cnt)

print(ans)


s=input()
l=input()
len_s=len(s)
len_l=len(l)
a=len_s-len_l
ans=1001
for i in range(len_s-a):
    cnt=0
    for j in range(len_s):
        if l[j]==s[i+j]:
            cnt+=1
    ans=min(ans,len_l-cnt)

print(ans)

s=input()
l=input()
len_s=len(s)
len_l=len(l)
a=len_s-len_l
ans=1001
for i in range(len_s-len_l+1):
    cnt=0
    for j in range(len_l):
        if l[j]!=s[i+j]:
            cnt+=1
    ans=min(ans,cnt)

print(ans)



Verdicts: Runtime Error

Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
#!/usr/bin/python3
# -*- coding: utf-8 -*-
s = input()
t = input()
min_count = 1000
for i in range(len(s) - len(t) + ):
    count = 0
    for j in range(len(t)):
        if s[i+j] != t[j]:
            count += 1
    min_count = min(count, min_count)
    if min_count == 0:
        break
print(min_count)

#!/usr/bin/python3
# -*- coding: utf-8 -*-
s = input()
t = input()
min_count = 1000
for i in range(len(s) - len(t) + 1):
    count = 0
    for j in range(len(t)):
        if s[i+j] != t[j]:
            count += 1
    min_count = min(count, min_count)
    if min_count == 0:
        break
print(min_count)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S = input()
T = input()

lent = len(T)
ans = lent
for i in range(len(S)-lent+1):
    s = S[i:i+lent]
    lev = 0
    lev = sum(map(lambda x: x[0] != x[1], zip(s, T)))
    print(s)
    print(lev)
    if lev == 0:
        ans = 0
      #  break
    elif lev < ans:
        ans = lev
print(ans)


S = input()
T = input()

lent = len(T)
ans = lent
for i in range(len(S)-lent+1):
    s = S[i:i+lent]
    lev = 0
    lev = sum(map(lambda x: x[0] != x[1], zip(s, T)))
    if lev == 0:
        ans = 0
        break
    elif lev < ans:
        ans = lev
print(ans)


Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
#B - Substring 
S = str(input())
T = str(input())
i = 0
j = 0

Slen = len(S)
Tlen = len(T)
change_min = Tlen

for i in range(Slen - Tlen):
    diff = 0
    for j in range(Tlen):
        if S[i] != T[i + j]:
            diff += 1
    change_min = min(change_min,diff)


print(change_min)

#B - Substring 
S = str(input())
T = str(input())
i = 0
j = 0

k = len(S)
l = len(T)
change_min = l

for i in range(l):
    for m in range(l - i) :
        change = l
        for j in range(k - (l -i)+1):
            print(S[j+m:j +l-i],T[m:l-i],change,l-i-m)
            if S[j+m:j +l-i] == T[m:l-i]:
                print('Match !!')
                change -= l-i-m
        if change_min > change:
            change_min = change

print(change_min)


#B - Substring 
S = str(input())
T = str(input())
i = 0
j = 0

Slen = len(S)
Tlen = len(T)
change_min = Tlen

for i in range(Slen - Tlen):
    diff = 0
    for j in range(Tlen):
        if S[i] != T[j]:
            diff += 1
    change_min = min(change_min,diff)


print(change_min)

#B - Substring 
S = str(input())
T = str(input())
i = 0
j = 0

Slen = len(S)
Tlen = len(T)
change_min = Tlen

for i in range(Slen - Tlen + 1):
    diff = 0
    for j in range(Tlen):
        if T[j] != S[i + j]:
            diff += 1
    change_min = min(change_min,diff)


print(change_min)


Verdicts: Runtime Error

Runtime Error

Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()

ans = len(t)
for i in range(len(s)):
    if i + len(t) - 1 >= len(s):break
    dif = 0
    for j in range(len(t)):
        if s[i+j] != t[j]:
            dif += 1
        ans = min(ans, dif)

print(ans)

s = input()
t = input()

ans = len(s)
for i in range(len(s)):
    if i + len(t) - 1 >= len(s):break
    dif = 0
    for j in range(len(t)):
        if s[i+j] != t[j]:
            dif += 1
    ans = min(ans, dif)

print(ans)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
S=input()
T=input()
ans=len(T)
for i in range(len(S)-len(T)+1):
  _ans=0
  for j in range(len(T)):
    if S[i+j]!=T[i+j]:
      _ans+=1
  ans=min(ans,_ans)
print(ans)

S=input()
T=input()
ans=len(T)
for i in range(len(S)-len(T)+1):
  _ans=0
  for j in range(len(T)):
    if S[i+j]!=T[j]:
      _ans+=1
  ans=min(ans,_ans)
print(ans)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = str(input())
t = str(input())

slen = len(s)
tlen = len(t)

i = tlen
n = 0
a = 0
tuu = [0] * tlen
ans = [0] * tlen
max_count = 0
while i <= slen:
    ps = s[ n : i + tlen -1 ]
    count = 0
    for j in range(tlen):
        if ps[j] == t[j]:
            count += 1
            tuu[j] = "True"

#     print(count)
    if max_count < count:
        max_count = count

        a = n
        ans = tuu
        
#     print(a)    
    n += 1
    i += 1
# print(a)
# print(ans)

for h in range(tlen):
    if ans[h] == "True":
        pass
    else:
        t[h] = s[a + h]  

s = str(input())
t = str(input())

slen = len(s)
tlen = len(t)

i = tlen
n = 0
a = 0

# ans = [0] * tlen
max_count = 0
while i <= slen:
    ps = s[ n : i + tlen -1 ]
    count = 0
    for j in range(tlen):
        if ps[j] == t[j]:
            count += 1


#     print(count)
    if max_count < count:
        max_count = count
    n += 1
    i += 1
print(tlen - max_count)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()
max_len = 0

for i in range(len(t)):
    for j in range(i, len(t)+1):
        print(t[i:j])
        if t[i:j] in s[i:len(s)-j+1]:
            max_len = max(max_len, j-i)

print(len(t) - max_len)

s = input()
t = input()
max_count = 0

for i in range(len(s)-len(t)+1):
    count = 0
    s_ = s[i:i+len(t)+1]
    for j in range(len(t)):
        if s_[j] == t[j]:
            count += 1
    max_count = max(max_count, count)

print(len(t) - max_count)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s=list(input())
t=list(input())
n=len(t)
m=len(s)
for i in range(n):
    l=n-i
    for j in range(i+1):
        print(t[j:j+l],i,s[j:j+m-i])
        if ''.join(t[j:j+l]) in ''.join(s[j:j+m-i]):
            print(i)
            exit()
print(n)

s=list(input())
t=list(input())
n=len(t)
m=len(s)
mn=n
for i in range(m-n+1):
    err=0
    for j in range(n):
        if s[i+j]!=t[j]:
            err+=1
    mn=min(mn,err)
print(mn)

Verdicts: Runtime Error

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
s = input()
t = input()

t_len = len(t)
s_len = len(s)
max_ = 0
temp = 0

for i in range(s_len - t_len):
  for j in range(t_len):
    if s[i + j] == t[j]:
      temp += 1
  if max_ < temp:
    max_ = temp
  temp = 0
print(t_len - max_ + 1)

s = input()
t = input()

t_len = len(t)
s_len = len(s)
max_ = 0
temp = 0

for i in range(s_len - t_len + 1):
  for j in range(t_len):
    if s[i + j] == t[j]:
      temp += 1
  if max_ < temp:
    max_ = temp
  temp = 0

print(t_len - max_)

Verdicts: Wrong Answer

Accepted
Problem: Given are two strings S and T.  Let us change some of the characters in S so that T will be a substring of S.  At least how many characters do we need to change?  Here, a substring is a consecutive subsequence. For example, `xxx` is a substring of `yxxxy`, but not a substring of `xxyxx`.

Submission attempts (in order):
list_data = [input() for _ in range(2)]
print(list_data)

s = list_data[0]
t = list_data[1]

len_t = len(t)

max_correct = 0
for i in range(len(s)-len(t)):
  correct = 0
  for j in range(len(t)):
    if s[i+j] == t[j]:
      correct += 1
  
  if max_correct < correct:
    max_correct = correct

print(len_t - max_correct)

list_data = [input() for _ in range(2)]

s = list_data[0]
t = list_data[1]

len_t = len(t)

max_correct = 0
for i in range(len(s)-len(t)+1):
  correct = 0
  for j in range(len(t)):
    if s[i+j] == t[j]:
      correct += 1
  
  if max_correct < correct:
    max_correct = correct

print(len_t - max_correct)

Verdicts: Wrong Answer

Accepted