The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures especially popular in field of competitive programming. Moreover we want to improve the collected knowledge by extending the articles and adding new articles to the collection.https://cp-algorithms.com/ https://github.com/cp-algorithms/cp-algorithmsen Wed, 15 Apr 2026 12:37:11 -0000 Wed, 15 Apr 2026 12:37:11 -0000 1440 MkDocs RSS plugin - v1.18.1 None https://cp-algorithms.com/ <h1>Floyd's Linked List Cycle Finding Algorithm</h1> <p>Given a linked list where the starting point of that linked list is denoted by <strong>head</strong>, and there may or may ...</p> https://cp-algorithms.com/others/tortoise_and_hare.html Tue, 14 Apr 2026 13:15:23 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/others/tortoise_and_hare.html <h1>Manacher's Algorithm - Finding all sub-palindromes in $O(N)$</h1> <h2>Statement</h2> <p>Given string $s$ with length $n$. Find all the pairs $(i, j)$ such that substri...</p> https://cp-algorithms.com/string/manacher.html Sun, 12 Apr 2026 00:41:41 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/string/manacher.html <h1>Modular Multiplicative Inverse</h1> <h2>Definition</h2> <p>A <a href="http://en.wikipedia.org/wiki/Modular_multiplicative_inverse">modular multiplicative inverse</a> of an intege...</p> https://cp-algorithms.com/algebra/module-inverse.html Fri, 10 Apr 2026 14:25:37 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/module-inverse.html <h1>Length of the union of segments</h1> <p>Given $n$ segments on a line, each described by a pair of coordinates $(a_{i1}, a_{i2})$. We have to find the length of th...</p> https://cp-algorithms.com/geometry/length-of-segments-union.html Thu, 09 Apr 2026 22:54:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/length-of-segments-union.html <h1>Check whether a graph is bipartite</h1> <p>A bipartite graph is a graph whose vertices can be divided into two disjoint sets so that every edge connects two verti...</p> https://cp-algorithms.com/graph/bipartite-check.html Thu, 02 Apr 2026 14:40:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/bipartite-check.html <h1>Disjoint Set Union</h1> <p>This article discusses the data structure <strong>Disjoint Set Union</strong> or <strong>DSU</strong>. Often it is also called <strong>Union Find</strong> because of its two ...</p> https://cp-algorithms.com/data_structures/disjoint_set_union.html Sun, 29 Mar 2026 22:17:21 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/disjoint_set_union.html <h1>Lowest Common Ancestor - Binary Lifting</h1> <p>Let $G$ be a tree. For every query of the form <code>(u, v)</code> we want to find the lowest common ancestor of the nodes `u...</p> https://cp-algorithms.com/graph/lca_binary_lifting.html Sun, 29 Mar 2026 22:17:21 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/lca_binary_lifting.html <h1>Gray code</h1> <p>Gray code is a binary numeral system where two successive values differ in only one bit. </p> <p>Denote by $G(n)$ the representation of the number $n$...</p> https://cp-algorithms.com/algebra/gray-code.html Thu, 26 Mar 2026 19:44:21 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/gray-code.html <h1>Manhattan Distance</h1> <h2>Definition</h2> <p>For points $p$ and $q$ on a plane, we can define the distance between them as the sum of the differences between their $...</p> https://cp-algorithms.com/geometry/manhattan-distance.html Fri, 20 Mar 2026 20:41:53 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/manhattan-distance.html <h1>The Stern-Brocot tree and Farey sequences</h1> <h2>Stern-Brocot tree</h2> <p>The Stern-Brocot tree is an elegant construction to represent the set of all positive frac...</p> https://cp-algorithms.com/others/stern_brocot_tree_farey_sequences.html Thu, 19 Mar 2026 12:44:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/others/stern_brocot_tree_farey_sequences.html <h1>Centroid Decomposition</h1> <p>Prerequisite knowledge: <a href="./depth-first-search.md">Depth First Search (DFS)</a>, [Divide and Conquer](https://en.wikipedia.org/wiki/Div...</p> https://cp-algorithms.com/graph/centroid_decomposition.html Sat, 14 Mar 2026 12:03:59 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/centroid_decomposition.html <h1>Divide and Conquer DP</h1> <p>Divide and Conquer is a dynamic programming optimization.</p> <h3>Preconditions</h3> <p>Some dynamic programming problems have a recurrence of ...</p> https://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html Thu, 26 Feb 2026 01:27:05 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/dynamic_programming/divide-and-conquer-dp.html <h1>Basic Geometry</h1> <p>In this article we will consider basic operations on points in Euclidean space which maintains the foundation of the whole analytical geome...</p> https://cp-algorithms.com/geometry/basic-geometry.html Mon, 16 Feb 2026 20:12:36 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/basic-geometry.html <h1>Binary Exponentiation</h1> <p>Binary exponentiation (also known as exponentiation by squaring) is a trick which allows to calculate $a^n$ using only $O(\log n)$ m...</p> https://cp-algorithms.com/algebra/binary-exp.html Thu, 05 Feb 2026 08:07:35 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/binary-exp.html <h1>Maximum flow - Ford-Fulkerson and Edmonds-Karp</h1> <p>The Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing a maximal flow i...</p> https://cp-algorithms.com/graph/edmonds_karp.html Wed, 21 Jan 2026 07:42:17 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/edmonds_karp.html <h1>Randomized Heap</h1> <p>A randomized heap is a heap that, through using randomization, allows to perform all operations in expected logarithmic time.</p> <p>A **min hea...</p> https://cp-algorithms.com/data_structures/randomized_heap.html Fri, 16 Jan 2026 19:22:03 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/randomized_heap.html <ul> <li>Home<ul> <li><a href="index.md">Main Page</a></li> <li><a href="navigation.md">Navigation</a></li> <li><a href="tags.md">Tag index</a></li> <li><a href="contrib.md">How to Contribute</a></li> <li>[Code of conduct]...</li> </ul> </li> </ul> https://cp-algorithms.com/navigation.html Sat, 10 Jan 2026 20:28:53 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/navigation.html <h1>Finding Power of Factorial Divisor</h1> <p>You are given two numbers $n$ and $k$. Find the largest integer $x$ such that $k^x$ divides $n!$.</p> <h2>Prime $k$ {data-t...</h2> https://cp-algorithms.com/algebra/factorial-divisors.html Mon, 29 Dec 2025 17:12:09 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/factorial-divisors.html <h1>Search for connected components in a graph</h1> <p>Given an undirected graph $G$ with $n$ nodes and $m$ edges. We are required to find in it all the connected com...</p> https://cp-algorithms.com/graph/search-for-connected-components.html Sun, 28 Dec 2025 14:42:11 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/search-for-connected-components.html <h1>Euler's totient function</h1> <p>Euler's totient function, also known as <strong>phi-function</strong> $\phi (n)$, counts the number of integers between 1 and $n$ inclusive, w...</p> https://cp-algorithms.com/algebra/phi-function.html Sun, 28 Dec 2025 13:07:53 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/phi-function.html