PrevNext
Has Not Appeared
 0/7

Introduction to Fast Fourier Transform

Author: Benjamin Qi

Quickly multiplying polynomials

StatusSourceProblem NameDifficultyTagsSolution
YSEasyView Solution
YSNormalView Solution

Tutorial

Solution - Convolution Mod

Resources
Benq

Solution - Convolution Mod 109+710^9+7

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 NameDifficultyTagsSolution
KattisEasyView Solution
KattisNormalView Solution
KattisVery HardShow Sketch

On a Tree

StatusSourceProblem NameDifficultyTagsSolution
YSHard
Show Tags

Centroid, FFT

View Solution
DMOJVery Hard
Show Tags

Centroid, FFT

Check DMOJ

Module Progress:

Give Us Feedback on Introduction to Fast Fourier Transform!

PrevNext