Задачи

Лесно · 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