Задачи

Лесно · Sorting

Лесно · Math · Brute force

Лесно · Brute force · Sorting

Лесно · Dynamic programming

Многу тешко · Dynamic programming

Лесно · Greedy algorithms · String suffix structures

Многу тешко · Brute force · Math

Средно · Number theory · Prefix Sums · Prime factorization

Лесно · Sorting · Hashing

Многу тешко · Dynamic programming · Divide and Conquer · Data Structures · Bitmasks

Тешко · Geometry · Binary Search

Средно · Graphs · Shortest paths

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

Тешко · Dynamic programming · Combinatorics · Trees

Многу тешко · Graphs · Number theory · Depth-first Search · Dynamic programming · Binary Search · Prefix Sums · Data Structures

Многу тешко · Segment Tree · Data Structures

Тешко · Breadth-first Search · Graphs · Binary Search

Многу тешко · Dynamic programming · Graphs · Breadth-first Search · Dijkstra algorithm · Shortest paths

Тешко · Binary Search · Hashing · Strings

Тешко · Greedy algorithms · Sorting · Data Structures

Многу тешко · Constructive Algorithms · Graphs · Breadth-first Search · Disjoint set union

Лесно · Graphs

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

Многу лесно · Brute force

Многу лесно · Brute force · Implementation