Задачи

Лесно · Dynamic programming · Divide and Conquer

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

Много трудно · Segment Tree · Range queries · Queries · Data Structures

Много трудно · Breadth-first Search · Graphs · Constructive Algorithms · Number theory

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

Лесно · Combinatorics · Prefix Sums · Greedy algorithms

Лесно · Greedy algorithms · Prefix Sums

Много лесно · Dynamic programming · Combinatorics · Constructive Algorithms · Greedy algorithms

Трудно · Greedy algorithms · Sorting · Two pointers

Лесно · Disjoint set union · Greedy algorithms · Sorting

Средно · Prefix Sums · Sorting · Combinatorics

Много трудно · Dynamic programming · Greedy algorithms · Binary Search · Sorting

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

Много трудно · Graphs · Constructive Algorithms · Sorting · Stacks

Много трудно · Dijkstra algorithm · Segment Tree · Graphs · Shortest paths

Лесно · Dynamic programming · Greedy algorithms · Two pointers

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

Много лесно · Greedy algorithms · Sorting · Binary Search

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

Трудно · Greedy algorithms · Combinatorics

Трудно · Depth-first Search · Dynamic programming · Bitmasks

Средно · Brute force · Combinatorics

Средно · Binary Search · Greedy algorithms · Sorting

Трудно · Fenwick Tree · Data Structures · Prefix Sums · Greedy algorithms · Sorting

Лесно · Graphs · Greedy algorithms · Disjoint set union · Sorting