Anonymous user
McNuggets problem: Difference between revisions
m
→{{header|REXX}}: added wording to the REXX section header.
m (→{{header|REXX}}: corrected misspellings.) |
m (→{{header|REXX}}: added wording to the REXX section header.) |
||
Line 53:
=={{header|REXX}}==
This REXX version generalizes the problem (does not depend on fixed meal sizes), and also checks for:
:* a meal that doesn't include McNuggets (in other words, zero nuggets)
:* a meal size that includes a double order of nuggets
:* a meal size that includes a single nugget (which means, no largest McNugget number)
:* excludes meals that have a multiple order of nuggets
:* automatically computes the '''high''' value algebraically instead of using '''100'''.
<lang rexx>/*REXX pgm solves the McNuggets problem: the largest McNugget number for given meals. */
parse arg y /*obtain optional arguments from the CL*/
| |||