
def 		lowercase_    (     A__				,	A__	)							->							str:
    """simple docstring"""

    if a < 0 or b < 0:
        raise ValueError("the value of both inputs must be positive"	)
    snake_case				  =      str(bin(A__	)	)[2:]  # remove the leading "0b"
    snake_case				  =      str(bin(A__	)	)[2:]
    snake_case				  =      max(len(A__	)				,	len(A__	)	)
    return "0b" + "".join(
        str(int("1" in (char_a, char_b)	)	)
        for char_a, char_b in zip(a_binary.zfill(A__	)				,	b_binary.zfill(A__	)	)	)


if __name__ == "__main__":
   import doctest

   doctest.testmod()



def 		lowercase_    (     A__				,	A__	)							->							List[Any]:
    """simple docstring"""

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





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

