






import numpy as np
import qiskit



def      UpperCAmelCase						( lowerCAmelCase__					,     lowerCAmelCase__	):


		'''simple docstring'''

		__A    =							qiskit.QuantumCircuit(num_qubits + 1	)

		# First, let's deal with the case in which oracle is balanced
		if case == "balanced":
				# First generate a random number that tells us which CNOTs to
				# wrap in X-gates:
				__A    =							np.random.randint(1					,     2**num_qubits	)
				# Next, format 'b' as a binary string of length 'n', padded with zeros:
				__A    =							format(lowerCAmelCase__					,     F"""0{num_qubits}b"""	)
				# Next, we place the first X-gates. Each digit in our binary string
				# corresponds to a qubit, if the digit is 0, we do nothing, if it's 1
				# we apply an X-gate to that qubit:
				for index, bit in enumerate(lowerCAmelCase__	):
						if bit == "1":
								oracle_qc.x(lowerCAmelCase__	)
        # Do the controlled-NOT gates for each qubit, using the output qubit
        # as the target:
				for index in range(lowerCAmelCase__	):
						oracle_qc.cx(lowerCAmelCase__					,     lowerCAmelCase__	)
				# Next, place the final X-gates
				for index, bit in enumerate(lowerCAmelCase__	):
						if bit == "1":
								oracle_qc.x(lowerCAmelCase__	)

    # Case in which oracle is constant
		if case == "constant":
				# First decide what the fixed output of the oracle will be
				# (either always 0 or always 1)
				__A    =							np.random.randint(2	)
				if output == 1:
						oracle_qc.x(lowerCAmelCase__	)

		__A    =							oracle_qc.to_gate()
		__A    =							"Oracle"  # To show when we display the circuit
		return oracle_gate



def      UpperCAmelCase						( lowerCAmelCase__					,     lowerCAmelCase__	):


		'''simple docstring'''

		__A    =							qiskit.QuantumCircuit(num_qubits + 1					,     lowerCAmelCase__	)
		# Set up the output qubit:
		dj_circuit.x(lowerCAmelCase__	)
		dj_circuit.h(lowerCAmelCase__	)
		# And set up the input register:
		for qubit in range(lowerCAmelCase__	):
				dj_circuit.h(lowerCAmelCase__	)
		# Let's append the oracle gate to our circuit:
		dj_circuit.append(lowerCAmelCase__					,     range(num_qubits + 1	)	)
		# Finally, perform the H-gates again and measure:
		for qubit in range(lowerCAmelCase__	):
				dj_circuit.h(lowerCAmelCase__	)

		for i in range(lowerCAmelCase__	):
				dj_circuit.measure(lowerCAmelCase__					,     lowerCAmelCase__	)

		return dj_circuit



def      UpperCAmelCase						( lowerCAmelCase__					,     lowerCAmelCase__	):


		'''simple docstring'''

		__A    =							qiskit.Aer.get_backend("aer_simulator"	)

		__A    =							dj_oracle(lowerCAmelCase__					,     lowerCAmelCase__	)
		__A    =							dj_algorithm(lowerCAmelCase__					,     lowerCAmelCase__	)

		# Execute the circuit on the simulator
		__A    =							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__":
					print(f"""Deutsch Jozsa - Constant Oracle: {deutsch_jozsa("constant", 3)}""")
					print(f"""Deutsch Jozsa - Balanced Oracle: {deutsch_jozsa("balanced", 3)}""")





'''simple docstring'''




from collections import deque





def 				a_							(    lowercase     )      ->Tuple:






				'''simple docstring'''

				return input(lowercase     ).strip().split(" "     )





def 				a_							(    lowercase				,    lowercase     )      ->dict[int, list[int]]:






				'''simple docstring'''

				__lowerCamelCase		:   dict[int, list[int]]           =       {}
				for i in range(lowercase     ):
								__lowerCamelCase		:   int           =       []

				for e in range(lowercase     ):
								__lowerCamelCase    ,       __lowerCamelCase		:   int           =       (int(lowercase     ) for i in _input(F'Edge {e + 1}: <node1> <node2> '     ))
								graph[x].append(lowercase     )
				return graph





def 				a_							(    lowercase				,    lowercase     )      ->dict[int, list[int]]:






				'''simple docstring'''

				__lowerCamelCase		:   dict[int, list[int]]           =       {}
				for i in range(lowercase     ):
								__lowerCamelCase		:   Any           =       []

				for e in range(lowercase     ):
								__lowerCamelCase    ,       __lowerCamelCase		:   Dict           =       (int(lowercase     ) for i in _input(F'Edge {e + 1}: <node1> <node2> '     ))
								graph[x].append(lowercase     )
								graph[y].append(lowercase     )
				return graph





def 				a_							(    lowercase				,    lowercase     )      ->dict[int, list[tuple[int, int]]]:






				'''simple docstring'''

				__lowerCamelCase		:   dict[int, list[tuple[int, int]]]           =       {}
				for i in range(lowercase     ):
								__lowerCamelCase		:   List[Any]           =       []

				for e in range(lowercase     ):
								__lowerCamelCase    ,       __lowerCamelCase    ,       __lowerCamelCase		:   int           =       (int(lowercase     ) for i in _input(F'Edge {e + 1}: <node1> <node2> <weight> '     ))
								graph[x].append((y, w)     )
								graph[y].append((x, w)     )
				return graph


if __name__ == "__main__":
				__lowercase		,		__lowercase	:   List[Any]   		=					(int(i) for i in _input("""Number of nodes and edges: """))

				__lowercase	:   Any   		=					int(
				    _input(
				        """Press 1 or 2 or 3 \n"""
				        """1. Unweighted directed \n"""
				        """2. Unweighted undirected \n"""
				        """3. Weighted undirected \n"""
				    )[0]
				)

				__lowercase	:   Any   		=					{
				    1: initialize_unweighted_directed_graph,
				    2: initialize_unweighted_undirected_graph,
				    3: initialize_weighted_undirected_graph,
				}[graph_choice](n, m)





def 				a_							(    lowercase				,    lowercase     )      ->Tuple:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase		:   Dict           =       {s}, [s]
				print(lowercase     )
				while _s:
								__lowerCamelCase		:   int           =       0
								for i in g[_s[-1]]:
												if i not in vis:
																_s.append(lowercase     )
																vis.add(lowercase     )
																__lowerCamelCase		:   Tuple           =       1
																print(lowercase     )
																break
								if not flag:
												_s.pop()





def 				a_							(    lowercase				,    lowercase     )      ->List[str]:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase		:   Tuple           =       {s}, deque([s]     )
				print(lowercase     )
				while q:
								__lowerCamelCase		:   Optional[Any]           =       q.popleft()
								for v in g[u]:
												if v not in vis:
																vis.add(lowercase     )
																q.append(lowercase     )
																print(lowercase     )





def 				a_							(    lowercase				,    lowercase     )      ->Any:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase    ,       __lowerCamelCase		:   Optional[int]           =       {s: 0}, set(), {s: 0}
				while True:
								if len(lowercase     ) == len(lowercase     ) - 1:
												break
								__lowerCamelCase		:   str           =       10_0000
								for i in dist:
												if i not in known and dist[i] < mini:
																__lowerCamelCase		:   Any           =       dist[i]
																__lowerCamelCase		:   List[str]           =       i
								known.add(lowercase     )
								for v in g[u]:
												if v[0] not in known and dist[u] + v[1] < dist.get(v[0]				,    10_0000     ):
																__lowerCamelCase		:   Optional[int]           =       dist[u] + v[1]
																__lowerCamelCase		:   List[str]           =       u
				for i in dist:
								if i != s:
												print(dist[i]     )





def 				a_							(    lowercase				,    lowercase=None				,    lowercase=None     )      ->Optional[Any]:






				'''simple docstring'''

				if q is None:
								__lowerCamelCase		:   int           =       [1]
				if ind is None:
								__lowerCamelCase		:   Any           =       [0] * (len(lowercase     ) + 1)  # SInce oth Index is ignored
								for u in g:
												for v in g[u]:
																ind[v] += 1
								__lowerCamelCase		:   Tuple           =       deque()
								for i in g:
												if ind[i] == 0:
																q.append(lowercase     )
				if len(lowercase     ) == 0:
								return
				__lowerCamelCase		:   Optional[Any]           =       q.popleft()
				print(lowercase     )
				for w in g[v]:
								ind[w] -= 1
								if ind[w] == 0:
												q.append(lowercase     )
				topo(lowercase				,    lowercase				,    lowercase     )





def 				a_							(    )      ->Union[str, Any]:






				'''simple docstring'''

				__lowerCamelCase		:   Tuple           =       input().strip()
				__lowerCamelCase		:   Any           =       []
				for _ in range(lowercase     ):
								a.append(map(lowercase				,    input().strip().split()     )     )
				return a, n





def 				a_							(    lowercase     )      ->List[str]:






				'''simple docstring'''

				((__lowerCamelCase)    ,       (__lowerCamelCase))		:   Optional[int]           =       a_and_n
				__lowerCamelCase		:   Optional[int]           =       list(lowercase     )
				__lowerCamelCase		:   str           =       [[0] * n for i in range(lowercase     )]
				for k in range(lowercase     ):
								for i in range(lowercase     ):
												for j in range(lowercase     ):
																if dist[i][j] > dist[i][k] + dist[k][j]:
																				__lowerCamelCase		:   str           =       dist[i][k] + dist[k][j]
																				__lowerCamelCase		:   Tuple           =       k
				print(lowercase     )





def 				a_							(    lowercase				,    lowercase     )      ->Dict:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase    ,       __lowerCamelCase		:   int           =       {s: 0}, set(), {s: 0}
				while True:
								if len(lowercase     ) == len(lowercase     ) - 1:
												break
								__lowerCamelCase		:   List[Any]           =       10_0000
								for i in dist:
												if i not in known and dist[i] < mini:
																__lowerCamelCase		:   str           =       dist[i]
																__lowerCamelCase		:   Optional[int]           =       i
								known.add(lowercase     )
								for v in g[u]:
												if v[0] not in known and v[1] < dist.get(v[0]				,    10_0000     ):
																__lowerCamelCase		:   Dict           =       v[1]
																__lowerCamelCase		:   List[str]           =       u
				return dist





def 				a_							(    )      ->Union[str, Any]:






				'''simple docstring'''

				__lowerCamelCase    ,       __lowerCamelCase		:   List[Any]           =       map(lowercase				,    input().split(" "     )     )
				__lowerCamelCase		:   Optional[Any]           =       []
				for _ in range(lowercase     ):
								edges.append(map(lowercase				,    input().split(" "     )     )     )
				return edges, n





def 				a_							(    lowercase     )      ->Optional[int]:






				'''simple docstring'''

				((__lowerCamelCase)    ,       (__lowerCamelCase))		:   Any           =       e_and_n
				e.sort(reverse=lowercase				,    key=lambda lowercase     : x[2]     )
				__lowerCamelCase		:   Optional[Any]           =       [{i} for i in range(1				,    n + 1     )]
				while True:
								if len(lowercase     ) == 1:
												break
								print(lowercase     )
								__lowerCamelCase		:   List[str]           =       e.pop()
								for i in range(len(lowercase     )     ):
												if x[0] in s[i]:
																break
								for j in range(len(lowercase     )     ):
												if x[1] in s[j]:
																if i == j:
																				break
																s[j].update(s[i]     )
																s.pop(lowercase     )
																break





def 				a_							(    lowercase     )      ->int:






				'''simple docstring'''

				__lowerCamelCase		:   Tuple           =       []
				for node in graph:
								if not graph[node]:
												isolated.append(lowercase     )
				return isolated





