All challenges

Build a tiny Rust program that reads a name from a file and writes the expected greeting.

Recover the hidden permutation used by pairwise bitwise-or queries.

Draw a square grid map whose color adjacencies exactly realize a country graph while minimizing K/N.

Reconstruct hidden weighted trees through the original Frontier-CS distance-query interaction.

Choose sets covering every element while minimizing total cost.

Remove numbered boxes from stacks in order while minimizing move energy.

Draw a smaller colored map preserving ward adjacency relationships.

Select a small vertex cover for an undirected graph.

Optimize a Triton vector-addition kernel for 2^20 CUDA elements.

Optimize a Triton vector-addition kernel for 2^28 CUDA elements.

Optimize a Triton vector-addition kernel for 2^24 CUDA elements.

Sort a permutation using reversals of two related segment lengths.