02-validator

A rule set for writing Polygon validators with testlib.h. Polygon is a platform for preparing and testing programming-contest problems; a validator checks whether test input follows the stated format and limits.

In plain words
What is it for?
Creating complete C++17 validators that check contest test files and compile without warnings.
Why use it?
It reduces malformed or incomplete validators by enforcing strict input, whitespace, bounds, and end-of-file checks.

Cursor rule for Cursor

Install

Getting it into your agent

One page per mod, every tool's command on it. A separate URL per tool would split the same page into five that compete with each other.

agentmods
npx agentmods add rules/7oskaaa/polygon-problems-generator/02-validator
Clone the repo
git clone --depth 1 https://github.com/7oSkaaa/polygon-problems-generator

Made for: Cursor.

Per session 0 Nothing until a file matches its globs; then the whole rule loads.
When invoked 242 The whole file, excluding the scripts and references it only reads on demand.
Security scan A 0 findings. Scan, not verified.
Origin original No closer match found in the catalogue.
Token cost

What it costs to keep this loaded

Counted locally with the o200k_base tokenizer, which is exact for GPT models; Claude uses its own tokenizer and its counts differ. Treat this as one consistent yardstick across the catalogue rather than a bill. Prices are per million input tokens.

ModelPer sessionOnce invoked
Fable 5 $0.00000 $0.00242
Opus 5 $0.00000 $0.00121
Sonnet 5 $0.00000 $0.00048
Haiku 4.5 $0.00000 $0.00024

Measured 2d ago against content hash de4a6f9ebad3, method: parsed. Prices are Anthropic first-party input rates as of 2026-08-30, from the pricing page.

Security

Grade A, and why

02-validator scanned grade A with 0 findings against 26 rules in 11 categories — prompt injection, anti-refusal, data exfiltration, privilege escalation, supply chain, agent snooping, system-prompt leakage, SSRF and excessive agency — measured 2d ago.

A static scan of the body, not an audit. Every finding is printed with the line that produced it so you can judge whether it matters here. A mod is markdown that instructs an agent; that is exactly why what it instructs is worth reading.

Nothing flagged

None of the 26 patterns this scan looks for appear in this file: no shell pipes, no recursive deletes, no credential paths, no hidden text, no instruction-override or anti-refusal phrasing, no agent-config snooping. That is not a guarantee, it is the absence of the things that are checkable.

.cursor/rules/02-validator.mdc · 26 lines

What it actually says

You are an expert competitive programming problem setter specialising in writing Polygon validators using testlib.h.

Shared: Read .claude/shared.md first.

Apply the validator guidance from tutorials/polygon-hints.md, especially named reads, fixed-length token formats, global constants for bounds, and immediate checks for sum constraints after reading each test case.

Key Rules

  • Always include #include "testlib.h" and registerValidation(argc, argv)
  • Validate whitespace and newlines strictly: readSpace, readEoln, readEof
  • Use named variables in all inf.read*() calls
  • Reject trailing spaces — check whitespace precisely after every value
  • Use digit-separator constants: 100'000 not 100000
  • End with inf.readEof()
  • Compile with cpp17, no warnings

Return only the complete C++ code, no explanation.

Changes

What this file has done since we first saw it

Hashed on every crawl. A supply-chain change to an agent config is a question of when, not whether, so the history is kept rather than the latest state alone.

  1. 2d ago First seen · 26 lines · 242 tokens per session scan A de4a6f9ebad3

Subscribe to this mod's changes

02-validator is a cursor rule published in the GitHub repository 7oSkaaa/polygon-problems-generator (21 stars, last pushed 2d ago), licensed MIT. It costs nothing until one of its globs matches a file; then it loads 242 tokens. A static security scan graded it A with 0 findings. No closer match exists in the catalogue, so it is treated as the original; first seen 2026-08-30.