| 1799-G |
Count Voting
|
combinatorics
dp
math
|
2600
|
| 1799-F |
Halve or Subtract
|
binary search
brute force
dp
+2
|
2700
|
| 1799-E |
City Union
|
constructive algorithms
dfs and similar
dsu
+4
|
2300
|
| 1799-D2 |
Hot Start Up (hard version)
|
data structures
dp
|
2100
|
| 1799-D1 |
Hot Start Up (easy version)
|
dp
|
1900
|
| 1799-C |
Double Lexicographically Minimum
|
greedy
strings
|
1700
|
| 1799-B |
Equalize by Divide
|
brute force
constructive algorithms
greedy
+1
|
1200
|
| 1799-A |
Recent Actions
|
data structures
greedy
implementation
+1
|
800
|
| 1798-F |
Gifts from Grandfather Ahmed
|
dp
math
number theory
|
2500
|
| 1798-E |
Multitest Generator
|
brute force
dp
|
2300
|
| 1798-D |
Shocking Arrangement
|
constructive algorithms
greedy
math
|
1600
|
| 1798-C |
Candy Store
|
greedy
math
number theory
|
1700
|
| 1798-B |
Three Sevens
|
brute force
data structures
greedy
+1
|
1000
|
| 1798-A |
Showstopper
|
greedy
implementation
sortings
|
800
|
| 1797-F |
Li Hua and Path
|
data structures
dfs and similar
divide and conquer
+2
|
3000
|
| 1797-E |
Li Hua and Array
|
brute force
data structures
dsu
+3
|
2300
|
| 1797-D |
Li Hua and Tree
|
brute force
data structures
dfs and similar
+3
|
1900
|
| 1797-C |
Li Hua and Chess
|
constructive algorithms
greedy
interactive
|
1600
|
| 1797-B |
Li Hua and Pattern
|
constructive algorithms
greedy
|
1100
|
| 1797-A |
Li Hua and Maze
|
constructive algorithms
flows
graphs
+2
|
800
|
| 1796-F |
Strange Triples
|
brute force
math
number theory
|
2900
|
| 1796-E |
Colored Subgraphs
|
dfs and similar
dp
games
+2
|
2500
|
| 1796-D |
Maximum Subarray
|
data structures
dp
greedy
+1
|
2000
|
| 1796-C |
Maximum Set
|
binary search
math
|
1600
|
| 1796-B |
Asterisk-Minor Template
|
implementation
strings
|
1000
|
| 1796-A |
Typical Interview Problem
|
brute force
implementation
strings
|
800
|
| 1795-G |
Removal Sequences
|
bitmasks
dfs and similar
graphs
|
2700
|
| 1795-F |
Blocking Chips
|
binary search
constructive algorithms
dfs and similar
+2
|
2400
|
| 1795-E |
Explosions?
|
binary search
data structures
dp
+2
|
2200
|
| 1795-D |
Triangle Coloring
|
combinatorics
math
|
1600
|
| 1795-C |
Tea Tasting
|
binary search
data structures
implementation
|
1500
|
| 1795-B |
Ideal Point
|
brute force
geometry
greedy
|
900
|
| 1795-A |
Two Towers
|
brute force
implementation
strings
|
800
|
| 1794-E |
Labeling the Tree with Distances
|
data structures
dp
greedy
+3
|
2400
|
| 1794-D |
Counting Factorizations
|
combinatorics
divide and conquer
dp
+2
|
1900
|
| 1794-C |
Scoring Subsequences
|
binary search
greedy
math
+1
|
1300
|
| 1794-B |
Not Dividing
|
constructive algorithms
greedy
math
|
900
|
| 1794-A |
Prefix and Suffix Array
|
strings
|
800
|
| 1793-F |
Rebrending
|
brute force
data structures
divide and conquer
+1
|
2600
|
| 1793-E |
Velepin and Marketing
|
binary search
data structures
dp
+3
|
2600
|
| 1793-D |
Moscow Gorillas
|
binary search
dp
greedy
+3
|
1800
|
| 1793-C |
Dora and Search
|
constructive algorithms
data structures
two pointers
|
1200
|
| 1793-B |
Fedya and Array
|
constructive algorithms
math
|
1100
|
| 1793-A |
Yet Another Promotion
|
greedy
math
|
800
|
| 1792-F2 |
Graph Coloring (hard version)
|
brute force
combinatorics
divide and conquer
+3
|
2900
|
| 1792-F1 |
Graph Coloring (easy version)
|
combinatorics
dp
graphs
|
2700
|
| 1792-E |
Divisors and Table
|
brute force
dfs and similar
dp
+1
|
2400
|
| 1792-D |
Fixed Prefix Permutations
|
binary search
bitmasks
data structures
+3
|
1700
|
| 1792-C |
Min Max Sort
|
binary search
brute force
greedy
+2
|
1500
|
| 1792-B |
Stand-up Comedian
|
greedy
math
|
1200
|