Problemi

Facile · Sorting

Facile · Math · Brute force

Facile · Brute force · Sorting

Facile · Dynamic programming

Molto difficile · Dynamic programming

Facile · Greedy algorithms · String suffix structures

Molto difficile · Brute force · Math

Media · Number theory · Prefix Sums · Prime factorization

Facile · Sorting · Hashing

Molto difficile · Dynamic programming · Divide and Conquer · Data Structures · Bitmasks

Difficile · Geometry · Binary Search

Media · Graphs · Shortest paths

Molto facile · Math

Difficile · Dynamic programming · Combinatorics · Trees

Molto difficile · Graphs · Number theory · Depth-first Search · Dynamic programming · Binary Search · Prefix Sums · Data Structures

Molto difficile · Segment Tree · Data Structures

Difficile · Breadth-first Search · Graphs · Binary Search

Molto difficile · Dynamic programming · Graphs · Breadth-first Search · Dijkstra algorithm · Shortest paths

Difficile · Binary Search · Hashing · Strings

Difficile · Greedy algorithms · Sorting · Data Structures

Molto difficile · Constructive Algorithms · Graphs · Breadth-first Search · Disjoint set union

Facile · Graphs

Molto facile · Implementation

Molto facile · Brute force

Molto facile · Brute force · Implementation