快速幂方法

quick-power.py

import hypothesis.strategies as st
from hypothesis import given


def quick_pow(a: int, b: int) -> int:
    base, ans = a, 1
    while b:
        if b & 1:
            ans *= base
        base *= base
        b >>= 1
    return ans


@given(st.integers(min_value=1, max_value=100), st.integers(min_value=0, max_value=20))
def test_quick_pow(a, b):
    print(a, b)
    assert pow(a, b) == quick_pow(a, b)