EndlessCheng/codeforces-go
Codeforces Go
Codeforces-go is a competitive programming algorithm library written in Go, providing a collection of reusable code templates for solving algorithmic problems. It covers core areas including data structures, graph algorithms, dynamic programming, and mathematical computation, with pre-built implementations for segment trees, Fenwick trees, shortest paths, minimum spanning trees, knapsack DP, interval DP, and number theory routines.
The library organizes its templates by algorithmic pattern, grouping them into categories such as DP, graph, and math to match common contest question structures. It is designed for template-based code reuse, offering parameterized code blocks that users adapt by filling in problem-specific logic rather than rewriting from scratch. The project is a zero-dependency Go module that leverages only the standard library.
A test-case generation framework is included, which generates random inputs and compares solution output against a brute-force reference for correctness verification. The entire library is written in Go, utilizing its standard library and concurrency primitives for efficient algorithm execution.
Features
- Template Libraries - Organises reusable algorithm implementations as standalone templates for rapid copy-paste into contest solutions.
- Data Structure Implementations - Provides pre-built implementations of segment trees, Fenwick trees, and union-find for algorithmic problem-solving.
- Competitive Programming Repositories - Solves algorithmic problems in competitive programming contests with pre-written, optimized code templates.
- Competitive Programming Templates - Provides parameterised code blocks that users adapt by filling in problem-specific logic rather than rewriting from scratch.
- Dynamic Programming Patterns - Ships ready-to-use templates for knapsack, interval, tree, and digit DP to solve optimization problems.
- Graph Algorithm Routines - Implements shortest paths, minimum spanning trees, maximum flow, and tree query routines for competitive programming.
- Mathematical Algorithms - Provides templates for GCD, FFT, matrix operations, and number theory algorithms for contest problem-solving.
- Algorithmic Patterns - Groups templates by problem-solving patterns like DP, graph, and math to match contest question structures.
- Go Language Implementations - Written entirely in Go, leveraging its standard library and concurrency primitives for efficient algorithm execution.
- Zero-Dependency Libraries - Operates as a standalone Go module with no external runtime dependencies beyond the standard library.
- Test Case Generators - Includes a harness that generates random inputs and compares solution output against a brute-force reference for correctness.
