Задачи
Многу лесно · Graphs · Implementation
Многу тешко · Brute force · String suffix structures
Многу тешко · Geometry
Многу лесно · Math
Многу тешко · Graphs · Dynamic programming
Многу лесно · Implementation
Лесно · Prime factorization · Binary Search
Средно · Dynamic programming
Многу тешко · Geometry
Лесно · Graphs · Shortest paths
Средно · Greedy algorithms · Sorting · Disjoint set union · Graphs
Тешко · Breadth-first Search · Shortest paths · Graphs
Лесно · Implementation
Многу тешко · Geometry
Многу тешко · Math · Number theory · Combinatorics · Matrix · Constructive Algorithms
Тешко · Breadth-first Search · Bitmasks · Graphs
Средно · Geometry
Многу тешко · Dynamic programming · Bitmasks
Многу тешко · Trees · Data Structures · Range queries · Dynamic programming
Многу лесно · Graphs · Dynamic programming
Лесно · Dynamic programming · Combinatorics
Средно · Dynamic programming · Binary Search
Лесно · Graphs · Geometry
Средно · Math · Dynamic programming
Тешко · Greedy algorithms · Trees · Sorting · Breadth-first Search