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.
git clone --depth 1 https://github.com/7oSkaaa/polygon-problems-generatorWrote this? Show the measurements
A badge with what this costs and how it scanned, read live from this page, so it follows the numbers instead of freezing them. Markdown for a README, HTML for a documentation site or a project page.
[](https://agentmods.dev/rules/7oskaaa/polygon-problems-generator/04-solutions)<a href="https://agentmods.dev/rules/7oskaaa/polygon-problems-generator/04-solutions"><img src="https://agentmods.dev/badge/rules/7oskaaa/polygon-problems-generator/04-solutions/github.svg" alt="Measured on agentmods" height="20"></a>Or the 80×15 button, for a site that already has a row of RSS and ATOM ones. Only the verdict fits; the numbers stay here.
<a href="https://agentmods.dev/rules/7oskaaa/polygon-problems-generator/04-solutions"><img src="https://agentmods.dev/badge/rules/7oskaaa/polygon-problems-generator/04-solutions.svg" alt="Reviewed on agentmods" width="80" height="20"></a>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.
| Model | Per session | Once invoked |
|---|---|---|
| Fable 5.1 | $0.00560 | $0.00560 |
| Opus 5.5 | $0.00224 | $0.00224 |
| Sonnet 5.5 | $0.00112 | $0.00112 |
| Haiku 4.5 | $0.00056 | $0.00056 |
Grade A, and why
04-solutions 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 1mo 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.
How it starts
The opening of the file, as written. The whole thing — 50 lines — stays where its author put it; the contents beside it link to each section on GitHub.
You are an expert competitive programming coach who writes clean, correct, and efficient solutions for competitive programming problems.
Shared: Read .claude/shared.md first.
Rules
- Base C++ on
templates/solutions/solution.cpp: no#definemacros, no GCC pragmas, C++17 only (long long,vector, STL). Keepsolve()+main()as in the template - Base Java on
templates/solutions/solution.java:Scanner,solve(), no extra I/O helpers or unused constants. Rename the class to match the file (acc_java.java→public class acc_java) - Never use
freopenin any solution - No compiler warnings
- No
#pragma GCC optimizeor other compiler-optimization directives acc.cppmust be a clear, relaxed implementation — not a highly optimized one used to set the time limit- Provide a second correct C++ solution
acc_alt.cppwith a different approach (not a rewrite ofacc.cpp) - cpp17 for C++, java21 for Java
- Interactive C++: do not call
ios::sync_with_stdio(false)orcin.tie(nullptr); read judge replies asstring
Tags
| Tag | Requirement |
|---|---|
ACC |
100% correct solution |
TLE |
Intentionally O(n²) or worse — must exceed time limit on large inputs |
WA |
Produces wrong answers on some inputs — add a subtle bug intentionally |
Multi-test vs Single-test
Multi-test: uncomment cin >> test_cases; (C++) / testCases = in.nextInt(); (Java) in main.
Single-test: keep test_cases = 1 — do NOT read T from input.
Output
Fill in solve() and any helpers. Keep the C++17 / Java templates. Return only code, no explanation.
Approach Suggestion Format
When asked to suggest approaches, provide:
- MAIN APPROACH — optimal algorithm with time/space complexity
- BRUTE FORCE — simple O(n²+) approach for stress testing
- KEY OBSERVATIONS — 2–3 bullet points on what makes this problem tick
- EDGE CASES — inputs that might break naive implementations
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.
- 1mo ago First seen · 50 lines · 560 tokens per session scan A f700cb50b919
04-solutions is a cursor rule published in the GitHub repository 7oSkaaa/polygon-problems-generator (21 stars, last pushed today), licensed MIT. It adds 560 tokens to every session, about $0.0022 per session on Opus 5.5. 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.
Other cursor rules, from other repositories
move-copy-semantics
Avoid std::move(const&) silent copies; use sink-by-value + std::move.
mockito
This guide provides definitive best practices for writing robust, maintainable, and readable unit tests using Mockito with JUnit 5, focusing on modern patterns and common pitfalls.
springboot-jpa-best-practices
A set of Chinese-language rules for structuring Java Spring Boot applications that use JPA, a library for database access.
graftcode-java
Mandatory Graftcode architecture rules for building Java backend services (plain Maven/Gradle modules exposed via Graftcode Gateway, not REST).
component-parameter-key-no-dot
A naming rule for Java code parameters marked with @ComponentParameter. Their keys must be flat names using letters, numbers, and underscores; dots are not allowed.
java-17-development-standards
Java-specific development standards following Effective Java, Google Java Style Guide, and modern Java 17 LTS best practices.