{"id":15032431,"url":"https://github.com/endlesscheng/codeforces-go","last_synced_at":"2025-05-13T17:13:38.589Z","repository":{"id":37657622,"uuid":"210268863","full_name":"EndlessCheng/codeforces-go","owner":"EndlessCheng","description":"算法竞赛模板库 by 灵茶山艾府 💭💡🎈","archived":false,"fork":false,"pushed_at":"2025-05-06T22:51:32.000Z","size":129665,"stargazers_count":6572,"open_issues_count":8,"forks_count":677,"subscribers_count":63,"default_branch":"master","last_synced_at":"2025-05-06T23:29:42.672Z","etag":null,"topics":["acm-icpc","algorithm","algorithms","codeforces","codeforces-go","codeforces-golang","codeforces-solutions","competitive-programming","data-structure","data-structures","go","golang","icpc","leetcode","leetcode-go","leetcode-golang"],"latest_commit_sha":null,"homepage":"https://space.bilibili.com/206214","language":"Go","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/EndlessCheng.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2019-09-23T05:08:01.000Z","updated_at":"2025-05-06T22:51:35.000Z","dependencies_parsed_at":"2024-03-23T12:14:24.891Z","dependency_job_id":"70db9781-9285-48f3-8e88-76666528a28d","html_url":"https://github.com/EndlessCheng/codeforces-go","commit_stats":{"total_commits":8999,"total_committers":3,"mean_commits":"2999.6666666666665","dds":"0.17990887876430717","last_synced_commit":"0f59a92f4a14dcb1ae08b9029eeb06a728657ccc"},"previous_names":[],"tags_count":3,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EndlessCheng%2Fcodeforces-go","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EndlessCheng%2Fcodeforces-go/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EndlessCheng%2Fcodeforces-go/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/EndlessCheng%2Fcodeforces-go/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/EndlessCheng","download_url":"https://codeload.github.com/EndlessCheng/codeforces-go/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":253990498,"owners_count":21995776,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["acm-icpc","algorithm","algorithms","codeforces","codeforces-go","codeforces-golang","codeforces-solutions","competitive-programming","data-structure","data-structures","go","golang","icpc","leetcode","leetcode-go","leetcode-golang"],"created_at":"2024-09-24T20:18:23.053Z","updated_at":"2025-05-13T17:13:33.579Z","avatar_url":"https://github.com/EndlessCheng.png","language":"Go","readme":"# 算法竞赛模板库 by 灵茶山艾府 💭💡🎈\n\n## 算法 Algorithm\n\n由于算法知识点繁杂，将自己学习到的算法、做过的题目分类整理好是有必要的。\n\n一个算法模板应当涵盖以下几点：\n- 对该算法的基本介绍（核心思想、复杂度等）\n- 参考链接或书籍章节（讲得比较好的资料）\n- 模板代码（代码注释、使用说明）\n- 模板补充（常见题型中的额外代码、建模技巧等）\n- 相关题目（模板题、经典题、思维转换题等）\n\n## 算法目录\n\n[不了解 Go？快速入门教程](https://gobyexample-cn.github.io/)\n\n- [集合论与位运算](https://leetcode.cn/circle/discuss/CaOJ45/)\n- 数据结构\n  - [单调栈 monotone_stack.go](/copypasta/monotone_stack.go)\n  - [单调队列 monotone_queue.go](/copypasta/monotone_queue.go)\n    - 二维单调队列\n  - [双端队列 deque.go](/copypasta/deque.go)\n  - [堆（优先队列）heap.go](/copypasta/heap.go)\n    - 支持修改、删除指定元素的堆\n    - 懒删除堆\n    - 对顶维\n    - 前缀中位数\n    - 滑动窗口前 k 小元素和\n  - [并查集 union_find.go](/copypasta/union_find.go)\n    - 点权并查集\n    - 边权并查集（种类并查集）\n    - 可持久化并查集\n    - 回滚并查集 \u0026 动态图连通性\n  - [稀疏表（ST 表）sparse_table.go](/copypasta/sparse_table.go)\n  - [树状数组 fenwick_tree.go](/copypasta/fenwick_tree.go)\n    - 差分树状数组（支持区间加、区间求和）\n    - 二维差分树状数组\n    - 树套树 \u0026 三维偏序\n  - [线段树 segment_tree.go](/copypasta/segment_tree.go)\n    - 线段树二分\n    - 延迟标记（懒标记）\n      - [矩形面积并（扫描线）segment_tree_rect.go](/copypasta/segment_tree_rect.go)\n    - 动态开点\n    - 线段树合并\n    - 线段树分裂\n    - 持久化（主席树）\n  - [0-1 线段树 segment_tree01.go](/copypasta/segment_tree01.go)\n  - [左偏树（可并堆）leftist_tree.go](/copypasta/leftist_tree.go)\n  - [笛卡尔树 cartesian_tree.go](/copypasta/cartesian_tree.go)\n  - [二叉搜索树公共方法 bst.go](/copypasta/bst.go)\n  - [Treap treap.go](/copypasta/treap/README.md)\n    - [前 k 小元素和](/copypasta/treap/prefixsum/prefixsum.go)\n  - [伸展树 splay.go](/copypasta/splay.go)\n  - [动态树 LCT link_cut_tree.go](/copypasta/link_cut_tree.go)\n  - [红黑树 red_black_tree.go](/copypasta/red_black_tree.go)\n  - [替罪羊树 scapegoat_tree.go](/copypasta/scapegoat_tree.go)\n  - [k-d 树 kd_tree.go](/copypasta/kd_tree.go)\n  - 珂朵莉树（ODT）\n    - [数组版 odt.go](/copypasta/odt.go)\n    - [平衡树版 odt_bst.go](/copypasta/odt_bst.go)\n  - [根号分治、分块 sqrt_decomposition.go](/copypasta/sqrt_decomposition.go)\n  - [莫队算法 mo.go](/copypasta/mo.go)\n     - 普通莫队\n     - 带修莫队\n     - 回滚莫队\n     - 树上莫队\n- [字符串 strings.go](/copypasta/strings.go)\n  - 字符串哈希\n  - KMP\n    - pi 函数\n    - border\n    - 最小循环节\n    - fail 树（失配树 / border 树）\n  - 扩展 KMP（Z algorithm）\n  - 最小表示法\n  - 最长回文子串 \n    - Manacher 算法\n  - [回文自动机（回文树，PAM）pam.go](/copypasta/pam.go)\n  - 后缀数组（SA）\n  - [后缀自动机（SAM）sam.go](/copypasta/sam.go)\n  - [字典树 trie.go](/copypasta/trie.go)\n    - 可持久化字典树\n  - [0-1 字典树 trie01.go](/copypasta/trie01.go)\n    - 最大异或和\n    - 第 k 大异或和\n    - 删除元素\n    - 可持久化 0-1 字典树\n    - 【研究】0-1 字典树上最多有多少个节点\n  - [AC 自动机 acam.go](/copypasta/acam.go)\n- 数学\n  - [数论 math.go](/copypasta/math.go)\n    - 辗转相除法（最大公因数 GCD）\n    - 类欧几里得算法 ∑⌊(ai+b)/m⌋\n    - Pollard-Rho 质因数分解算法\n    - 埃氏筛（埃拉托斯特尼筛法）\n    - 欧拉筛（线性筛）\n    - 欧拉函数\n    - 原根\n    - 扩展 GCD\n      - 二元一次不定方程\n    - 逆元\n      - 线性求逆元\n    - 中国剩余定理（CRT）\n      - 扩展中国剩余定理\n    - 离散对数\n    - 大步小步算法（BSGS）\n      - 扩展大步小步算法\n    - 二次剩余\n    - Jacobi 符号\n    - N 次剩余\n    - 卢卡斯定理\n      - 扩展卢卡斯定理\n    - 卡特兰数\n    - 默慈金数\n    - 那罗延数\n    - 斯特林数\n      - 第一类斯特林数（轮换）\n      - 第二类斯特林数（子集）\n    - 贝尔数\n    - 欧拉数\n    - 数论分块（整除分块）\n    - 莫比乌斯函数\n    - 莫比乌斯反演\n      - 互质计数问题\n      - GCD 求和问题\n    - 杜教筛\n  - [组合数学 math_comb.go](/copypasta/math_comb.go)\n    - 常见模型\n    - 常用恒等式\n    - 容斥原理\n  - [快速傅里叶变换 FFT math_fft.go](/copypasta/math_fft.go)\n  - [快速数论变换 NTT math_ntt.go](/copypasta/math_ntt.go)\n    - 包含多项式全家桶（求逆、开方等等）\n  - [快速沃尔什变换 FWT math_fwt.go](/copypasta/math_fwt.go)\n  - [连分数、佩尔方程 math_continued_fraction.go](/copypasta/math_continued_fraction.go)\n  - [线性代数 math_matrix.go](/copypasta/math_matrix.go)\n    - 矩阵相关运算\n    - 高斯消元\n    - 行列式\n    - 线性基\n  - [数值分析 math_numerical_analysis.go](copypasta/math_numerical_analysis.go)\n    - 自适应辛普森积分\n    - 拉格朗日插值\n  - [计算几何 geometry.go](/copypasta/geometry.go)\n    - 线与点\n    - 线与线\n    - 圆与点\n      - 最小圆覆盖\n        - Welzl 随机增量法\n      - 固定半径覆盖最多点\n    - 圆与线\n    - 圆与圆\n    - 圆与矩形\n    - 最近点对\n    - 多边形与点\n      - 判断点在凸多边形内 $O(\\log n)$\n      - 判断点在任意多边形内\n        - 转角法（统计绕数）\n    - 凸包\n    - 最远点对\n      - 旋转卡壳\n    - 半平面交\n  - [博弈论 games.go](/copypasta/games.go)\n    - SG 函数\n- [动态规划 dp.go](/copypasta/dp.go)\n  - 背包\n    - 0-1 背包\n    - 完全背包\n    - 多重背包\n      - 二进制优化\n      - 单调队列优化\n      - 同余前缀和优化（求方案数）\n    - 分组背包\n    - 树上背包（依赖背包）\n    - 字典序最小方案\n  - 线性 DP\n    - 最大子段和\n    - LCS\n    - LPS\n    - LIS\n      - 狄尔沃斯定理\n    - LCIS\n    - 长度为 m 的 LIS 个数\n    - 本质不同子序列个数\n  - 区间 DP\n  - 环形 DP\n  - 博弈 DP\n  - 概率 DP\n  - 期望 DP\n  - 状压 DP\n    - 全排列 DP\n    - 旅行商问题（TSP）\n    - 子集 DP\n    - 高维前缀和（SOS DP）\n    - 插头 DP\n  - 数位 DP\n    - 记忆化搜索（同时跑上下界）\n  - 倍增优化 DP\n  - 斜率优化 DP（CHT）\n  - WQS 二分优化 DP（凸优化 DP / 带权二分）\n  - 树形 DP\n    - 树的直径个数\n    - 在任一直径上的节点个数\n    - 树上最大独立集\n    - 树上最小顶点覆盖\n    - 树上最小支配集\n    - 树上最大匹配\n    - 换根 DP（二次扫描法）\n      - 简单写法\n      - 维护最大次大写法\n      - 前后缀分解写法（适用性最广）\n- [图论 graph.go](/copypasta/graph.go)\n  - 链式前向星\n  - DFS 常用技巧\n  - BFS 常用技巧\n  - 欧拉回路和欧拉路径\n    - 无向图\n    - 有向图\n    - 完全图\n  - 割点\n  - 割边（桥）\n  - 双连通分量（BCC）\n    - v-BCC\n    - e-BCC\n  - 仙人掌 \u0026 圆方树\n  - 最短路\n    - Dijkstra\n    - SPFA（队列优化的 Bellman-Ford）\n      - 差分约束系统\n    - Floyd-Warshall\n    - Johnson\n    - 0-1 BFS（双端队列 BFS）\n    - 字典序最小最短路\n    - 同余最短路\n  - 最小环\n  - 最小斯坦纳树\n  - 最小生成树（MST）\n    - Kruskal\n    - Prim\n  - 单度限制最小生成树\n  - 次小生成树\n  - 曼哈顿距离最小生成树\n  - 最小差值生成树\n  - 最小树形图\n    - 朱刘算法\n  - 二分图判定（染色）\n  - 二分图找奇环\n  - 二分图最大匹配\n    - 匈牙利算法\n  - 带权二分图最大完美匹配\n    - Kuhn–Munkres 算法\n  - 拓扑排序\n  - 强连通分量（SCC）\n    - Kosaraju\n    - Tarjan\n  - 2-SAT\n  - 基环树\n  - 最大流\n    - Dinic\n    - ISAP\n    - HLPP\n  - 最小费用最大流\n    - SPFA\n    - Dijkstra\n  - 三元环计数\n  - 四元环计数\n  - [树上问题 graph_tree.go](/copypasta/graph_tree.go)\n    - 直径\n    - 重心\n    - 点分治\n    - 点分树\n    - 最近公共祖先（LCA）\n      - 倍增\n      - ST 表\n      - Tarjan\n      - 树上差分\n      - 虚树\n    - 重链剖分（HLD）\n    - 长链剖分\n    - 树上启发式合并（small to large）\n      - 按大小合并\n      - 轻重儿子合并\n    - 树分块\n    - Prufer 序列\n- 其他\n  - [bitset](/copypasta/bitset.go)\n  - [位运算笔记 bits.go](/copypasta/bits.go)\n    - 区间位运算 trick（含 GCD）\n  - [二分 三分 sort.go](/copypasta/sort.go)\n    - 二分答案\n    - 0-1 分数规划\n    - 整体二分\n  - [搜索 search.go](/copypasta/search.go)\n    - 枚举排列\n    - 枚举组合\n    - 生成下一个排列\n    - 康托展开\n    - 逆康托展开\n    - 枚举子集\n      - Gosper's Hack\n    - 折半枚举（Meet in the middle）\n      - 超大背包问题\n  - [随机算法 rand.go](/copypasta/rand.go)\n    - 模拟退火\n  - [基础算法 common.go](/copypasta/common.go)\n    - 算法思路整理\n    - 分组循环\n    - 滑动窗口\n    - 前缀和\n    - 同余前缀和\n    - 二维前缀和\n    - 菱形区域和\n    - 斜向前缀和\n      - 菱形边界和\n    - 等腰直角三角形区域和\n      - 金字塔区域和\n    - 二阶差分\n    - 二维差分\n    - 菱形二维差分\n    - 离散化\n  - [杂项 misc.go](/copypasta/misc.go)\n- [快速输入输出模板 io.go](/copypasta/io.go)\n- [交互题单 interactive.go](/copypasta/interactive.go)\n\n## 分类题单\n\n[如何科学刷题？](https://leetcode.cn/circle/discuss/RvFUtj/)\n\n1. [滑动窗口与双指针（定长/不定长/单序列/双序列/三指针/分组循环）](https://leetcode.cn/circle/discuss/0viNMK/)\n2. [二分算法（二分答案/最小化最大值/最大化最小值/第K小）](https://leetcode.cn/circle/discuss/SqopEo/)\n3. [单调栈（基础/矩形面积/贡献法/最小字典序）](https://leetcode.cn/circle/discuss/9oZFK9/)\n4. [网格图（DFS/BFS/综合应用）](https://leetcode.cn/circle/discuss/YiXPXW/)\n5. [位运算（基础/性质/拆位/试填/恒等式/思维）](https://leetcode.cn/circle/discuss/dHn9Vk/)\n6. [图论算法（DFS/BFS/拓扑排序/最短路/最小生成树/二分图/基环树/欧拉路径）](https://leetcode.cn/circle/discuss/01LUak/)\n7. 🔥[动态规划（入门/背包/状态机/划分/区间/状压/数位/数据结构优化/树形/博弈/概率期望）](https://leetcode.cn/circle/discuss/tXLS3i/)\n8. [常用数据结构（前缀和/差分/栈/队列/堆/字典树/并查集/树状数组/线段树）](https://leetcode.cn/circle/discuss/mOr1u6/)\n9. [数学算法（数论/组合/概率期望/博弈/计算几何/随机算法）](https://leetcode.cn/circle/discuss/IYT3ss/)\n10. [贪心与思维（基本贪心策略/反悔/区间/字典序/数学/思维/脑筋急转弯/构造）](https://leetcode.cn/circle/discuss/g6KTKL/)\n11. [链表、二叉树与回溯（前后指针/快慢指针/DFS/BFS/直径/LCA/一般树）](https://leetcode.cn/circle/discuss/K0n2gO/)\n12. [字符串（KMP/Z函数/Manacher/字符串哈希/AC自动机/后缀数组/子序列自动机）](https://leetcode.cn/circle/discuss/SJFwQI/)\n\n欢迎关注 [B站@灵茶山艾府](https://space.bilibili.com/206214)\n\n## 如何选择题目 How to Choose Problems\n\n### Rating \u003c 2100\n\n这一阶段主要目标是提高对问题的观察能力。做构造题可以针对性地训练这一点。\n\n选择难度在自己 rating 到 rating+200 范围内的构造题 (tag: constructive algorithms)，按照过题人数降序做题，比如 [1700,1900] 区间的就是下面这个链接：\n\n[https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=constructive+algorithms%2C1700-1900](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=constructive+algorithms%2C1700-1900)\n\n通过大量的构造题训练，提高观察能力，快速找到切题入口。具体见我在知乎上的这篇 [回答](https://www.zhihu.com/question/353734418/answer/2353160035)。\n\n### Rating \u003e= 2100（个人训练用，仅供参考）\n\n见识更高的山、更广的海。\n\n按人数从高到低，做 2200+ 的题目。**建议不设置难度上限**！由于按人数排序，难度分不会太高，**不设上限可以避免错过高分好题**。\n\n- [按照洛谷通过人数排序的 CF 题单](https://www.luogu.com.cn/training/465300)\n- [构造题 2200+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=constructive+algorithms%2C2200-)：锻炼手玩能力。\n- [DP 2200+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=dp%2C2200-)：几乎每场都有 DP。\n- [数学综合：数论、组合数学、概率期望等 2200+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=combine-tags-by-or%2Ccombinatorics%2Cfft%2Cmatrices%2Cnumber+theory%2Cprobabilities%2Cchinese+remainder+theorem%2C2200-)：包含 6 个 tag。\n- [图论综合：图论+树上问题 2200+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=combine-tags-by-or%2C2-sat%2Cdsu%2Cflows%2Cgraph+matchings%2Cgraphs%2Cshortest+paths%2Ctrees%2C2200-)：包含 7 个 tag。\n- [字符串 2200+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=combine-tags-by-or%2Cstring+suffix+structures%2Cstrings%2C2200-)：数据结构题不好筛选，可以找树状数组/线段树的题单，这里只单独筛选字符串的题。\n- [交互 2200+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=interactive%2C2200-)：偶尔做做，了解一些解题套路。\n- [博弈 2000+](https://codeforces.com/problemset?order=BY_SOLVED_DESC\u0026tags=games%2C2000-)：也适合锻炼手玩。由于题目比较少，从 2000 开始筛选。\n\n**我的 Codeforces 账号**\n\n[![0x3F](https://img.shields.io/badge/0x3F-MASTER%202208-orange?style=for-the-badge)](https://codeforces.com/profile/0x3F)\n\n\n## 测试及对拍 Testing\n\n编写一个 `run(io.Reader, io.Writer)` 函数来处理输入输出。这样写的理由是：\n\n- 在 `main` 中调用 `run(os.Stdin, os.Stdout)` 来执行代码；\n- 测试时，将测试数据转换成 `strings.Reader` 当作输入，并用一个 `strings.Builder` 来接收输出，将这二者传入 `run` 中，然后就能比较输出与答案了；\n- 对拍时需要实现一个暴力算法 `runAC`，参数和 `run` 一样。通过 [随机数据生成器](/main/testutil/rand.go) 来生成数据，分别传入 `runAC` 和 `run`，通过比对各自的输出，来检查 `run` 中的问题。\n\n具体可以见 Codeforces 代码仓库 [main](/main)，所有非交互题的代码及其对应测试全部按照上述框架实现。\n\n例如：[1439C_test.go](/main/1400-1499/1439C_test.go)\n\n交互题的写法要复杂一些，需要把涉及输入输出的地方抽象成接口，详见 [interactive_problem](/copypasta/template/interactive_problem)。\n\n## 学习资料及题目 Resources\n\n注：由于入门经典上选了很多区域赛的题，一部分题目可以在 GYM 上找到，这样可以就可以用 Go 编程提交了。\n\n[算法竞赛入门经典（第二版）](https://github.com/aoapc-book/aoapc-bac2nd)\n\n[算法竞赛入门经典训练指南](https://github.com/klb3713/aoapc-book/tree/master/TrainingGuide/bookcodes)\n\n[算法竞赛入门经典训练指南（升级版）](https://gitee.com/sukhoeing/aoapc-training-guide2)\n\n[算法竞赛进阶指南](https://github.com/lydrainbowcat/tedukuri)\n\n[算法竞赛入门到进阶](https://github.com/luoyongjun999/code)\n\n[《算法竞赛》配套题单](https://www.luogu.com.cn/training/441063)\n\n[国家集训队论文列表](https://github.com/enkerewpo/OI-Public-Library/tree/master/IOI%E4%B8%AD%E5%9B%BD%E5%9B%BD%E5%AE%B6%E5%80%99%E9%80%89%E9%98%9F%E8%AE%BA%E6%96%87)\n\n[算法竞赛 (ICPC, OI, etc) 论文，课件，文档，笔记等](https://github.com/LzyRapx/Competitive-Programming-Docs)\n\n[算法竞赛课件分享 by hzwer](https://github.com/hzwer/shareOI)\n\n[算法第四版 Java 源码](https://algs4.cs.princeton.edu/code/)\n\n[数据结构和算法动态可视化](https://visualgo.net/zh)\n\n[OI Wiki](https://oi-wiki.org/)\n\n[CP-Algorithms](https://cp-algorithms.com/)\n\n[The Ultimate Topic List (with Resources, Problems and Templates)](https://codeforces.com/blog/entry/95106)\n\n[A Huge Update on The Ultimate Topic List](https://codeforces.com/blog/entry/129419)\n\n[洛谷日报](https://www.craft.do/s/N0l80k2gv46Psq)\n\n[All the good tutorials found for Competitive Programming](https://codeforces.com/blog/entry/57282)\n\n[Codeforces Problem Topics](https://codeforces.com/blog/entry/55274)\n\n[The Ultimate Topic List(with Tutorials, Problems, and Templates)](https://blog.shahjalalshohag.com/topic-list/)\n\n[GeeksforGeeks 上的算法合集](https://www.geeksforgeeks.org/how-to-prepare-for-acm-icpc/)\n\n[Pepcy 模板](http://pepcy.cf/icpc-templates/)\n\n[F0RE1GNERS 模板](https://github.com/F0RE1GNERS/template)\n\nhttps://github.com/hh2048/XCPC 含 jiangly 模板\n\nhttps://www.cnblogs.com/alex-wei/p/contents.html\n\n[【模板整合计划】目录](https://www.cnblogs.com/Xing-Ling/p/10930556.html)\n\n[算法学习笔记（目录）](https://zhuanlan.zhihu.com/p/105467597)\n\n[洛谷模板题（建议按难度筛选）](https://www.luogu.com.cn/problem/list?keyword=%E6%A8%A1%E6%9D%BF\u0026page=1)\n\n[能力全面提升综合题单](https://www.luogu.com.cn/training/9391)\n\n[Luogu Problem List](https://github.com/SFOI-Team/luogu-problem-list/blob/master/list.md)\n\n[洛谷原试炼场](https://www.luogu.com.cn/paste/0id3h6on)\n\n[Links of ICPC/CCPC Contests from China](https://codeforces.com/blog/entry/84429)\n\n[AtCoder 题目分类](https://atcoder-tags.herokuapp.com/explain)\n\n### AtCoder 版《挑战程序设计竞赛》\n\n[AtCoder 版！蟻本 (初級編)](https://qiita.com/drken/items/e77685614f3c6bf86f44)\n\n[AtCoder 版！蟻本 (中級編)](https://qiita.com/drken/items/2f56925972c1d34e05d8)\n\n[AtCoder 版！蟻本 (上級編)](https://qiita.com/drken/items/9b311d553aa434bb26e4)\n\n[AtCoder 版！蟻本 (発展的トピック編)](https://qiita.com/drken/items/0de3d205690d92307b7c)\n\n### 待整理\n\n[【杂文】记一些有用的神奇网站](https://www.cnblogs.com/Xing-Ling/p/10897760.html)\n\n[偶然在 GitHub 上发现的超长列表](https://github.com/dhs347/Dream/blob/master/%E8%AE%A1%E5%88%92/%E8%AE%A1%E5%88%92%E4%B9%A6/A%E8%AE%A1%E5%88%92_%E9%98%B6%E6%AE%B51.md)\n\n[算法竞赛训练中较难的部分](https://blog.csdn.net/skywalkert/article/details/48924861)\n\n[算法竞赛中可能不太会遇到的论文题](https://blog.csdn.net/skywalkert/article/details/48878925)\n\n[[杂谈]OI/ACM中冷门算法](https://zhuanlan.zhihu.com/p/21924647)\n\n[Things I don't know](https://codeforces.com/blog/entry/92248)\n\n\u003e [meme] If you know at least 3 of these things and you are not red — you are doing it wrong. Stop learning useless algorithms, go and solve some problems, learn how to use binary search.\n\nhttps://blog.csdn.net/calabash_boy/article/details/79973483\n\nhttps://github.com/zimpha/algorithmic-library\n\nhttps://www.luogu.com.cn/blog/command-block/blog-suo-yin-zhi-ding-post\n\nhttps://wcysai.github.io/\n\nhttps://www.luogu.com.cn/blog/Troverld/index\n\n[C++ @cache](https://codeforces.com/blog/entry/124683)\n\n## 其他 Others\n\nMy GoLand `Live Templates` and `Postfix Completion` [settings](/misc/my_goland_template)\n\n### Useful Tools\n\n[查看汇编](https://godbolt.org/)\n\n[GeoGebra](https://www.geogebra.org/classic)\n\n[Draw Geometry](https://csacademy.com/app/geometry_widget/)\n\n[Draw Graph](https://csacademy.com/app/graph_editor/)\n\n[OEIS](https://oeis.org/)\n\n[Wolfram|Alpha](https://www.wolframalpha.com/)\n\n[ACD Ladders](https://www.acodedaily.com/)\n\n[Contests Filter](https://codeforceshelper.herokuapp.com/contests)\n\n[Codeforced](http://codeforced.github.io/handle/)\n\n[Codeforces Visualizer](https://cfviz.netlify.app/)\n\n[Codeforces Solve Tracker](https://tom0727.github.io/cf-problems/)\n\n[Another Codeforces Solve Tracker](https://cftracker.netlify.app/contests)\n\n[AtCoder Problems](https://kenkoooo.com/atcoder/#/table/)\n\n[AtCoder Companions](https://atcoder-companions.kakira.dev/)\n\n[AtCoder-Codeforces Rating converter](https://silverfoxxxy.github.io/rating-converter)\n\n[在线 Markdown + LaTeX](https://stackedit.io/app)\n\n### Rating and Difficulties\n\n[Open Codeforces Rating System](https://codeforces.com/blog/entry/20762)\n\n[How to Interpret Contest Ratings](https://codeforces.com/blog/entry/68288)\n\n[Codeforces: Problem Difficulties](https://codeforces.com/blog/entry/62865)\n\n[Elo rating system](https://en.wikipedia.org/wiki/Elo_rating_system#Theory)\n\n### Stay Healthy\n\n[Exercises!](https://musclewiki.org/)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fendlesscheng%2Fcodeforces-go","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fendlesscheng%2Fcodeforces-go","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fendlesscheng%2Fcodeforces-go/lists"}