Problemi

Facile · Implementation

Media · Implementation

Media · Breadth-first Search · Shortest paths

Difficile · Graphs · Graph matchings

Media · Graphs · Depth-first Search · Bitsets

Facile · Graphs · Trees

Molto facile · Disjoint set union · Graphs

Molto difficile · Greedy algorithms

Media · Geometry

Molto facile · Number theory

Media · Sorting

Difficile · Dynamic programming · Graphs

Difficile · Dynamic programming · Bitmasks

Difficile · Geometry

Facile · Geometry

Facile · Implementation

Molto difficile · Geometry

Media · Dijkstra algorithm · Shortest paths · Greedy algorithms

Difficile · Binary Search · Greedy algorithms · Implementation

Difficile · Shortest paths · Graph matchings · Greedy algorithms

Facile · Implementation

Difficile · Trees

Molto facile · Binary Search

Molto difficile · Dynamic programming · Bitmasks · Greedy algorithms · Constructive Algorithms

Facile · Math · Number theory