IN
0 1 1 0 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 0 1 0 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 0 0 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 1 0 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 0 1 0 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 0 0 1 0
OUT
1 1 1 0 0 0 0

IN
1 1 1 0 0 0 1
OUT
1 1 1 0 0 0 0

My program gives correct answer for the above tests. But I am getting wrong answer for
Test 35 :(  More tests please!

the bits are ordered like this:

1, 2, 3, 4, (2^3^4), (1^3^4), (1^2^4)

and not:

1, 2, 3, 4, (1^2^4), (1^3^4), (2^3^4)

good luck.

Edited by author 25.09.2011 20:53

I don't think that, because if we take x^0, x=0 or x=1, so we have always 1!

Edited by author 02.10.2011 19:27

Edited by author 02.10.2011 19:28

The seven numbers:
a[1] a[2] a[3] a[4] a[5] a[6] a[7]
a[5]:=(a[2]+a[3]+a[4]) mod 2
a[6]:=(a[1]+a[3]+a[4]) mod 2
a[7]:=(a[1]+a[2]+a[4]) mod 2

May it help you.

Good lucky