Problemi

Facile · Dynamic programming · Knapsack

Molto facile · Implementation

Media · Disjoint set union · Graphs

Difficile · Binary Search · Sparse Table · Greedy algorithms · Data Structures

Difficile · Trees · Depth-first Search

Media · Depth-first Search · Graphs · Sorting

Molto difficile · Combinatorics · Math · Number theory · Dynamic programming

Molto facile · Implementation

Molto difficile · SQRT Decomposition · Trees · Data Structures · Queries

Difficile · Trees · Depth-first Search · Greedy algorithms · Number theory

Molto difficile · Trees · Depth-first Search · Graphs · Binary Search · Data Structures

Molto difficile · Dynamic programming · Dynamic Programming Optimization · Graphs · Shortest paths · Number theory · Combinatorics · Data Structures · Convex Hull · Prime factorization

Molto difficile · Dynamic programming · Graphs · Depth-first Search · Sorting · Combinatorics

Difficile · Meet-in-the-middle · Binary Search · Sorting · Dynamic programming

Difficile · Greedy algorithms · Sorting · Combinatorics · Binary Search

Difficile · Dynamic programming · Segment Tree · Binary Search · Sorting

Media · Greedy algorithms · Sorting

Molto difficile · Constructive Algorithms · Combinatorics · Number theory

Molto difficile · Dynamic programming · Combinatorics · Math · Number theory · Strings

Facile · Greedy algorithms · Math

Molto difficile · Dynamic programming · Probabilities

Difficile · Math · Probabilities · Games

Difficile · Dynamic programming · Matrix · Divide and Conquer

Difficile · Bitwise Operations · Data Structures · Greedy algorithms

Media · Number theory · Combinatorics · Math