ModAdd

#include <iostream>
#include <string>

inline int min(int x, int y){
    return y ^ ((x ^ y) & -(x < y));
}


int main(int argc, const char * argv[]) {
    
    std::string word1, word2;
    std::cin >> word1;
    std::cin >> word2;
    
    //std::getline(std::cin, word1);
    //std::getline(std::cin, word2);
    
    int cols = word1.length();
    int rows = word2.length();
    
    int* data = (int*)malloc((rows + 1) * (cols + 1) * sizeof(int));
    
    data[0] = 0;
    for(int i = 1; i <= cols; i++)
        data[i] = i;
    
    for(int i = 1; i <= rows; i++)
        data[i * (cols + 1)] = i;
    
    
    for(int i = 1; i <= rows; i++){
        for(int j = 1; j <= cols; j++){
            int own = word1[j - 1] != word2[i - 1];
            int other = min(data[(i - 1) * (cols + 1) + j - 1], min(data[(i - 1) * (cols + 1) + j], data[i * (cols + 1) + j - 1]));
            
            data[i * (cols + 1) + j] = own + other;
        }
    }
    
    
    
    std::cout << data[rows * (cols + 1) + cols] << "\n";
    
    return 0;
}


/*
 std::ios::sync_with_stdio();
 
 char* word1 = (char*)malloc(5000 * sizeof(char));
 char* word2 = (char*)malloc(5000 * sizeof(char));
 
 
 std::cin.getline (word1, 5000);
 
 std::cout << word1 << "\n";
 
 free(word1);
 free(word2);
 
 
 return 0;
 */


/*
 for(int i = 0; i <= rows; i++){
 for(int j = 0; j <= cols; j++){
 std::cout << data[i * (cols + 1) + j] << "\t";
 }
 std::cout << "\n";
 }
 std::cout << "\n";
 */


/*
 for(int i = 0; i <= rows; i++){
 for(int j = 0; j <= cols; j++){
 std::cout << data[i * (cols + 1) + j] << "\t";
 }
 std::cout << "\n";
 }
 std::cout << "\n";
 */

Test 1

Verdict: WRONG ANSWER

Test 2

Verdict: WRONG ANSWER

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: WRONG ANSWER

Test 5

Verdict: WRONG ANSWER

Test 6

Verdict: WRONG ANSWER

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: RUNTIME ERROR

Test 9

Verdict: WRONG ANSWER

Test 10

Verdict: RUNTIME ERROR