Задачи

Лесно · Dynamic programming · Knapsack

Много лесно · Implementation

Средно · Disjoint set union · Graphs

Трудно · Binary Search · Sparse Table · Greedy algorithms · Data Structures

Трудно · Trees · Depth-first Search

Средно · Depth-first Search · Graphs · Sorting

Много трудно · Combinatorics · Math · Number theory · Dynamic programming

Много лесно · Implementation

Много трудно · SQRT Decomposition · Trees · Data Structures · Queries

Трудно · Trees · Depth-first Search · Greedy algorithms · Number theory

Много трудно · Trees · Depth-first Search · Graphs · Binary Search · Data Structures

Много трудно · Dynamic programming · Dynamic Programming Optimization · Graphs · Shortest paths · Number theory · Combinatorics · Data Structures · Convex Hull · Prime factorization

Много трудно · Dynamic programming · Graphs · Depth-first Search · Sorting · Combinatorics

Трудно · Meet-in-the-middle · Binary Search · Sorting · Dynamic programming

Трудно · Greedy algorithms · Sorting · Combinatorics · Binary Search

Трудно · Dynamic programming · Segment Tree · Binary Search · Sorting

Средно · Greedy algorithms · Sorting

Много трудно · Constructive Algorithms · Combinatorics · Number theory

Много трудно · Dynamic programming · Combinatorics · Math · Number theory · Strings

Лесно · Greedy algorithms · Math

Много трудно · Dynamic programming · Probabilities

Трудно · Math · Probabilities · Games

Трудно · Dynamic programming · Matrix · Divide and Conquer

Трудно · Bitwise Operations · Data Structures · Greedy algorithms

Средно · Number theory · Combinatorics · Math