




def       UpperCAmelCase__  (     lowerCamelCase,			lowerCamelCase   ):
  return int((input_a, input_a).count(0   ) != 0   )



def       UpperCAmelCase__  (     ):
  assert nand_gate(0,			0   ) == 1
  assert nand_gate(0,			1   ) == 1
  assert nand_gate(1,			0   ) == 1
  assert nand_gate(1,			1   ) == 0


if __name__ == "__main__":
     print(nand_gate(0, 0))
     print(nand_gate(0, 1))
     print(nand_gate(1, 0))
     print(nand_gate(1, 1))









from collections import defaultdict

from graphs.minimum_spanning_tree_prims import prisms_algorithm as mst



def       UpperCAmelCase__  (     ):
  lowercase	,    lowercase    :Union[str, Any]      	=						9, 14  # noqa: F841
  lowercase    :Optional[Any]      	=						[
      [0, 1, 4],
      [0, 7, 8],
      [1, 2, 8],
      [7, 8, 7],
      [7, 6, 1],
      [2, 8, 2],
      [8, 6, 6],
      [2, 3, 7],
      [2, 5, 4],
      [6, 5, 2],
      [3, 5, 14],
      [3, 4, 9],
      [5, 4, 10],
      [1, 7, 11],
  ]

  lowercase    :Optional[Any]      	=						defaultdict(lowerCamelCase   )
  for nodea, nodea, cost in edges:
    adjancency[nodea].append([nodea, cost]   )
    adjancency[nodea].append([nodea, cost]   )

  lowercase    :Optional[int]      	=						mst(lowerCamelCase   )

  lowercase    :Any      	=						[
      [7, 6, 1],
      [2, 8, 2],
      [6, 5, 2],
      [0, 1, 4],
      [2, 5, 4],
      [2, 3, 7],
      [0, 7, 8],
      [3, 4, 9],
  ]

  for answer in expected:
    lowercase    :Any      	=						tuple(answer[:2]   )
    lowercase    :str      	=						tuple(edge[::-1]   )
    assert edge in result or reverse in result



