McNuggets problem: Difference between revisions
m (→List monad) |
(→Python List monad: (enumFromTo -> enumFromThenTo)) |
||
| Line 835: | Line 835: | ||
Note that the innermost function wraps its results in a (potentially empty) list. The resulting list of lists, some empty, is then flattened by the concatenation component of '''bind'''. |
Note that the innermost function wraps its results in a (potentially empty) list. The resulting list of lists, some empty, is then flattened by the concatenation component of '''bind'''. |
||
<lang python>'''mcNuggets list monad''' |
|||
| ⚫ | |||
| ⚫ | |||
def main(): |
def main(): |
||
'''List monad equivalent of the list (or set) comprehension.''' |
'''List monad equivalent of the list (or set) comprehension.''' |
||
def size(n): |
def size(n): |
||
return |
return enumFromThenTo(0)(n)(100) |
||
mcNuggets = set( |
mcNuggets = set( |
||
bind(size(6))( |
bind(size(6))( |
||
lambda x: |
|||
bind(size( |
bind(size(9))( |
||
lambda y: |
|||
bind(size(20))( |
|||
lambda z: ( |
|||
lambda v=sum([x, y, z]): ( |
|||
| ⚫ | |||
[v] if 101 > v else [] |
|||
) |
|||
| ⚫ | |||
) |
) |
||
| Line 885: | Line 891: | ||
list(range(m, 1 + n, next - m)) |
list(range(m, 1 + n, next - m)) |
||
) |
) |
||
# enumFromTo :: (Int, Int) -> [Int] |
|||
def enumFromTo(m): |
|||
'''Integer enumeration from m to n.''' |
|||
return lambda n: list(range(m, 1 + n)) |
|||
Revision as of 23:24, 18 March 2019
You are encouraged to solve this task according to the task description, using any language you may know.
From Wikipedia:
The McNuggets version of the coin problem was introduced by Henri Picciotto, who included it in his algebra textbook co-authored with Anita Wah. Picciotto thought of the application in the 1980s while dining with his son at McDonald's, working the problem out on a napkin. A McNugget number is the total number of McDonald's Chicken McNuggets in any number of boxes. In the United Kingdom, the original boxes (prior to the introduction of the Happy Meal-sized nugget boxes) were of 6, 9, and 20 nuggets.
- Task
Calculate (from 0 up to a limit of 100) the largest non-McNuggets number (a number n which cannot be expressed with 6x + 9y + 20z = n where x, y and z are natural numbers).
Ada
<lang Ada>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;</lang>
- Output:
The largest non McNugget number is: 43
ALGOL 68
<lang algol68>BEGIN
# Solve the McNuggets problem: find the largest n <= 100 for which there #
# are no non-negative integers x, y, z such that 6x + 9y + 20z = n #
INT max nuggets = 100;
[ 0 : max nuggets ]BOOL sum;
FOR i FROM LWB sum TO UPB sum DO sum[ i ] := FALSE OD;
FOR x FROM 0 BY 6 TO max nuggets DO
FOR y FROM 0 BY 9 TO max nuggets DO
FOR z FROM 0 BY 20 TO max nuggets DO
INT nuggets = x + y + z;
IF nuggets <= max nuggets THEN sum[ nuggets ] := TRUE FI
OD # z #
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 largest := i; sum[ i ] DO SKIP OD;
print( ( "The largest non McNugget number is: "
, whole( largest, 0 )
, newline
)
)
END</lang>
- Output:
The largest non McNugget number is: 43
AppleScript
Generalised for other set sizes, and for other triples of natural numbers. Uses NSMutableSet, through the AppleScript ObjC interface: <lang applescript>use AppleScript version "2.4" use framework "Foundation" use scripting additions
on run
set setNuggets to mcNuggetSet(100, 6, 9, 20)
script isMcNugget
on |λ|(x)
setMember(x, setNuggets)
end |λ|
end script
set xs to dropWhile(isMcNugget, enumFromThenTo(100, 99, 1))
set setNuggets to missing value -- Clear ObjC pointer value
if 0 < length of xs then
item 1 of xs
else
"No unreachable quantities in this range"
end if
end run
-- mcNuggetSet :: Int -> Int -> Int -> Int -> ObjC Set on mcNuggetSet(n, mcx, mcy, mcz)
set upTo to enumFromTo(0)
script fx
on |λ|(x)
script fy
on |λ|(y)
script fz
on |λ|(z)
set v to sum({mcx * x, mcy * y, mcz * z})
if 101 > v then
{v}
else
{}
end if
end |λ|
end script
concatMap(fz, upTo's |λ|(n div mcz))
end |λ|
end script
concatMap(fy, upTo's |λ|(n div mcy))
end |λ|
end script
setFromList(concatMap(fx, upTo's |λ|(n div mcx)))
end mcNuggetSet
-- GENERIC FUNCTIONS ----------------------------------------------------
-- concatMap :: (a -> [b]) -> [a] -> [b] on concatMap(f, xs)
set lng to length of xs
set acc to {}
tell mReturn(f)
repeat with i from 1 to lng
set acc to acc & |λ|(item i of xs, i, xs)
end repeat
end tell
return acc
end concatMap
-- drop :: Int -> [a] -> [a]
-- drop :: Int -> String -> String
on drop(n, xs)
set c to class of xs
if c is not script then
if c is not string then
if n < length of xs then
items (1 + n) thru -1 of xs
else
{}
end if
else
if n < length of xs then
text (1 + n) thru -1 of xs
else
""
end if
end if
else
take(n, xs) -- consumed
return xs
end if
end drop
-- dropWhile :: (a -> Bool) -> [a] -> [a] -- dropWhile :: (Char -> Bool) -> String -> String on dropWhile(p, xs)
set lng to length of xs
set i to 1
tell mReturn(p)
repeat while i ≤ lng and |λ|(item i of xs)
set i to i + 1
end repeat
end tell
drop(i - 1, xs)
end dropWhile
-- enumFromThenTo :: Int -> Int -> Int -> [Int] on enumFromThenTo(x1, x2, y)
set xs to {}
repeat with i from x1 to y by (x2 - x1)
set end of xs to i
end repeat
return xs
end enumFromThenTo
-- enumFromTo :: Int -> Int -> [Int] on enumFromTo(m)
script
on |λ|(n)
if m ≤ n then
set lst to {}
repeat with i from m to n
set end of lst to i
end repeat
return lst
else
return {}
end if
end |λ|
end script
end enumFromTo
-- foldl :: (a -> b -> a) -> a -> [b] -> a on foldl(f, startValue, xs)
tell mReturn(f)
set v to startValue
set lng to length of xs
repeat with i from 1 to lng
set v to |λ|(v, item i of xs, i, xs)
end repeat
return v
end tell
end foldl
-- Lift 2nd class handler function into 1st class script wrapper -- mReturn :: First-class m => (a -> b) -> m (a -> b) on mReturn(f)
if class of f is script then
f
else
script
property |λ| : f
end script
end if
end mReturn
-- sum :: [Num] -> Num on sum(xs)
script add
on |λ|(a, b)
a + b
end |λ|
end script
foldl(add, 0, xs)
end sum
-- NB All names of NSMutableSets should be set to *missing value* -- before the script exits. -- ( scpt files can not be saved if they contain ObjC pointer values ) -- setFromList :: Ord a => [a] -> Set a on setFromList(xs)
set ca to current application
ca's NSMutableSet's ¬
setWithArray:(ca's NSArray's arrayWithArray:(xs))
end setFromList
-- setMember :: Ord a => a -> Set a -> Bool on setMember(x, objcSet)
missing value is not (objcSet's member:(x))
end setMember</lang>
- Output:
43
C
<lang c>#include <stdio.h>
int main() {
int max = 0, i = 0, sixes, nines, twenties;
loopstart: while (i < 100) {
for (sixes = 0; sixes*6 < i; sixes++) {
if (sixes*6 == i) {
i++;
goto loopstart;
}
for (nines = 0; nines*9 < i; nines++) {
if (sixes*6 + nines*9 == i) {
i++;
goto loopstart;
}
for (twenties = 0; twenties*20 < i; twenties++) {
if (sixes*6 + nines*9 + twenties*20 == i) {
i++;
goto loopstart;
}
}
}
}
max = i;
i++;
}
printf("Maximum non-McNuggets number is %d\n", max);
return 0;
}</lang>
- Output:
Maximum non-McNuggets number is 43
F#
<lang fsharp> // McNuggets. Nigel Galloway: October 28th., 2018 let fN n g = Seq.initInfinite(fun ng->ng*n+g)|>Seq.takeWhile(fun n->n<=100) printfn "%d" (Set.maxElement(Set.difference (set[1..100]) (fN 20 0|>Seq.collect(fun n->fN 9 n)|>Seq.collect(fun n->fN 6 n)|>Set.ofSeq))) </lang>
- Output:
43
Go
<lang go>package main
import "fmt"
func mcnugget(limit int) {
sv := make([]bool, limit+1) // all false by default
for s := 0; s <= limit; s += 6 {
for n := s; n <= limit; n += 9 {
for t := n; t <= limit; t += 20 {
sv[t] = true
}
}
}
for i := limit; i >= 0; i-- {
if !sv[i] {
fmt.Println("Maximum non-McNuggets number is", i)
return
}
}
}
func main() {
mcnugget(100)
}</lang>
- Output:
Maximum non-McNuggets number is 43
Haskell
<lang haskell>import Data.Set (Set, fromList, member)
gaps :: [Int] gaps = dropWhile (`member` mcNuggets) [100,99 .. 1]
mcNuggets :: Set Int mcNuggets =
let size = enumFromTo 0 . quot 100
in fromList $
size 6 >>=
\x ->
size 9 >>=
\y ->
size 20 >>=
\z ->
let v = sum [6 * x, 9 * y, 20 * z]
in [ v
| 101 > v ]
main :: IO () main =
print $ case gaps of x:_ -> show x [] -> "No unreachable quantities found ..."</lang>
Or equivalently, making use of the list comprehension notation: <lang haskell>import Data.Set (Set, fromList, member)
gaps :: [Int] gaps = dropWhile (`member` mcNuggets) [100,99 .. 1]
mcNuggets :: Set Int mcNuggets =
let size n = [0 .. quot 100 n]
in fromList
[ v
| x <- size 6
, y <- size 9
, z <- size 20
, let v = sum [6 * x, 9 * y, 20 * z]
, 101 > v ]
main :: IO () main =
print $ case gaps of x:_ -> show x [] -> "No unreachable quantities found ..."</lang>
43
Java
<lang Java>public class McNuggets {
public static void main(String... args) {
int[] SIZES = new int[] { 6, 9, 20 };
int MAX_TOTAL = 100;
// Works like Sieve of Eratosthenes
int numSizes = SIZES.length;
int[] counts = new int[numSizes];
int maxFound = MAX_TOTAL + 1;
boolean[] found = new boolean[maxFound];
int numFound = 0;
int total = 0;
boolean advancedState = false;
do {
if (!found[total]) {
found[total] = true;
numFound++;
}
// Advance state
advancedState = false;
for (int i = 0; i < numSizes; i++) {
int curSize = SIZES[i];
if ((total + curSize) > MAX_TOTAL) {
// Reset to zero and go to the next box size
total -= counts[i] * curSize;
counts[i] = 0;
}
else {
// Adding a box of this size still keeps the total at or below the maximum
counts[i]++;
total += curSize;
advancedState = true;
break;
}
}
} while ((numFound < maxFound) && advancedState);
if (numFound < maxFound) {
// Did not find all counts within the search space
for (int i = MAX_TOTAL; i >= 0; i--) {
if (!found[i]) {
System.out.println("Largest non-McNugget number in the search space is " + i);
break;
}
}
}
else {
System.out.println("All numbers in the search space are McNugget numbers");
}
return;
}
}</lang>
- Output:
Largest non-McNugget number in the search space is 43
JavaScript
<lang javascript>(() => {
'use strict';
// main :: IO ()
const main = () => {
const
size = n => enumFromTo(0)(
quot(100, n)
),
nuggets = new Set(
bindList(
size(6),
x => bindList(
size(9),
y => bindList(
size(20),
z => {
const v = sum([6 * x, 9 * y, 20 * z]);
return 101 > v ? (
[v]
) : [];
}
),
)
)
),
xs = dropWhile(
x => nuggets.has(x),
enumFromThenTo(100, 99, 1)
);
return 0 < xs.length ? (
xs[0]
) : 'No unreachable quantities found in this range';
};
// GENERIC FUNCTIONS ----------------------------------
// bindList (>>=) :: [a] -> (a -> [b]) -> [b] const bindList = (xs, mf) => [].concat.apply([], xs.map(mf));
// dropWhile :: (a -> Bool) -> [a] -> [a]
const dropWhile = (p, xs) => {
const lng = xs.length;
return 0 < lng ? xs.slice(
until(
i => i === lng || !p(xs[i]),
i => 1 + i,
0
)
) : [];
};
// enumFromThenTo :: Int -> Int -> Int -> [Int]
const enumFromThenTo = (x1, x2, y) => {
const d = x2 - x1;
return Array.from({
length: Math.floor(y - x2) / d + 2
}, (_, i) => x1 + (d * i));
};
// ft :: Int -> Int -> [Int]
const enumFromTo = m => n =>
Array.from({
length: 1 + n - m
}, (_, i) => m + i);
// quot :: Int -> Int -> Int const quot = (n, m) => Math.floor(n / m);
// sum :: [Num] -> Num const sum = xs => xs.reduce((a, x) => a + x, 0);
// until :: (a -> Bool) -> (a -> a) -> a -> a
const until = (p, f, x) => {
let v = x;
while (!p(v)) v = f(v);
return v;
};
// MAIN ---
return console.log(
main()
);
})();</lang>
- Output:
43
J
Brute force solution: calculate all pure (just one kind of box) McNugget numbers which do not exceed 100, then compute all possible sums, and then remove those from the list of numbers up to 100 (which is obviously a McNugget number), then find the largest number remaining:
<lang J> >./(i.100)-.,+/&>{(* i.@>.@%~&101)&.>6 9 20 43</lang>
Technically, we could have used 100 in place of 101 when we were finding how many pure McNugget numbers were in each series (because 100 is obviously a McNugget number), but it's not like that's a problem, either.
Julia
Simple brute force solution, though the BitSet would save memory considerably with larger max numbers. <lang julia>function mcnuggets(max)
b = BitSet(1:max)
for i in 0:6:max, j in 0:9:max, k in 0:20:max
delete!(b, i + j + k)
end
maximum(b)
end
println(mcnuggets(100))
</lang>
- Output:
43
Kotlin
<lang scala>// Version 1.2.71
fun mcnugget(limit: Int) {
val sv = BooleanArray(limit + 1) // all false by default
for (s in 0..limit step 6)
for (n in s..limit step 9)
for (t in n..limit step 20) sv[t] = true
for (i in limit downTo 0) {
if (!sv[i]) {
println("Maximum non-McNuggets number is $i")
return
}
}
}
fun main(args: Array<String>) {
mcnugget(100)
}</lang>
- Output:
Maximum non-McNuggets number is 43
Perl
<lang perl>use ntheory qw/forperm vecall vecmin/;
sub Mcnugget_number {
my $counts = shift;
return 'No maximum' if vecall { 0 == $_%2 } @$counts;
my $min = vecmin @$counts; my @meals; my @min;
my $a = -1;
while (1) {
$a++;
for my $b (0..$a) {
for my $c (0..$b) {
my @s = ($a, $b, $c);
forperm {
$meals[
$s[$_[0]] * $counts->[0]
+ $s[$_[1]] * $counts->[1]
+ $s[$_[2]] * $counts->[2]
] = 1;
} @s;
}
}
for my $i (0..$#meals) {
next unless $meals[$i];
if ($min[-1] and $i == ($min[-1] + 1)) {
push @min, $i;
last if $min == @min
} else {
@min = $i;
}
}
last if $min == @min
}
$min[0] ? $min[0] - 1 : 0
}
for my $counts ([6,9,20], [6,7,20], [1,3,20], [10,5,18], [5,17,44], [2,4,6]) {
print 'Maximum non-Mcnugget number using ' . join(', ', @$counts) . ' is: ' . Mcnugget_number($counts) . "\n"
}</lang>
- Output:
Maximum non-Mcnugget number using 6, 9, 20 is: 43 Maximum non-Mcnugget number using 6, 7, 20 is: 29 Maximum non-Mcnugget number using 1, 3, 20 is: 0 Maximum non-Mcnugget number using 10, 5, 18 is: 67 Maximum non-Mcnugget number using 5, 17, 44 is: 131 Maximum non-Mcnugget number using 2, 4, 6 is: No maximum
Perl 6
No hard coded limits, no hard coded values. General purpose 3 value solver. Count values may be any 3 different positive integers, in any order, that are relatively prime.
Finds the smallest count value, then looks for the first run of consecutive count totals able to be generated, that is at least the length of the smallest count size. From then on, every number can be generated by simply adding multiples of the minimum count to each of the totals in that run.
<lang perl6>sub Mcnugget-number (*@counts) {
return '∞' if 1 < [gcd] @counts;
my $min = [min] @counts; my @meals; my @min;
for ^Inf -> $a {
for 0..$a -> $b {
for 0..$b -> $c {
($a, $b, $c).permutations.map: {
for flat $_ Z* @counts {
@meals[sum $^first, $^second, $^third] = True
}
}
}
}
for @meals.grep: so *, :k {
if @min.tail and @min.tail + 1 == $_ {
@min.push: $_;
last if $min == +@min
} else {
@min = $_;
}
}
last if $min == +@min
}
@min[0] ?? @min[0] - 1 !! 0
}
for (6,9,20), (6,7,20), (1,3,20), (10,5,18), (5,17,44), (2,4,6), (3,6,15) -> $counts {
put "Maximum non-Mcnugget number using {$counts.join: ', '} is: ",
Mcnugget-number(|$counts)
}</lang>
- Output:
Maximum non-Mcnugget number using 6, 9, 20 is: 43 Maximum non-Mcnugget number using 6, 7, 20 is: 29 Maximum non-Mcnugget number using 1, 3, 20 is: 0 Maximum non-Mcnugget number using 10, 5, 18 is: 67 Maximum non-Mcnugget number using 5, 17, 44 is: 131 Maximum non-Mcnugget number using 2, 4, 6 is: ∞ Maximum non-Mcnugget number using 3, 6, 15 is: ∞
Phix
<lang Phix>constant limit=100 sequence nuggets = repeat(false,limit+1) for sixes=0 to limit by 6 do
for nines=sixes to limit by 9 do
for twenties=nines to limit by 20 do
nuggets[twenties+1] = true
end for
end for
end for printf(1,"Maximum non-McNuggets number is %d\n", rfind(false,nuggets)-1)</lang>
- Output:
Maximum non-McNuggets number is 43
Also, since it is a bit more interesting, a
<lang Phix>function Mcnugget_number(sequence counts)
if gcd(counts)>1 then return "No maximum" end if
atom cmin = min(counts)
sequence meals = {}
sequence smin = {}
integer a = -1
while true do
a += 1
for b=0 to a do
for c=0 to b do
sequence s = {a, b, c}
for i=1 to factorial(3) do
sequence p = permute(i,s)
integer k = sum(sq_mul(p,counts))+1
if k>length(meals) then meals &= repeat(0,k-length(meals)) end if
meals[k] = 1
end for
end for
end for
for i=1 to length(meals) do
if meals[i] then
if length(smin) and smin[$]+1=i-1 then
smin = append(smin,i-1)
if length(smin)=cmin then exit end if
else
smin = {i-1}
end if
end if
end for
if length(smin)=cmin then exit end if
end while
return sprintf("%d",iff(smin[1]?smin[1]-1:0))
end function
constant tests = {{6,9,20}, {6,7,20}, {1,3,20}, {10,5,18}, {5,17,44}, {2,4,6}, {3,6,15}} for i=1 to length(tests) do
sequence ti = tests[i]
printf(1,"Maximum non-Mcnugget number using %s is: %s\n",{sprint(ti),Mcnugget_number(ti)})
end for</lang>
- Output:
Maximum non-Mcnugget number using {6,9,20} is: 43
Maximum non-Mcnugget number using {6,7,20} is: 29
Maximum non-Mcnugget number using {1,3,20} is: 0
Maximum non-Mcnugget number using {10,5,18} is: 67
Maximum non-Mcnugget number using {5,17,44} is: 131
Maximum non-Mcnugget number using {2,4,6} is: No maximum
Maximum non-Mcnugget number using {3,6,15} is: No maximum
PicoLisp
<lang PicoLisp>(de nuggets1 (M)
(let Lst (range 0 M)
(for A (range 0 M 6)
(for B (range A M 9)
(for C (range B M 20)
(set (nth Lst (inc C))) ) ) )
(apply max Lst) ) )</lang>
Generator from fiber: <lang PicoLisp>(de nugg (M)
(co 'nugget
(for A (range 0 M 6)
(for B (range A M 9)
(for C (range B M 20)
(yield (inc C)) ) ) ) ) )
(de nuggets2 (M)
(let Lst (range 0 M)
(while (nugg 100)
(set (nth Lst @)) )
(apply max Lst) ) )</lang>
Test versions against each other: <lang PicoLis>(test
T
(=
43
(nuggets1 100)
(nuggets2 100) ) )</lang>
Python
Python: REPL
It's a simple solution done on the command line: <lang python>>>> from itertools import product >>> nuggets = set(range(101)) >>> for s, n, t in product(range(100//6+1), range(100//9+1), range(100//20+1)): nuggets.discard(6*s + 9*n + 20*t)
>>> max(nuggets)
43
>>> </lang>
Single expression version (expect to be slower, however no noticeable difference on a Celeron B820 and haven't benchmarked): <lang python>>>> from itertools import product >>> max(x for x in range(100+1) if x not in ... (6*s + 9*n + 20*t for s, n, t in ... product(range(100//6+1), range(100//9+1), range(100//20+1)))) 43 >>> </lang>
Using Set Comprehension
<lang python>
- Wherein I observe that Set Comprehension is not intrinsically dysfunctional. Nigel Galloway: October 28th., 2018
n = {n for x in range(0,101,20) for y in range(x,101,9) for n in range(y,101,6)} g = {n for n in range(101)} print(max(g.difference(n))) </lang>
- Output:
43
List monad
A composition of pure functions, including dropwhile, which shows a more verbose and unwieldy (de-sugared) route to list comprehension, and reveals the underlying mechanics of what the (compact and elegant) built-in syntax expresses. May help to build intuition for confident use of the latter.
Note that the innermost function wraps its results in a (potentially empty) list. The resulting list of lists, some empty, is then flattened by the concatenation component of bind. <lang python>mcNuggets list monad
from itertools import (chain, count, dropwhile, islice)
def main():
List monad equivalent of the list (or set) comprehension.
def size(n):
return enumFromThenTo(0)(n)(100)
mcNuggets = set(
bind(size(6))(
lambda x:
bind(size(9))(
lambda y:
bind(size(20))(
lambda z: (
lambda v=sum([x, y, z]): (
[v] if 101 > v else []
)
)())))
)
xs = list(dropwhile(
lambda x: x in mcNuggets,
enumFromThenTo(100)(99)(1)
))
print(
xs[0] if xs else 'No unreachable quantities found in this range.'
)
- GENERIC ABSTRACTIONS ------------------------------------
- bind (>>=) :: [a] -> (a -> [b]) -> [b]
def bind(xs):
List monad injection operator.
Two computations sequentially composed,
with any value produced by the first
passed as an argument to the second.
return lambda f: list(
chain.from_iterable(
map(f, xs)
)
)
- enumFromThenTo :: Int -> Int -> Int -> [Int]
def enumFromThenTo(m):
List of integer values enumerated from m to n
with a step defined by nxt-m.
return lambda next: lambda n: (
list(range(m, 1 + n, next - m))
)
if __name__ == '__main__':
main()</lang>
- Output:
43
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*/ if y= | y="," then y= 6 9 20 /*Not specified? Then use the defaults*/ say 'The number of McNuggets in the serving sizes of: ' space(y) $=
- = 0 /*the Y list must be in ascending order*/
z=.
do j=1 for words(y); _= word(y, j) /*examine Y list for dups, neg, zeros*/
if _==1 then signal done /*Value ≡ 1? Then all values possible.*/
if _<1 then iterate /*ignore zero and negative # of nuggets*/
if wordpos(_, $)\==0 then iterate /*search for duplicate values. */
do k=1 for # /* " " multiple " */
if _//word($,k)==0 then iterate j /*a multiple of a previous value, skip.*/
end /*k*/
$= $ _; #= # + 1; $.#= _ /*add─►list; bump counter; assign value*/
end /*j*/
if #<2 then signal done /*not possible, go and tell bad news. */ _= gcd($) if _\==1 then signal done /* " " " " " " " */ if #==2 then z= $.1 * $.2 - $.1 - $.2 /*special case, construct the result. */ if z\==. then signal done h= 0 /*construct a theoretical high limit H.*/
do j=2 for #-1; _= j-1; _= $._; h= max(h, _ * $.j - _ - $.j)
end /*j*/
@.=0
do j=1 for #; _= $.j /*populate the Jth + Kth summand. */
do a=_ by _ to h; @.a= 1 /*populate every multiple as possible. */
end /*s*/
do k=1 for h; if \@.k then iterate
s= k + _; @.s= 1 /*add two #s; mark as being possible.*/
end /*k*/
end /*j*/
do z=h by -1 for h until \@.z /*find largest integer not summed. */
end /*z*/
say done: if z==. then say 'The largest McNuggets number not possible.'
else say 'The largest McNuggets number is: ' z
exit /*stick a fork in it, we're all done. */ /*──────────────────────────────────────────────────────────────────────────────────────*/ gcd: procedure; $=; do j=1 for arg(); $=$ arg(j); end; $= space($)
parse var $ x $; x= abs(x);
do while $\==; parse var $ y $; y= abs(y); if y==0 then iterate
do until y==0; parse value x//y y with y x; end
end; return x</lang>
- output when using the default inputs:
The number of McNuggets in the serving sizes of: 6 9 20 The largest McNuggets number is: 43
Ruby
<lang ruby>def mcnugget(limit)
sv = (0..limit).to_a
(0..limit).step(6) do |s|
(0..limit).step(9) do |n|
(0..limit).step(20) do |t|
sv.delete(s + n + t)
end
end
end
sv.max
end
puts(mcnugget 100)</lang>
- Output:
43
Generic solution, allowing for more or less then 3 portion-sizes: <lang ruby>limit = 100 nugget_portions = [6, 9, 20]
arrs = nugget_portions.map{|n| 0.step(limit, n).to_a } hits = arrs.pop.product(*arrs).map(&:sum) p ((0..limit).to_a - hits).max # => 43</lang>
zkl
<lang zkl>nuggets:=[0..101].pump(List()); // (0,1,2,3..101), mutable foreach s,n,t in ([0..100/6],[0..100/9],[0..100/20])
{ nuggets[(6*s + 9*n + 20*t).min(101)]=0 }
println((0).max(nuggets));</lang>
- Output:
43