| 2168-B |
Locate
|
binary search
combinatorics
communication
+3
|
—
|
| 2168-A2 |
Encode and Decode (Hard Version)
|
bitmasks
communication
interactive
+1
|
—
|
| 2168-A1 |
Encode and Decode (Easy Version)
|
communication
constructive algorithms
interactive
|
—
|
| 2167-G |
Mukhammadali and the Smooth Array
|
data structures
dp
|
1600
|
| 2167-F |
Tree, TREE!!!
|
dfs and similar
dp
math
+1
|
1600
|
| 2167-E |
khba Loves to Sleep!
|
binary search
data structures
geometry
+2
|
1600
|
| 2167-D |
Yet Another Array Problem
|
brute force
implementation
math
+1
|
1000
|
| 2167-C |
Isamatdin and His Magic Wand!
|
constructive algorithms
greedy
implementation
+1
|
800
|
| 2167-B |
Your Name
|
sortings
strings
|
800
|
| 2167-A |
Square?
|
math
sortings
|
800
|
| 2166-B |
Tab Closing
|
math
|
900
|
| 2166-A |
Same Difference
|
brute force
greedy
strings
|
800
|
| 2165-F |
Arctic Acquisition
|
data structures
greedy
|
3500
|
| 2165-E |
Rainbow Branch
|
constructive algorithms
dp
greedy
+1
|
3200
|
| 2165-D |
Path Split
|
graph matchings
greedy
|
2500
|
| 2165-C |
Binary Wine
|
bitmasks
greedy
math
|
2000
|
| 2165-B |
Marble Council
|
dp
math
sortings
|
1900
|
| 2165-A |
Cyclic Merging
|
constructive algorithms
greedy
|
1300
|
| 2164-H |
PalindromePalindrome
|
data structures
strings
|
3400
|
| 2164-G |
Pointless Machine
|
constructive algorithms
graphs
interactive
+1
|
3300
|
| 2164-F2 |
Chain Prefix Rank (Hard Version)
|
binary search
combinatorics
data structures
+5
|
2900
|
| 2164-F1 |
Chain Prefix Rank (Easy Version)
|
combinatorics
dfs and similar
dp
+2
|
2600
|
| 2164-E |
Journey
|
data structures
dfs and similar
dsu
+2
|
2300
|
| 2164-D |
Copy String
|
greedy
implementation
strings
+1
|
1800
|
| 2164-C |
Dungeon
|
binary search
brute force
data structures
+2
|
1400
|
| 2164-B |
Even Modulo Pair
|
brute force
math
number theory
|
1000
|
| 2164-A |
Sequence Game
|
brute force
sortings
|
800
|
| 2163-E |
Plegma
|
bitmasks
combinatorics
communication
+1
|
2700
|
| 2163-D2 |
Diadrash (Hard Version)
|
binary search
interactive
math
+1
|
2500
|
| 2163-D1 |
Diadrash (Easy Version)
|
binary search
brute force
divide and conquer
+2
|
2100
|
| 2163-C |
Monopati
|
brute force
combinatorics
dp
+2
|
1500
|
| 2163-B |
Siga ta Kymata
|
constructive algorithms
greedy
implementation
+1
|
1700
|
| 2163-A |
Souvlaki VS. Kalamaki
|
brute force
greedy
math
+1
|
800
|
| 2162-H |
Beautiful Problem
|
dp
|
2900
|
| 2162-G |
Beautiful Tree
|
constructive algorithms
math
probabilities
+1
|
2200
|
| 2162-F |
Beautiful Intervals
|
constructive algorithms
greedy
|
2100
|
| 2162-E |
Beautiful Palindromes
|
constructive algorithms
greedy
schedules
|
1600
|
| 2162-D |
Beautiful Permutation
|
binary search
interactive
|
1400
|
| 2162-C |
Beautiful XOR
|
bitmasks
constructive algorithms
greedy
|
1100
|
| 2162-B |
Beautiful String
|
brute force
constructive algorithms
|
1000
|
| 2162-A |
Beautiful Average
|
brute force
greedy
|
800
|
| 2161-H |
Cycle Sort
|
data structures
|
3500
|
| 2161-G |
Bitwise And Equals
|
bitmasks
greedy
|
3500
|
| 2161-F |
SubMST
|
combinatorics
graphs
trees
|
3000
|
| 2161-E |
Left is Always Right
|
combinatorics
implementation
math
|
2400
|
| 2161-D |
Locked Out
|
binary search
data structures
dp
+1
|
2100
|
| 2161-C |
Loyalty
|
constructive algorithms
greedy
sortings
+1
|
1200
|
| 2161-B |
Make Connected
|
brute force
implementation
|
1700
|
| 2161-A |
Round Trip
|
games
greedy
implementation
+1
|
800
|
| 2160-C |
Reverse XOR
|
bitmasks
|
1300
|