| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | Dominater069 | 154 |
| 8 | awoo | 154 |
| 10 | luogu_official | 150 |
Help with problem involving bitmasking and SOS dp .
I was solving this problem https://www.codechef.com/problems/COVERING and sort of came with a subproblem which I am not sure if it helps to solve the original problem but seems very interesting anyways.
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 can one solve this for N <= 20 .
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| 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) |
