| 1176-E |
Cover it!
|
dfs and similar
dsu
graphs
+2
|
1700
|
| 1176-D |
Recover it!
|
dfs and similar
graphs
greedy
+2
|
1800
|
| 1176-C |
Lose it!
|
dp
greedy
implementation
|
1300
|
| 1176-B |
Merge it!
|
math
|
1100
|
| 1176-A |
Divide it!
|
brute force
greedy
implementation
|
800
|
| 1175-G |
Yet Another Partiton Problem
|
data structures
divide and conquer
dp
+2
|
3000
|
| 1175-F |
The Number of Subpermutations
|
brute force
data structures
divide and conquer
+2
|
2500
|
| 1175-E |
Minimal Segment Cover
|
data structures
dfs and similar
divide and conquer
+4
|
2200
|
| 1175-D |
Array Splitting
|
greedy
sortings
|
1900
|
| 1175-C |
Electrification
|
binary search
brute force
greedy
|
1600
|
| 1175-B |
Catch Overflow!
|
data structures
expression parsing
implementation
|
1600
|
| 1175-A |
From Hero to Zero
|
implementation
math
|
900
|
| 1174-F |
Ehab and the Big Finale
|
constructive algorithms
divide and conquer
graphs
+3
|
2400
|
| 1174-E |
Ehab and the Expected GCD Problem
|
combinatorics
dp
math
+1
|
2500
|
| 1174-D |
Ehab and the Expected XOR Problem
|
bitmasks
constructive algorithms
|
1900
|
| 1174-C |
Ehab and a Special Coloring Problem
|
constructive algorithms
number theory
|
1300
|
| 1174-B |
Ehab Is an Odd Person
|
sortings
|
1200
|
| 1174-A |
Ehab Fails to Be Thanos
|
constructive algorithms
greedy
sortings
|
1000
|
| 1173-B |
Nauuo and Chess
|
constructive algorithms
greedy
|
1100
|
| 1173-A |
Nauuo and Votes
|
greedy
|
800
|
| 1172-F |
Nauuo and Bug
|
data structures
|
3300
|
| 1172-E |
Nauuo and ODT
|
data structures
|
3300
|
| 1172-D |
Nauuo and Portals
|
constructive algorithms
|
2900
|
| 1172-C2 |
Nauuo and Pictures (hard version)
|
dp
probabilities
|
2600
|
| 1172-C1 |
Nauuo and Pictures (easy version)
|
dp
probabilities
|
2300
|
| 1172-B |
Nauuo and Circle
|
combinatorics
dfs and similar
dp
+1
|
1900
|
| 1172-A |
Nauuo and Cards
|
greedy
implementation
|
1800
|
| 1170-I |
Good Subsets
|
*special
dp
|
—
|
| 1170-H |
Longest Saw
|
*special
constructive algorithms
|
—
|
| 1170-G |
Graph Decomposition
|
*special
graphs
|
—
|
| 1170-F |
Wheels
|
*special
binary search
greedy
|
—
|
| 1170-E |
Sliding Doors
|
*special
binary search
|
—
|
| 1170-D |
Decoding of Integer Sequences
|
*special
data structures
implementation
|
—
|
| 1170-C |
Minus and Minus Give Plus
|
*special
implementation
strings
|
—
|
| 1170-B |
Bad Days
|
*special
implementation
|
—
|
| 1170-A |
Three Integers Again
|
*special
math
|
—
|
| 1169-B |
Pairs
|
graphs
implementation
|
1500
|
| 1169-A |
Circle Metro
|
implementation
math
|
900
|
| 1168-E |
Xor Permutations
|
constructive algorithms
math
|
3100
|
| 1168-D |
Anagram Paths
|
dp
implementation
trees
|
3000
|
| 1168-C |
And Reachability
|
bitmasks
dp
|
2200
|
| 1168-B |
Good Triple
|
brute force
two pointers
|
1900
|
| 1168-A |
Increasing by Modulo
|
binary search
greedy
|
1700
|
| 1167-G |
Low Budget Inception
|
brute force
geometry
|
3100
|
| 1167-F |
Scalar Queries
|
combinatorics
data structures
math
+1
|
2300
|
| 1167-E |
Range Deleting
|
binary search
combinatorics
data structures
+1
|
2100
|
| 1167-D |
Bicolored RBS
|
constructive algorithms
greedy
|
1500
|
| 1167-C |
News Distribution
|
dfs and similar
dsu
graphs
|
1400
|
| 1167-B |
Lost Numbers
|
brute force
divide and conquer
interactive
+1
|
1400
|
| 1167-A |
Telephone Number
|
brute force
greedy
strings
|
800
|