My competitive programming library

This library contains the implementation of the algorithms/data structure that are mostly used in competitive programming.

Content

• data structures
  • basic
    • minimum queue
    • minimum stack
  • trees
    • fenwick tree
    • segment tree
• graphs
  • basic
    • BFS
• math
  • functions
    • euler totient
  • fundamentals
    • gcd
    • extended euclidien
    • power modulo
    • matrix power mod
  • modular
    • inverse
    • modulo integer
  • primes
    • factorization
    • miller primality test
    • sieve
• string
  • prefix function
• util
  • mo algorithm
• std (standard cpp library)
  • priority queue
• debug library that helps you to debug your code

notes

• the library is still in its first version.
• some of the algorithms are not tested.

TODO

• add explanatory comments for each algorithm/data structure
• add more algorithm/data structure implemetations

references

• The structure of the files and some algorithms are inspired from cp-algorithms.