I have been trying to solve [this](https://www.google.co.in/url?sa=t&rct=j&q=&esrc=s&source=web&cd=1&cad=rja&uact=8&ved=0ahUKEwjRodGi9t7UAhXMKY8KHVyPCZIQFggqMAA&url=https%3A%2F%2Fwww.codechef.com%2Fproblems%2FAMXOR&usg=AFQjCNGfYjKhHz1N_IIXUzcaDHMDvlimUw) on Codechef for some days but i donot find [editorial](http://discuss.codechef.com/problems/AMXOR) pretty clear ...↵
↵
↵
** The problem statement goes as follows **↵
Chef has a sequence of N positive integers { a1, a2, a3, ... aN }. The Sous Chef wants to choose another sequence of N non-negative integers { b1, b2, b3, ... bN } such that↵
↵
The bitwise xor sum of these 2 sequences is equal↵
i.e, a1 ^ a2 ^ a3 ^ ... aN = b1 ^ b2 ^ b3 ^ ... bN↵
for each i, bi ≤ ai.↵
↵
↵
** I am not getting how to avoid recounting of subsequences or to be more precise what does "one" or "zero" denote in editorial...so if someone could provide example to explain this(though there are few comments on editorial page but still if somebody can explain it better . **↵
...↵
please donot downvote it , I really want to solve this problem...↵
thanks in advance↵
↵
↵
** The problem statement goes as follows **↵
Chef has a sequence of N positive integers { a1, a2, a3, ... aN }. The Sous Chef wants to choose another sequence of N non-negative integers { b1, b2, b3, ... bN } such that↵
↵
The bitwise xor sum of these 2 sequences is equal↵
i.e, a1 ^ a2 ^ a3 ^ ... aN = b1 ^ b2 ^ b3 ^ ... bN↵
for each i, bi ≤ ai.↵
↵
↵
** I am not getting how to avoid recounting of subsequences or to be more precise what does "one" or "zero" denote in editorial...so if someone could provide example to explain this(though there are few comments on editorial page but still if somebody can explain it better . **↵
...↵
please donot downvote it , I really want to solve this problem...↵
thanks in advance↵
