Edit distance

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <stack>

using namespace std;

int main(int argc, char *argv[])
{
    int n = 0;
    int m = 0;
    string s1 = "";
    string s2 = "";

    getline(cin, s1);
    getline(cin, s2);

    n = s1.size();
    m = s2.size();

    int arr[5001][5001];

    for (int i = 0; i <= n; ++i) {
        arr[0][i] = i;
    }

    for (int i = 0; i <= m; ++i) {
        arr[i][0] = i;
    }

    for (int i = 1; i <= m; ++i) {
        for (int j = 1; j <= n; ++j) {
            if (s2[i - 1] == s1[j - 1]) {
                arr[i][j] = arr[i - 1][j - 1];
            } else {
                arr[i][j] = min(min(arr[i - 1][j], arr[i][j - 1]), arr[i - 1][j - 1]) + 1;
            }
        }
    }

    cout << arr[m][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