Data update

Task/McNuggets-problem/Applesoft-BASIC/mcnuggets-problem.basic

@@ -0,0 +1,13 @@
+100 dim nuggets(100)
+110 for six = 0 to 100/6
+120  for nine = 0 to 100/9
+130   for twenty = 0 to 100/20
+140    n = six*6+nine*9+twenty*20
+150    if n <= 100 then nuggets(n) = 1
+160   next twenty
+170  next nine
+180 next six
+190 for n = 100 to 1 step -1
+200  if nuggets(n) <> 1 then print "Maximum non-McNuggets number is: ";n : goto 250
+240 next n
+250 end

Task/McNuggets-problem/Asymptote/mcnuggets-problem.asymptote

@@ -0,0 +1,19 @@
+bool[] n;
+for(int i = 0; i <= 100; ++i) { n[i] = false; }
+int k;
+
+for (int a = 0; a < 100/6; ++a) {
+  for (int b = 0; b < 100/9; ++b) {
+    for (int c = 0; c < 100/20; ++c) {
+      k = a*6 + b*9 + c*20;
+      if (k <= 100) { n[k] = true; }
+    }
+  }
+}
+
+for (int k = 100; k >= 0; --k) {
+  if (n[k] != true) {
+    write("Maximum non-McNuggets number is: ", k);
+    break;
+  }
+}

Task/McNuggets-problem/BASIC256/mcnuggets-problem.basic

@@ -0,0 +1,18 @@
+arraybase 1
+dim nuggets(100)
+
+for six = 0 To 100/6
+	for nine =  0 To 100/9
+		for twenty = 0 To 100/20
+			n = six*6 + nine*9 + twenty*20
+			if n <= 100 then nuggets[n] = true
+		next twenty
+	next nine
+next six
+
+for n = 100 to 1 step -1
+	if nuggets[n] = false then
+		print "Maximum non-McNuggets number is: "; n
+		exit for
+	end if
+next n

Task/McNuggets-problem/C++/mcnuggets-problem.cpp

@@ -0,0 +1,25 @@
+#include <cstdint>
+#include <iostream>
+#include <vector>
+
+void mcnuggets(int32_t limit) {
+    std::vector<bool> mcnuggets_numbers(limit + 1, false);
+    for ( int32_t small = 0; small <= limit; small += 6 ) {
+        for ( int32_t medium = small; medium <= limit; medium += 9 ) {
+            for ( int32_t large = medium; large <= limit; large += 20 ) {
+            	mcnuggets_numbers[large] = true;
+            }
+        }
+    }
+
+    for ( int32_t i = limit; i >= 0; --i ) {
+        if ( ! mcnuggets_numbers[i] ) {
+            std::cout << "Maximum non-McNuggets number is " << i << std::endl;
+            return;
+        }
+    }
+}
+
+int main() {
+	mcnuggets(100);
+}

Task/McNuggets-problem/Chipmunk-Basic/mcnuggets-problem.basic

@@ -0,0 +1,16 @@
+100 dim nuggets(100)
+110 for six = 0 to 100/6
+120  for nine = 0 to 100/9
+130   for twenty = 0 to 100/20
+140    n = six*6+nine*9+twenty*20
+150    if n <= 100 then nuggets(n) = 1
+160   next twenty
+170  next nine
+180 next six
+190 for n = 100 to 1 step -1
+200  if nuggets(n) <> 1 then
+210   print "Maximum non-McNuggets number is: ";n
+220   end
+230  endif
+240 next n
+250 end

Task/McNuggets-problem/Minimal-BASIC/mcnuggets-problem.basic

@@ -0,0 +1,17 @@
+10 DIM N(100) : rem  10 ARRAY N for Quite BASIC
+20 FOR A = 0 TO 100/6
+30  FOR B = 0 TO 100/9
+40   FOR C = 0 TO 100/20
+50    LET K = A*6+B*9+C*20
+60    IF K <= 100 THEN 80
+70    GOTO 90
+80    LET N(K) = 1
+90   NEXT C
+100  NEXT B
+110 NEXT A
+120 FOR K = 100 TO 1 STEP -1
+130  IF N(K) <> 1 THEN 160
+140 NEXT K
+150 STOP
+160 PRINT "Maximum non-McNuggets number is: "; K
+170 END

Task/McNuggets-problem/PureBasic/mcnuggets-problem.basic

@@ -0,0 +1,24 @@
+OpenConsole()
+Define n.i
+Dim nuggets.i(100)
+
+For six.i = 0 To 100/6
+  For nine.i =  0 To 100/9
+    For twenty.i = 0 To 100/20
+      n = six*6 + nine*9 + twenty*20
+      If n <= 100
+        nuggets(n) = #True
+      EndIf
+    Next twenty
+  Next nine
+Next six
+
+For n = 100 To 1 Step -1
+  If nuggets(n) = #False
+    PrintN("Maximum non-McNuggets number is: " + Str(n))
+    Break
+  EndIf
+Next n
+
+PrintN(#CRLF$ + "Press ENTER to exit"): Input()
+CloseConsole()

Task/McNuggets-problem/Run-BASIC/mcnuggets-problem.basic

@@ -0,0 +1,17 @@
+dim nuggets(100)
+
+for six = 0 to 100/6
+    for nine =  0 to 100/9
+        for twenty = 0 to 100/20
+            n = six*6 + nine*9 + twenty*20
+            if n <= 100 then nuggets(n) = 1
+        next twenty
+    next nine
+next six
+
+for n = 100 to 1 step -1
+    if nuggets(n) <> 1 then
+        print "Maximum non-McNuggets number is: "; n
+        end
+    end if
+next n

Task/McNuggets-problem/XBasic/mcnuggets-problem.basic

@@ -0,0 +1,23 @@
+PROGRAM	"McNuggets problem"
+VERSION	"0.0000"
+
+DECLARE FUNCTION  Entry ()
+
+FUNCTION  Entry ()
+DIM N[100]
+
+FOR A = 0 TO 100/6
+ FOR B = 0 TO 100/9
+  FOR C = 0 TO 100/20
+    K = A*6+B*9+C*20
+   IF K <= 100 THEN N[K] = 1
+  NEXT C
+ NEXT B
+NEXT A
+
+FOR K = 100 TO 1 STEP -1
+ IF N[K] <> 1 THEN PRINT "Maximum non-McNuggets number is: "; K : EXIT FOR
+NEXT K
+
+END FUNCTION
+END PROGRAM

Task/McNuggets-problem/Yabasic/mcnuggets-problem.basic

@@ -0,0 +1,17 @@
+dim nuggets(100)
+
+for six = 0 to 100/6
+	for nine =  0 to 100/9
+		for twenty = 0 to 100/20
+			n = six*6 + nine*9 + twenty*20
+			if n <= 100  nuggets(n) = true
+        next twenty
+    next nine
+next six
+
+for n = 100 to 1 step -1
+	if nuggets(n) = false then
+		print "Maximum non-McNuggets number is: ", n
+		break
+    end if
+next n