Competitive Programming Reference

A collection of standalone implementations of algorithms and data structures commonly used in programming contests. Most examples are written in C++, with selected implementations also available in Kotlin.

The collection includes graph algorithms, data structures, string processing, number theory, sorting, searching, and other common contest techniques.

Using the examples

Each source file focuses on a single topic and can be read or adapted independently. Many files include their own main function and demonstrate input and output. Check the comments and code for assumptions such as input format, indexing, graph direction, and constraints, then adapt them to the problem you are solving.

Compile or run an individual file with the appropriate compiler or runtime for its language. The repository is a reference collection rather than a single integrated application.

Name		Name	Last commit message	Last commit date
challenge-template		challenge-template
.gitignore		.gitignore
AGENTS.md		AGENTS.md
README.md		README.md
alterar_ordenacao_map.cpp		alterar_ordenacao_map.cpp
alterar_ordenacao_priority_queue_de_pairs.cpp		alterar_ordenacao_priority_queue_de_pairs.cpp
alterar_ordenacao_set.cpp		alterar_ordenacao_set.cpp
bellman_ford.cpp		bellman_ford.cpp
bfs.cpp		bfs.cpp
bfs.kt		bfs.kt
bfs_flood_fill.cpp		bfs_flood_fill.cpp
binary_search.cpp		binary_search.cpp
binary_search.kt		binary_search.kt
bipartido.cpp		bipartido.cpp
bit.cpp		bit.cpp
bit_2.cpp		bit_2.cpp
bit_2d.cpp		bit_2d.cpp
comparacao_doubles.cpp		comparacao_doubles.cpp
counting_sort.cpp		counting_sort.cpp
crivo.cpp		crivo.cpp
dfs_flood_fill.cpp		dfs_flood_fill.cpp
digitos_aproximação_do_fatorial.cpp		digitos_aproximação_do_fatorial.cpp
dijkstra.cpp		dijkstra.cpp
dijkstra.kt		dijkstra.kt
divisors.cpp		divisors.cpp
divisors.kt		divisors.kt
fastexp.cpp		fastexp.cpp
fastexp_2.cpp		fastexp_2.cpp
fatores_primos.cpp		fatores_primos.cpp
floyd_warshall.cpp		floyd_warshall.cpp
hopcroft_karp.cpp		hopcroft_karp.cpp
infix_to_rpn.cpp		infix_to_rpn.cpp
int_to_string.cpp		int_to_string.cpp
kadane.cpp		kadane.cpp
kd_tree1.cpp		kd_tree1.cpp
kd_tree2.cpp		kd_tree2.cpp
kmp.cpp		kmp.cpp
kosaraju.cpp		kosaraju.cpp
kruskal.cpp		kruskal.cpp
lca.cpp		lca.cpp
lca2.cpp		lca2.cpp
lcs.cpp		lcs.cpp
lis.cpp		lis.cpp
matrix_power.cpp		matrix_power.cpp
max_flow.cpp		max_flow.cpp
max_flow2.cpp		max_flow2.cpp
max_sum_2d.cpp		max_sum_2d.cpp
maximum_match.cpp		maximum_match.cpp
merge_sort.cpp		merge_sort.cpp
min_cost_max_flow.cpp		min_cost_max_flow.cpp
mulmod.cpp		mulmod.cpp
ordenar_vector_de_pair.cpp		ordenar_vector_de_pair.cpp
palindrome.cpp		palindrome.cpp
pontes_e_articulacoes.cpp		pontes_e_articulacoes.cpp
prim.cpp		prim.cpp
prim_2.cpp		prim_2.cpp
problema_do_troco.cpp		problema_do_troco.cpp
problema_do_troco_2.cpp		problema_do_troco_2.cpp
random.cpp		random.cpp
rpn_calculator.cpp		rpn_calculator.cpp
segment_tree.cpp		segment_tree.cpp
segment_tree_(lazy_prop).cpp		segment_tree_(lazy_prop).cpp
segment_tree_2.cpp		segment_tree_2.cpp
segment_tree_2d_(point_update).cpp		segment_tree_2d_(point_update).cpp
segment_tree_2d_(range_update).cpp		segment_tree_2d_(range_update).cpp
set_de_struct.cpp		set_de_struct.cpp
stoer_wagner.cpp		stoer_wagner.cpp
string_token.cpp		string_token.cpp
suffix_array.cpp		suffix_array.cpp
topological_sort.cpp		topological_sort.cpp
topological_sort_(kahn).cpp		topological_sort_(kahn).cpp
trie.cpp		trie.cpp
tsp.cpp		tsp.cpp

Navigation Menu

Repository navigation

About

Repository files navigation

Competitive Programming Reference

Using the examples

About

Releases

Packages

Contributors

Languages

Latest commit

History

Folders and files

Repository files navigation

Competitive Programming Reference

Using the examples

About

Resources

Stars

Watchers

Forks

Releases

Packages

Contributors

Languages