Problemi

Facile · Dynamic programming · Divide and Conquer

Molto difficile · Dynamic programming · Number theory · Combinatorics

Molto difficile · Segment Tree · Range queries · Queries · Data Structures

Molto difficile · Breadth-first Search · Graphs · Constructive Algorithms · Number theory

Molto difficile · Graphs · Breadth-first Search · Combinatorics · Dynamic programming

Facile · Combinatorics · Prefix Sums · Greedy algorithms

Facile · Greedy algorithms · Prefix Sums

Molto facile · Dynamic programming · Combinatorics · Constructive Algorithms · Greedy algorithms

Difficile · Greedy algorithms · Sorting · Two pointers

Facile · Disjoint set union · Greedy algorithms · Sorting

Media · Prefix Sums · Sorting · Combinatorics

Molto difficile · Dynamic programming · Greedy algorithms · Binary Search · Sorting

Molto difficile · Data Structures · Greedy algorithms · Constructive Algorithms

Molto difficile · Graphs · Constructive Algorithms · Sorting · Stacks

Molto difficile · Dijkstra algorithm · Segment Tree · Graphs · Shortest paths

Facile · Dynamic programming · Greedy algorithms · Two pointers

Molto difficile · Combinatorics · Dynamic programming · Probabilities

Molto facile · Greedy algorithms · Sorting · Binary Search

Difficile · Greedy algorithms · Sorting · Constructive Algorithms

Difficile · Greedy algorithms · Combinatorics

Difficile · Depth-first Search · Dynamic programming · Bitmasks

Media · Brute force · Combinatorics

Media · Binary Search · Greedy algorithms · Sorting

Difficile · Fenwick Tree · Data Structures · Prefix Sums · Greedy algorithms · Sorting

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