Задачи

Тешко · Greedy algorithms · Fenwick Tree · Data Structures · Prefix Sums

Многу тешко · Constructive Algorithms · Greedy algorithms · Graphs · Math

Многу тешко · 2-SAT · Binary Search · Segment Tree · Data Structures · Prefix Sums · Graphs

Многу тешко · Meet-in-the-middle · Graphs · Trees · Depth-first Search · Bitmasks · Greedy algorithms · Constructive Algorithms

Лесно · Implementation

Средно · Math · Constructive Algorithms

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

Тешко · Math · Combinatorics

Средно · Brute force · Number theory

Средно · Dynamic programming · Combinatorics

Средно · Math · Greedy algorithms

Многу тешко · Dynamic programming · Prefix Sums · Stacks · Combinatorics

Лесно · Hashing · Implementation

Средно · Greedy algorithms · Sorting · Number theory

Тешко · Prefix Sums · Binary Search · Fenwick Tree · Sorting

Тешко · Bitmasks · Bitwise Operations · Dynamic programming · Breadth-first Search

Многу тешко · Dynamic programming · Combinatorics · Number theory · Prefix Sums

Многу лесно · 2-SAT

Многу тешко · Two pointers · Prefix Sums · Greedy algorithms

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

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

Многу тешко · Greedy algorithms · Sorting · Constructive Algorithms

Тешко · Constructive Algorithms · Math

Многу тешко · Dynamic programming · Greedy algorithms · Strings · Constructive Algorithms

Многу тешко · Bitwise Operations