algo

The snippets you are asked to code way too often in competitive programming.

Code is intentionally simplified (no references, templates, inheritance, try-catches or stuff like that) so that you do not need to read a 300 pages long book to understand it. You are supposed to just copy and paste it during contest with minimal changes.

Use at your own risk. I am pretty sure it at least compiles, but may contain minor bugs.

Pull requests are welcome, since I do not do contests so actively anymore.

TODO:

convex hull (!)
half-plane intersection
dinic's algorithm
long arithmetic
bridge finding (!)
minimum spanning tree
sqrt decomposition (!!)
string hashing
kth element in O(n)
bitset Gauss, bitset matmul (!)
better FFT or fast Karatsuba
persiistent data structures (!!)
dynamic connectivity (!)

Name		Name	Last commit message	Last commit date
Latest commit History 32 Commits
README.md		README.md
aho_corasick.cpp		aho_corasick.cpp
alcotree.cpp		alcotree.cpp
bfs.cpp		bfs.cpp
burnside.cpp		burnside.cpp
centroid.cpp		centroid.cpp
checker.py		checker.py
cnk.cpp		cnk.cpp
compress.cpp		compress.cpp
dijkstra.cpp		dijkstra.cpp
dp_dnc.cpp		dp_dnc.cpp
dsu.cpp		dsu.cpp
fenwick.cpp		fenwick.cpp
fft.cpp		fft.cpp
gauss.cpp		gauss.cpp
gcd.cpp		gcd.cpp
geometry.cpp		geometry.cpp
hashmap.cpp		hashmap.cpp
hld.cpp		hld.cpp
kuhn.cpp		kuhn.cpp
lca.cpp		lca.cpp
manacher.cpp		manacher.cpp
maxflow_ffa.cpp		maxflow_ffa.cpp
mincost_maxflow.cpp		mincost_maxflow.cpp
palindromic_tree.cpp		palindromic_tree.cpp
persistent_treap.cpp		persistent_treap.cpp
prefix_function.cpp		prefix_function.cpp
radix_sort.cpp		radix_sort.cpp
segtree.cpp		segtree.cpp
segtree_dynamic.cpp		segtree_dynamic.cpp
sparse.cpp		sparse.cpp
suffix_array.cpp		suffix_array.cpp
suffix_automaton.cpp		suffix_automaton.cpp
treap.cpp		treap.cpp
z_function.cpp		z_function.cpp

algorithmica-org/implementations

Folders and files

Latest commit

History

Repository files navigation

algo

About

Topics

Resources

Stars

Watchers

Forks

Languages