| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 162 |
| 4 | TheScrasse | 160 |
| 5 | nor | 158 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | orz | 146 |
| 9 | pajenegod | 145 |
| 9 | SecondThread | 145 |
Hi -is-this-fft-, yes this is fft.
I'm taking an algorithms class and we did some fft last week. I know it allows us to do polynomial multiplication in nlog(n) (which was what we were talking about) but I'm still a bit confused. If possible, could you give an easy explanation (with a little bit of math though)?
It's better to ask your classmate or professor, as a random codeforces user probably won't know what exactly was taught at your class.
I don't believe there is any "easy" explanation. It will take an entire lecture to teach FFT (I've tried) and there really isn't any reasonable way to make it shorter, especially since I have no idea which part you are confused about. I would basically need to write an entire lecture here and there's no reason to expect I'd do it any better than the various lectures and tutorials that already exist online.
I think these notes explain it pretty well.