[{"data":1,"prerenderedAt":-1},["ShallowReactive",2],{"project-96257":3},{"id":4,"name":5,"fullName":6,"owner":7,"repo":5,"description":8,"homepage":9,"htmlUrl":9,"language":10,"languages":9,"totalLinesOfCode":9,"stars":11,"forks":12,"watchers":13,"openIssues":14,"contributorsCount":14,"subscribersCount":14,"size":14,"stars1d":14,"stars7d":14,"stars30d":14,"stars90d":14,"forks30d":14,"starsTrendScore":14,"compositeScore":15,"rankGlobal":9,"rankLanguage":9,"license":16,"archived":17,"fork":17,"defaultBranch":18,"hasWiki":19,"hasPages":17,"topics":20,"createdAt":9,"pushedAt":9,"updatedAt":29,"readmeContent":30,"aiSummary":31,"trendingCount":14,"starSnapshotCount":14,"syncStatus":32,"lastSyncTime":33,"discoverSource":34},96257,"awesome-competitive-olympiad-algorithms","wzj52501\u002Fawesome-competitive-olympiad-algorithms","wzj52501","Original algorithmic contest problems and lecture notes — NOIP to NOI & ACM-ICPC level",null,"C++",104,12,1,0,3.34,"MIT License",false,"main",true,[21,22,23,24,25,26,27,28],"acm-icpc","algorithms","competitive-programming","contest","lecture-notes","noi","oi","problem-setting","2026-09-21 02:04:31","# awesome-competitive-olympiad-algorithms\n\n[简体中文](README.zh-CN.md)\n\n> A personally curated archive of **original algorithmic problems** and lecture\n> notes — every problem authored and set by hand — spanning NOIP through NOI and\n> ACM-ICPC level. Centered on the algorithmic craft shared by informatics\n> olympiads and ACM-ICPC-style contests: design, analysis, and proof — not\n> low-level implementation.\n\n## About\n\nThis repository collects materials I created over years of competing and\nproblem setting in algorithm contests — **all original work**:\n\n- **Lecture slides** — notes prepared for teaching sessions.\n- **Original contest problems** — problems I set for the National Olympiad in\n  Informatics (NOI), provincial team selection, and mock contests.\n\nDifficulty ranges from NOIP all the way up to NOI and ACM-ICPC level.\n\nWhether you aim for OI, ACM-ICPC, or simply want to study rigorous algorithm\ndesign, I hope this archive offers something useful. **If it does, a star\nwould mean a lot — and would help more people discover it.**\n\nEach problem is preserved with three artifacts:\n\n- **statement** — the problem description\n- **standard solution** — a reference C++ implementation\n- **editorial** — the algorithm explained, with correctness and complexity\n\n## Structure\n\n```\n.\n├── Lectures\u002F   Algorithm lecture slides, notes, and a difficulty-ordered guide\n└── Setter\u002F     Original problems, grouped by contest, with a spoiler-free guide\n    ├── NOI\u002F    National Olympiad in Informatics\n    ├── BJTSC\u002F  Beijing Team Selection Contest\n    └── NOIP\u002F   National Olympiad in Informatics in Provinces\n```\n\n| Directory | Contents |\n|---|---|\n| [`Lectures\u002F`](Lectures\u002FREADME.md) | Lecture slides and notes on algorithms, with a difficulty-ordered guide covering key topics, prerequisites, and recommended levels. |\n| [`Setter\u002F`](Setter\u002FREADME.md) | A spoiler-free guide to the original problem sets, their sources, approximate difficulty, and suggested training order. |\n| `Setter\u002FNOI\u002F` | NOI problems, NOI-level mock contests, and problem-setting or validation archives. |\n| `Setter\u002FBJTSC\u002F` | Beijing Team Selection contests, joint provincial selection materials, and related training rounds. |\n| `Setter\u002FNOIP\u002F` | NOIP-level mock contests. |\n\n---\n\n> **Note** — All lecture slides and editorials are written in Chinese.\n\n## Test Data\n\nThe official test data (test points: `.in` \u002F `.out` \u002F `.ans`) for every original\nproblem is published separately as **AwesomeAlgorithms_SetterData**, a data mirror\nof the `Setter\u002F` directory tree — one sub-folder per problem, original file names\nkept.\n\n- **Download**: [AwesomeAlgorithms_SetterData.zip](https:\u002F\u002Fdrive.google.com\u002Ffile\u002Fd\u002F1TWY_qQmcse0iGu6806oHXnvKl1XxRCX0\u002Fview?usp=drive_link) (Google Drive)\n- Also available from [GitHub Release v1.1](https:\u002F\u002Fgithub.com\u002Fwzj52501\u002Fawesome-competitive-olympiad-algorithms\u002Freleases\u002Ftag\u002Fv1.1)\n\nThe archive includes its own `README.md` documenting the exact format.\n\n## License\n\n- **Code** (standard solutions \u002F `.cpp`): [MIT License](LICENSE)\n- **Content** (problem statements, editorials, lecture slides): [CC BY-NC-SA 4.0](CONTENT-LICENSE.md)\n\n## Updates\n\n- **upd0910**: Add difficulty-ordered guides for all lecture materials and a spoiler-free catalog of the problem sets, including prerequisites, intended levels, sources, and suggested study order.\n- **upd0909.2**: Fix typos and minor issues; make the standard solutions C++17-compatible.\n- **upd0909.1**: Release the official test data (AwesomeAlgorithms_SetterData) as GitHub Release v1.1.\n- **upd0908**: Add 12 new lecture slides and the MIT License; complete the missing solutions for BJTSC Mock-1 and NOI Mock-1.\n","这是一个面向信息学竞赛选手与教练的原创算法题库与讲义资源库，覆盖NOIP、NOI及ACM-ICPC难度等级。项目核心包含手工原创的竞赛题目（含题面、标准C++代码和中文题解）、系统化的算法讲义幻灯片及难度分级学习指南，强调算法设计、正确性证明与复杂度分析，而非单纯实现技巧。所有内容均为作者多年参赛与命题实践积累，适用于OI\u002FACM备赛训练、算法教学辅导及高阶算法思维培养。",2,"2026-09-12 02:30:15","CREATED_QUERY"]