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 | 3985 |
2 | jiangly | 3741 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3489 |
7 | Radewoosh | 3483 |
8 | Kevin114514 | 3442 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | atcoder_official | 162 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | nor | 150 |
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