Help with problem involving bitmasking and SOS dp .

Правка en2, от deepkamal, 2021-02-06 11:06:16

I was solving this problem https://www.codechef.com/problems/COVERING and sort of came with a subproblem which is

Given an array A and array B with size (2^N) . Compute another array X of size (2^N) such that X[mask] = sum of (A[i] * B[j]) such that ( (i&j) == mask ) . How to solve it or is it solvable for N <= 20 .

Теги #doubt, #bitmasks, #sos

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en6 Английский deepkamal 2021-02-06 14:03:35 162
en5 Английский deepkamal 2021-02-06 11:10:32 167
en4 Английский deepkamal 2021-02-06 11:09:12 36
en3 Английский deepkamal 2021-02-06 11:07:41 46
en2 Английский deepkamal 2021-02-06 11:06:16 7 Tiny change: 'which is\nBelow\n========' -> 'which is\n========'
en1 Английский deepkamal 2021-02-06 11:05:56 398 Initial revision (published)