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: s1 = input()
  s2 = input()
  ls1 = len(s1)
  ls2 = len(s2)
  f = [[0 for j in range(ls2 + 1)] for i in range(ls1 + 1)]
  for i in range(ls1 + 1):
      f[i][0] = i
  for i in range(ls2 + 1):
      f[0][i] = i
  for i in range(1, ls1 + 1):
      for j in range(1, ls2 + 1):
          if s1[i - 1] != s2[j - 1]:
              f[i][j] = min(f[i - 1][j] + 1, f[i][j - 1] + 1, f[i - 1][j - 1] + 1)
          else:
              f[i][j] = f[i - 1][j - 1]
  print(f)
  
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"}]