| 1764-G3 |
Doremy's Perfect DS Class (Hard Version)
|
binary search
interactive
|
3300
|
| 1764-G2 |
Doremy's Perfect DS Class (Medium Version)
|
binary search
interactive
|
3000
|
| 1764-G1 |
Doremy's Perfect DS Class (Easy Version)
|
binary search
interactive
|
2900
|
| 1764-F |
Doremy's Experimental Tree
|
brute force
constructive algorithms
dfs and similar
+3
|
2500
|
| 1764-E |
Doremy's Number Line
|
dp
greedy
sortings
|
2400
|
| 1764-D |
Doremy's Pegging Game
|
combinatorics
dp
math
|
2000
|
| 1764-C |
Doremy's City Construction
|
graphs
greedy
|
1400
|
| 1764-B |
Doremy's Perfect Math Class
|
math
number theory
|
900
|
| 1764-A |
Doremy's Paint
|
greedy
|
800
|
| 1763-F |
Edge Queries
|
data structures
dfs and similar
dp
+3
|
3000
|
| 1763-E |
Node Pairs
|
dp
graphs
math
+1
|
2200
|
| 1763-D |
Valid Bitonic Permutations
|
combinatorics
dp
implementation
+2
|
2200
|
| 1763-C |
Another Array Problem
|
brute force
constructive algorithms
greedy
|
2000
|
| 1763-B |
Incinerate
|
binary search
brute force
data structures
+3
|
1200
|
| 1763-A |
Absolute Maximization
|
bitmasks
constructive algorithms
greedy
+1
|
800
|
| 1762-G |
Unequal Adjacent Elements
|
constructive algorithms
sortings
|
3100
|
| 1762-F |
Good Pairs
|
binary search
data structures
dp
|
2600
|
| 1762-E |
Tree Sum
|
combinatorics
math
trees
|
2600
|
| 1762-D |
GCD Queries
|
constructive algorithms
interactive
number theory
|
2100
|
| 1762-C |
Binary Strings are Fun
|
combinatorics
math
|
1400
|
| 1762-B |
Make Array Good
|
constructive algorithms
implementation
number theory
+1
|
1100
|
| 1762-A |
Divide and Conquer
|
greedy
math
number theory
|
800
|
| 1761-G |
Centroid Guess
|
interactive
probabilities
trees
|
3500
|
| 1761-F2 |
Anti-median (Hard Version)
|
combinatorics
dp
math
|
3500
|
| 1761-F1 |
Anti-median (Easy Version)
|
dp
math
|
3100
|
| 1761-E |
Make It Connected
|
binary search
brute force
constructive algorithms
+6
|
2400
|
| 1761-D |
Carry Bit
|
combinatorics
math
|
2100
|
| 1761-C |
Set Construction
|
constructive algorithms
dfs and similar
graphs
+1
|
1400
|
| 1761-B |
Elimination of a Ring
|
constructive algorithms
greedy
implementation
|
1000
|
| 1761-A |
Two Permutations
|
brute force
constructive algorithms
|
800
|
| 1760-G |
SlavicG's Favorite Problem
|
bitmasks
dfs and similar
graphs
|
1700
|
| 1760-F |
Quests
|
binary search
greedy
sortings
|
1500
|
| 1760-E |
Binary Inversions
|
data structures
greedy
math
|
1100
|
| 1760-D |
Challenging Valleys
|
implementation
two pointers
|
1000
|
| 1760-C |
Advantage
|
data structures
implementation
sortings
|
800
|
| 1760-B |
Atilla's Favorite Problem
|
greedy
implementation
strings
|
800
|
| 1760-A |
Medium Number
|
implementation
sortings
|
800
|
| 1759-G |
Restore the Permutation
|
binary search
constructive algorithms
data structures
+2
|
1900
|
| 1759-F |
All Possible Digits
|
binary search
data structures
greedy
+2
|
1800
|
| 1759-E |
The Humanoid
|
brute force
dp
sortings
|
1500
|
| 1759-D |
Make It Round
|
brute force
number theory
|
1400
|
| 1759-C |
Thermostat
|
greedy
math
shortest paths
|
1100
|
| 1759-B |
Lost Permutation
|
math
|
800
|
| 1759-A |
Yes-Yes?
|
implementation
strings
|
800
|
| 1758-F |
Decent Division
|
constructive algorithms
data structures
|
3000
|
| 1758-E |
Tick, Tock
|
combinatorics
dfs and similar
dsu
+1
|
2500
|
| 1758-D |
Range = √Sum
|
binary search
brute force
constructive algorithms
+2
|
1800
|
| 1758-C |
Almost All Multiples
|
greedy
number theory
|
1400
|
| 1758-B |
XOR = Average
|
constructive algorithms
|
900
|
| 1758-A |
SSeeeeiinngg DDoouubbllee
|
constructive algorithms
strings
|
800
|