Data update

Task/Least-common-multiple/PascalABC.NET/least-common-multiple.pas

@@ -0,0 +1,12 @@
+function GCD(a,b: integer): integer;
+begin
+  while b > 0 do
+    (a,b) := (b,a mod b);
+  Result := a;
+end;
+
+function LCM(a,b: integer): integer := a = 0 ? 0 : a div GCD(a,b) * b;
+
+begin
+  Println(LCM(12,18));
+end.

Task/Least-common-multiple/Standard-ML/least-common-multiple-1.ml

@@ -0,0 +1,4 @@
+fun gcd (0,n) = n
+  | gcd (m,n) = gcd(n mod m, m)
+
+fun lcm (m,n) = abs(x * y) div gcd (m, n)

Task/Least-common-multiple/Uiua/least-common-multiple.uiua

@@ -0,0 +1,4 @@
+# Greatest Common Divisor using Euclidean algorithm
+Gcd ← ⊙◌⍢(⟜◿:|±,)
+# Least Common Multiple
+Lcm ← ÷⊃(Gcd|⌵×)