[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-79858":3},{"id":4,"name":5,"fullName":6,"owner":5,"repo":5,"description":7,"homepage":8,"htmlUrl":9,"language":10,"languages":8,"totalLinesOfCode":8,"stars":11,"forks":12,"watchers":13,"openIssues":14,"contributorsCount":8,"subscribersCount":15,"size":15,"stars1d":16,"stars7d":17,"stars30d":18,"stars90d":15,"forks30d":15,"starsTrendScore":19,"compositeScore":20,"rankGlobal":8,"rankLanguage":8,"license":8,"archived":21,"fork":21,"defaultBranch":22,"hasWiki":21,"hasPages":21,"topics":23,"createdAt":8,"pushedAt":8,"updatedAt":36,"readmeContent":37,"aiSummary":38,"trendingCount":15,"starSnapshotCount":15,"syncStatus":39,"lastSyncTime":40,"discoverSource":41},79858,"cp-algorithms","cp-algorithms\u002Fcp-algorithms","Algorithm and data structure articles for https:\u002F\u002Fcp-algorithms.com (based on http:\u002F\u002Fe-maxx.ru)",null,"https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms","C++",10740,2065,102,56,0,26,49,71,78,44.95,false,"main",[24,25,26,27,28,29,30,31,32,33,34,35],"algorithms","translation","algorithm-competitions","algorithms-and-data-structures","data-structures","competitive-programming","competitive-programming-contests","learning-materials","programming-contests","programming-competitions","hacktoberfest","hacktoberfest-accepted","2026-06-12 02:03:55","# Algorithms for Competitive Programming\n\n[![Contributors](https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Fcontributors\u002Fcp-algorithms\u002Fcp-algorithms.svg)](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Fgraphs\u002Fcontributors)\n[![Pull Requests](https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Fissues-pr\u002Fcp-algorithms\u002Fcp-algorithms.svg)](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Fpulls)\n[![Closed Pull Requests](https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Fissues-pr-closed\u002Fcp-algorithms\u002Fcp-algorithms.svg)](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Fpulls?q=is%3Apr+is%3Aclosed)\n[![Build](https:\u002F\u002Fimg.shields.io\u002Fgithub\u002Factions\u002Fworkflow\u002Fstatus\u002Fcp-algorithms\u002Fcp-algorithms\u002Ftest.yml)](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Factions?query=branch%3Amain+workflow%3Atest)\n[![Translation Progress](https:\u002F\u002Fimg.shields.io\u002Fbadge\u002Ftranslation_progress-85.2%25-yellowgreen.svg)](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Fwiki\u002FTranslation-Progress)\n\nThe goal of this project is to translate the wonderful resource\n[https:\u002F\u002Fe-maxx.ru\u002Falgo](https:\u002F\u002Fe-maxx.ru\u002Falgo) which provides descriptions of many algorithms\nand data structures especially popular in field of competitive programming.\nMoreover we want to improve the collected knowledge by extending the articles\nand adding new articles to the collection.\n\nWe're an ad-free, volunteer-run website that's free for everyone. Users can contribute articles or help sponsor bounties on articles for greater algorithmic coverage. Your help is greatly appreciated.\n\nCompiled pages are published at [https:\u002F\u002Fcp-algorithms.com\u002F](https:\u002F\u002Fcp-algorithms.com\u002F).\n\n## Become a Contributor\n\n- [How to Contribute](https:\u002F\u002Fcp-algorithms.com\u002Fcontrib.html)\n- [Code of Conduct](https:\u002F\u002Fcp-algorithms.com\u002Fcode_of_conduct.html)\n- [Test-Your-Page Form](https:\u002F\u002Fcp-algorithms.com\u002Fpreview.html)\n\n## Sponsor Us\n\n- [Become a Financial Supporter](https:\u002F\u002Fgithub.com\u002Fsponsors\u002Fcp-algorithms)\n\n## Changelog\n\n- August, 2025: Overhaul of CP-Algorithms [donation system](https:\u002F\u002Fgithub.com\u002Fsponsors\u002Fcp-algorithms). Please consider supporting us, so that we can grow!\n- August, 2025: Launched a [Discord server](https:\u002F\u002Fdiscord.gg\u002FHZ5AecN3KX)!\n- October, 2024: Welcome new maintainers: [jxu](https:\u002F\u002Fgithub.com\u002Fjxu), [mhayter](https:\u002F\u002Fgithub.com\u002Fmhayter) and [kostero](https:\u002F\u002Fgithub.com\u002Fkostero)!\n- October, 15, 2024: GitHub pages based mirror is now served at [https:\u002F\u002Fgh.cp-algorithms.com\u002F](https:\u002F\u002Fgh.cp-algorithms.com\u002F), and an auxiliary competitive programming library is available at [https:\u002F\u002Flib.cp-algorithms.com\u002F](https:\u002F\u002Flib.cp-algorithms.com\u002F).\n- July 16, 2024: Major overhaul of the [Finding strongly connected components \u002F Building condensation graph](https:\u002F\u002Fcp-algorithms.com\u002Fgraph\u002Fstrongly-connected-components.html) article.\n- June 26, 2023: Added automatic RSS feeds for [new articles](https:\u002F\u002Fcp-algorithms.com\u002Ffeed_rss_created.xml) and [updates in articles](https:\u002F\u002Fcp-algorithms.com\u002Ffeed_rss_updated.xml).\n- December 20, 2022: The repository name and the owning organizations were renamed! Now the repo is located at [https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms). It is recommended to update the upstream link in your local repositories, if you have any.\n- October 31, 2022: It is now possible to select and copy $\\LaTeX$ source code of formulas within the articles.\n- June 8, 2022: Tags are enabled. Each article is now marked whether it is translated or original, overall tag info is present in the [tag index](https:\u002F\u002Fcp-algorithms.com\u002Ftags.html). For translated articles, clicking on `From: X` tag would lead to the original article.\n- June 7, 2022: Date of last commit and author list with contribution percentage is tracked for each page.\n- June 5, 2022: Enabled content tabs and sidebar navigation. The navigation is moved to a [separate page](https:\u002F\u002Fcp-algorithms.com\u002Fnavigation.html) and its structure should be adjusted in [navigation.md](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Fblob\u002Fmain\u002Fsrc\u002Fnavigation.md) whenever a new article is created or an old one is moved.\n- January 16, 2022: Switched to the [MkDocs](https:\u002F\u002Fwww.mkdocs.org\u002F) site generator with the [Material for MkDocs](https:\u002F\u002Fsquidfunk.github.io\u002Fmkdocs-material\u002F) theme, which give the website a more modern look, brings a couple of new features (dark mode, better search, ...), makes the website more stable (in terms of rendering math formulas), and makes it easier to contribute.\n\n### New articles\n\n- (28 March 2026) [Centroid decomposition](graph\u002Fcentroid_decomposition.md)\n- (19 August 2025) [Minimum Enclosing Circle](https:\u002F\u002Fcp-algorithms.com\u002Fgeometry\u002Fenclosing-circle.html)\n- (21 May 2025) [Simulated Annealing](https:\u002F\u002Fcp-algorithms.com\u002Fnum_methods\u002Fsimulated_annealing.html)\n- (12 July 2024) [Manhattan distance](https:\u002F\u002Fcp-algorithms.com\u002Fgeometry\u002Fmanhattan-distance.html)\n- (8 June 2024) [Knapsack Problem](https:\u002F\u002Fcp-algorithms.com\u002Fdynamic_programming\u002Fknapsack.html)\n- (28 January 2024) [Introduction to Dynamic Programming](https:\u002F\u002Fcp-algorithms.com\u002Fdynamic_programming\u002Fintro-to-dp.html)\n- (8 December 2023) [Hungarian Algorithm](https:\u002F\u002Fcp-algorithms.com\u002Fgraph\u002Fhungarian-algorithm.html)\n- (10 September 2023) [Tortoise and Hare Algorithm](https:\u002F\u002Fcp-algorithms.com\u002Fothers\u002Ftortoise_and_hare.html)\n- (12 July 2023) [Finding faces of a planar graph](https:\u002F\u002Fcp-algorithms.com\u002Fgeometry\u002Fplanar.html)\n- (18 April 2023) [Bit manipulation](https:\u002F\u002Fcp-algorithms.com\u002Falgebra\u002Fbit-manipulation.html)\n- (17 October 2022) [Binary Search](https:\u002F\u002Fcp-algorithms.com\u002Fnum_methods\u002Fbinary_search.html)\n- (17 October 2022) [MEX (Minimum Excluded element in an array)](https:\u002F\u002Fcp-algorithms.com\u002Fsequences\u002Fmex.html)\n- (12 May 2022) [Factoring Exponentiation](https:\u002F\u002Fcp-algorithms.com\u002Falgebra\u002Ffactoring-exp.html)\n- (7 May 2022) [Knuth's Optimization](https:\u002F\u002Fcp-algorithms.com\u002Fdynamic_programming\u002Fknuth-optimization.html)\n- (31 March 2022) [Continued fractions](https:\u002F\u002Fcp-algorithms.com\u002Falgebra\u002Fcontinued-fractions.html)\n\nFull list of updates: [Commit History](https:\u002F\u002Fgithub.com\u002Fcp-algorithms\u002Fcp-algorithms\u002Fcommits\u002Fmain)\n\nFull list of articles: [Navigation](https:\u002F\u002Fcp-algorithms.com\u002Fnavigation.html)\n\n\n","该项目是一个专注于算法和数据结构的教育资源库，旨在为https:\u002F\u002Fcp-algorithms.com网站提供内容支持。它基于http:\u002F\u002Fe-maxx.ru的内容进行翻译，并持续增加新的文章以丰富算法竞赛相关的知识体系，主要使用C++语言实现示例代码。核心功能包括详尽的算法与数据结构讲解、实例代码展示以及持续更新的社区贡献机制。适合准备参加编程竞赛的学生、寻求提升算法技能的开发者以及对计算机科学基础感兴趣的读者使用。",2,"2026-06-11 03:58:20","trending"]