菜单
Use when preparing algorithm competition problems for ACM-ICPC, CCPC, Codeforces, or similar contests, including problem creation, statement writing, test data generation, and contest organization
用 Codex 或 Claude 帮你安装 复制这段 Prompt，粘贴到 Codex、Claude 或其他助手里，让它检查 Skill 页面并帮你完成安装。
Use when writing C++ competitive programming solutions for Codeforces, ICPC, or similar contests. Apply when creating XCPC solutions to ensure code follows jiangly's proven style patterns.
Use when creating structured best practices guides, organizing technical documentation, or establishing reference materials for teams or agents
Best practices for packaging pre-compiled binaries (.deb, .rpm, .tar.gz, AppImage) for NixOS, handling library dependencies, or facing "library not found" errors with binary distributions
基于 SOC 职业分类
| name | acm-icpc-problem-setting |
| description | Use when preparing algorithm competition problems for ACM-ICPC, CCPC, Codeforces, or similar contests, including problem creation, statement writing, test data generation, and contest organization |
Comprehensive guidance for creating high-quality algorithm competition problems, covering the full workflow from idea conception to publication.
| Topic | Detailed Rules |
|---|---|
| Problem conception | rules/problem-conception.md |
| Statement writing | rules/statement-writing.md |
| Test data generation | rules/test-data-generation.md |
| Special Judge | rules/spj-checker.md |
| Time/memory limits | rules/limits-subtasks.md |
| Contest organization | rules/contest-organization.md |
| Anti-pattern | Fix |
|---|---|
| Undefined terms in statement | Add definitions in problem description |
| Inconsistent terminology | Use same word for same concept |
| Weak samples | Include edge cases and wrong interpretations |
| Incomplete data ranges | Specify ALL variables' ranges |
| Wrong time limit | Test std × 2 minimum |
| Poor subtask design | Use clear structure, avoid percentages |
#include "testlib.h"
int main(int argc, char* argv[]) {
registerGen(argc, argv, 1);
int n = opt<int>("n");
vector<int> a(n);
for (int i = 0; i < n; i++)
a[i] = rnd.next(1, 1000000);
println(n);
println(a);
}
#include "testlib.h"
int main(int argc, char* argv[]) {
registerTestlibCmd(argc, argv);
int jans = ans.readInt();
int pans = ouf.readInt();
if (pans == jans) quitf(_ok, "%d", pans);
else quitf(_wa, "expected %d, found %d", jans, pans);
}