

"""simple docstring"""


def   _A					(	_a	:						str     ,   _a	:						str				):



      """simple docstring"""






      A				  =		len(_a				) + 1
      A				  =		len(_a				) + 1

      # dp is a 2d matrix where dp[i][j] denotes whether prefix string of
      # length i of input_string matches with prefix string of length j of
      # given pattern.
      # "dp" stands for dynamic programming.
      A				  =		[[0 for i in range(_a				)] for j in range(_a				)]

      # since string of zero length match pattern of zero length
      A				  =		1

      # since pattern of zero length will never match with string of non-zero length
      for i in range(1     ,   _a				):
            A				  =		0

      # since string of zero length will match with pattern where there
      # is at least one * alternatively
      for j in range(1     ,   _a				):
            A				  =		dp[0][j - 2] if pattern[j - 1] == """*""" else 0

      # now using bottom-up approach to find for all remaining lengths
      for i in range(1     ,   _a				):
            for j in range(1     ,   _a				):
                  if input_string[i - 1] == pattern[j - 1] or pattern[j - 1] == ".":
                        A				  =		dp[i - 1][j - 1]

                  elif pattern[j - 1] == "*":
                        if dp[i][j - 2] == 1:
                              A				  =		1
                        elif pattern[j - 2] in (input_string[i - 1], "."):
                              A				  =		dp[i - 1][j]
                        else:
                              A				  =		0
                  else:
                        A				  =		0

      return bool(dp[-1][-1]				)


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  # inputing the strings
  # input_string = input("input a string :")
  # pattern = input("input a pattern :")

  UpperCAmelCase													="aab"
  UpperCAmelCase													="c*a*b"

  # using function to check whether given string matches the given pattern
  if match_pattern(input_string, pattern):
    print(f"""{input_string} matches the given pattern {pattern}""")
  else:
    print(f"""{input_string} does not match with the given pattern {pattern}""")







"""simple docstring"""


from __future__ import annotations



def   _A					(	_a	:						list[float]     ,   _a	:						list[float]				):



      """simple docstring"""






      A				  =		sorted(numsa + numsa				)
      A  ,			A				  =		divmod(len(_a				)     ,   2				)
      if mod == 1:
            return all_numbers[div]
      else:
            return (all_numbers[div] + all_numbers[div - 1]) / 2


if __name__ == "__main__":
  import doctest

  doctest.testmod()
  UpperCAmelCase													=[float(x) for x in input("Enter the elements of first array: ").split()]
  UpperCAmelCase													=[float(x) for x in input("Enter the elements of second array: ").split()]
  print(f"""The median of two arrays is: {median_of_two_arrays(array_a, array_a)}""")




