Foram passados 10 problemas para serem resolvidos em 3 horas. Segue abaixo a lista de problemas e os respectivos assuntos necessários para resolvê-los:
(A) The Blocks Problem: ad-hoc, simulation
(B) Flea circus: LCA
(C) SCUD Busters: computational geometry, convex hull, point in convex polygon.
(D) Square root: big numbers, integer square root, divide and conquer
(E) Stamps: backtracking
(F) Dollars: Dynamic Programming, coin change
(G) The dog task: graph theory, maximum cardinality bipartite matching.
(H) Crime Wave - The Sequel: graph theory, minimum cost weighted bipartite matching (min-cost max-flow).
(I) Auto Estrada: ad-hoc
(J) Cavalos: ad-hoc