PrevNext
Has Not Appeared
 0/8

Introduction to Fast Fourier Transform

Author: Benjamin Qi

Quickly multiplying polynomials

StatusSourceProblem NameDifficultyTagsSolutionURL
YSEasyView Solution
YSNormalView Solution

Tutorial

Solution - Convolution Mod

Resources
Benq

Solution - Convolution Mod

Resources
BenqNTT with three different moduli

Note - FFT Killer

The "multiplication with arbitrary modulus" described in cp-algo requires long double to pass.

Problems

StatusSourceProblem NameDifficultyTagsSolutionURL
POIEasyView Solution
KattisEasyView Solution
KattisNormalView Solution
KattisVery HardShow Sketch

On a Tree

StatusSourceProblem NameDifficultyTagsSolutionURL
YSHard
Show Tags

Centroid, FFT

View Solution
DMOJVery Hard
Show Tags

Centroid, FFT

Check DMOJ

Module Progress:

Join the USACO Forum!

Stuck on a problem, or don't understand a module? Join the USACO Forum and get help from other competitive programmers!

Give Us Feedback on Introduction to Fast Fourier Transform!

Leave suggestions for us by making a post on the USACO Forum! Ex: Unclear sections, mislabeled problems, etc.

PrevNext