Edit distance

#include <iostream>
#include <string>

using namespace std;

string a, b;
int n, m;

int dp[5005][5005];

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cin >> a >> b;
	a = " " + a;
	b = " " + b;
	n = a.length();
	m = b.length();
	for (int i = 0; i < n; ++i) {
		dp[i][0] = i;
	}
	for (int j = 0; j < m; ++j) {
		dp[0][j] = j;
	}
	for (int i = 1; i < n; ++i) {
		for (int j = 1; j < m; ++j) {
			int ccost = 1;
			if (a[i] == b[j]) ccost = 0;

			dp[i][j] = min(dp[i][j-1]+1, min(dp[i-1][j]+1, dp[i-1][j-1]+ccost));
		}
	}
	cout << dp[n-1][m-1] << "\n";
	return 0;
}

Test 1

Verdict: UNKNOWN

Test 2

Verdict: UNKNOWN

Test 3

Verdict: UNKNOWN

Test 4

Verdict: UNKNOWN

Test 5

Verdict: UNKNOWN

Test 6

Verdict: UNKNOWN

Test 7

Verdict: UNKNOWN

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN

Test 13

Verdict: UNKNOWN

Test 14

Verdict: UNKNOWN

Test 15

Verdict: UNKNOWN

Test 16

Verdict: UNKNOWN

Test 17

Verdict: UNKNOWN

Test 18

Verdict: UNKNOWN

Test 19

Verdict: UNKNOWN