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 in Java (OpenJDK 11.0.6) (judge verdict: Accepted)

//package hiougyf;

import java.util.*;;

public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		   //Reader sc=new Reader();
        Scanner sc =new Scanner(System.in);
     String s=sc.next();
      String t=sc.next();
      int n=s.length();
      int m=t.length();
      int min=Integer.MAX_VALUE;
     // if(n<m) System.out.println();
      for(int i=0;i<=(n-m);i++) {
    	  String c=s.substring(i,(i+m));
    	//  System.out.println(c);
    	  int h=find(c,t,m);
    	   min=Math.min(min, h);
      }
      System.out.println(min);
	}
      static int find(String s,String t,int n) {
    	  int ans=0;
    	  for(int i=0;i<n;i++) {
    		  if(s.charAt(i)!=t.charAt(i)) ans++;
    	  }
    	  return ans;
      }
    
         
  public static int gcd(int a, int b) 
    { 
        if (a == 0) 
            return b; 
          
        return gcd(b%a, a); 
    } 
   public static int lcm(int a, int b)  
  {  
     return (a*b)/gcd(a, b);  
	}

}