Algorithms: Number Theory

    static 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;
    }

    public static void main(String[] args) {

function lcm(int $a, int $b): int {
    alg_require((($a >= 0) && ($b >= 0)));
    if ((($a == 0) || ($b == 0))) {
        return 0;
    }
    $x = $a;
    $y = $b;
    $remainder = 0;
    while (($y != 0)) {
        $remainder = ($x % $y);
        $x = $y;
        $y = $remainder;

    static int lcm(int a, int b) {
        checked {
            alg_require(((a >= 0) && (b >= 0)));
            if (((a == 0) || (b == 0))) {
                return 0;
            }
            int x = a;
            int y = b;
            int remainder = 0;
            while ((y != 0)) {
                remainder = (x % y);
                x = y;

int lcm(int a, int b) {
    alg_require(((a >= 0) && (b >= 0)));
    if (((a == 0) || (b == 0))) {
        return 0;
    }
    int x = a;
    int y = b;
    int remainder = 0;
    while ((y != 0)) {
        remainder = (x % y);
        x = y;
        y = remainder;

int lcm(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 alg_condition_1 = ((a == 0) || (b == 0));
    if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
    if (alg_condition_1) {
        alg_result = 0;
        if (alg_error) { errno = ERANGE; alg_result = INT_MIN; goto alg_cleanup; }
        goto alg_cleanup;