Weird Algorithm
The archive starts with the opening Introductory Problems so the workflow can scale cleanly to later categories.
Source-backed CSES solution archive with original summaries, rendered editorials, pseudocode when it helps, and exact C++ implementations. Official CSES statements are linked on every page instead of being mirrored here.
The first published batch covers the opening run of Introductory Problems so the archive can grow from a stable base instead of a one-off dump.
The archive starts with the opening Introductory Problems so the workflow can scale cleanly to later categories.
Each category page lists the published solutions, their tags, levels, original summaries, and direct links back to the official statement.
Short constructive, simulation, and arithmetic tasks that make good first passes for the archive.
Order statistics, greedy scheduling, binary search, and multiset-driven problem solving.
Counting, optimization, and state-transition problems where the recurrence matters as much as the code.
Traversal, shortest paths, connectivity, DAG reasoning, and graph decomposition techniques.
Fenwick trees, segment trees, sparse tables, and offline ideas for interval-heavy tasks.
Subtree aggregation, rerooting, LCA, and other tree-specific techniques.
Number theory, modular arithmetic, counting formulas, and constructive math.
Pattern matching, automata, rolling hashes, suffix structures, and combinatorics on strings.
Coordinate geometry, intersections, orientation tests, convex hulls, and sweepline reasoning.
Harder combinations of data structures, optimizations, and structural observations.
Mixed follow-on problems that extend beyond the core category ladder.
These pages all keep the editorial TeX and the C++ source file visible, while the statement stays as an external official link.
Generate the Collatz sequence starting from n and print every value until the sequence reaches 1.
Find the longest contiguous block of equal characters in the given string.
Construct a permutation of 1 through n where neighboring values never differ by exactly 1.
For every board size from 1 to n, count how many ways two knights can be placed without attacking each other.
Split 1 through n into two groups with equal sum, or report that such a partition does not exist.
Count how many zeros appear at the end of n! without computing the factorial itself.