nAuTahn / Fast-Fourier-Transform-FFT Public

Notifications You must be signed in to change notification settings
Fork 0
Star 5

Generating function - Polynomials - Multiply polynomials - FFT/NTT

5 stars 0 forks Branches Tags Activity

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 21 Commits
FFT - NTT		FFT - NTT
Generating Function		Generating Function
Notes		Notes
Polynomial - Complex Numbers - RUF theorem		Polynomial - Complex Numbers - RUF theorem
Support		Support
README.md		README.md

Repository files navigation

Fast-Fourier-Transform-FFT

Hàm sinh - Đa thức - Nhân đa thức

Cơ sở lý thuyết

Codeforces: https://codeforces.com/blog/entry/43499
CP Algorithms: https://cp-algorithms.com/algebra/fft.html
Art of Problem Solving: https://artofproblemsolving.com/wiki/index.php/Polynomial

Exercises

Part 1: https://codeforces.com/blog/entry/77468
Part 2: https://codeforces.com/blog/entry/77551

About

Generating function - Polynomials - Multiply polynomials - FFT/NTT

competitive-programming codeforces lagrange-interpolation fft-algorithm generating-functions primitive-root-mod-n polynomial-fft fft-ntt

Report repository

Releases

No releases published

Packages

No packages published

Languages

C++ 100.0%