Inverse of finding Xor Basis ?

Revision en2, by cantsolvediv2C, 2023-08-12 22:15:37

Hello Codeforces community! Hope you all are doing well.

I need some help with the following question that I had while understanding xor basis.

Given an array A. You need to tell how many arrays B of length n exist that satisfy the following property: For each A[i], a subset of B exist such that its xor is equal to A[i] and 0 <= B[i] < 2^k.

Tags xor basis, linear algebra, gaussian elimination, doubt

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en2 English cantsolvediv2C 2023-08-12 22:15:37 20 Tiny change: 'al to A[i].' -> 'al to A[i] and 0 <= B[i] < 2^k.'
en1 English cantsolvediv2C 2023-08-12 21:05:49 373 Initial revision (published)