Perfect Triples

bitmasks, brute force, constructive algorithms, divide and conquer, math

Minimal Segment Cover

data structures, dfs and similar, divide and conquer, dp, greedy, implementation, trees

Non-Decreasing Dilemma

data structures, divide and conquer, math

0-1-Tree

dfs and similar, divide and conquer, dp, dsu, trees

The Bakery

binary search, data structures, divide and conquer, dp, two pointers

Clear the Multiset

data structures, divide and conquer, dp, greedy

Blueprint for Seating

combinatorics, divide and conquer, math

Longest Array Deconstruction

data structures, divide and conquer, dp, sortings

Mashmokh and Reverse Operation

combinatorics, divide and conquer

Sum over all Substrings (Hard Version)

bitmasks, divide and conquer, dp, dsu, greedy, implementation, strings

Preorder

combinatorics, divide and conquer, dp, dsu, hashing, sortings, trees

Array Collapse

data structures, divide and conquer, dp, trees

Beautiful Subarrays

data structures, divide and conquer, strings, trees

Skyline Photo

data structures, divide and conquer, dp

More Wrong

divide and conquer, interactive

Timofey and Black-White Tree

brute force, dfs and similar, divide and conquer, graphs, greedy, math, shortest paths, trees

Points on Plane

constructive algorithms, divide and conquer, geometry, greedy, sortings

Xor Tree

binary search, bitmasks, data structures, divide and conquer, dp, trees

Pokémon Army (hard version)

data structures, divide and conquer, dp, greedy, implementation

Ciel the Commander

constructive algorithms, dfs and similar, divide and conquer, greedy, trees

Mahmoud and Ehab and the binary string

binary search, divide and conquer, interactive

Tokitsukaze and Strange Rectangle

data structures, divide and conquer, sortings, two pointers

Nene and the Mex Operator

bitmasks, brute force, constructive algorithms, divide and conquer, dp, greedy, implementation, math

No Palindromes

brute force, constructive algorithms, divide and conquer, greedy, hashing, implementation, math, strings

Counting Graphs

combinatorics, divide and conquer, dsu, graphs, greedy, sortings, trees

XOR Inverse

bitmasks, data structures, divide and conquer, dp, greedy, math, sortings, strings, trees

Book of Evil

dfs and similar, divide and conquer, dp, trees

Minimum Sum

divide and conquer, geometry, sortings

Hongcow's Game

bitmasks, divide and conquer, interactive

Counting Rectangles is Fun

brute force, divide and conquer, dp

Counting Factorizations

combinatorics, divide and conquer, dp, math, number theory

How many trees?

combinatorics, divide and conquer, dp

Moving Points

data structures, divide and conquer, implementation, sortings

Balanced Removals (Harder)

binary search, constructive algorithms, divide and conquer, greedy, implementation, sortings

Imbalanced Array

data structures, divide and conquer, dsu, sortings

Permutation Graph

binary search, constructive algorithms, data structures, divide and conquer, greedy, shortest paths

Array Stabilization (GCD version)

binary search, brute force, data structures, divide and conquer, number theory, two pointers

Beautiful Array

brute force, data structures, divide and conquer, dp, greedy

Dr. Evil Underscores

bitmasks, brute force, dfs and similar, divide and conquer, dp, greedy, strings, trees

Painting Fence

divide and conquer, dp, greedy

One-Based Arithmetic

brute force, dfs and similar, divide and conquer

Digits Sequence (Hard Edition)

binary search, divide and conquer, implementation

Permutations

bitmasks, divide and conquer, math

Merge Sort

constructive algorithms, divide and conquer

Set To Max (Hard Version)

constructive algorithms, data structures, divide and conquer, greedy, implementation, sortings

Max GEQ Sum

binary search, constructive algorithms, data structures, divide and conquer, implementation, two pointers

Petya and Array

data structures, divide and conquer, two pointers

Maximum AND

bitmasks, dfs and similar, divide and conquer, greedy, sortings

Maximum Subsequence

bitmasks, divide and conquer, meet-in-the-middle

Path Queries

divide and conquer, dsu, graphs, sortings, trees

Increasing Subsequences

bitmasks, constructive algorithms, divide and conquer, greedy, math

Integers Have Friends

binary search, data structures, divide and conquer, math, number theory, two pointers

Pashmak and Parmida's problem

data structures, divide and conquer, sortings

Ones and Twos

binary search, data structures, divide and conquer, math, two pointers

Creative Snap

binary search, brute force, divide and conquer, math

Sum of XOR Functions

bitmasks, combinatorics, divide and conquer, dp, math

Equivalent Strings

divide and conquer, hashing, sortings, strings

Practice

constructive algorithms, divide and conquer, implementation

Code For 1

constructive algorithms, dfs and similar, divide and conquer

Divide and Summarize

binary search, brute force, data structures, divide and conquer, implementation, sortings

Parsa's Humongous Tree

dfs and similar, divide and conquer, dp, greedy, trees

Maximum Sum on Even Positions

divide and conquer, dp, greedy, implementation

Maximum Crossings (Hard Version)

data structures, divide and conquer, sortings

Greetings

data structures, divide and conquer, sortings

a-Good String

bitmasks, brute force, divide and conquer, dp, implementation

Lost Numbers

brute force, divide and conquer, interactive, math

Masha and a Beautiful Tree

dfs and similar, divide and conquer, graphs, sortings, trees

Permutation Transformation

dfs and similar, divide and conquer, implementation