endlesscheng/codeforces-go

算法竞赛模板库 by 灵茶山艾府 💭💡🎈

View on GitHub ↗Jump to charts ↓

Summary Information

Updated 46 minutes ago
Added to GitGenius on September 7th, 2026
Created on September 23rd, 2019
Open Issues & Pull Requests: 2 (+0)
GitHub issues: Enabled
Number of forks: 821
Total Stargazers: 8,699 (+0)
Total Subscribers: 72 (+0)

Repository Insights (GitGenius)

Median issue/PR response: 4.9 days
Mean response time: 77.6 days
90th percentile: 285.4 days
Tracked items: 6

Charts & Analytics

Fetching additional details & charts...

Issue Activity (beta)

Open issues: 0
New in 7 days: 0
Closed in 7 days: 0
Avg open age: N/A days
Stale 30+ days: 0
Stale 90+ days: 0

Recent activity

Opened in 7 days: 0
Closed in 7 days: 0
Comments in 7 days: 0
Events in 7 days: 0

Top labels

No label distribution available yet.

Most active issues this week

No issue events were indexed in the last 7 days.

Detailed Description

codeforces-go is a competitive programming template library written in Go that organizes algorithms and solutions for algorithm contests.

The project addresses the challenge of managing and applying algorithmic knowledge across competitive programming problems. It provides a structured collection of algorithm templates that each include core concepts and complexity analysis, reference materials pointing to well-explained resources, annotated template code with usage instructions, supplementary techniques for common problem patterns, and curated related problems spanning template problems, classical problems, and problems requiring creative reformulation. This organization helps competitive programmers quickly locate and apply relevant algorithms when solving contest problems.

The tool suits programmers preparing for ACM-ICPC, Codeforces, and LeetCode competitions who want a reference library organized by algorithm type rather than scattered across multiple sources. It is particularly valuable for those learning Go while practicing competitive programming, as it demonstrates idiomatic Go implementations of standard algorithms and data structures. The repository serves as both a learning resource and a quick-lookup reference during problem-solving sessions.

The project shows consistent activity with regular additions to its algorithm collection and problem solutions. The maintainer actively curates and expands the template library based on competitive programming practice. The codebase demonstrates careful attention to code clarity through comprehensive comments and usage documentation within templates. Problem solutions are continuously added and organized, indicating ongoing engagement with new contest problems and algorithmic challenges.