https://www.codechef.com/viewsolution/30590410

Please rectify this code…and tell where i gone wrong.

Bro Can you tell me what it will calculate:

c[j]=a[j]+b[i];

{c[i]%2==0?count++:odd++;}

what is c[i] symbolizing?

c[n] is the sequence after adding the query(b[q]) to the sequence a[n]… and after that getting the even and odd from the sequence c[n]

can you specify even and odd ?

how are you counting the number of set bits for each element??

U need to realize that odd + odd = even; even + odd = odd; even + even = even

as in the number of set bits for each number

counting how many numbERS are even with count and odd numbers by odd…then print according to that

The question is you have to print No. of elements with even no. of 1’s and odd no. 1’s.

->1’s in the binary representation of the number which is the result of XOR of the elements of two input arrays

U need to solve this problem in O(t(n+q))

We can achieve this by counting the set bits for each element using the __builtin_popcount() function

maintain 4 variables aodd, aeven, qodd, qeven;

then if a num in a has even set bits ++aeven; and so on n+q times

then print aeven*qeven+aodd*qodd for no of elements with even and print aodd*qeven + aeven*qodd

@anon56072145

bro please read the problem again and dry run the test case on the paper then you will surely get what i am saying!