




from itertools import combinations, product





def 	__A	(			__lowerCamelCase							,    __lowerCamelCase							,    __lowerCamelCase							,    __lowerCamelCase					)   -> bool:
 if xa == ya == 0 or xa == ya == 0:
  return False
 a		       =							xa * xa + ya * ya
 a		       =							xa * xa + ya * ya
 a		       =							(xa - xa) * (xa - xa) + (ya - ya) * (ya - ya)
 return (
     a_square + b_square == c_square
     or a_square + c_square == b_square
     or b_square + c_square == a_square
 )





def 	__A	(			__lowerCamelCase = 50					)   -> int:
 return sum(
     1
     for pta, pta in combinations(product(range(limit + 1					)							,    repeat=2					)							,    2					)
     if is_right(*__lowerCamelCase							,    *__lowerCamelCase					)					)


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







import doctest

import projectq
from projectq.ops import H, Measure





def 	__A	(			__lowerCamelCase					)   -> int:
	a		       =							quantum_engine.allocate_qubit()
	H | qubit
	Measure | qubit
	return int(__lowerCamelCase					)


if __name__ == "__main__":
		doctest.testmod()

		# initialises a new quantum backend
		__UpperCamelCase      : List[Any]					      =   projectq.MainEngine()

		# Generate a list of 10 random numbers
		__UpperCamelCase      : Optional[int]					      =   [get_random_number(quantum_engine) for _ in range(10)]

		# Flushes the quantum engine from memory
		quantum_engine.flush()

		print("Random numbers", random_numbers_list)

