GCF and LCM Calculator

            from math import gcd
def greatest_common_factor(a: int, b: int) -> int:
    return gcd(a, b)
assert greatest_common_factor(12, 18) == 6
          

            #include <assert.h>
#include <stdint.h>
int64_t greatest_common_factor(int64_t a,int64_t b){if(a<0)a=-a;if(b<0)b=-b;while(b){int64_t r=a%b;a=b;b=r;}return a;}
int main(void){assert(greatest_common_factor(12,18)==6);}
          

            #include <cassert>
#include <numeric>
long long greatest_common_factor(long long a,long long b){return std::gcd(a,b);}
int main(){assert(greatest_common_factor(12,18)==6);}
          

x86-64 NASM · System V ABI · Linux · integer arguments in rdi, rsi and rdx

            ; int64_t greatest_common_factor(int64_t a, int64_t b)
global greatest_common_factor
section .text
greatest_common_factor:

    mov rax, rdi
    test rax, rax
    jns .a_ok
    neg rax
.a_ok:
    mov rcx, rsi
    test rcx, rcx
    jns .b_ok
    neg rcx
.b_ok:
    test rcx, rcx
    jz .done
.loop:
    xor rdx, rdx
    div rcx
    mov rax, rcx
    mov rcx, rdx
    test rcx, rcx
    jnz .loop
.done:
    ret
          

            function result = greatest_common_factor(a, b)
    result = gcd(abs(round(a)), abs(round(b)));
end
          

            ClearAll[mwCalculate];
mwCalculate[a_Integer, b_Integer] := GCD[a, b];