| 1710-A |
Color the Picture
|
constructive algorithms
greedy
math
|
1500
|
| 1709-F |
Multiset of Strings
|
bitmasks
brute force
dp
+6
|
2500
|
| 1709-E |
XOR Tree
|
bitmasks
data structures
dfs and similar
+3
|
2400
|
| 1709-D |
Rorororobot
|
binary search
data structures
greedy
+1
|
1700
|
| 1709-C |
Recover an RBS
|
constructive algorithms
greedy
implementation
+1
|
1800
|
| 1709-B |
Also Try Minecraft
|
data structures
dp
implementation
|
900
|
| 1709-A |
Three Doors
|
brute force
greedy
implementation
+1
|
800
|
| 1708-B |
Difference of GCDs
|
constructive algorithms
math
|
1100
|
| 1708-A |
Difference Operations
|
greedy
math
|
800
|
| 1707-F |
Bugaboo
|
bitmasks
constructive algorithms
dp
+1
|
3500
|
| 1707-E |
Replace
|
binary search
data structures
|
3500
|
| 1707-D |
Partial Virtual Trees
|
combinatorics
dfs and similar
dp
+2
|
3000
|
| 1707-C |
DFS Trees
|
dfs and similar
dsu
graphs
+3
|
2400
|
| 1707-B |
Difference Array
|
brute force
data structures
implementation
+1
|
1900
|
| 1707-A |
Doremy's IQ
|
binary search
constructive algorithms
greedy
+1
|
1600
|
| 1706-E |
Qpwoeirut and Vertices
|
binary search
data structures
dfs and similar
+4
|
2300
|
| 1706-D2 |
Chopping Carrots (Hard Version)
|
brute force
constructive algorithms
data structures
+5
|
2400
|
| 1706-D1 |
Chopping Carrots (Easy Version)
|
binary search
brute force
constructive algorithms
+2
|
1700
|
| 1706-C |
Qpwoeirut And The City
|
dp
flows
greedy
+1
|
1400
|
| 1706-B |
Making Towers
|
dp
greedy
math
|
1100
|
| 1706-A |
Another String Minimization Problem
|
2-sat
constructive algorithms
greedy
+2
|
800
|
| 1705-F |
Mark and the Online Exam
|
bitmasks
constructive algorithms
interactive
+1
|
2900
|
| 1705-E |
Mark and Professor Koro
|
binary search
bitmasks
brute force
+3
|
2300
|
| 1705-D |
Mark and Lightbulbs
|
combinatorics
constructive algorithms
greedy
+2
|
1800
|
| 1705-C |
Mark and His Unfinished Essay
|
brute force
implementation
|
1400
|
| 1705-B |
Mark the Dust Sweeper
|
constructive algorithms
greedy
implementation
|
900
|
| 1705-A |
Mark the Photographer
|
greedy
sortings
|
800
|
| 1704-H2 |
Game of AI (hard version)
|
combinatorics
fft
math
|
3500
|
| 1704-H1 |
Game of AI (easy version)
|
combinatorics
constructive algorithms
dp
+2
|
3200
|
| 1704-G |
Mio and Lucky Array
|
constructive algorithms
fft
math
+1
|
3500
|
| 1704-F |
Colouring Game
|
constructive algorithms
dp
games
|
2600
|
| 1704-E |
Count Seconds
|
brute force
constructive algorithms
dp
+3
|
2200
|
| 1704-D |
Magical Array
|
constructive algorithms
hashing
implementation
+1
|
1900
|
| 1704-C |
Virus
|
greedy
implementation
sortings
|
1200
|
| 1704-B |
Luke is a Foodie
|
brute force
greedy
implementation
|
1000
|
| 1704-A |
Two 0-1 Sequences
|
constructive algorithms
greedy
|
800
|
| 1703-G |
Good Key, Bad Key
|
bitmasks
brute force
dp
+2
|
1600
|
| 1703-F |
Yet Another Problem About Pairs Satisfying an Inequality
|
binary search
data structures
dp
+2
|
1300
|
| 1703-E |
Mirror Grid
|
implementation
|
1200
|
| 1703-D |
Double Strings
|
brute force
data structures
strings
|
1100
|
| 1703-C |
Cypher
|
brute force
implementation
strings
|
800
|
| 1703-B |
ICPC Balloons
|
data structures
implementation
|
800
|
| 1703-A |
YES or YES?
|
brute force
implementation
strings
|
800
|
| 1702-G2 |
Passable Paths (hard version)
|
data structures
dfs and similar
trees
|
2000
|
| 1702-G1 |
Passable Paths (easy version)
|
dfs and similar
trees
|
1900
|
| 1702-F |
Equate Multisets
|
constructive algorithms
data structures
greedy
+2
|
1700
|
| 1702-E |
Split Into Two Sets
|
dfs and similar
dsu
graphs
|
1600
|
| 1702-D |
Not a Cheap String
|
greedy
|
1000
|
| 1702-C |
Train and Queries
|
data structures
greedy
|
1100
|
| 1702-B |
Polycarp Writes a String from Memory
|
greedy
|
800
|