Random problem.

Revision en1, by Len, 2017-07-04 16:12:47

Given array a of length n ≤ 44, ai ≤ 244. Calculate di = number of subsets that their xor has i '1' bits.
I think this is a meet-in-the-middle problem but I couldn't solve it, so I need help.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English Len 2017-07-04 16:14:28 14
en1 English Len 2017-07-04 16:12:47 228 Initial revision (published)