Задачи

Трудно · Combinatorics · Disjoint set union · Trees · Number theory

Лесно · Combinatorics · Number theory

Лесно · Combinatorics · Number theory · Prefix Sums

Много лесно · Combinatorics · Math

Много лесно · Combinatorics · Number theory

Лесно · Trees · Depth-first Search · Graphs · Data Structures · Prefix Sums · Sorting

Средно · Segment Tree · Data Structures · Greedy algorithms · Combinatorics

Трудно · Dynamic programming · Knapsack · Sorting

Трудно · Constructive Algorithms · Strings · Greedy algorithms

Трудно · Greedy algorithms · Prefix Sums · Sorting · Constructive Algorithms

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

Трудно · Greedy algorithms · Constructive Algorithms

Много трудно · Greedy algorithms · Sorting · Data Structures · Constructive Algorithms · Trees

Лесно · Greedy algorithms · Sorting

Трудно · Greedy algorithms · Graphs · Sorting · Combinatorics

Лесно · Breadth-first Search · Graphs · Shortest paths

Много лесно · Prefix Sums · Bitwise Operations

Лесно · Binary Search

Лесно · Binary Search

Лесно · Dynamic programming

Много лесно · Combinatorics · Number theory

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

Трудно · Dynamic programming · Knapsack

Средно · Number theory · Prefix Sums · Hashing

Лесно · Trees · Depth-first Search · Data Structures · Greedy algorithms