Data update

Task/McNuggets-problem/ALGOL-68/mcnuggets-problem.alg

@@ -12,8 +12,8 @@ BEGIN
         OD # y #
     OD # x # ;
     # show the highest number that cannot be formed                          #
-    INT largest := -1;
-    FOR i FROM UPB sum BY -1 TO LWB sum WHILE sum[ largest := i ] DO SKIP OD;
+    INT largest := max nuggets;
+    WHILE sum[ largest ] DO largest -:= 1 OD;
     print( ( "The largest non McNugget number is: "
            , whole( largest, 0 )
            , newline

Task/McNuggets-problem/Ada/mcnuggets-problem.ada

@@ -1,24 +0,0 @@
-with Ada.Text_IO; use Ada.Text_IO;
-
-procedure McNugget is
-   Limit : constant                      := 100;
-   List  : array (0 .. Limit) of Boolean := (others => False);
-   N     : Integer;
-begin
-   for A in 0 .. Limit / 6 loop
-      for B in 0 .. Limit / 9 loop
-         for C in 0 .. Limit / 20 loop
-            N := A * 6 + B * 9 + C * 20;
-            if N <= 100 then
-               List (N) := True;
-            end if;
-         end loop;
-      end loop;
-   end loop;
-   for N in reverse 1 .. Limit loop
-      if not List (N) then
-         Put_Line ("The largest non McNugget number is:" & Integer'Image (N));
-         exit;
-      end if;
-   end loop;
-end McNugget;

Task/McNuggets-problem/Arturo/mcnuggets-problem.arturo

@@ -1,5 +1,5 @@
 nonMcNuggets: function [lim][
-    result: new 0..lim
+    result: @ 0..lim
 
     loop range.step:6 1 lim 'x [
         loop range.step:9 1 lim 'y [

Task/McNuggets-problem/COBOL/mcnuggets-problem.cobol

@@ -1,35 +0,0 @@
-       IDENTIFICATION DIVISION.
-       PROGRAM-ID.  MCNUGGETS.
-
-       DATA DIVISION.
-       WORKING-STORAGE SECTION.
-       01 NUGGETS.
-          03 NUGGET-FLAGS     PIC X OCCURS 100 TIMES.
-             88 IS-NUGGET     VALUE 'X'.
-
-       01 A                   PIC 999.
-       01 B                   PIC 999.
-       01 C                   PIC 999.
-
-       PROCEDURE DIVISION.
-       BEGIN.
-           MOVE SPACES TO NUGGETS.
-           PERFORM A-LOOP VARYING A FROM 0 BY 6
-               UNTIL A IS GREATER THAN 100.
-           MOVE 100 TO A.
-
-       FIND-LARGEST.
-           IF IS-NUGGET(A), SUBTRACT 1 FROM A, GO TO FIND-LARGEST.
-           DISPLAY 'Largest non-McNugget number: ', A.
-           STOP RUN.
-
-       A-LOOP.
-           PERFORM B-LOOP VARYING B FROM A BY 9
-               UNTIL B IS GREATER THAN 100.
-
-       B-LOOP.
-           PERFORM C-LOOP VARYING C FROM B BY 20
-               UNTIL C IS GREATER THAN 100.
-
-       C-LOOP.
-           IF C IS NOT EQUAL TO ZERO, MOVE 'X' TO NUGGET-FLAGS(C).

Task/McNuggets-problem/EasyLang/mcnuggets-problem.easy

@@ -1,17 +1,12 @@
 len l[] 100
-for a = 0 to 100 div 6
-   for b = 0 to 100 div 9
-      for c = 0 to 100 div 20
-         n = a * 6 + b * 9 + c * 20
-         if n >= 1 and n <= 100
-            l[n] = 1
-         .
+for a = 0 step 6 to 100
+   for b = 0 step 9 to 100
+      for c = 0 step 20 to 100
+         n = a + b + c
+         if n >= 1 and n <= 100 : l[n] = 1
       .
    .
 .
-for n = 100 downto 1
-   if l[n] = 0
-      print n
-      break 1
-   .
-.
+n = 100
+while l[n] <> 0 : n -= 1
+print n

Task/McNuggets-problem/PowerShell/mcnuggets-problem.psh

@@ -1,18 +0,0 @@
-$possible = @{}
-For ($i=0; $i -lt 18; $i++) {
-  For ($j=0; $j -lt 13; $j++) {
-    For ( $k=0; $k -lt 6; $k++ ) {
-      $possible[ $i*6 + $j*9 + $k*20 ] = $true
-    }
-  }
-}
-
-For ( $n=100; $n -gt 0; $n-- ) {
-  If ($possible[$n]) {
-    Continue
-  }
-  Else {
-    Break
-  }
-}
-Write-Host "Maximum non-McNuggets number is $n"