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

http://qs321.pair.com?node_id=11121912

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

For an especially slow solution, just read 10 bytes from /dev/random and test whether it contains seven 0s and three 1s. If it does, keep it. If it doesn't, discard it and repeat.

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

Replies are listed 'Best First'.
Re^2: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's by Eily (Monsignor) on Sep 18, 2020 at 11:52 UTC
Because of the "unique" requirement, you can add a cache as well, so that it can take a lot of memory as well as time.	[reply]
Re^3: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's by tobyink (Canon) on Sep 18, 2020 at 11:56 UTC
Only takes a lot of memory if you cache the unsuccessful hits. toby döt ink	[reply]

In Section Seekers of Perl Wisdom