Edit distance

#include <algorithm>
#include <iostream>
#include <vector>
int main(){
	using namespace std;
	ios::sync_with_stdio(0);

	string word1 = "", word2 = "";

	getline(cin, word1);
	getline(cin, word2);

	int n = word1.length();
	int m = word2.length();
/*
	//make strings same size
	int n = word1.length(), m = word2.length();
	string* shorter = (n > m? &word2: &word1);
	int diff = abs(m-n);
	while(diff>0){
		shorter->append("_");
		diff--;
	}
*/	
	vector<vector<int> > dist(n + 1, vector<int>(m+ 1));

	for(int i = 0; i <= n; i++){
		for(int j = 0; j<=  m; j++){
			if(i==0){
				dist[i][j] = j;
			} 
			else if(j==0){
				dist[i][j] = i;
			}
			else if (word1[i-1] == word2[j-1]){
				dist[i][j] = dist[i-1][j-1];
			} else {
				dist[i][j] = 1 + min({
					dist[i-1][j],
					dist[i][j-1],
					dist[i-1][j-1]
				});
			}
		}
	}

	cout << dist[n][m] << "\n";
}

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