Data update

Task/Least-common-multiple/PureBasic/least-common-multiple.basic

@@ -1,17 +1,29 @@
-Procedure GCDiv(a, b); Euclidean algorithm
-  Protected r
-  While b
-    r = b
-    b = a%b
-    a = r
-  Wend
-  ProcedureReturn a
+Procedure GCDiv(a.q, b.q); Euclidean algorithm
+  a = Abs(a)
+  b = Abs(b)
+  If a = 0
+    ProcedureReturn b
+  ElseIf b = 0
+    ProcedureReturn a
+  Else
+    Protected r.q
+    While b
+      r = b
+      b = a % b
+      a = r
+    Wend
+    ProcedureReturn a
+  EndIf
 EndProcedure
 
-Procedure LCM(m,n)
-  Protected t
-  If m And n
-    t=m*n/GCDiv(m,n)
+Procedure LCM(m.d, n.d)
+  m = Abs(m)
+  n = Abs(n)
+  If m = 0
+    ProcedureReturn n
+  ElseIf n = 0
+    ProcedureReturn m
+  Else
+    ProcedureReturn m / GCDiv(m, n) * n
   EndIf
-  ProcedureReturn t*Sign(t)
 EndProcedure