1120번 문자열

 간단한 브루트 포스 문제.

 

 

#include <iostream>
 
using namespace std;
 
typedef long long ll;
string A,B;
int ans=987654321;
 
int main(){
    cin >> A >> B;
    
    ll Asize = A.size();
    ll Bsize = B.size();
    
    ll diff = Bsize-Asize;
    
    for(int i=0;i<=diff;i++){
        int cnt=0;
        for(int j=i;j<Asize+i;j++){
            if(A[j-i]!=B[j]){
                cnt++;
            }
        }
        ans=min(ans,cnt);
    }
    
    cout << ans << endl;
}