{"version": "https://jsonfeed.org/version/1", "title": "Algorithms for Competitive Programming", "home_page_url": "https://cp-algorithms.com/", "feed_url": "https://cp-algorithms.com/feed_json_updated.json", "description": "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.", "icon": null, "authors": [], "language": "en", "items": [{"id": "https://cp-algorithms.com/num_methods/binary_search.html", "url": "https://cp-algorithms.com/num_methods/binary_search.html", "title": "Binary Search", "content_html": "<h1>Binary search</h1>\n<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>", "image": null, "date_modified": "2025-08-11T00:40:14+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/data_structures/stack_queue_modification.html", "url": "https://cp-algorithms.com/data_structures/stack_queue_modification.html", "title": "Minimum Stack / Minimum Queue", "content_html": "<h1>Minimum stack / Minimum queue</h1>\n<p>In this article we will consider three problems: \nfirst we will modify a stack in a way that allows us to find the smallest ...</p>", "image": null, "date_modified": "2025-08-09T09:10:30+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/geometry/basic-geometry.html", "url": "https://cp-algorithms.com/geometry/basic-geometry.html", "title": "Basic Geometry", "content_html": "<h1>Basic Geometry</h1>\n<p>In this article we will consider basic operations on points in Euclidean space which maintains the foundation of the whole analytical geome...</p>", "image": null, "date_modified": "2025-08-09T09:05:50+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/polynomial.html", "url": "https://cp-algorithms.com/algebra/polynomial.html", "title": "Operations on polynomials and series", "content_html": "<h1>Operations on polynomials and series</h1>\n<p>Problems in competitive programming, especially the ones involving enumeration some kind, are often solved by reducin...</p>", "image": null, "date_modified": "2025-08-07T06:04:38+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/linear_algebra/linear-system-gauss.html", "url": "https://cp-algorithms.com/linear_algebra/linear-system-gauss.html", "title": "Gauss & System of Linear Equations", "content_html": "<h1>Gauss method for solving system of linear equations</h1>\n<p>Given a system of $n$ linear algebraic equations (SLAE) with $m$ unknowns. You are asked to solve the ...</p>", "image": null, "date_modified": "2025-07-31T08:48:33+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/chinese-remainder-theorem.html", "url": "https://cp-algorithms.com/algebra/chinese-remainder-theorem.html", "title": "Chinese Remainder Theorem", "content_html": "<h1>Chinese Remainder Theorem</h1>\n<p>The Chinese Remainder Theorem (which will be referred to as CRT in the rest of this article) was discovered by Chinese mathemati...</p>", "image": null, "date_modified": "2025-07-29T01:26:09+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/binary-exp.html", "url": "https://cp-algorithms.com/algebra/binary-exp.html", "title": "Binary Exponentiation", "content_html": "<h1>Binary Exponentiation</h1>\n<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>", "image": null, "date_modified": "2025-07-27T06:10:49+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/big-integer.html", "url": "https://cp-algorithms.com/algebra/big-integer.html", "title": "Arbitrary-Precision Arithmetic", "content_html": "<h1>Arbitrary-Precision Arithmetic</h1>\n<p>Arbitrary-Precision arithmetic, also known as \"bignum\" or simply \"long arithmetic\" is a set of data structures and algorith...</p>", "image": null, "date_modified": "2025-07-12T15:11:52+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/data_structures/treap.html", "url": "https://cp-algorithms.com/data_structures/treap.html", "title": "Treap", "content_html": "<h1>Treap (Cartesian tree)</h1>\n<p>A treap is a data structure which combines binary tree and binary heap (hence the name: tree + heap $\\Rightarrow$ Treap).</p>\n<p>More spe...</p>", "image": null, "date_modified": "2025-07-03T15:57:46+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/mst_prim.html", "url": "https://cp-algorithms.com/graph/mst_prim.html", "title": "Minimum Spanning Tree - Prim's Algorithm", "content_html": "<h1>Minimum spanning tree - Prim's algorithm</h1>\n<p>Given a weighted, undirected graph $G$ with $n$ vertices and $m$ edges.\nYou want to find a spanning tree of this ...</p>", "image": null, "date_modified": "2025-06-30T19:15:08+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/fixed_length_paths.html", "url": "https://cp-algorithms.com/graph/fixed_length_paths.html", "title": "Number of paths of fixed length / Shortest paths of fixed length", "content_html": "<h1>Number of paths of fixed length / Shortest paths of fixed length</h1>\n<p>The following article describes solutions to these two problems built on the same idea:\nr...</p>", "image": null, "date_modified": "2025-06-14T10:11:52+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/factorization.html", "url": "https://cp-algorithms.com/algebra/factorization.html", "title": "Integer factorization", "content_html": "<h1>Integer factorization</h1>\n<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>", "image": null, "date_modified": "2025-05-29T05:50:00+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/string/manacher.html", "url": "https://cp-algorithms.com/string/manacher.html", "title": "Manacher's Algorithm - Finding all sub-palindromes in O(N)", "content_html": "<h1>Manacher's Algorithm - Finding all sub-palindromes in $O(N)$</h1>\n<h2>Statement</h2>\n<p>Given string $s$ with length $n$. Find all the pairs $(i, j)$ such that substri...</p>", "image": null, "date_modified": "2025-05-24T18:58:13+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/num_methods/simulated_annealing.html", "url": "https://cp-algorithms.com/num_methods/simulated_annealing.html", "title": "Simulated Annealing", "content_html": "<h1>Simulated Annealing</h1>\n<p><strong>Simulated Annealing (SA)</strong> is a randomized algorithm, which approximates the global optimum of a function. It's called a randomized ...</p>", "image": null, "date_modified": "2025-05-21T11:11:00+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/sequences/longest_increasing_subsequence.html", "url": "https://cp-algorithms.com/sequences/longest_increasing_subsequence.html", "title": "Longest increasing subsequence", "content_html": "<h1>Longest increasing subsequence</h1>\n<p>We are given an array with $n$ numbers: $a[0 \\dots n-1]$.\nThe task is to find the longest, strictly increasing, subsequence...</p>", "image": null, "date_modified": "2025-05-21T09:00:17+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/fibonacci-numbers.html", "url": "https://cp-algorithms.com/algebra/fibonacci-numbers.html", "title": "Fibonacci Numbers", "content_html": "<h1>Fibonacci Numbers</h1>\n<p>The Fibonacci sequence is defined as follows:</p>\n<p>$$F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$$</p>\n<p>The first elements of the sequence ([OEIS ...</p>", "image": null, "date_modified": "2025-04-22T03:58:03+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/edmonds_karp.html", "url": "https://cp-algorithms.com/graph/edmonds_karp.html", "title": "Maximum flow - Ford-Fulkerson and Edmonds-Karp", "content_html": "<h1>Maximum flow - Ford-Fulkerson and Edmonds-Karp</h1>\n<p>The Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing a maximal flow i...</p>", "image": null, "date_modified": "2025-04-22T02:45:52+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/second_best_mst.html", "url": "https://cp-algorithms.com/graph/second_best_mst.html", "title": "Second best Minimum Spanning Tree - Using Kruskal and Lowest Common Ancestor", "content_html": "<h1>Second Best Minimum Spanning Tree</h1>\n<p>A Minimum Spanning Tree $T$ is a tree for the given graph $G$ which spans over all vertices of the given graph and has t...</p>", "image": null, "date_modified": "2025-04-22T02:26:46+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/topological-sort.html", "url": "https://cp-algorithms.com/graph/topological-sort.html", "title": "Topological Sorting", "content_html": "<h1>Topological Sorting</h1>\n<p>You are given a directed graph with $n$ vertices and $m$ edges.\nYou have to find an <strong>order of the vertices</strong>, so that every edge lead...</p>", "image": null, "date_modified": "2025-04-22T02:26:46+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/geometry/manhattan-distance.html", "url": "https://cp-algorithms.com/geometry/manhattan-distance.html", "title": "Manhattan Distance", "content_html": "<h1>Manhattan Distance</h1>\n<h2>Definition</h2>\n<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>", "image": null, "date_modified": "2025-04-22T02:11:52+00:00", "authors": [], "tags": null}]}

{"version": "https://jsonfeed.org/version/1", "title": "Algorithms for Competitive Programming", "home_page_url": "https://cp-algorithms.com/", "feed_url": "https://cp-algorithms.com/feed_json_updated.json", "description": "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.", "icon": null, "authors": [], "language": "en", "items": [{"id": "https://cp-algorithms.com/num_methods/binary_search.html", "url": "https://cp-algorithms.com/num_methods/binary_search.html", "title": "Binary Search", "content_html": "<h1>Binary search</h1>\n<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>", "image": null, "date_modified": "2025-08-11T00:48:28+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/data_structures/stack_queue_modification.html", "url": "https://cp-algorithms.com/data_structures/stack_queue_modification.html", "title": "Minimum Stack / Minimum Queue", "content_html": "<h1>Minimum stack / Minimum queue</h1>\n<p>In this article we will consider three problems: \nfirst we will modify a stack in a way that allows us to find the smallest ...</p>", "image": null, "date_modified": "2025-08-09T09:10:30+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/geometry/basic-geometry.html", "url": "https://cp-algorithms.com/geometry/basic-geometry.html", "title": "Basic Geometry", "content_html": "<h1>Basic Geometry</h1>\n<p>In this article we will consider basic operations on points in Euclidean space which maintains the foundation of the whole analytical geome...</p>", "image": null, "date_modified": "2025-08-09T09:05:50+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/polynomial.html", "url": "https://cp-algorithms.com/algebra/polynomial.html", "title": "Operations on polynomials and series", "content_html": "<h1>Operations on polynomials and series</h1>\n<p>Problems in competitive programming, especially the ones involving enumeration some kind, are often solved by reducin...</p>", "image": null, "date_modified": "2025-08-07T06:04:38+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/linear_algebra/linear-system-gauss.html", "url": "https://cp-algorithms.com/linear_algebra/linear-system-gauss.html", "title": "Gauss & System of Linear Equations", "content_html": "<h1>Gauss method for solving system of linear equations</h1>\n<p>Given a system of $n$ linear algebraic equations (SLAE) with $m$ unknowns. You are asked to solve the ...</p>", "image": null, "date_modified": "2025-07-31T08:48:33+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/chinese-remainder-theorem.html", "url": "https://cp-algorithms.com/algebra/chinese-remainder-theorem.html", "title": "Chinese Remainder Theorem", "content_html": "<h1>Chinese Remainder Theorem</h1>\n<p>The Chinese Remainder Theorem (which will be referred to as CRT in the rest of this article) was discovered by Chinese mathemati...</p>", "image": null, "date_modified": "2025-07-29T01:26:09+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/binary-exp.html", "url": "https://cp-algorithms.com/algebra/binary-exp.html", "title": "Binary Exponentiation", "content_html": "<h1>Binary Exponentiation</h1>\n<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>", "image": null, "date_modified": "2025-07-27T06:10:49+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/big-integer.html", "url": "https://cp-algorithms.com/algebra/big-integer.html", "title": "Arbitrary-Precision Arithmetic", "content_html": "<h1>Arbitrary-Precision Arithmetic</h1>\n<p>Arbitrary-Precision arithmetic, also known as \"bignum\" or simply \"long arithmetic\" is a set of data structures and algorith...</p>", "image": null, "date_modified": "2025-07-12T15:11:52+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/data_structures/treap.html", "url": "https://cp-algorithms.com/data_structures/treap.html", "title": "Treap", "content_html": "<h1>Treap (Cartesian tree)</h1>\n<p>A treap is a data structure which combines binary tree and binary heap (hence the name: tree + heap $\\Rightarrow$ Treap).</p>\n<p>More spe...</p>", "image": null, "date_modified": "2025-07-03T15:57:46+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/mst_prim.html", "url": "https://cp-algorithms.com/graph/mst_prim.html", "title": "Minimum Spanning Tree - Prim's Algorithm", "content_html": "<h1>Minimum spanning tree - Prim's algorithm</h1>\n<p>Given a weighted, undirected graph $G$ with $n$ vertices and $m$ edges.\nYou want to find a spanning tree of this ...</p>", "image": null, "date_modified": "2025-06-30T19:15:08+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/fixed_length_paths.html", "url": "https://cp-algorithms.com/graph/fixed_length_paths.html", "title": "Number of paths of fixed length / Shortest paths of fixed length", "content_html": "<h1>Number of paths of fixed length / Shortest paths of fixed length</h1>\n<p>The following article describes solutions to these two problems built on the same idea:\nr...</p>", "image": null, "date_modified": "2025-06-14T10:11:52+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/factorization.html", "url": "https://cp-algorithms.com/algebra/factorization.html", "title": "Integer factorization", "content_html": "<h1>Integer factorization</h1>\n<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>", "image": null, "date_modified": "2025-05-29T05:50:00+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/string/manacher.html", "url": "https://cp-algorithms.com/string/manacher.html", "title": "Manacher's Algorithm - Finding all sub-palindromes in O(N)", "content_html": "<h1>Manacher's Algorithm - Finding all sub-palindromes in $O(N)$</h1>\n<h2>Statement</h2>\n<p>Given string $s$ with length $n$. Find all the pairs $(i, j)$ such that substri...</p>", "image": null, "date_modified": "2025-05-24T18:58:13+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/num_methods/simulated_annealing.html", "url": "https://cp-algorithms.com/num_methods/simulated_annealing.html", "title": "Simulated Annealing", "content_html": "<h1>Simulated Annealing</h1>\n<p><strong>Simulated Annealing (SA)</strong> is a randomized algorithm, which approximates the global optimum of a function. It's called a randomized ...</p>", "image": null, "date_modified": "2025-05-21T11:11:00+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/sequences/longest_increasing_subsequence.html", "url": "https://cp-algorithms.com/sequences/longest_increasing_subsequence.html", "title": "Longest increasing subsequence", "content_html": "<h1>Longest increasing subsequence</h1>\n<p>We are given an array with $n$ numbers: $a[0 \\dots n-1]$.\nThe task is to find the longest, strictly increasing, subsequence...</p>", "image": null, "date_modified": "2025-05-21T09:00:17+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/fibonacci-numbers.html", "url": "https://cp-algorithms.com/algebra/fibonacci-numbers.html", "title": "Fibonacci Numbers", "content_html": "<h1>Fibonacci Numbers</h1>\n<p>The Fibonacci sequence is defined as follows:</p>\n<p>$$F_0 = 0, F_1 = 1, F_n = F_{n-1} + F_{n-2}$$</p>\n<p>The first elements of the sequence ([OEIS ...</p>", "image": null, "date_modified": "2025-04-22T03:58:03+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/edmonds_karp.html", "url": "https://cp-algorithms.com/graph/edmonds_karp.html", "title": "Maximum flow - Ford-Fulkerson and Edmonds-Karp", "content_html": "<h1>Maximum flow - Ford-Fulkerson and Edmonds-Karp</h1>\n<p>The Edmonds-Karp algorithm is an implementation of the Ford-Fulkerson method for computing a maximal flow i...</p>", "image": null, "date_modified": "2025-04-22T02:45:52+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/second_best_mst.html", "url": "https://cp-algorithms.com/graph/second_best_mst.html", "title": "Second best Minimum Spanning Tree - Using Kruskal and Lowest Common Ancestor", "content_html": "<h1>Second Best Minimum Spanning Tree</h1>\n<p>A Minimum Spanning Tree $T$ is a tree for the given graph $G$ which spans over all vertices of the given graph and has t...</p>", "image": null, "date_modified": "2025-04-22T02:26:46+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/topological-sort.html", "url": "https://cp-algorithms.com/graph/topological-sort.html", "title": "Topological Sorting", "content_html": "<h1>Topological Sorting</h1>\n<p>You are given a directed graph with $n$ vertices and $m$ edges.\nYou have to find an <strong>order of the vertices</strong>, so that every edge lead...</p>", "image": null, "date_modified": "2025-04-22T02:26:46+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/geometry/manhattan-distance.html", "url": "https://cp-algorithms.com/geometry/manhattan-distance.html", "title": "Manhattan Distance", "content_html": "<h1>Manhattan Distance</h1>\n<h2>Definition</h2>\n<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>", "image": null, "date_modified": "2025-04-22T02:11:52+00:00", "authors": [], "tags": null}]}