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 | 3843 |
2 | jiangly | 3705 |
3 | Benq | 3628 |
4 | orzdevinwang | 3571 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | jqdai0815 | 3530 |
8 | ecnerwala | 3499 |
9 | gyh20 | 3447 |
10 | Rebelz | 3409 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 163 |
3 | adamant | 162 |
4 | TheScrasse | 158 |
5 | nor | 153 |
5 | maroonrk | 153 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
9 | orz | 145 |
10 | pajenegod | 144 |
Help Required!!
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 |
---|