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, 10 Jun 2026 02:12:33 -0000 Wed, 10 Jun 2026 02:12:33 -0000 1440 MkDocs RSS plugin - v1.19.0 None https://cp-algorithms.com/ <h1>Binary Exponentiation</h1> <p>Binary exponentiation (also known as exponentiation by squaring) is a trick which allows to calculate $a^n$, where $n$ is a non-nega...</p> https://cp-algorithms.com/algebra/binary-exp.html Wed, 10 Jun 2026 01:43:43 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/binary-exp.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 Wed, 10 Jun 2026 01:04:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/navigation.html <h1>Edge connectivity / Vertex connectivity</h1> <h2>Definition</h2> <p>Given an undirected graph $G$ with $n$ vertices and $m$ edges. Both the edge connectivity and the v...</p> https://cp-algorithms.com/graph/edge_vertex_connectivity.html Wed, 10 Jun 2026 01:04:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/edge_vertex_connectivity.html <h1>Minimum cut - Stoer-Wagner algorithm</h1> <h2>Problem statement</h2> <p>Given an undirected weighted graph $G$ with $n$ vertices and $m$ edges. A cut $C$ is a non-empt...</p> https://cp-algorithms.com/graph/stoer_wagner_mincut.html Wed, 10 Jun 2026 01:04:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/stoer_wagner_mincut.html <h1>Sqrt Decomposition</h1> <p>Sqrt Decomposition is a method (or a data structure) that allows you to perform some common operations (finding sum of the elements of ...</p> https://cp-algorithms.com/data_structures/sqrt_decomposition.html Wed, 27 May 2026 11:57:33 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/sqrt_decomposition.html <h1>Depth First Search</h1> <p>Depth First Search is one of the main graph algorithms.</p> <p>Depth First Search finds the lexicographical first path in the graph from a so...</p> https://cp-algorithms.com/graph/depth-first-search.html Sun, 24 May 2026 04:23:13 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/depth-first-search.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 Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/segment_tree.html <h1>Treap (Cartesian tree)</h1> <p>A treap is a data structure which combines binary tree and binary heap (hence the name: tree + heap $\Rightarrow$ Treap).</p> <p>More spe...</p> https://cp-algorithms.com/data_structures/treap.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/treap.html <h1>Knapsack Problem</h1> <p>Prerequisite knowledge: <a href="https://cp-algorithms.com/dynamic_programming/intro-to-dp.html">Introduction to Dynamic Programming</a></p> <h2>Introduc...</h2> https://cp-algorithms.com/dynamic_programming/knapsack.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/dynamic_programming/knapsack.html <h1>Half-plane intersection</h1> <p>In this article we will discuss the problem of computing the intersection of a set of half-planes. Such an intersection can be con...</p> https://cp-algorithms.com/geometry/halfplane-intersection.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/halfplane-intersection.html <h1>Finding the nearest pair of points</h1> <h2>Problem statement</h2> <p>Given $n$ points on the plane. Each point $p_i$ is defined by its coordinates $(x_i,y_i)$. It is ...</p> https://cp-algorithms.com/geometry/nearest_points.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/nearest_points.html <h1>Lowest Common Ancestor - $O(\sqrt{N})$ and $O(\log N)$ with $O(N)$ preprocessing</h1> <p>Given a tree $G$. Given queries of the form $(v_1, v_2)$, for each query ...</p> https://cp-algorithms.com/graph/lca.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/lca.html <h1>Solve RMQ (Range Minimum Query) by finding LCA (Lowest Common Ancestor)</h1> <p>Given an array <code>A[0..N-1]</code>. For each query of the form <code>[L, R]</code> we want to find th...</p> https://cp-algorithms.com/graph/rmq_linear.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/rmq_linear.html <h1>Newton's method for finding roots</h1> <p>This is an iterative method invented by Isaac Newton around 1664. However, this method is also sometimes called the Rap...</p> https://cp-algorithms.com/num_methods/roots_newton.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/num_methods/roots_newton.html <h1>Simulated Annealing</h1> <p><strong>Simulated Annealing (SA)</strong> is a randomized algorithm, which approximates the global optimum of a function. It's called a randomized ...</p> https://cp-algorithms.com/num_methods/simulated_annealing.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/num_methods/simulated_annealing.html <h1>Suffix Automaton</h1> <p>A <strong>suffix automaton</strong> is a powerful data structure that allows solving many string-related problems. </p> <p>For example, you can search for a...</p> https://cp-algorithms.com/string/suffix-automaton.html Sun, 24 May 2026 04:18:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/string/suffix-automaton.html <h1>Minimum stack / Minimum queue</h1> <p>In this article we will consider three problems: first we will modify a stack in a way that allows us to find the smallest ...</p> https://cp-algorithms.com/data_structures/stack_queue_modification.html Thu, 21 May 2026 05:09:09 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/stack_queue_modification.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 Sat, 16 May 2026 01:08:12 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/basic-geometry.html <h1>0-1 BFS</h1> <p>It is well-known, that you can find the shortest paths between a single source and all other vertices in $O(|E|)$ using [Breadth First Search](bre...</p> https://cp-algorithms.com/graph/01_bfs.html Sun, 19 Apr 2026 06:04:57 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/01_bfs.html <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