McNuggets problem: Difference between revisions
Content added Content deleted
Not a robot (talk | contribs) (Add Modula-2) |
(Added solution for Action!) |
||
Line 29: | Line 29: | ||
<pre> |
<pre> |
||
43 |
43 |
||
</pre> |
|||
=={{header|Action!}}== |
|||
<lang Action!>PROC Main() |
|||
BYTE x,y,z,n |
|||
BYTE ARRAY nuggets(101) |
|||
FOR n=0 TO 100 |
|||
DO |
|||
nuggets(n)=0 |
|||
OD |
|||
FOR x=0 TO 100 STEP 6 |
|||
DO |
|||
FOR y=0 TO 100 STEP 9 |
|||
DO |
|||
FOR z=0 TO 100 STEP 20 |
|||
DO |
|||
n=x+y+z |
|||
IF n<=100 THEN |
|||
nuggets(n)=1 |
|||
FI |
|||
OD |
|||
OD |
|||
OD |
|||
n=100 |
|||
DO |
|||
IF nuggets(n)=0 THEN |
|||
PrintF("The largest non McNugget number is %B%E",n) |
|||
EXIT |
|||
ELSEIF n=0 THEN |
|||
PrintE("There is no result") |
|||
EXIT |
|||
ELSE |
|||
n==-1 |
|||
FI |
|||
OD |
|||
RETURN</lang> |
|||
{{out}} |
|||
[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/McNuggets_problem.png Screenshot from Atari 8-bit computer] |
|||
<pre> |
|||
The largest non McNugget number is 43 |
|||
</pre> |
</pre> |
||