Re^2: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's


Clear questions and runnable code get the best and fastest answer
	PerlMonks

Re^2: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

by Tux (Canon)

on Sep 18, 2020 at 12:43 UTC ( [id://11121918]=note: print w/replies, xml )

Need Help??

in reply to Re: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's
in thread Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's

This one ends up somewhere in the middle:

sub tux_for {
    my ($length, $ones) = @_;
    [   map  { substr unpack ("b*", $_), 0, $length }
        grep { $ones == unpack "%32b*" => $_ }
        map  { pack "L<", $_ }
        0 .. oct "0b".join""=> (1) x $ones, (0) x ($length - $ones)
        ];
    }
[download]

Enjoy, Have FUN! H.Merijn