Please subscribe to the official Codeforces channel in Telegram via the link: https://t.me/codeforces_official. ×

Len's blog

By Len, history, 17 months ago, In English,

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.

Read more »

 
 
 
 
  • Vote: I like it  
  • +64
  • Vote: I do not like it