Задачи

Трудно · Geometry · Convex Hull · Strings · Number theory · Sorting

Средно · Dynamic programming · Strings · Greedy algorithms

Много трудно · Dynamic programming · Matrix · Dynamic Programming Optimization

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

Средно · Math · Number theory · Hashing · Probabilities

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

Трудно · Constructive Algorithms

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

Средно · Strings

Много трудно · Combinatorics · Convex Hull · Geometry · Dynamic programming

Средно · Dynamic programming · Knapsack · Combinatorics

Средно · Prefix Sums · Bitwise Operations · Brute force

Много трудно · Dynamic programming · Dynamic Programming Optimization · Sorting · Greedy algorithms

Много трудно · Trees · Binary Search · Prefix Sums · SQRT Decomposition · Data Structures · Depth-first Search

Много трудно · Suffix Array · Sparse Table · Data Structures · Binary Search · Strings

Много трудно · Trees · Data Structures · Bitwise Operations · Divide and Conquer · Range queries · Prefix Sums

Трудно · Geometry · Scanline / Sweep Line · Greedy algorithms

Много трудно · Matrix · Dynamic programming · Number theory · Bitmasks

Лесно · Two pointers · Greedy algorithms

Лесно · Combinatorics · Math

Средно · Combinatorics · Dynamic programming

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

Лесно · Two pointers · Prefix Sums

Много трудно · Dynamic programming · Graphs · Sorting · Shortest paths · Probabilities

Трудно · Graphs · Breadth-first Search · Strings