June 2018 Update

Task/Greatest-common-divisor/Simula/greatest-common-divisor.simula

@@ -0,0 +1,23 @@
+BEGIN
+    INTEGER PROCEDURE GCD(a, b); INTEGER a, b;
+    BEGIN
+        IF a = 0 THEN a := b
+        ELSE
+            WHILE 0 < b DO BEGIN INTEGER i;
+                i := MOD(a, b); a := b; b := i;
+            END;
+        GCD := a
+    END;
+
+    INTEGER a, b;
+    !outint(SYSOUT.IMAGE.MAIN.LENGTH, 0);!OUTIMAGE;!OUTIMAGE;
+    !SYSOUT.IMAGE :- BLANKS(132);  ! this may or may not work;
+    FOR b := 1 STEP 5 UNTIL 37 DO BEGIN
+        FOR a := 0 STEP 2 UNTIL 21 DO BEGIN
+            OUTTEXT("  ("); OUTINT(a, 0);
+            OUTCHAR(','); OUTINT(b, 2);
+            OUTCHAR(')'); OUTINT(GCD(a, b), 3);
+        END;
+        OUTIMAGE
+    END
+END