Heidi and the Turing Test (Hard)

Heidi and the Turing Test (Medium)

data structures

Heidi and the Turing Test (Easy)

implementation

The Doctor Meets Vader (Hard)

flows, shortest paths

The Doctor Meets Vader (Medium)

flows, graph matchings, graphs, shortest paths, sortings

The Doctor Meets Vader (Easy)

binary search, sortings

Heidi Learns Hashing (Hard)

fft, math, number theory

Heidi Learns Hashing (Medium)

brute force, number theory

Heidi Learns Hashing (Easy)

brute force, math, number theory

Subsequences (hard version)

dp, strings

Candy Box (hard version)

greedy, implementation, sortings

Topforces Strikes Back

brute force, math, sortings

Subsequences (easy version)

dp, graphs, implementation, shortest paths

Candy Box (easy version)

greedy, sortings

Computer Game

binary search, math

Equalize Prices

math

Nearest Interesting Number

implementation

Maximum Sine

binary search, data structures, number theory

Product Oriented Recurrence

dp, math, matrices, number theory

Complete Mirror

constructive algorithms, dfs and similar, dp, hashing, implementation, trees

Beautiful Lyrics

data structures, greedy, strings

Plus from Picture

dfs and similar, implementation, strings

Filling Shapes

dp, math

A Story of One Country (Hard)

brute force, greedy, sortings

A Story of One Country (Easy)

brute force, divide and conquer, sortings

Irrigation

binary search, data structures, implementation, sortings, trees, two pointers

Flag

brute force, combinatorics, dp, implementation

Split a Number

greedy, implementation, strings

Chunga-Changa

greedy, math

Nick and Array

greedy, implementation

Alex and a Rhombus

dp, implementation, math

Alesya and Discrete Math

divide and conquer, interactive

Fedor Runs for President

data structures, dp, trees

Serge and Dining Room

binary search, data structures, graph matchings, greedy, implementation, math, trees

Tolik and His Uncle

constructive algorithms

Valeriy and Deque

data structures, implementation

Stock Exchange

binary search, flows, graphs

The Awesomest Vertex

data structures, dfs and similar

Long Colorful Strip

dp

Short Colorful Strip

combinatorics, dfs and similar, dp

Archaeology

brute force, constructive algorithms, greedy, strings

Prime Graph

constructive algorithms, greedy, math, number theory

Tiles

combinatorics, greedy, math

WOW Factor

dp, strings

Prime Minister

greedy

Digits Sequence (Hard Edition)

binary search, divide and conquer, implementation

Digits Sequence (Easy Edition)

implementation

Destroy it!

dp, implementation, sortings

Cover it!

dfs and similar, dsu, graphs, shortest paths, trees

Recover it!

dfs and similar, graphs, greedy, number theory, sortings

Lose it!

dp, greedy, implementation

Merge it!

math

Divide it!

brute force, greedy, implementation

Yet Another Partiton Problem

data structures, divide and conquer, dp, geometry, two pointers

The Number of Subpermutations

brute force, data structures, divide and conquer, hashing, math

Minimal Segment Cover

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

Array Splitting

greedy, sortings

Electrification

binary search, brute force, greedy

Catch Overflow!

data structures, expression parsing, implementation

From Hero to Zero

implementation, math

Ehab and the Big Finale

constructive algorithms, divide and conquer, graphs, implementation, interactive, trees

Ehab and the Expected GCD Problem

combinatorics, dp, math, number theory

Ehab and the Expected XOR Problem

bitmasks, constructive algorithms

Ehab and a Special Coloring Problem

constructive algorithms, number theory

Ehab Is an Odd Person

sortings

Ehab Fails to Be Thanos

constructive algorithms, greedy, sortings

Nauuo and Chess

constructive algorithms, greedy

Nauuo and Votes

greedy

Nauuo and Bug

data structures

Nauuo and ODT

data structures

Nauuo and Portals

constructive algorithms

Nauuo and Pictures (hard version)

dp, probabilities

Nauuo and Pictures (easy version)

dp, probabilities

Nauuo and Circle

combinatorics, dfs and similar, dp, trees

Nauuo and Cards

greedy, implementation

Good Subsets

*special problem, dp

Longest Saw

*special problem, constructive algorithms

Graph Decomposition

*special problem, graphs

Wheels

*special problem, binary search, greedy

Sliding Doors

*special problem, binary search

Decoding of Integer Sequences

*special problem, data structures, implementation

Minus and Minus Give Plus

*special problem, implementation, strings

Bad Days

*special problem, implementation

Three Integers Again

*special problem, math

Pairs

graphs, implementation

Circle Metro

implementation, math

Xor Permutations

constructive algorithms, math

Anagram Paths

dp, implementation, trees

And Reachability

bitmasks, dp

Good Triple

brute force, two pointers

Increasing by Modulo

binary search, greedy

Low Budget Inception

brute force, geometry

Scalar Queries

combinatorics, data structures, math, sortings

Range Deleting

binary search, combinatorics, data structures, two pointers

Bicolored RBS

constructive algorithms, greedy

News Distribution

dfs and similar, dsu, graphs

Lost Numbers

brute force, divide and conquer, interactive, math

Telephone Number

brute force, greedy, strings

Vicky's Delivery Service

data structures, dsu, graphs, hashing

The LCMs Must be Large

bitmasks, brute force, constructive algorithms, math, number theory