

import qiskit

def 							__SCREAMING_SNAKE_CASE							(			lowerCAmelCase:					int					, lowerCAmelCase:					int	)				->    qiskit.result.counts.Counts:
				_UpperCAmelCase    :						Optional[int]							=      qiskit.Aer.get_backend("aer_simulator"	)

				# Create a Quantum Circuit acting on the q register
				_UpperCAmelCase    :						List[Any]							=      qiskit.QuantumCircuit(lowerCAmelCase					, lowerCAmelCase	)

				# Apply X (NOT) Gate to Qubits 0 & 1
				circuit.x(0	)
				circuit.x(1	)

				# Map the quantum measurement to the classical bits
				circuit.measure([0, 1]					, [0, 1]	)

				# Execute the circuit on the qasm simulator
				_UpperCAmelCase    :						Tuple							=      qiskit.execute(lowerCAmelCase					, lowerCAmelCase					, shots=1000	)

				# Return the histogram data of the results of the experiment.
				return job.result().get_counts(lowerCAmelCase	)


if __name__ == "__main__":
					SCREAMING_SNAKE_CASE_            = single_qubit_measure(2, 2)
					print(F'''Total count for various states are: {counts}''')





def 							__SCREAMING_SNAKE_CASE							(			lowerCAmelCase:					str					, lowerCAmelCase:					str	)				->    bool:
				_UpperCAmelCase    :						Optional[Any]							=      len(lowerCAmelCase	) + 1
				_UpperCAmelCase    :						Optional[int]							=      len(lowerCAmelCase	) + 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.
				_UpperCAmelCase    :						List[str]							=      [[0 for i in range(lowerCAmelCase	)] for j in range(lowerCAmelCase	)]

				# since string of zero length match pattern of zero length
				_UpperCAmelCase    :						List[Any]							=      1

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

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

												elif pattern[j - 1] == "*":
																if dp[i][j - 2] == 1:
																				_UpperCAmelCase    :						List[str]							=      1
																elif pattern[j - 2] in (input_string[i - 1], "."):
																				_UpperCAmelCase    :						str							=      dp[i - 1][j]
																else:
																				_UpperCAmelCase    :						int							=      0
												else:
																_UpperCAmelCase    :						List[Any]							=      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_            = 'aab'
					SCREAMING_SNAKE_CASE_            = '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}''')


