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()
  dp = [[0 for i in range(len(S1) + 1)] for j in range(len(S2) + 1)]
  for i in range(len(S1) + 1):
      dp[0][i] = i
  for j in range(len(S2) + 1):
      dp[j][0] = j
  for i in range(1, len(S1) + 1):
      for j in range(1, len(S2) + 1):
          if S1[i - 1] == S2[j - 1]:
              dp[j][i] = dp[j - 1][i - 1]
          else:
              dp[j][i] = min(dp[j - 1][i], dp[j][i - 1], dp[j - 1][i - 1]) + 1
  print(dp[len(S2)][len(S1)])
  
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"}]