Skip to content

Team reference for Competitive Programming. Algorithms implementations very used in the ACM-ICPC contests. Latex template to build your own team reference.

Notifications You must be signed in to change notification settings

ivangalbans/TeamReference

Repository files navigation

ACM-ICPC Team Reference

Team Reference for Programming Competitions (click here)

Compile to pdf

latex -output-format=pdf reference.tex

Contents

Misc

  • Cube

  • Josephus

  • Partition

  • Random

  • Useful

BitMask

  • Amount of Hamiltonian Walks

  • Existence of Hamiltonian Cycle

  • Existence of Hamiltonian Walk

  • Finding the Number of Simple Paths

  • Finding the Shortest Hamiltonian Cycle

  • Number of Hamiltonian Cycles

  • Number of Simple Cycles

  • Shortest Hamiltonian Walk

  • Subset Subset (3^n)

Data Structures

  • AVL Tree

  • Big Integer

  • Binary Heap

  • Binomial Heap

  • Disjoint Set

  • Fenwick Tree (update-range and query index)

  • Fenwick Tree 1D

  • Fenwick Tree 2D

  • Fraction

  • Kd-Tree

  • Longest Common Ancestor. Sparse Table

  • Longest Common Ancestor (rmq)

  • Longest Common Ancestor (sqrt)

  • Longest Common Ancestor (Tarjan)

  • Polynomial

  • Red-Black-Tree

  • Range Minimum Query (SQRT)

  • Range Minimum Query (Fast)

  • Range Minimum Query

  • Range Minimum Sum Segment Query

  • Segment Tree Lazy Propagation

  • Segment Tree-1D Query

  • Segment Tree-2D

  • Splay Tree

  • Treap

  • Treap Implicit Key

  • Trie

Dynamic Programming

  • Convex Hull Trick

  • Longest Increasing Subsequence

  • Matrix Chain

Geometry

  • Basic Operation

  • Circles

  • Closest Pair Points

  • Convex Cut

  • Convex Hull 3D

  • Lines

  • Minkowski

  • Point 3D

  • Polygon Triangulation

  • Rectilinear MST

  • Rotating Calipers

  • Segment Intersect

  • Segments

  • Semiplane Intersection

  • Triangles

Graphs

  • Articulation Point And Bridge

  • Bellman-Ford

  • Biconnected Components

  • Bipartite Matching

  • Centroid Decomposition

  • Dijkstra

  • Dominator Tree

  • Flow with Lower Bound

  • Floyd Warshall

  • Gabow Edmonds

  • Gomory hu Tree

  • Hopcroft Karp

  • Hungarian

  • Kruskal

  • Max Flow Dinic

  • Max Flow push relabel

  • Min Cost Max Flow

  • Prim

  • Satisfiability Two SAT

  • Strongly Connected Components

  • SCC Gabow

  • Stoer Wagner

  • Tree Isomorphism

Matrix

  • Gauss

  • Gauss Modulo 2

  • Matrix Template

Number Theory

  • Binomial Coefficient

  • Divisibility

  • ALL Number Theory

  • Prime

  • Tree Stern-Brocot

Numeric Methods

  • Fast Fourier Transform

  • Goldsection Search

  • Linear Recursion

  • Romberg

  • Roots Newton

  • Simplex

  • Simpson

Parsing

  • Shunting Yard

Sorting-Searching

  • Ternary Searh

String

  • Aho Corasick

  • Knuth-Morris-Pratt

  • Longest Common Subsequence

  • Longest Palindrome Substring

  • Manacher

  • Maximal Suffix

  • Minimum Rotation

  • Palindromic Tree

  • Substring Palindrome

  • Suffix Array

  • Suffix Automaton

  • Z Function