ICPC and IOI solutions, kept as editable source files.
This archive sits alongside Project Euler as a second major problem-solving area on the site.
The source of truth stays explicit: written solutions live in .tex, implementations
live in .cpp, and the pages are built directly from those copied files.
Two serious archives with different source models
ICPC entries keep metadata and statement assets with each problem. IOI entries stay lean:
just the task folder plus the normalized solution.tex and
solution.cpp pair.
ICPC World Finals
212 entries across 18 contest years, with 212 statement PDFs and exact TeX and C++ source files preserved in the repo.
Open ICPC archive 02 IOIInternational Olympiad in Informatics
177 entries across 36 contest years, with exact TeX and C++ source files preserved in the repo.
Open IOI archiveNewest copied problem folders
These cards are driven from the copied source file timestamps, so the archive can surface recently touched entries without a separate metadata layer.
Hieroglyphs
Given two sequences A and B, find their universal common subsequence (UCS), or report that none exists.
Message
Each packet has 31 bits. Cleopatra controls exactly 15 positions (known to Aisha), while the other 16 positions are always transmitted correctly. Aisha must send a bit string M of length at most 1024, and Basma must r...
Mosaic
Given two arrays X[0..N-1] and Y[0..N-1] (with X[0] = Y[0]), define an N N grid where: Row 0: grid[0][j] = X[j] Column 0: grid[i][0] = Y[i] Otherwise: grid[i][j] = 1 if both grid[i-1][j] = 0 and grid[i][j-1] = 0; else...
Nile
Observation: adjacent pairing suffices After sorting artifacts by weight, every optimal matching pairs only adjacent elements. Suppose an optimal matching pairs artifacts a < b and c < d (in sorted order) with a < c <...