My own competitive programming library designed to be used in both presential contests, like ICPC, or online platforms such as Codeforces, AtCoder, etc...

Some notes about the implementations:

• Each implementation should be self-contained, so once you typed or copied there is no need to look for other files, the only "template" you need is :

  #include<bits/stdc++.h>
  using namespace std;

• Should be as short as possible, as you may have to type it in a presential contest

You can find a little explanation about each algorithm at the PDF Notebook

• Segtree Dynamic

  • segtree rsq psu (dynamic)
  • segtree rmaxq pmaxu (dynamic)

• Segtree Point Update (Bottom Up)

  • query max subarray sum
  • struct
  • query min
  • query sum

• Segtree Point Update (Top Down)

  • struct
  • query hash
  • query sum

• Segtree Range Update (Bottom Up)

  • increment update query sum

• Segtree Range Update (Top Down)

  • segtree PA
  • struct
  • set and increment update sum query
  • increment update max query

• Sqrt_Decomposition

  • two sequence queries

• bitree 2d

• bitree

• convex hull trick

• disjoint sparse table

• dsu

• lichao tree dynamic

• merge sort tree

• ordered set gnu pbds

• prefix sum 2d

• sparse table

• Digits

  • no consecutive equal
  • sum digits divisible by d
  • product of digits less equal than k
  • no 13 and 4 as substr
  • number divisible by sum of digits
  • longest increasing subsequence

• binary knapsack (bottom up)

• binary knapsack (top down)

• edit distance

• kadane

• knapsack with quantity (no recover)

• longest increasing subsequence

• money sum bottom up

• tsp

• binary to gray
• closest value greater than
• get permutation cycles
• hanoi tower
• meet in the middle
• mos algorithm
• ternary search recursive
• to any base

• check point inside triangle
• convex hull
• determinant
• equals
• line
• point struct and utils (2d)
• polygon lattice points
• segment intersection
• segment
• template line
• template point
• template segment

• Flow Problems

  • maximum flow (dinic)
  • minimum cut (unweighted)
  • maximum flow (edmonds karp)
  • minimum cost flow

• 2 SAT

• Cycle Distances

• SCC (struct)

• bellman ford (find negative cycle)

• bellman ford

• bfs 01

• biconnected components

• binary lifting

• block cut tree

• check bipartite

• dijkstra (k shortest paths)

• dijkstra (restore path)

• disjoint edge paths (maxflow)

• euler path (directed)

• euler path (undirected)

• extra edges to make digraph fully strongly connected

• find articulation points

• find bridge tree components

• find bridges (online)

• find bridges

• find centroid

• floyd warshall

• functional graph

• graph cycle (directed)

• graph cycle (undirected)

• heavy light decomposition

• kruskal

• lowest common ancestor (binary lifting)

• lowest common ancestor (sparse table)

• prim

• shortest path with k edges

• small to large

• successor graph (struct)

• sum every node distance

• topological sorting (kahn)

• topological sorting (tarjan)

• tree diameter (dp)

• tree isomorphism (not rooted)

• tree isomorphism (rooted)

• tree maximum distances

• GCD
• LCM
• arithmetic progression sum
• binomial mod
• binomial
• chinese remainder theorem
• derangement
• euler phi (in range)
• euler phi
• factorial factorization
• factorization (Pollard)
• factorization
• fast pow
• fft convolution
• find multiplicative inverse
• find solution diophantine equation
• gauss elimination
• gauss xor
• integer mod
• integer partition
• linear recurrence
• list n elements choose k
• matrix exponentiation
• ntt int convolution and exp
• ntt int convolution two mods
• polyominoes
• power sum
• sieve list primes

• bigint
• integer mod
• matrix

• count distinct anagrams
• double hash range query
• hash big mod
• hash range query
• hash ull
• kth digit in digit string
• longest palindrome substring (manacher)
• longest palindrome
• rabin karp
• suffix array
• suffix automaton (complete)
• trie
• z function get occurence positions

• Thalisson's Library

• Macacário

• KACTL ICPC Code Library

• PauloMiranda98's Library

• SSRS lib

• IME algoritmos

• UFMG Library

• TEP

• UnBalloon

• Algorithms for Competitive Programming

• Neps Academy

• USACO Guide

• Competitive Programing Book

• Competitive Programmer's Handbook