Problemi

Media · Brute force · Bitmasks

Difficile · Combinatorics · Dynamic programming · Number theory

Molto difficile · Hashing · Binary Search · Sorting · Number theory

Facile · Graphs · Trees

Molto difficile · Geometry

Molto difficile · Breadth-first Search · Hashing · Bitmasks

Facile · String suffix structures · Implementation

Facile · Sorting · Greedy algorithms

Facile · Priority Queue

Difficile · Graphs · Shortest paths

Molto facile · Geometry

Facile · Graphs

Media · Dynamic programming

Molto difficile · Graphs · Greedy algorithms · Depth-first Search · Prefix Sums

Molto difficile · Dynamic programming

Molto facile · Dynamic programming

Media · Implementation · Dynamic programming

Molto facile · Implementation

Molto facile · Graphs · Brute force

Difficile · Geometry

Molto facile · Geometry

Difficile · Geometry · Disjoint set union · Graphs

Molto facile · Implementation

Media · Depth-first Search

Molto facile · Implementation