






"""simple docstring"""
def 							A						(				__snake_case: Tuple ,     __snake_case: Union[str, Any]  )    ->		str:

       """simple docstring"""





       __magic_name__      				=    [0 for i in range(r + 1  )]
       # nc0 = 1
       __magic_name__      				=    1
       for i in range(1 ,     n + 1  ):
              # to compute current row from previous row.
              __magic_name__      				=    min(lowerCAmelCase_ ,     lowerCAmelCase_  )
              while j > 0:
                     c[j] += c[j - 1]
                     j -= 1
       return c[r]






print(binomial_coefficient(n=1_0, r=5))



def       _lowerCAmelCase    (				lowerCAmelCase_				:int		,    lowerCAmelCase_				:int				)->int:
   '''simple docstring'''






   return int((input_a, input_a).count(0				) == 0				)



def       _lowerCAmelCase    (				)->None:
   '''simple docstring'''






   assert and_gate(0		,    0				) == 0
   assert and_gate(0		,    1				) == 0
   assert and_gate(1		,    0				) == 0
   assert and_gate(1		,    1				) == 1


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




