{"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_created.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/dynamic_programming/longest_increasing_subsequence.html", "url": "https://cp-algorithms.com/dynamic_programming/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_published": "2025-08-25T06:45:10+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/supporters.html", "url": "https://cp-algorithms.com/supporters.html", "title": "Supporters", "content_html": "<h1>Financial Supporters</h1>\n<h1>Current Team</h1>\n<p><a href=\"https://github.com/adamant-pwn\">Oleksandr Kulkov</a>\n<a href=\"https://github.com/mhayter\">Michael Hayter</a>\n[Bartosz Kostka](http...</p>", "image": null, "date_published": "2025-08-24T22:38:13+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/geometry/enclosing-circle.html", "url": "https://cp-algorithms.com/geometry/enclosing-circle.html", "title": "Minimum Enclosing Circle", "content_html": "<h1>Minimum Enclosing Circle</h1>\n<p>Consider the following problem:</p>\n<p>!!! example \"[Library Checker - Minimum Enclosing Circle](https://judge.yosupo.jp/problem/minimu...</p>", "image": null, "date_published": "2025-08-19T15:59:22+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_published": "2024-10-18T16:18:55+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/dynamic_programming/knapsack.html", "url": "https://cp-algorithms.com/dynamic_programming/knapsack.html", "title": "Knapsack Problem", "content_html": "<h1>Knapsack Problem</h1>\n<p>Prerequisite knowledge: <a href=\"https://cp-algorithms.com/dynamic_programming/intro-to-dp.html\">Introduction to Dynamic Programming</a></p>\n<h2>Introduc...</h2>", "image": null, "date_published": "2024-05-18T06:20:41+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_published": "2024-05-16T19:20:34+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/graph/hungarian-algorithm.html", "url": "https://cp-algorithms.com/graph/hungarian-algorithm.html", "title": "Hungarian Algorithm", "content_html": "<h1>Hungarian algorithm for solving the assignment problem</h1>\n<h2>Statement of the assignment problem</h2>\n<p>There are several standard formulations of the assignment p...</p>", "image": null, "date_published": "2023-12-07T23:50:44+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/dynamic_programming/intro-to-dp.html", "url": "https://cp-algorithms.com/dynamic_programming/intro-to-dp.html", "title": "Introduction to Dynamic Programming", "content_html": "<h1>Introduction to Dynamic Programming</h1>\n<p>The essence of dynamic programming is to avoid repeated calculation. Often, dynamic programming problems are naturall...</p>", "image": null, "date_published": "2023-11-29T10:21:39+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/others/tortoise_and_hare.html", "url": "https://cp-algorithms.com/others/tortoise_and_hare.html", "title": "Tortoise and Hare Algorithm (Linked List cycle detection)", "content_html": "<h1>Floyd's Linked List Cycle Finding Algorithm</h1>\n<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>", "image": null, "date_published": "2023-09-10T08:20:59+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/geometry/planar.html", "url": "https://cp-algorithms.com/geometry/planar.html", "title": "Finding faces of a planar graph", "content_html": "<h1>Finding faces of a planar graph</h1>\n<p>Consider a graph $G$ with $n$ vertices and $m$ edges, which can be drawn on a plane in such a way that two edges intersect...</p>", "image": null, "date_published": "2023-07-12T15:52:18+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/bit-manipulation.html", "url": "https://cp-algorithms.com/algebra/bit-manipulation.html", "title": "Bit manipulation", "content_html": "<h1>Bit manipulation</h1>\n<h2>Binary number</h2>\n<p>A <strong>binary number</strong> is a number expressed in the base-2 numeral system or binary numeral system, it is a method of math...</p>", "image": null, "date_published": "2023-03-31T02:53:20+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/garners-algorithm.html", "url": "https://cp-algorithms.com/algebra/garners-algorithm.html", "title": "Garner's Algorithm", "content_html": "<h1>Garner's algorithm</h1>\n<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>", "image": null, "date_published": "2023-01-29T19:48:33+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/code_of_conduct.html", "url": "https://cp-algorithms.com/code_of_conduct.html", "title": "Code of conduct", "content_html": "<h1>Code of conduct</h1>\n<p>We endorse and follow the code of conduct of the International Olympiad of Informatics, available at the [IOI website](https://ioinformati...</p>", "image": null, "date_published": "2022-12-13T14:21:50+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/tags.html", "url": "https://cp-algorithms.com/tags.html", "title": "Tag index", "content_html": "<h1>Tags</h1>\n<p>This file contains a global index of all tags used on the pages.</p>\n<h6>tags.md:74-96/name { #tags.md:74-96/slug }</h6>", "image": null, "date_published": "2022-06-05T22:11:56+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/navigation.html", "url": "https://cp-algorithms.com/navigation.html", "title": "Navigation", "content_html": "<ul>\n<li>Home<ul>\n<li><a href=\"index.md\">Main Page</a></li>\n<li><a href=\"navigation.md\">Navigation</a></li>\n<li><a href=\"tags.md\">Tag index</a></li>\n<li><a href=\"contrib.md\">How to Contribute</a></li>\n<li>[Code of conduct]...</li>\n</ul>\n</li>\n</ul>", "image": null, "date_published": "2022-06-05T18:52:23+00:00", "authors": [], "tags": null}, {"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_published": "2022-06-03T11:53:41+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/dynamic_programming/knuth-optimization.html", "url": "https://cp-algorithms.com/dynamic_programming/knuth-optimization.html", "title": "Knuth's Optimization", "content_html": "<h1>Knuth's Optimization</h1>\n<p>Knuth's optimization, also known as the Knuth-Yao Speedup, is a special case of dynamic programming on ranges, that can optimize the ...</p>", "image": null, "date_published": "2022-04-29T09:57:35+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/factoring-exp.html", "url": "https://cp-algorithms.com/algebra/factoring-exp.html", "title": "Factoring Exponentiation", "content_html": "<h1>Binary Exponentiation by Factoring</h1>\n<p>Consider a problem of computing $ax^y \\pmod{2^d}$, given integers $a$, $x$, $y$ and $d \\geq 3$, where $x$ is odd.</p>\n<p>The ...</p>", "image": null, "date_published": "2022-04-16T22:54:14+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/algebra/continued-fractions.html", "url": "https://cp-algorithms.com/algebra/continued-fractions.html", "title": "Continued fractions", "content_html": "<!--?title Continued fractions -->\n<h1>Continued fractions</h1>\n<p><strong>Continued fraction</strong> is a representation of a real number as a specific convergent sequence of ra...</p>", "image": null, "date_published": "2022-03-31T16:21:16+00:00", "authors": [], "tags": null}, {"id": "https://cp-algorithms.com/sequences/mex.html", "url": "https://cp-algorithms.com/sequences/mex.html", "title": "MEX task (Minimal Excluded element in an array)", "content_html": "<h1>MEX (minimal excluded) of a sequence</h1>\n<p>Given an array $A$ of size $N$. You have to find the minimal non-negative element that is not present in the array. T...</p>", "image": null, "date_published": "2022-02-25T06:55:18+00:00", "authors": [], "tags": null}]}