27 lines
879 B
Text
27 lines
879 B
Text
---
|
|
id: fft
|
|
title: "Introduction to Fast Fourier Transform"
|
|
author: Benjamin Qi
|
|
prerequisites:
|
|
description: "?"
|
|
frequency: 0
|
|
---
|
|
|
|
## FFT
|
|
|
|
### Tutorial
|
|
|
|
- [cp-algo - FFT](https://cp-algorithms.com/algebra/fft.html)
|
|
- [CSA - FFT and Variations](https://csacademy.com/blog/fast-fourier-transform-and-variations-of-it/)
|
|
- [CF Tutorial Pt 1](http://codeforces.com/blog/entry/43499)
|
|
- [CF Tutorial Pt 2](http://codeforces.com/blog/entry/48798)
|
|
- [CF adamant](http://codeforces.com/blog/entry/55572)
|
|
|
|
### Problems
|
|
|
|
- [K-Inversions](https://open.kattis.com/problems/kinversions)
|
|
- [Big Integer](https://dmoj.ca/problem/bts17p8)
|
|
- [Matchings](https://open.kattis.com/contests/acpc17open/problems/matchings)
|
|
- [Counting Triplets](https://toph.co/p/counting-triplets)
|
|
- [Alien Codebreaking](https://open.kattis.com/problems/aliencodebreaking)
|
|
- base conversion in $O(N\log^2N)$ |