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 Sat, 22 Aug 2026 09:40:38 -0000 Sat, 22 Aug 2026 09:40:38 -0000 1440 MkDocs RSS plugin - v1.19.0 None https://cp-algorithms.com/ <h1>Number of divisors / sum of divisors</h1> <p>In this article we discuss how to compute the number of divisors $d(n)$ and the sum of divisors $\sigma(n)$ of a give...</p> https://cp-algorithms.com/algebra/divisors.html Sat, 22 Aug 2026 09:40:10 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/divisors.html <h1>Fibonacci Numbers</h1> <p>The Fibonacci sequence is defined as follows:</p> <p>$$F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$$</p> <p>The first elements of the sequence ([OEIS ...</p> https://cp-algorithms.com/algebra/fibonacci-numbers.html Sat, 22 Aug 2026 09:40:10 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/fibonacci-numbers.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 Sat, 22 Aug 2026 09:11:13 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/2SAT.html <h1>Integer factorization</h1> <p>In this article we list several algorithms for the factorization of integers, each of which can be either fast or varying levels of ...</p> https://cp-algorithms.com/algebra/factorization.html Sat, 22 Aug 2026 05:53:36 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/factorization.html <h1>Check if two segments intersect</h1> <p>You are given two segments $(a, b)$ and $(c, d)$. You have to check if they intersect. Of course, you may find their inter...</p> https://cp-algorithms.com/geometry/check-segments-intersection.html Wed, 12 Aug 2026 22:13:48 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/geometry/check-segments-intersection.html <h1>Fenwick Tree</h1> <p>Let $f$ be some group operation (a binary associative function over a set with an identity element and inverse elements) and $A$ be an array ...</p> https://cp-algorithms.com/data_structures/fenwick.html Fri, 07 Aug 2026 11:03:47 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/fenwick.html <h1>Chinese Remainder Theorem</h1> <p>The Chinese Remainder Theorem (which will be referred to as CRT in the rest of this article) was discovered by Chinese mathemati...</p> https://cp-algorithms.com/algebra/chinese-remainder-theorem.html Fri, 07 Aug 2026 06:36:26 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/chinese-remainder-theorem.html <h1>Minimum spanning tree - Kruskal's algorithm</h1> <p>Given a weighted undirected graph. We want to find a subtree of this graph which connects all vertices (i.e. i...</p> https://cp-algorithms.com/graph/mst_kruskal.html Fri, 07 Aug 2026 06:34:38 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/mst_kruskal.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 Wed, 22 Jul 2026 07:16:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/euler_path.html <h1>Z-function and its calculation</h1> <p>Suppose we are given a string $s$ of length $n$. The <strong>Z-function</strong> for this string is an array of length $n$ where the $i$...</p> https://cp-algorithms.com/string/z-function.html Sat, 18 Jul 2026 07:22:02 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/string/z-function.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 Thu, 09 Jul 2026 17:21:36 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/dynamic_programming/knapsack.html <h1>Introduction to Dynamic Programming</h1> <p>The essence of dynamic programming is to avoid repeated calculation. Often, dynamic programming problems are naturall...</p> https://cp-algorithms.com/dynamic_programming/intro-to-dp.html Sat, 04 Jul 2026 13:31:14 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/dynamic_programming/intro-to-dp.html <h1>Catalan Numbers</h1> <p>Catalan numbers is a number sequence, which is found useful in a number of combinatorial problems, often involving recursively-defined obje...</p> https://cp-algorithms.com/combinatorics/catalan-numbers.html Sat, 27 Jun 2026 06:48:11 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/combinatorics/catalan-numbers.html <h1>Breadth-first search</h1> <p>Breadth first search is one of the basic and essential searching algorithms on graphs.</p> <p>As a result of how the algorithm works, the p...</p> https://cp-algorithms.com/graph/breadth-first-search.html Sat, 27 Jun 2026 01:20:26 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/graph/breadth-first-search.html <h1>String Hashing</h1> <p>Hashing algorithms are helpful in solving a lot of problems.</p> <p>We want to solve the problem of comparing strings efficiently. The brute forc...</p> https://cp-algorithms.com/string/string-hashing.html Thu, 25 Jun 2026 09:38:19 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/string/string-hashing.html <h1>Balanced Ternary</h1> <p><img alt="&quot;Setun computer using Balanced Ternary system&quot;" src="https://earltcampbell.files.wordpress.com/2014/12/setun.jpeg?w=300"></p> <p>This is a non-stan...</p> https://cp-algorithms.com/algebra/balanced-ternary.html Sun, 21 Jun 2026 12:58:09 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/balanced-ternary.html <h1>Binary search</h1> <p><strong>Binary search</strong> is a method that allows for quicker search of something by splitting the search interval into two. Its most common applica...</p> https://cp-algorithms.com/num_methods/binary_search.html Sat, 20 Jun 2026 12:37:43 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/num_methods/binary_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 Sat, 20 Jun 2026 10:20:08 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/segment_tree.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 Sun, 14 Jun 2026 13:41:51 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/data_structures/sqrt_decomposition.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 Sat, 13 Jun 2026 15:49:50 +0000 Algorithms for Competitive Programminghttps://cp-algorithms.com/algebra/phi-function.html