Algorithms: Number Theory

function modular_power(int $base, int $exponent, int $modulus): int {
    alg_require((($base >= 0) && ($exponent >= 0) && ($modulus > 0) && ($modulus <= 46340)));
    $result = (1 % $modulus);
    $base = ($base % $modulus);
    while (($exponent > 0)) {
        if ((($exponent % 2) == 1)) {
            $result = (alg_mul($result, $base) % $modulus);
        }
        $base = (alg_mul($base, $base) % $modulus);
        $exponent = intdiv($exponent, 2);
    }
    return $result;

    static int modular_power(int base_value, int exponent, int modulus) {
        checked {
            alg_require(((base_value >= 0) && (exponent >= 0) && (modulus > 0) && (modulus <= 46340)));
            int result = (1 % modulus);
            base_value = (base_value % modulus);
            while ((exponent > 0)) {
                if (((exponent % 2) == 1)) {
                    result = ((result * base_value) % modulus);
                }
                base_value = ((base_value * base_value) % modulus);
                exponent = (exponent / 2);
            }

int modular_power(int base, int exponent, int modulus) {
    alg_require(((base >= 0) && (exponent >= 0) && (modulus > 0) && (modulus <= 46340)));
    int result = (1 % modulus);
    base = (base % modulus);
    while ((exponent > 0)) {
        if (((exponent % 2) == 1)) {
            result = (alg_mul(result, base) % modulus);
        }
        base = (alg_mul(base, base) % modulus);
        exponent = (exponent / 2);
    }
    return result;

int modular_power(int base, int exponent, int modulus) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    if (!(((base >= 0) && (exponent >= 0) && (modulus > 0) && (modulus <= 46340)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    int result = (1 % modulus);
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    base = (base % modulus);
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    while (1) {
        int alg_condition = (exponent > 0);

def modular_power(base: int, exponent: int, modulus: int) -> int:
    alg_require(type(base) is int and -2147483648 <= base <= 2147483647)
    alg_require(type(exponent) is int and -2147483648 <= exponent <= 2147483647)
    alg_require(type(modulus) is int and -2147483648 <= modulus <= 2147483647)
    alg_require(base >= 0 and exponent >= 0 and (modulus > 0) and (modulus <= 46340))
    result: int = 1 % modulus
    base = base % modulus
    while exponent > 0:
        if exponent % 2 == 1:
            result = result * base % modulus
        base = base * base % modulus
        exponent = exponent // 2