output_description: Print the edit distance in a line.
input_description: s1
      s2
      
  
  Two words s1 and s2 are given in the first line and the second line
  respectively. The words will consist of lower case characters.
attempt: X = input()
  Y = input()
  m = len(X)
  n = len(Y)
  res = [[m + n for j in range(n + 1)] for i in range(m + 1)]
  for i in range(m + 1):
      res[i][0] = i
  for j in range(n + 1):
      res[0][j] = j
  for i in range(1, m + 1):
      for j in range(1, n + 1):
          a = 1
          if X[i - 1] == Y[j - 1]:
              a = 0
          res[i][j] = min(a + res[i - 1][j - 1], 1 + res[i - 1][j], 1 + res[i][j - 1])
  print(res[m][n])
  
problem_description: Edit Distance (Levenshtein Distance)
  
    
  
  Find the edit distance between given two words s1 and s2.
  
  The disntace is the minimum number of single-character edits required to
  change one word into the other. The edits including the following operations:
  
    * **insertion** : Insert a character at a particular position.
    * **deletion** : Delete a character at a particular position. 
    * **substitution** : Change the character at a particular position to a different character
samples: [{"input": "acac\n    acm", "output": "2"}, {"input": "icpc\n    icpc", "output": "0"}]