Problem
You are given two vectors A and B, for each 1 <= k <= 2*N
we want to find out C[k] where C[k] is sum of all A[i]*B[j]
such that i + j == k
.
Constraints
N <= 1e6
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 166 |
2 | maomao90 | 163 |
2 | Um_nik | 163 |
4 | atcoder_official | 161 |
5 | adamant | 160 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | nor | 153 |
9 | Dominater069 | 153 |
You are given two vectors A and B, for each 1 <= k <= 2*N
we want to find out C[k] where C[k] is sum of all A[i]*B[j]
such that i + j == k
.
N <= 1e6
Name |
---|
Auto comment: topic has been updated by Misa-Misa (previous revision, new revision, compare).
its just FFT bro