Probleme

Dificil · Shortest paths · Graphs · Greedy algorithms

Foarte ușor · Math · Number theory

Dificil · Brute force

Ușor · Dynamic programming

Foarte ușor · Graphs · Graph network flows

Foarte dificil · Shortest paths · Graphs

Dificil · Graphs · Graph network flows

Dificil · Brute force · Dynamic programming

Dificil · Graph matchings · Graphs

Ușor · Graphs · Brute force

Foarte ușor · Dynamic programming · Combinatorics

Foarte ușor · Dynamic programming · Segment Tree

Foarte ușor · Sorting · Geometry

Foarte ușor · Data Structures · Implementation · Fenwick Tree

Foarte ușor · Graphs · Implementation

Mediu · Graphs

Foarte ușor · Brute force

Foarte dificil · Graphs · Graph matchings · Graph network flows · Greedy algorithms · Dynamic programming

Foarte dificil · Segment Tree · Sorting · Binary Search · Data Structures

Mediu · Binary Search · Greedy algorithms · Priority Queue

Mediu · Dynamic programming · Probabilities

Mediu · Expression parsing · Brute force · Combinatorics

Dificil · Prefix Sums · Greedy algorithms

Ușor · Sorting

Dificil · Geometry · Math · Number theory