Random problem.

Правка en2, от Len, 2017-07-04 16:14:28

Given array a of length 1 ≤ n ≤ 44, 0 ≤ 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.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en2 Английский Len 2017-07-04 16:14:28 14
en1 Английский Len 2017-07-04 16:12:47 228 Initial revision (published)