auto lca = [&](int u, int v) -> int { ... };
ll qpow(ll a, ll b) { ll r=1; for(;b;b>>=1,a=a*a%MOD) ... }
Dinic::max_flow(SOURCE, SINK) == TOTAL_CONSTRAINTS
fft::convolve(poly_a, poly_b, result_c);
ROUND 892 DIV. 1// MEMORY 256 MB // CLOCK 2.000s
PILLAR 01 // DYNAMIC PROGRAMMING
PILLAR 02 // GRAPH THEORY
PILLAR 03 // SEGMENT TREES & RMQ
PILLAR 04 // NUMBER THEORY
PILLAR 05 // GREEDY & BINARY SEARCH
PILLAR 06 // COMPUTATIONAL GEOMETRY
Department
Competitive Coding
Department head
Team leads
About
Historical dossier / pressure
The clock is an army.
A contest is a map with a clock nailed to it. The problem does not care how elegant the solution is if it arrives after the horn. History is full of brilliant plans that died in the last five minutes, and simple ones that survived because they moved first.
1843 / London01
The first algorithm
Ada Lovelace wrote a method for a machine that did not yet exist. The instruction was not a single calculation; it was a sequence, a loop, a way for a future engine to be told what to do. The idea outlived the hardware.
Sequence before silicon
1916 / Verdun02
The arithmetic of attrition
The longest battle of the First World War was not decided by one charge. It was a ledger of minutes, supplies and replacements, a brutal optimization problem where every resource had a cost. Contest time is gentler, but the ledger is the same.
Time is a resource
1971 / Berkeley03
The problem that refuses
Cook showed that some problems may never have a fast answer. The lesson was not defeat; it was classification. Know the shape of the problem before you spend the clock trying to break it.