Problem:
 Score : 200 points    Problem Statement 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 .      Constraints  The lengths of S and T are each at least 1 and at most 1000 .  The length of T is at most that of S .  S and T consist of lowercase English letters.         Input Input is given from Standard Input in the following format:  S  T       Output Print the minimum number of characters in S that need to be changed.        Sample Input 1 cabacc
abc      Sample Output 1 1  For example, changing the fourth character a in S to c will match the second through fourth characters in S to T .  Since S itself does not have T as its substring, this number of changes - one - is the minimum needed.       Sample Input 2 codeforces
atcoder      Sample Output 2 6

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

ss = len(s)
tt = len(t)

ans = 1000

for i in range(ss-tt+1):
    tmp = 0
    for j in range(tt):
        if s[i+j] == t[j]:
            tmp = tmp
        else:
            tmp = tmp + 1
    if tmp < ans:
        ans = tmp

print(ans)

Solution (Python):
if __name__ == '__main__':
    s = input()
    t = input()
    min_diff = len(t)
    for i in range(len(s)-len(t)+1):
        diff = len(t)
        for j in range(len(t)):
            if s[i+j] == t[j]:
                diff -= 1
        min_diff = min(min_diff, diff)
    print(min_diff)

Solution (Python):
s = input().rstrip()
t = input().rstrip()

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

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

s = len(S)
t = len(T)

ans = 10**10
for i in range(s-t+1):
    mm = 0
    for j in range(t):
        if S[i+j]!=T[j]:
            mm += 1
    else:
        ans = min(ans,mm)
print(ans)

Solution (Python):
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
  if ans<count:
    ans=count
print(len(t)-ans)

Solution (Python):
def main(sample_file = ''):

    """ convenient functions
    
    
    
    
    
    """

    """convenient decorator
    
    
        
        
        
        
        
        
        
        
        
        
    """
    
    
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product, combinations_with_replacement 
    
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  
        b, e = 2, 0  
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict 
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest 
    from copy import deepcopy, copy 
    import operator
    from operator import itemgetter 
    
    
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd 
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    
    
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz') 
    modpow = lambda a, n, p = MOD: pow(a, n, p) 
    def modinv(a, p = MOD):
        
        
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        
        
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    class SegTree:
        """
        ref: https://qiita.com/takayg1/items/c811bd07c21923d7ec69
        init(init_val, ide_ele): 配列init_valで初期化 O(N)
        update(k, x): k番目の値をxに更新 O(logN)
        query(l, r): 区間[l, r)をsegfuncしたものを返す O(logN)
        """
        def __init__(self, init_val, segfunc, ide_ele):
            """
            init_val: 配列の初期値
            segfunc: 区間にしたい操作
            ide_ele: 単位元
            n: 要素数
            num: n以上の最小の2のべき乗
            tree: セグメント木(1-index)
            """
            n = len(init_val)
            self.segfunc = segfunc
            self.ide_ele = ide_ele
            self.num = 1 << (n - 1).bit_length()
            self.tree = [ide_ele] * 2 * self.num
            
            for i in range(n):
                self.tree[self.num + i] = init_val[i]
            
            for i in range(self.num - 1, 0, -1):
                self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

        def update(self, k, x):
            """
            k番目の値をxに更新
            k: index(0-index)
            x: update value
            """
            k += self.num
            self.tree[k] = x
            while k > 1:
                self.tree[k >> 1] = self.segfunc(self.tree[k], self.tree[k ^ 1])
                k >>= 1

        def query(self, l, r):
            """
            [l, r)のsegfuncしたものを得る
            l: index(0-index)
            r: index(0-index)
            """
            res = self.ide_ele
            l += self.num
            r += self.num
            while l < r:
                if l & 1:
                    res = self.segfunc(res, self.tree[l])
                    l += 1
                if r & 1:
                    res = self.segfunc(res, self.tree[r - 1])
                l >>= 1
                r >>= 1
            return res

    
    
    
    
    
    
    
    

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    
    def warshall_floyd(number_vertex, XYD, shift_one_for_vertex=False):
        
        
        
        
        
        d = [[float("inf")]*number_vertex for i in range(number_vertex)]
        for x, y, dist in XYD:
            if shift_one_for_vertex:
                x = x - 1
                y = y - 1
            d[x][y] = dist
            d[y][x] = dist
        for i in range(number_vertex):
            d[i][i] = 0 
        for k in range(number_vertex):
            for i in range(number_vertex):
                for j in range(number_vertex):
                    d[i][j] = min(d[i][j],d[i][k] + d[k][j])
        return d


    """ initialize variables and set inputs
    
        
        
            
            
    
        
        
        
        
        
        
        
    
        
        
        
        
    
        
        
    """

    
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    
    
    
    
    
    
    
    """

    
    if sample_file:
        sys.stdin = open(sample_file)
        
    
    
    

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

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    


    
    
    

    """memo: how to use defaultdict of list
    
    Dic = defaultdict(list)
    
    Dic[x].append(y)
    
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    
    >>> a = 5
    >>> bin_str_a = format(a, '
    >>> print(bin_str_a)
    0b0101 
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Solution (Python):
def hd(x,y):
  ans = 0
  for i in range(len(x)):
    if x[i]==y[i]:
      ans+=1
  return ans

s = input()
t = input()

if s.find(t)!=-1:
  print(0)
else:
  mx = 0
  for i in range(len(s)-len(t)+1):
    h = hd(s[i:i+len(t)],t)
    mx = max(mx,h)
  print(len(t)-mx)

Solution (Python):
import sys
import bisect as bi
import math
from collections import defaultdict as dd
import heapq
import itertools
input=sys.stdin.readline
from random import randint


mo=10**9+7
def cin():
    return map(int,sin().split())
def ain():            
    return list(map(int,sin().split()))
def sin():
    return input()
def inin():
    return int(input())

for _ in range(1):
    s=sin().strip()
    t=sin().strip()
    ls,lt=len(s),len(t)
    ans=ls
    for i in range(0,ls-lt+1):
        c=0
        for j in range(i,i+lt):
            if(s[j]!=t[j-i]):
                c+=1
        ans=min(ans,c)
    print(ans)

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

ans = len(t)

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

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

result = float('inf')
for i in range(len(S) - len(T) + 1):
    count = sum(x != y for x, y in zip(S[i:i+len(T)], T))
    if count < result:
        result = count
print(result)

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


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

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

    print(ans)



if __name__ == '__main__':
    main()

Solution (Python):
s=input()
t=input()
ls=len(s)
lt=len(t)
mc=lt
for i in range(ls-lt+1):
  c=0
  for j in range(lt):
    if s[i+j]!=t[j]:
      c+=1
  mc=min(mc,c)
print(mc)

Solution (Python):
s = list(input())
t = list(input())
b = 0
for i in range(len(s)-len(t)+1):
  a = 0
  for j in range(len(t)):
    if t[j] == s[i:i+len(t)][j]:
      a += 1
  if b < a:
    b = a
print(len(t)-b)

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

n = len(S)
m = len(T)

def solve(s, t):
    res = 0
    for i in range(len(s)):
        if s[i] == t[i]:
            continue
        res += 1
    return res

ans = m
for i in range(n - m + 1):
    ans = min(ans, solve(S[i:i+m], T))
print(ans)

Solution (Python):
S = input()
T = input()
ans = float('inf')

for i in range(len(S)-len(T)+1):
  tmp = 0
  for a,b in zip(S[i:i+len(T)],T):
    if a!=b:
      tmp+=1
  ans = min(ans,tmp)
  
print(ans)

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

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

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

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

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

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

print(ans)

Solution (Python):
s=list(input())
t=list(input())
n=len(t)
for i in range(len(s)-len(t)+1):
    p=0
    for j in range(len(t)):
        if t[j]==s[i+j]:
            p+=1
    n=min(n,len(t)-p)
print(n)

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

l = []
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
    l.append(tmp)

print(len(T) - max(l))

Solution (Python):
s=input()
t=input()
n=len(s)
m=len(t)
ans=m
for i in range(n-m+1):
  cnt=0
  for j in range(m):
    if s[i+j]!=t[j]:cnt+=1
  ans=min(ans,cnt)
print(ans)

Solution (Python):
S=list(input())
T=list(input())
ans_li=[]
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_li.append(ans)
print(min(ans_li))

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

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

    cnt=0
    for j in range(len(T)):
        if T[j]!=tes[j]:
            cnt+=1

    ans=min(ans,cnt)

print(ans)

Solution (Python):
def match(s, t):
    res = 0
    for i, j in zip(s, t):
        res += (i == j)
    
    return res

s = input()
t = input()

lens = len(s)
lent = len(t)

maxmc = 0
for i in range(0, lens - lent + 1):
    maxmc = max(maxmc, match(t, s[i: i + lent]))

print(lent - maxmc)

Solution (Python):
S=input()
T=input()
lens=len(S)
lent=len(T)

ans=0
for i in range(lens-lent+1):
    tmp=0
    for j in range(lent):
        if S[i+j]==T[j]:
            tmp+=1
        if tmp>ans:
            ans=tmp

print(lent-ans)

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

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

Solution (Python):
import os
import sys
from io import BytesIO, IOBase

BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")

def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
INF = 10 ** 18
MOD = 10**9+7

from math import gcd

Ri = lambda : [int(x) for x in sys.stdin.readline().split()]
ri = lambda : sys.stdin.readline().strip()

s = ri()
t = ri()

n,m= len(s),len(t)
ans=  10**18
for i in range(0, n-m+1):
    tcnt = 0
    for j in range(m):
        if s[i+j] != t[j]:
            tcnt+=1
    ans = min(ans, tcnt)
print(ans)

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

print(len(T) - ans)

Solution (Python):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:input()

"""========main code==============="""
t=1

for _ in range(t):
    a=ip()
    b=ip()
    n=len(a)
    m=len(b)
    mn=1e18
    for i in range(n-m+1):
        cnt=0
        for j in range(m):
            if(a[i+j]!=b[j]):
                cnt+=1
        mn=min(mn,cnt)
    print(mn)

Solution (Python):
import sys

def I(): 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 main():
    S = input()
    T = input()
    ans = 1001
    for i in range(len(S)-len(T)+1):
        temp = 0
        for j in range(len(T)):
            if S[i+j] != T[j]:
                temp += 1
        ans = min(ans, temp)
    print(ans)



if __name__ == '__main__':
    main()

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

n_t = len(t)

res = n_t

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

print(res)

Solution (Python):
S = str(input())
T = str(input())
n = len(S)
m = len(T)
ans = m
for i in range(n-m+1):
    x = m
    s = S[i:i+m]
    for j in range(m):
        if s[j] == T[j]:
            x -= 1
    ans = min(ans, x)

print(ans)

Solution (Python):
s=input()
t=input()
anses=[]
for i in range(0,len(s)-len(t)+1,1):
    cnt=0
    for j in range(len(t)):
        if s[i+j]==t[j]:
            cnt+=1
    anses.append(cnt)
print(len(t)-max(anses))

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
input = sys.stdin.readline
INF = float("inf")



def main():
    S = input()[:-1]
    T = input()[:-1]

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


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import numpy as np
import math  
from collections import deque
from collections import defaultdict
from copy import deepcopy
from itertools import accumulate 
def input(): return sys.stdin.readline().rstrip()
from functools import lru_cache 
INF = 10**9

def main():
    S1 = list(input())
    S2 = list(input())
    min_ans = INF
    for i in range(len(S1) - len(S2) + 1):
        temp_ans = 0
        for j in range(len(S2)):
            if S1[i+j] != S2[j]:
                temp_ans += 1
        
        if min_ans > temp_ans:
            min_ans = temp_ans
    print(min_ans)

    
    return 0

if __name__ == "__main__":
    main()

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

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

Solution (Python):
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
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()
mi = 10 ** 9
for i in range(len(S) - len(T)+1):
    a = S[i:i+len(T)]
    
    tmp = 0
    for j in range(len(T)):
        if T[j] != a[j]:
            tmp += 1
    mi = min(mi, tmp)
print(mi)

Solution (Python):
s = input()
t = input()
ls = len(s)
lt = len(t)

ans = 10000
for i in range(ls - lt + 1):
    d = 0
    for j in range(lt):
        if s[i + j] != t[j]:
            d += 1
    ans = min(ans, d)

print(ans)

Solution (Python):

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    T=input()
    N=len(S)
    M=len(T)
    ans=10000
    
    for i in range(N-M+1):
        temp=0
        for j in range(M):
            if S[i+j]!=T[j]:
                temp+=1
                
        ans=min(ans,temp)
        
    print(ans)

main()

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

lt = len(t)

minc = 1000
for i in range(len(s)):
  ress = s[i:i + lt]
  if len(ress) != lt:
    break
  
  minc = min(minc, sum([1*(x != y) for x,y in zip(ress, t)]))
print(minc)

Solution (Python):
S = input()
T = input()
ans = float('inf')

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

print(ans)