Problemi

Molto facile · Graphs · Implementation

Molto difficile · Brute force · String suffix structures

Molto difficile · Geometry

Molto facile · Math

Molto difficile · Graphs · Dynamic programming

Molto facile · Implementation

Facile · Prime factorization · Binary Search

Media · Dynamic programming

Molto difficile · Geometry

Facile · Graphs · Shortest paths

Media · Greedy algorithms · Sorting · Disjoint set union · Graphs

Difficile · Breadth-first Search · Shortest paths · Graphs

Facile · Implementation

Molto difficile · Geometry

Molto difficile · Math · Number theory · Combinatorics · Matrix · Constructive Algorithms

Difficile · Breadth-first Search · Bitmasks · Graphs

Media · Geometry

Molto difficile · Dynamic programming · Bitmasks

Molto difficile · Trees · Data Structures · Range queries · Dynamic programming

Molto facile · Graphs · Dynamic programming

Facile · Dynamic programming · Combinatorics

Media · Dynamic programming · Binary Search

Facile · Graphs · Geometry

Media · Math · Dynamic programming

Difficile · Greedy algorithms · Trees · Sorting · Breadth-first Search