generating 2D bit array variants with specific algorythm

[Joel Goldstick]

On Fri, Nov 7, 2014 at 10:39 AM, Robert Voigtländer
<r.voigtlaender at gmail.com> wrote:
> Hi,
>
> I need to generate all variants of a 2D array with variable dimension sizes which fit a specific rule. (up to 200*1000)
>
> The rules are:
> - Values are only 0 or 1
> - the sum of each line bust be 1
> - only valid results must be generated (generating all and only returning the valid results takes to long; that's what I tried already)
>
> So for a 2x2 array these would be the valid results:
>
> 10
> 01
>
> 01
> 10
>
> 10
> 10
>
> 01
> 01
>
>
> Must be possible with nested loops and a counter per line. But I don't get it.
>
> Can someone help?

is this valid:
1011
What I mean is do you throw away the carry or does each row have only one zero?

>
> Thanks
> Robert
> --
> https://mail.python.org/mailman/listinfo/python-list



-- 
Joel Goldstick
http://joelgoldstick.com