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
→ Pay attention
→ Top rated
| # | User | Rating |
|---|---|---|
| 1 | tourist | 3751 |
| 2 | Benq | 3727 |
| 3 | cnnfls_csy | 3691 |
| 4 | Radewoosh | 3651 |
| 5 | jiangly | 3632 |
| 6 | orzdevinwang | 3559 |
| 7 | -0.5 | 3545 |
| 8 | inaFSTream | 3478 |
| 9 | fantasy | 3468 |
| 10 | Rebelz | 3415 |
→ Top contributors
| # | User | Contrib. |
|---|---|---|
| 1 | adamant | 178 |
| 2 | awoo | 167 |
| 3 | BledDest | 165 |
| 4 | Um_nik | 163 |
| 5 | maroonrk | 162 |
| 6 | SecondThread | 160 |
| 7 | nor | 158 |
| 8 | -is-this-fft- | 154 |
| 9 | kostka | 146 |
| 10 | TheScrasse | 144 |
→ Find user
→ Recent actions
Codeforces (c) Copyright 2010-2023 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/30/2023 11:49:36 (g1).
Desktop version, switch to mobile version.
Supported by
Auto comment: topic has been updated by Misa-Misa (previous revision, new revision, compare).
its just FFT bro