Edit distance

#include <bits/stdc++.h>

using namespace std;

int dp[5003][5003];

int main()
{
    string a,b;
    cin >> a;
    cin >> b;

int m=a.length();
int n=b.length();
    for(int i=1;i<=m;++i){
        dp[i][0]=i;
    }

    for(int j=1;j<=n;++j){
        dp[0][j]=j;
    }


    for(int j=1;j<=n;++j)
    {
        for(int i=1;i<=m;++i){
            int helper;
            if(a[i-1]==b[j-1])helper=0;
            else helper=1;
            dp[i][j]=min( dp[i-1][j-1]+helper, min(dp[i-1][j]+1 ,dp[i][j-1]+1 ) );
        }
    }
    printf("%d",dp[m][n]);
    return 0;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: ACCEPTED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED

Test 5

Verdict: ACCEPTED

Test 6

Verdict: ACCEPTED

Test 7

Verdict: ACCEPTED

Test 8

Verdict: ACCEPTED

Test 9

Verdict: ACCEPTED

Test 10

Verdict: ACCEPTED

Test 11

Verdict: ACCEPTED

Test 12

Verdict: ACCEPTED

Test 13

Verdict: ACCEPTED

Test 14

Verdict: ACCEPTED

Test 15

Verdict: ACCEPTED

Test 16

Verdict: ACCEPTED

Test 17

Verdict: ACCEPTED

Test 18

Verdict: ACCEPTED

Test 19

Verdict: ACCEPTED