Help with problem involving bitmasking and SOS dp .
Difference between en2 and en3, changed 46 character(s)
I was solving this problem https://www.codechef.com/problems/COVERING and sort of came with a subproblem which is↵
==================[cut]↵
Given an array A and array B with size (2^N) . ↵
[cut]↵
Compute another array X of size (2^N) such that↵
[cut]↵
X[mask] = sum of (A[i] * B[j]) such that ( (i&j) == mask ) .↵
[cut]↵
How to solve it or is it solvable for N <= 20 .

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en6 English deepkamal 2021-02-06 14:03:35 162
en5 English deepkamal 2021-02-06 11:10:32 167
en4 English deepkamal 2021-02-06 11:09:12 36
en3 English deepkamal 2021-02-06 11:07:41 46
en2 English deepkamal 2021-02-06 11:06:16 7 Tiny change: 'which is\nBelow\n========' -> 'which is\n========'
en1 English deepkamal 2021-02-06 11:05:56 398 Initial revision (published)