Skip to content

Nafyaz/IUT_slowFourierTransform

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

38 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Data Structure

  • Merge Sort Tree
  • Palindromic Tree
  • DSU
  • Binary Trie
  • RMQ
  • 2D BIT
  • Segtree
  • Persistent Segtree
  • Implicit Segtree

Offline Querying

  • Mo's + with update algorithm
  • Divide and Conquer LIFO

Graph

  • Hungarian : Flow diye kora jabe
  • Dominator Tree : Very Obscure, never used
  • Bridge Tree
  • Block cut Tree
  • Edge Euler Tour
  • HLD
  • MCMF
  • Flow (dinic)
  • Centroid Decomposition
  • LCA // LCA O(1)
  • SCC
  • 2Sat : Can write on my own if needed, obscure

Dp optimization

  • SOS
  • CHT
  • Divide and conquer
  • knuth
  • Li chao tree

Math

  • Mobius Function
  • Matrix Expo : Can write if needed
  • FFT
  • NTT
  • FFT anymod
  • Walsh hadamart
  • gaussian elimination : obscure, not needed generally, can write if emergency
  • Combi
  • CRT + egcd
  • Linear Sieve
  • Pollar Rho
  • Xor Basis
  • Lagrange interpolation
  • Subset-Convolution
  • Barlekamp Massey
  • Adaptive Simpsions
  • Fractional Binary saerch

Geometry

  • Everything from Anachor: half plane, intersecting segments, covering circles baad

String

  • Manchers
  • Z algo
  • Kmp
  • Suffix Array
  • double hash
  • Aho corasick
  • suffix atuomata

Misc

  • Order Set
  • All headers
  • debug template : updated

Formula

  • Derangement
  • Picks theorem

Tools /Builids

  • Stresstester script
  • .vimrc

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Contributors 3

  •  
  •  
  •  

Languages