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, 11 Mar 2026 00:00:02 -0000 Wed, 11 Mar 2026 00:00:02 -0000 1440 MkDocs RSS plugin - v1.17.9 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, 10 Mar 2026 23:59:30 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/others/tortoise_and_hare.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 <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 <h1>Convex Hull construction</h1> <p>In this article we will discuss the problem of constructing a convex hull from a set of points.</p> <p>Consider $N$ points given on a p...</p> https://cp-algorithms.com/geometry/convex-hull.html Fri, 26 Dec 2025 10:25:54 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/convex-hull.html <h1>Strongly connected components and the condensation graph</h1> <h2>Definitions</h2> <p>Let $G=(V,E)$ be a directed graph with vertices $V$ and edges $E \subseteq V \time...</p> https://cp-algorithms.com/graph/strongly-connected-components.html Fri, 26 Dec 2025 00:31:37 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/strongly-connected-components.html <h1>Segment Tree</h1> <p>A Segment Tree is a data structure that stores information about array intervals as a tree. This allows answering range queries over an array...</p> https://cp-algorithms.com/data_structures/segment_tree.html Fri, 19 Dec 2025 07:16:42 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/segment_tree.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 Mon, 15 Dec 2025 01:10:23 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/disjoint_set_union.html <h1>Gauss method for solving system of linear equations</h1> <p>Given a system of $n$ linear algebraic equations (SLAE) with $m$ unknowns. You are asked to solve the ...</p> https://cp-algorithms.com/linear_algebra/linear-system-gauss.html Wed, 10 Dec 2025 11:02:10 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/linear_algebra/linear-system-gauss.html <h1>Finding Bridges Online</h1> <p>We are given an undirected graph. A bridge is an edge whose removal makes the graph disconnected (or, more precisely, increases the...</p> https://cp-algorithms.com/graph/bridge-searching-online.html Sun, 23 Nov 2025 17:50:05 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/bridge-searching-online.html <h1>Heavy-light decomposition</h1> <p><strong>Heavy-light decomposition</strong> is a fairly general technique that allows us to effectively solve many problems that come down to ...</p> https://cp-algorithms.com/graph/hld.html Wed, 19 Nov 2025 12:44:51 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/hld.html <h1>2-SAT</h1> <p>SAT (Boolean satisfiability problem) is the problem of assigning Boolean values to variables to satisfy a given Boolean formula. The Boolean formul...</p> https://cp-algorithms.com/graph/2SAT.html Thu, 06 Nov 2025 12:07:11 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/2SAT.html <h1>Finding the Eulerian path in $O(M)$</h1> <p>A Eulerian path is a path in a graph that passes through all of its edges exactly once. A Eulerian cycle is a Eulerian...</p> https://cp-algorithms.com/graph/euler_path.html Mon, 03 Nov 2025 22:39:11 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/euler_path.html <h1>Garner's algorithm</h1> <p>A consequence of the <a href="chinese-remainder-theorem.md">Chinese Remainder Theorem</a> is, that we can represent big numbers using an array of ...</p> https://cp-algorithms.com/algebra/garners-algorithm.html Wed, 29 Oct 2025 17:23:37 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/garners-algorithm.html <h1>Linear Diophantine Equation</h1> <p>A Linear Diophantine Equation (in two variables) is an equation of the general form:</p> <p>$$ax + by = c$$</p> <p>where $a$, $b$, $c$ are...</p> https://cp-algorithms.com/algebra/linear-diophantine-equation.html Wed, 29 Oct 2025 17:22:34 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/linear-diophantine-equation.html