data-algo-competitive

Generate contest-ready C++ templates for advanced competitive programming data structures.

10|Updated Mar 24, 2026

Search Tags:#algorithms #data-structures #competitive-programming #icpc #cp-template #codeforces

Ready to run

npx skills add https://github.com/Fearvox/data-algo-skill --skill data-algo-competitive

💬 Prompt for ChatGPT / Claude Chat▼

Please help me install this Agent Skill.
Skill: data-algo-competitive
Source: https://github.com/Fearvox/data-algo-skill/tree/main/data-algo-competitive
Command: npx skills add https://github.com/Fearvox/data-algo-skill --skill data-algo-competitive

SYSTEM DOCUMENTATION & REQUIREMENTS

💡 This Skill includes references (resource) components.

What problem does it solve?

This skill provides a library of contest-ready CP templates and advanced data-structure patterns to accelerate solving competitive programming problems.

Core Features & Use Cases

80 advanced patterns and templates for ICPC/OI/Codeforces-level problems, focusing on fast, contest-grade implementations in C++.
Extensive references and documented templates to adapt to a wide range of CP tasks, from segment trees and FFT/NTT to centroid decomposition and HLD.
Real-world usage: quickly scaffold a solution, extend templates for new constraints, and archive decisions in per-project CP profiles.

Quick Start

Use this skill to scaffold a contest-ready CP solution template for a problem that requires advanced data structures.

Frequently Asked Questions about data-algo-competitive

High-intent search queries and answers about installing and using this skill.

FAQPage Schema

How do I implement segment trees for ICPC and Codeforces competitive programming problems?▼

Implement segment trees for competitive programming by leveraging contest-ready C++ templates that ensure correctness, speed, and robust edge-case handling. This skill provides a library of 80 advanced patterns, including segment trees, to quickly scaffold solutions for ICPC and Codeforces tasks.

What is the best way to scaffold a C++ solution for heavy-light decomposition tasks?▼

Scaffold C++ heavy-light decomposition solutions by applying contest-ready templates designed for ICPC and Codeforces. The skill provides documented, ready-to-use patterns for HLD and other advanced data structures, allowing quick extension for new problem constraints.

Does this skill support advanced mathematical templates like FFT and NTT for CP tasks?▼

Yes, this skill supports FFT and NTT templates for competitive programming. It includes an extensive library of advanced data-structure patterns and mathematical templates tailored for a C++-centric workflow, specifically targeting ICPC, OI, and Codeforces level problems.

Can I use these competitive programming templates for centroid decomposition and LCA problems?▼

Yes, you can use these templates for centroid decomposition and LCA problems. The skill specifically covers these advanced techniques alongside heavy-light decomposition, providing documented C++ references to adapt to a wide range of contest-ready CP tasks.

How do I handle edge cases when extending CP templates for new constraints?▼

Handle edge cases when extending CP templates by utilizing the skill's emphasis on correctness, speed, and robust edge-case handling. The extensive references and documented patterns guide you in safely adapting the base templates to meet new problem constraints.

When do I need contest-ready CP templates instead of writing algorithms from scratch?▼

You need contest-ready CP templates when solving ICPC, OI, or Codeforces problems that require advanced data structures like segment trees or FFT. These templates accelerate problem solving by providing fast, contest-grade C++ implementations, reducing setup time and minimizing edge-case errors.