ワンクリックでManusで任意のスキルを実行

acm-icpc-problem-setting

スター3

フォーク0

更新日2026年3月7日 01:23

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 ページを確認してインストールできます。

Manusで実行

ソース

lihaoze123

lihaoze123/my-claude-code

GitHub リポジトリを開く Creator のリポジトリを見る

ダウンロード

Manusで実行

ACM-ICPC Problem Setting Best Practices

Overview

Comprehensive guidance for creating high-quality algorithm competition problems, covering the full workflow from idea conception to publication.

When to Use

Creating problems for ACM-ICPC, CCPC, Codeforces, or similar contests
Writing problem statements with LaTeX
Generating test data using testlib
Setting up validators and checkers
Organizing algorithm competitions

Quick Reference

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

Core Principles

Problem Quality

Original idea - No duplicates or trivial enhancements
Clear statement - Every concept defined, no ambiguity
Complete constraints - All variable ranges specified
Strong samples - Catch wrong interpretations

Data Quality

Edge cases - Min/max values, boundary conditions
Diverse constructions - Random + handcrafted
Format compliance - Linux line endings, no trailing whitespace

Platform-Specific

Polygon - Integrated workflow for teams
Codeforces - Requires 5-25 rated contests
Luogu - Requires competition awards

Red Flags - STOP

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

Essential Code

testlib Generator

#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);
}

Basic Checker

#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);
}

References

このリポジトリの他の Skills

同じリポジトリ

xcpc-jiangly-style

lihaoze123/my-claude-code

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.

2026-03-073

writing-best-practices

lihaoze123/my-claude-code

Use when creating structured best practices guides, organizing technical documentation, or establishing reference materials for teams or agents

2026-01-243

nix-packaging-best-practices

lihaoze123/my-claude-code

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

2026-01-233

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

ACM-ICPC Problem Setting Best Practices

Overview

Comprehensive guidance for creating high-quality algorithm competition problems, covering the full workflow from idea conception to publication.

When to Use

Creating problems for ACM-ICPC, CCPC, Codeforces, or similar contests
Writing problem statements with LaTeX
Generating test data using testlib
Setting up validators and checkers
Organizing algorithm competitions

Quick Reference

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

Core Principles

Problem Quality

Original idea - No duplicates or trivial enhancements
Clear statement - Every concept defined, no ambiguity
Complete constraints - All variable ranges specified
Strong samples - Catch wrong interpretations

Data Quality

Edge cases - Min/max values, boundary conditions
Diverse constructions - Random + handcrafted
Format compliance - Linux line endings, no trailing whitespace

Platform-Specific

Polygon - Integrated workflow for teams
Codeforces - Requires 5-25 rated contests
Luogu - Requires competition awards

Red Flags - STOP

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

Essential Code

testlib Generator

#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);
}

Basic Checker

#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);
}