number-theory-toolkit
Provide number theory algorithm implementations and guidance
它会碰到什么
扫了多少2 个文本文件，3 KB
它会碰到什么不碰外部（只输出文字）
命中总数0 处
命中统计严重 0 · 高 0 · 中 0 · 低 0
这一栏是扫描器报的事实，不是结论。命中多不等于有毒（安全工具、规则库、示例脚本本来就会包含危险写法），命中少也不等于干净。它和你手上的凭据、文件、网络有什么关系，需要你自己看。
技能内容
Number Theory Toolkit Skill
Purpose
Provide implementations and guidance for number theory algorithms commonly used in competitive programming.
Capabilities
- Modular arithmetic operations
- Extended Euclidean algorithm
- Chinese Remainder Theorem
- Modular inverse and exponentiation
- FFT/NTT for polynomial multiplication
- Linear sieve implementations
Target Processes
- number-theory-algorithms
- prime-algorithms
- combinatorics-counting
Algorithm Catalog
Modular Arithmetic
- Modular exponentiation (binary exp)
- Modular inverse (Fermat/Extended GCD)
- Modular square root (Tonelli-Shanks)
GCD and Extensions
- Euclidean algorithm
- Extended Euclidean algorithm
- Linear Diophantine equations
Chinese Remainder Theorem
- CRT for coprime moduli
- General CRT
FFT/NTT
- Fast Fourier Transform
- Number Theoretic Transform
- Polynomial multiplication
Input Schema
{
"type": "object",
"properties": {
"algorithm": { "type": "string" },
"parameters": { "type": "object" },
"language": {
"type": "string",
"enum": ["cpp", "python", "java"]
},
"modulo": { "type": "integer" }
},
"required": ["algorithm"]
}Output Schema
{
"type": "object",
"properties": {
"success": { "type": "boolean" },
"code": { "type": "string" },
"explanation": { "type": "string" },
"complexity": { "type": "string" }
},
"required": ["success"]
}想直接用这个技能？
本站把开放许可（MIT / Apache 等）的技能按仓库打包整理到网盘，点一下转存到你自己的网盘，不用一个个从 GitHub 拉。许可未声明的技能只给原始仓库链接，不打包。
它属于哪个仓库
星标★ 1,796
本站分层T1
该仓技能数2115
原文件路径
library/specializations/algorithms-optimization/skills/number-theory-toolkit/SKILL.md