{"id":17914434,"url":"https://github.com/dtcxzyw/oi-source","last_synced_at":"2025-03-23T23:30:51.908Z","repository":{"id":105619517,"uuid":"140553277","full_name":"dtcxzyw/OI-Source","owner":"dtcxzyw","description":"OI代码仓库、复习笔记、代码模板、本地Judger","archived":false,"fork":false,"pushed_at":"2021-12-17T12:52:52.000Z","size":2406,"stargazers_count":53,"open_issues_count":0,"forks_count":14,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-03-19T02:24:19.345Z","etag":null,"topics":["acm-icpc","acm-icpc-handbook","algorithm","algorithm-challenges","automated-testing","competitive-programming","data-structures","icpc","icpc-training","judger","noi","noip","oi","oi-handbook","oi-training","olympiad-in-informatics"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dtcxzyw.png","metadata":{"files":{"readme":"readme.md","changelog":null,"contributing":null,"funding":null,"license":null,"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}},"created_at":"2018-07-11T09:33:15.000Z","updated_at":"2025-03-05T12:52:26.000Z","dependencies_parsed_at":null,"dependency_job_id":"a5e2dc8d-8859-46fd-b82f-6956a9ef3a4d","html_url":"https://github.com/dtcxzyw/OI-Source","commit_stats":null,"previous_names":[],"tags_count":4,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dtcxzyw%2FOI-Source","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dtcxzyw%2FOI-Source/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dtcxzyw%2FOI-Source/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dtcxzyw%2FOI-Source/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dtcxzyw","download_url":"https://codeload.github.com/dtcxzyw/OI-Source/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245186453,"owners_count":20574551,"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","acm-icpc-handbook","algorithm","algorithm-challenges","automated-testing","competitive-programming","data-structures","icpc","icpc-training","judger","noi","noip","oi","oi-handbook","oi-training","olympiad-in-informatics"],"created_at":"2024-10-28T19:58:21.516Z","updated_at":"2025-03-23T23:30:51.893Z","avatar_url":"https://github.com/dtcxzyw.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"![GitHub code size in bytes](https://img.shields.io/github/languages/code-size/dtcxzyw/OI-Source.svg?style=popout-square)\n\n# 此仓库是我的OI代码仓库。\n\n## 该仓库包括：\n- Source/Unclassified：源代码\n- Review：[复习笔记](https://github.com/dtcxzyw/OI-Source/releases/download/Fourth/Main.pdf)![GitHub All Releases](https://img.shields.io/github/downloads/dtcxzyw/OI-Source/total.svg?style=popout-square)\n- [Checker](/Checker)：Windows/Linux本地Judger\n- Templates：代码模板\n\n希望有一天学弟们可以看到我给他们留下的东西。\n\n高考加油吧。\n\n# Review\n## 博弈论\n- [x] nim系列游戏\n- [x] sg函数\n- [x] 对抗搜索 AlphaBeta\n- [x] 威佐夫博弈、斐波那契博弈\n## 网络流\n- [x] 二分图\n- [x] 最大流\n- [x] 费用流\n- [x] 带上下界网络流\n- [x] 常见网络流/最小割模型\n- [x] 最小割性质【AHOI2009】最小割\n- [x] 消圈定理\n## 数据结构\n- [x] 树状数组\n- [x] 线段树\n- [x] 划分树\n- [x] 平衡树（fhqtreap/splay）\n- [x] LCT\n- [x] 并查集\n- [x] kd-tree\n- [x] 可并堆\n- [x] 可持久化数据结构\n## 数学\n### 数论\n- [x] gcd/exgcd\n- [x] 费马（线性推逆元）/（EX）欧拉定理\n- [x] Miller Rabin\n- [x] Pollard Rho\n- [x] RSA\n- [x] CRT/exCRT\n- [x] 线性筛求积性函数值-因子分解\n- [x] 狄利克雷卷积，莫比乌斯反演\n- [x] 低于线性复杂度筛法\n- [x] BSGS/exBSGS\n- [x] 原根 映射技巧\n### 集合论/群论\n- [x] 置换 Polya定理\n- [x] 容斥\n### 组合数学\n- [x] Catalan\n- [x] Stirling\n- [x] lucas/exLucas\n### 多项式\n- [x] FFT\n- [x] NTT\n- [x] FWT\n- [x] 实序列DFT\n- [x] MTT\n- [x] 牛顿迭代法与多项式求逆/取模/ln/exp/三角函数/组合数取模\n- [x] FFT封装\n### 线性代数\n- [x] 高斯消元\n- [x] LUP分解/矩阵求逆\n- [x] 行列式\n- [x] 线性基\n- [x] 最小二乘逼近\n### 其他\n- [x] 泰勒展开\n- [x] Simpson积分\n- [x] 概率期望\n- [x] 生成函数/贝尔数/伯努利数求自然数幂和\n- [x] 拉格朗日插值法\n- [x] 二项式/斯特林/子集反演\n- [x] 常见数学公式\n- [x] 线性复杂度插值\n## 动态规划\n- [x] 背包\n- [x] 数位动规\n- [x] 插头dp\n- [x] LCIS\n### dp优化\n- [x] 单调队列\n- [x] 斜率优化\n- [x] 四边形不等式\n- [x] 矩阵快速幂\n## 图论\n### 树\n- [x] LCA\n- [x] 树链剖分（重链剖分/长链剖分）\n- [x] 树的直径\n- [x] 点分治\n- [x] 虚树\n- [x] purfer序列\n- [x] dsu on tree\n### 最短路\n- [x] SPFA\n- [x] Dijskra\n- [x] Floyd\n- [x] 差分约束\n- [x] k短路\n### 生成树\n- [x] Kruskal/Prim\n- [x] Kruskal重构树\n- [x] 曼哈顿距离最小生成树\n- [x] 生成树性质\n- [x] MatrixTree定理、扩展\n- [x] 斯坦纳树\n### 其他\n- [x] 割点，桥\n- [x] 强连通分量\n- [x] 双连通分量\n- [x] 2-SAT\n- [x] 仙人掌与圆方树\n- [x] 欧拉回路/哈密尔顿回路\n- [x] 竞赛图、最小平均值环、平面图性质\n## 字符串\n- [x] Hash\n- [x] Trie/AC自动机\n- [x] 后缀树\n- [x] 后缀数组\n- [x] 后缀仙人掌\n- [x] 后缀自动机\n- [x] PAM\n- [x] KMP\n- [x] Manacher\n- [x] Huffman\n- [x] 表达式解析\n## 计算几何\n- [x] 基础设施-pick定理-切比雪夫距离\n- [x] 凸包（[在线凸包](http://dwjshift.logdown.com/posts/285072) /凸包加法/合并/稀疏包分布P614）\n- [x] 旋转卡壳\n- [x] HPI（WC2012钟诚讲稿-线性判空集）\n- [x] 圆的交并/最小圆覆盖/圆的反演\n- [x] 平面最近点对\n## 最优化问题\n- [x] 爬山法\n- [x] 模拟退火（分块模拟退火）\n- [x] 遗传算法\n- [x] A*算法\n- [x] 梯度下降\n- [x] 01分数规划\n## 思想/技巧\n- [x] 二分\n- [x] 三分\n- [x] 补集转化\n- [x] 莫队-按照奇偶性排序-树上莫队\n- [x] 分块\n- [x] MITM\n- [x] 倍增\n- [x] 随机化\n- [x] 按位拆分\n- [x] 整体二分\n- [x] cdq分治\n- [x] 扫描线\n- [x] 差分\n- [x] 双指针法\n- [x] 优先队列维护长序列\n- [x] 可删堆\n- [x] 二进制分组\n## 卡常\n- [x] 取模\n- [x] 矩阵乘法\n- [x] 基于硬件的优化\n- [x] 搜索优化\n- [x] 位运算技巧 子集枚举\n- [x] 数组的清零（对修改部分清零，时间戳）\n## 理论\n- [x] 主定理\n- [x] NP完全性\n- [x] 数值编码\n-----\n# Advance\n- [x] 带花树\n- [x] 线段树分治\n- [x] HLPP\n- [x] min_25筛\n- [x] Berlekamp-Massey[By fjzzq2002](https://www.cnblogs.com/zzqsblog/p/6877339.html)\n- [x] ISAP\n- [x] IDA*\n- [x] DLX\n- [x] 单纯形算法\n- [x] Johnson\n- [x] 二次剩余、三次剩余、高次剩余\n- [x] 拉格朗日乘数法\n- [x] 常系数齐次线性递推\n- [x] 拉格朗日反演\n- [x] 快速莫比乌斯变换\n- [x] zkw线段树\n- [x] Segment tree beats\n- [x] Lindström–Gessel–Viennot lemma\n- [x] 最小割树\n- [x] 势能分析线段树\n- [x] 弦图、最大势算法\n- [x] Hall定理\n- [x] Raney引理\n- [x] 快速凸包\n- [x] 康托展开\n- [x] Stoer-Wagner算法\n- [x] LCT维护子树信息和边权信息\n- [x] 共价大爷游长沙技巧\n- [x] FFT字符串通配[By yyb](https://www.cnblogs.com/cjyyb/p/10132855.html)\n- [x] boruvka算法-CF888G\n- [x] 动态DP\n- [x] ExKMP(Z Algorithm)\n- [x] 二维FFT\n- [x] 类欧几里得算法\n- [x] 三元环[By tan90°](https://www.luogu.org/blog/KingSann/fou-chang-yong-di-hei-ke-ji-san-yuan-huan-post)\n- [x] 启发式分裂[By zsy](https://blog.csdn.net/DSL_HN_2002/article/details/81193576)\n- [x] minmax容斥\n- [x] CZT[By myy 再探快速傅里叶变换](http://www.doc88.com/p-4912876232995.html)\n- [x] 优化形式幂级数计算的牛顿法的常数[By negiizhao](http://negiizhao.blog.uoj.ac/blog/4671)\n- [x] 回滚莫队\n- [x] 原根对1求离散对数[By Dance Of Faith](https://www.cnblogs.com/Dance-Of-Faith/p/9905786.html)\n- [x] 集合选数最值一类问题[By tkandi](https://www.cnblogs.com/tkandi/p/9375509.html)\n- [x] 子序列自动机\n- [x] Dilworth定理\n- [x] 杨氏矩阵\n- [x] 一个用SAM维护多个串的根号特技[By Mangoyang](https://www.cnblogs.com/mangoyang/p/10155185.html)\n- [x] IDDFS SPFA判负环[By 姜碧野](https://wenku.baidu.com/view/f22d0d36ee06eff9aef807e9.html)\n- [x] 单位根反演 [By czy](https://czyhe.me/algorithm/unit-root-inv/unit-root-inv/)\n- [x] GarsiaWachs算法\n- [x] 猫树[By immortalCO](http://immortalco.blog.uoj.ac/blog/2102)\n- [x] Baillie–PSW素性测试\n- [x] pollardrho离散对数\n- [x] Pohlig–Hellman algorithm\n- [x] 利用powerful number求积性函数前缀和[By fjzzq2002](https://www.cnblogs.com/zzqsblog/p/9904271.html)\n- [ ] 模拟费用流\n- [x] 生成函数与背包问题\n- [x] 多路增广费用流\n- [x] 最小表示法\n- [ ] 构造问题总结\n- [x] 珂朵莉树详解[By yzhang](https://www.cnblogs.com/yzhang-rp-inf/p/9443659.html)\n- [x] DP的各种优化[By FlashHu](https://www.cnblogs.com/flashhu/p/9480669.html,https://www.cnblogs.com/flashhu/p/9521094.html)\n- [x] 线段树分裂、李超线段树、线段树维护单调栈[By FlashHu](https://www.cnblogs.com/flashhu/p/9651161.html)\n- [x] 模拟退火调参[By FlashHu](https://www.cnblogs.com/flashhu/p/8884132.html)\n- [ ] 母函数求解、优选法、线性常系数齐次递推关系[By FlashHu](https://www.cnblogs.com/flashhu/p/9568368.html)\n- [ ] 线段树维护单调子序列[By xyz32768](https://blog.csdn.net/xyz32768/article/details/84398038)\n- [x] 配对堆[By WAAutoMaton](https://wa-am.com/2018/05/13/配对堆)\n- [ ] 图上博弈论[By 自为风月马前卒](https://www.cnblogs.com/zwfymqz/p/8470475.html,https://www.cnblogs.com/zwfymqz/p/8470624.html)\n- [ ] 莫比乌斯反演常见套路[By 自为风月马前卒](https://www.cnblogs.com/zwfymqz/p/10097376.html)\n- [x] 球与盒子的组合计数[By 自为风月马前卒](https://www.cnblogs.com/zwfymqz/p/9724918.html)\n- [ ] KMP算法优化\n- [ ] zkw线段树常用模板\n- [x] O(1)gcd[By fjzzq2002](https://www.cnblogs.com/zzqsblog/p/5436775.html)\n- [ ] FFT优化[By zjt](http://zjt-blog.cc/articles/154)\n- [ ] 常见线性规划标准型\n- [x] zkw费用流\n# 标准库使用\n- [ ] valarray:std::valarray[by SarvaTathagata](https://www.luogu.org/blog/474D/qian-tan-valarray)\n- [ ] functional:std::plus/minus等Function Object\n- [ ] algorithm:std::partial_sum/std::adjacent_difference\n- [ ] bitset:std::bitset\n- [ ] cmath:fma,tgamma\n# Research\n- [ ] 有标号的DAG计数[By yyb](https://www.cnblogs.com/cjyyb/p/10134575.html)\n- [ ] Bron–Kerbosch算法\n- [ ] 生成函数与图的计数\n- [ ] 最小树型图\n- [ ] 平面性算法\n- [ ] 点定位\n- [ ] 支配树[By MoebiusMeow](https://www.cnblogs.com/meowww/archive/2017/02/27/6475952.html)\n- [ ] 边分治\n- [ ] 欧几里得距离MST[By zball](https://www.cnblogs.com/tmzbot/p/6203547.html)\n- [ ] TS剩余\n- [ ] 组合数前缀和[By 自为风月马前卒](https://www.cnblogs.com/zwfymqz/p/9751173.html)\n- [ ] Lyndon Word[By 自为风月马前卒](https://www.cnblogs.com/zwfymqz/p/10198690.html)\n- [ ] 素数的k次幂前缀和(Meissel-Lehmer) IOI2018 zzt\n- [ ] 约数函数前缀和 IOI2018 zzt\n- [ ] 轨道-稳定集定理\n- [ ] Ukkonen线性构造后缀树[By permui](https://www.cnblogs.com/owenyu/p/6875887.html?utm_source=itdadao\u0026utm_medium=referral)\n- [ ] Q-learning\n- [ ] Karger算法\n- [ ] ETT(Euler Tour Tree)[By Memphis](http://memphis.is-programmer.com/2015/8/7/linkcutmemphis.99293.html)\n- [ ] Top-Tree[By Memphis](http://memphis.is-programmer.com/2015/8/7/linkcutmemphis.99293.html)[By negiizhao](http://negiizhao.blog.uoj.ac/blog/4912)\n- [ ] fractional cascading\n- [ ] 闭包[演算法筆記](http://www.csie.ntnu.edu.tw/~u91029/Closure.html)\n- [ ] b-Matching[演算法筆記](http://www.csie.ntnu.edu.tw/~u91029/Matching2.html#2)\n- [ ] Stable Matching[演算法筆記](http://www.csie.ntnu.edu.tw/~u91029/Matching2.html#3)\n- [ ] Chinese Postman Problem[演算法筆記](http://www.csie.ntnu.edu.tw/~u91029/Circuit.html#4)\n- [ ] 最小方差生成树\n- [ ] 牛顿级数差分\n- [ ] 牛顿插值法[By 马同学](https://www.matongxue.com/madocs/126/)\n- [ ] 拟牛顿法BFGS\n- [ ] 笛卡尔树 O(n)-O(1) RMQ\n- [ ] 三维凸包与Delaunay剖分的关系[By 刘汝佳](https://wenku.baidu.com/view/e2e2d86f58fafab069dc02f8.html)\n- [ ] Tutte 矩阵与一般图匹配\n- [ ] 特征多项式求法[By ftiasch](https://loj.ac/article/401)\n- [ ] 区间加多项式问题[By riteme](https://riteme.github.io/blog/2018-1-28/interval-polynomial.html)\n- [ ] 近似算法\n- [ ] ECC+ECM\n- [ ] ID3\n- [ ] 卡SPFA\n- [ ] 超大斐波那契数取模[By ACdreamer](https://blog.csdn.net/ACdreamers/article/details/25616461)\n- [ ] 卡Hash [By dacin21](https://codeforces.com/blog/entry/60442)\n- [ ] 卡并查集\n- [ ] 最大流算法效率比较\n- [ ] 平衡树效率比较\n- [ ] NTR算法 [By raffica](https://www.zhihu.com/question/268382638)\n- [ ] DC3\n- [ ] SA-IS算法\n- [ ] Chan's algorithm\n- [ ] DoubleArrayTrie\n- [ ] 用动态圆方树实现动态仙人掌[By Isrothy](http://isrothy.blog.uoj.ac/blog/3631)\n- [ ] 摊还分析\n- [ ] 拟阵\n- [ ] A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees\n- [ ] Micali-Vazirani Algorithm\n- [ ] Maximum Matchings via Glauber Dynamics\n- [ ] Dial's Algorithm\n- [ ] Gabow's Algorithm\n- [ ] Nardelli-Proietti-Widmayer Algorithm\n- [ ] Karger's Algorithm\n- [ ] 最优化方法[演算法筆記](http://www.csie.ntnu.edu.tw/~u91029/Optimization.html)\n- [ ] 迭代求解线性方程组\n- [ ] 求根、不动点与特征点的关系[演算法筆記](http://www.csie.ntnu.edu.tw/~u91029/RootFinding.html#5)\n- [ ] Karmarkar's algorithm\n- [ ] Mehrotra predictor-corrector method\n- [ ] 维护双向加字符的字符串[By 傅笙芳](https://zhuanlan.zhihu.com/p/51880239)\n- [ ] 排序网络\n- [ ] 超现实数 方展鹏-《浅谈如何解决不平等博弈问题》\n- [ ] Schreier-Sims 算法\n- [ ] 万能欧几里得[By Mr_Spade](https://www.cnblogs.com/Mr-Spade/p/10370259.html)\n- [ ] 量子算法\n- [ ] +-1RMQ\n- [ ] 信息熵\n- [ ] 混合基FFT\n- [ ] 树上后缀数组\n- [ ] 启发式模拟退火（参见模拟退火一节）\n- [ ] 收敛圆[By 马同学](https://www.matongxue.com/madocs/206.html)\n- [ ] 实数DFT/IDFT\n- [ ] 误差函数erf的应用\n- [ ] 分支定界法\n- [ ] 高斯整数\n- [ ] Stern-Brocot tree\n- [ ] 格点计数[By min-25](https://min-25.hatenablog.com/entry/2018/05/03/145505)\n- [ ] 后缀平衡树\n- [ ] Rainbow Tables\n- [ ] 扩展欧拉定理在矩阵幂中的应用\n- [ ] Bloom Filter\n- [ ] 广义（有限域）DFT+数论算法\n- [ ] 采样相关\n- [ ] border_tree\n- [ ] Perfect Hash Function\n- [ ] 五边形数定理\n- [ ] Link-Cut-Memphis[By Memphis](http://memphis.is-programmer.com/2015/8/7/linkcutmemphis.99293.html)\n- [ ] Self-Adjusting Top trees（AAA树）\n# 集训队论文/WC营员交流学习（省选后）\n## 2019\n- [ ] 模拟费用流 laofu\n## 2018\n- [x] 浅谈生成函数在掷骰子问题上的应用 杨懋龙\n- [ ] 《后缀树结点数》命题报告及一类区间问题的优化 陈江伦\n- [ ] 浅谈保序回归问题 高睿泉\n- [x] 解决树上连通块问题的一些技巧和工具 任轩笛\n- [ ] 一些特殊的数论函数求和问题 朱震霆\n- [x] 浅谈Splay与Treap的性质及其应用 董炜隽\n- [ ] 欧拉图相关的生成与计数问题探究 陈通\n## 2017\n- [ ] 关于数列递归式的一些研究 毛啸\n- [ ] 基于线性代数的一般图匹配 杨家齐\n- [ ] 浅谈信息学竞赛中的独立集问题 钟知闲\n- [ ] 动态传递闭包问题的探究 孙耀峰\n- [ ] 《A+B Problem》 命题报告 汪乐平\n- [ ] 非常规大小分块算法初探 徐明宽\n- [ ] 回文树及其应用 翁文涛\n## 2016\n- [x] 网络流的一些建模方法 姜志豪\n- [ ] 浅谈线性规划与对偶问题 董克凡\n- [ ] 浅谈无向图最小割问题的一些算法及应用 王文涛\n- [x] 区间最值操作与历史最值问题 吉如一\n- [x] 再探快速傅里叶变换 毛啸\n- [ ] 从 Unknown 谈一类支持末尾插入删除的区间信息维护方法 罗哲正\n## 2015\n- [ ] 后缀自动机在字典树上的扩展 刘研绎\n- [ ] 生成函数的运算与组合计数问题 金策\n- [ ] 浅谈分块在一些在线问题中的应用 邹逍遥\n- [ ] 仙人掌相关算法及其应用 王逸松\n- [ ] DP的一些优化技巧 张恒捷\n- [x] 集合幂级数的性质与应用及其快速算法 吕凯风\n## 2014\n- [ ] 对置换群有关算法的初步研究 岑若虚\n- [ ] 浅谈维护多维数组的方法在数据结构题中的应用 梁泽宇\n- [x] 线段树在一类分治问题上的应用 徐寅展\n- [x] 根号算法——不只是分块 王悦同\n- [x] 浅谈动态树的相关问题及简单拓展 黄志翱\n- [x] 随机化算法在信息学竞赛中的应用 胡泽聪\n- [ ] 寻找第 k 优解的几种方法 俞鼎力\n## 2013\n- [x] 浅谈分块思想在一类数据处理问题中的应用 罗剑桥\n- [x] 搜索问题中的 meet in the middle 技巧 乔明达\n- [x] 浅析信息学竞赛中概率论的基础与应用 胡渊鸣\n- [x] 浅谈数据结构题的几个非经典解法 许昊然\n- [x] 浅谈环状计数问题 高胜寒\n- [x] 浅谈容斥原理 王迪\n- [x] 浅谈一类分治算法 顾昱洲\n# Other\n- [ ] 使用Vim或Emacs\n- [x] 学习十指打字(目标：250cpm)\n- [ ] 更换为Dvorak布局\n- [ ] 整理引用的Bib与协议问题\n- [ ] 合并并索引重复内容\n- [ ] 学习Python3及其标准库用法\n- [ ] 解题思路总结（省选前）\n- [ ] 时间复杂度与正确性证明（大学）\n- [ ] 移除不具有指导意义的代码\n- [ ] 看看自己在那些题上是rank2\n# 重构\n- [x] SAM\n- [ ] 带花树[By rqy](https://rqy.moe/Algorithms/flower-tree/)\n- [ ] 三元环\n- [ ] FWT\n- [ ] CDF与PDF\n# 退役后看到的新东西\n- [ ] Hopcroft-Karp\n- [ ] [无标号图编码](https://mcfxmcfx.blog.uoj.ac/blog/7279)\n- [ ] [多项式计算](https://fjzzq2002.blog.uoj.ac/blog/7281) 怎么还有CDQ分治和半在线卷积啊\n- [ ] [在线卷积](https://hly1204.blog.uoj.ac/blog/7319)\n- [ ] [双极定向](https://zx2003.blog.uoj.ac/blog/7299)\n- [ ] [数论函数求和](https://negiizhao.blog.uoj.ac/blog/7165)\n- [ ] Barrett Reduction\n- [ ] [LA问题线性预处理O(1)查询](https://yurzhang.blog.uoj.ac/blog/6589)\n- [ ] [zkw线段树上无修改rmq](https://return20071007.blog.uoj.ac/blog/6554)\n- [ ] [三叶虫树](https://return20071007.blog.uoj.ac/blog/6556) 四毛子又是啥？\n- [ ] [多元拉格朗日反演](https://x-yi-x.blog.uoj.ac/blog/6511)\n- [ ] [质因数分解](https://computerkiller.blog.uoj.ac/blog/6520) 怎么整上椭圆曲线了\n- [ ] [莫队二次离线](https://matkave.blog.uoj.ac/blog/6445)\n- [ ] [任意模数二项卷积](https://entropyincreaser.blog.uoj.ac/blog/6285)\n- [ ] [多点求值优化](https://_rqy.blog.uoj.ac/blog/6202)\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdtcxzyw%2Foi-source","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdtcxzyw%2Foi-source","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdtcxzyw%2Foi-source/lists"}