Задачи

Много лесно · 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