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.
In reply to Re: Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's
by tobyink
in thread Generate all unique combinations of 1 and 0 using specified length of "0"-string and count of 1's
by Lana
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |