Algorithms: Number Theory

    static int gcd(int a, int b) {
        checked {
            alg_require(((a >= 0) && (b >= 0)));
            int remainder = 0;
            while ((b != 0)) {
                remainder = (a % b);
                a = b;
                b = remainder;
            }
            return a;
        }
    }

int gcd(int a, int b) {
    alg_require(((a >= 0) && (b >= 0)));
    int remainder = 0;
    while ((b != 0)) {
        remainder = (a % b);
        a = b;
        b = remainder;
    }
    return a;
}

int main(void) {

int gcd(int a, int b) {
    int alg_error = 0;
    int alg_result = INT_MIN;
    errno = 0;
    if (!(((a >= 0) && (b >= 0)))) { errno = EINVAL; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    int remainder = 0;
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    while (1) {
        int alg_condition = (b != 0);
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
        if (!alg_condition) break;

def gcd(a: int, b: int) -> int:
    alg_require(type(a) is int and -2147483648 <= a <= 2147483647)
    alg_require(type(b) is int and -2147483648 <= b <= 2147483647)
    alg_require(a >= 0 and b >= 0)
    remainder: int = 0
    while b != 0:
        remainder = a % b
        a = b
        b = remainder
    return a

a = 48

function gcd(a, b) {
    alg_require(Number.isInteger(a) && a >= -2147483648 && a <= 2147483647);
    alg_require(Number.isInteger(b) && b >= -2147483648 && b <= 2147483647);
    alg_require(((a >= 0) && (b >= 0)));
    let remainder = 0;
    while ((b != 0)) {
        remainder = (a % b);
        a = b;
        b = remainder;
    }
    return a;
}