
"""simple docstring"""

def     lowercase__						(					lowerCAmelCase				:					Dict ,				lowerCAmelCase				:					Any ) ->      List[str]:






    """simple docstring"""




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







print(binomial_coefficient(n=10, r=5))





"""simple docstring"""

def     lowercase__						(					lowerCAmelCase				:					int ,				lowerCAmelCase				:					int ) ->      int:






    """simple docstring"""




    return number | (1 << position)




def     lowercase__						(					lowerCAmelCase				:					int ,				lowerCAmelCase				:					int ) ->      int:






    """simple docstring"""




    return number & ~(1 << position)




def     lowercase__						(					lowerCAmelCase				:					int ,				lowerCAmelCase				:					int ) ->      int:






    """simple docstring"""




    return number ^ (1 << position)




def     lowercase__						(					lowerCAmelCase				:					int ,				lowerCAmelCase				:					int ) ->      bool:






    """simple docstring"""




    return ((number >> position) & 1) == 1




def     lowercase__						(					lowerCAmelCase				:					int ,				lowerCAmelCase				:					int ) ->      int:






    """simple docstring"""




    return int((number & (1 << position)) != 0 )


if __name__ == "__main__":
   import doctest

   doctest.testmod()



