





def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case							)		->    int:
		return x if y == 0 else greatest_common_divisor(snake_case						,   x % y							)



def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case							)		->    int:
		return (x * y) // greatest_common_divisor(snake_case						,   snake_case							)



def  SCREAMING_SNAKE_CASE				(      snake_case = 20							)		->    int:
		__lowercase											=     1
		for i in range(1						,   n + 1							):
				__lowercase											=     lcm(snake_case						,   snake_case							)
		return g


if __name__ == "__main__":
		print(F"""{solution() = }""")











def  SCREAMING_SNAKE_CASE				(      snake_case						,   snake_case							)		->    bool:
		__lowercase											=     len(snake_case							) + 1
		__lowercase											=     len(snake_case							) + 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.
		__lowercase											=     [[0 for i in range(snake_case							)] for j in range(snake_case							)]

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

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

		# since string of zero length will match with pattern where there
		# is at least one * alternatively
		for j in range(1						,   snake_case							):
				__lowercase											=     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						,   snake_case							):
				for j in range(1						,   snake_case							):
						if input_string[i - 1] == pattern[j - 1] or pattern[j - 1] == ".":
								__lowercase											=     dp[i - 1][j - 1]

						elif pattern[j - 1] == "*":
								if dp[i][j - 2] == 1:
										__lowercase											=     1
								elif pattern[j - 2] in (input_string[i - 1], "."):
										__lowercase											=     dp[i - 1][j]
								else:
										__lowercase											=     0
						else:
								__lowercase											=     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 :")

		SCREAMING_SNAKE_CASE_   :      Any			=   '''aab'''
		SCREAMING_SNAKE_CASE_   :      str			=   '''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}""")




