Each task keeps the editorial and the C++ implementation on one page.
- Hieroglyphs
- Message
- Mosaic
- Nile
IOI task write-ups and implementations, organized by year so the archive reads like a contest history instead of a flat file dump.
Each year page is the main entry point: open a year, then jump to the task you want.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
Each task keeps the editorial and the C++ implementation on one page.
These are the latest entries touched in this track, surfaced without taking over the main browse flow.
Given a rooted tree with N nodes, each with weight W[i]. Assign integer ``coefficients'' C[i] to each node such that for every node i, the sum of coefficients in its subtree is between L and R (given per query). Minim...
Given two sequences A and B, find their universal common subsequence (UCS), or report that none exists.
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...
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...
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 <...
We are given a connected graph with hidden vertex colours from \ 0,,N-1\ and one extra colour N that never appears initially. A query recolours some vertices and returns the number of monochromatic connected component...