



"""simple docstring"""





class  lowercase__  :







       '''simple docstring'''


       def __init__(				self     :    str       )					->		Optional[Any]:


             '''simple docstring'''




             UpperCAmelCase_     					=				""
             UpperCAmelCase_     					=				""
             UpperCAmelCase_     					=				[]



       def 	lowercase__							(				self     :    List[Any]						,							_UpperCAmelCase     :    int						,							_UpperCAmelCase     :    int       )					->		int:


             '''simple docstring'''




             if m == -1:
                   return n + 1
             elif n == -1:
                   return m + 1
             elif self.dp[m][n] > -1:
                   return self.dp[m][n]
             else:
                   if self.worda[m] == self.worda[n]:
                         UpperCAmelCase_     					=				self.__min_dist_top_down_dp(m - 1						,							n - 1       )
                   else:
                         UpperCAmelCase_     					=				self.__min_dist_top_down_dp(_UpperCAmelCase						,							n - 1       )
                         UpperCAmelCase_     					=				self.__min_dist_top_down_dp(m - 1						,							_UpperCAmelCase       )
                         UpperCAmelCase_     					=				self.__min_dist_top_down_dp(m - 1						,							n - 1       )
                         UpperCAmelCase_     					=				1 + min(_UpperCAmelCase						,							_UpperCAmelCase						,							_UpperCAmelCase       )

                   return self.dp[m][n]



       def 	lowercase__							(				self     :    str						,							_UpperCAmelCase     :    str						,							_UpperCAmelCase     :    str       )					->		int:


             '''simple docstring'''




             UpperCAmelCase_     					=				worda
             UpperCAmelCase_     					=				worda
             UpperCAmelCase_     					=				[[-1 for _ in range(len(_UpperCAmelCase       )       )] for _ in range(len(_UpperCAmelCase       )       )]

             return self.__min_dist_top_down_dp(len(_UpperCAmelCase       ) - 1						,							len(_UpperCAmelCase       ) - 1       )







       def 	lowercase__							(				self     :    int						,							_UpperCAmelCase     :    str						,							_UpperCAmelCase     :    str       )					->		int:


             '''simple docstring'''




             UpperCAmelCase_     					=				worda
             UpperCAmelCase_     					=				worda
             UpperCAmelCase_     					=				len(_UpperCAmelCase       )
             UpperCAmelCase_     					=				len(_UpperCAmelCase       )
             UpperCAmelCase_     					=				[[0 for _ in range(n + 1       )] for _ in range(m + 1       )]

             for i in range(m + 1       ):
                   for j in range(n + 1       ):
                         if i == 0:  # first string is empty
                               UpperCAmelCase_     					=				j
                         elif j == 0:  # second string is empty
                               UpperCAmelCase_     					=				i
                         elif worda[i - 1] == worda[j - 1]:  # last characters are equal
                               UpperCAmelCase_     					=				self.dp[i - 1][j - 1]
                         else:
                               UpperCAmelCase_     					=				self.dp[i][j - 1]
                               UpperCAmelCase_     					=				self.dp[i - 1][j]
                               UpperCAmelCase_     					=				self.dp[i - 1][j - 1]
                               UpperCAmelCase_     					=				1 + min(_UpperCAmelCase						,							_UpperCAmelCase						,							_UpperCAmelCase       )
             return self.dp[m][n]


if __name__ == "__main__":
  lowerCamelCase  			=		EditDistance()

  print("""****************** Testing Edit Distance DP Algorithm ******************""")
  print()

  lowerCamelCase  			=		input("""Enter the first string: """).strip()
  lowerCamelCase  			=		input("""Enter the second string: """).strip()

  print()
  print(F"The minimum edit distance is: {solver.min_dist_top_down(Sa, Sa)}")
  print(F"The minimum edit distance is: {solver.min_dist_bottom_up(Sa, Sa)}")
  print()
  print("""*************** End of Testing Edit Distance DP Algorithm ***************""")





def 							UpperCAmelCase		(       lowercase				,     lowercase				):







				"""simple docstring"""



				__lowercase					     =				word.split()

				def justify(lowercase				,     lowercase				,     lowercase				) -> str:
								__lowercase					     =				max_width - width
								__lowercase					     =				len(lowercase				)
								if len(lowercase				) == 1:
												# if there is only word in line
												# just insert overall_spaces_count for the remainder of line
												return line[0] + " " * overall_spaces_count
								else:
												__lowercase					     =				words_count - 1
												# num_spaces_between_words_list[i] : tells you to insert
												# num_spaces_between_words_list[i] spaces
												# after word on line[i]
												__lowercase					     =				spaces_to_insert_between_words * [
												    overall_spaces_count // spaces_to_insert_between_words
												]
												__lowercase					     =				(
												    overall_spaces_count % spaces_to_insert_between_words
												)
												# distribute spaces via round robin to the left words
												for i in range(lowercase				):
																num_spaces_between_words_list[i] += 1
												__lowercase					     =				[]
												for i in range(lowercase				):
																# add the word
																aligned_words_list.append(line[i]				)
																# add the spaces to insert
																aligned_words_list.append(num_spaces_between_words_list[i] * ''' '''				)
												# just add the last word to the sentence
												aligned_words_list.append(line[-1]				)
												# join the aligned words list to form a justified line
												return "".join(lowercase				)

				__lowercase					     =				[]
				__lowercase					     =				[]
				__lowercase					     =				0
				for word in words:
								if width + len(lowercase				) + len(lowercase				) <= max_width:
												# keep adding words until we can fill out max_width
												# width = sum of length of all words (without overall_spaces_count)
												# len(word) = length of current word
												# len(line) = number of overall_spaces_count to insert between words
												line.append(lowercase				)
												width += len(lowercase				)
								else:
												# justify the line and add it to result
												answer.append(justify(lowercase				,     lowercase				,     lowercase				)				)
												# reset new line and new width
												__lowercase     ,	__lowercase					     =				[word], len(lowercase				)
				__lowercase					     =				max_width - width - len(lowercase				)
				answer.append(''' '''.join(lowercase				) + (remaining_spaces + 1) * ''' '''				)
				return answer


if __name__ == "__main__":
		from doctest import testmod

		testmod()