| 1769-C1 |
Подкрутка I
|
*special
brute force
dp
+1
|
1200
|
| 1769-B2 |
Копирование файлов II
|
*special
binary search
brute force
+1
|
1400
|
| 1769-B1 |
Копирование файлов I
|
*special
brute force
implementation
+1
|
1000
|
| 1769-A |
Узкая дорога
|
*special
math
|
800
|
| 1768-F |
Wonderful Jump
|
dp
greedy
|
2900
|
| 1768-E |
Partial Sorting
|
combinatorics
math
number theory
|
2300
|
| 1768-D |
Lucky Permutation
|
constructive algorithms
dfs and similar
graphs
+1
|
1800
|
| 1768-C |
Elemental Decompress
|
constructive algorithms
greedy
implementation
+1
|
1300
|
| 1768-B |
Quick Sort
|
greedy
math
|
900
|
| 1768-A |
Greatest Convex
|
greedy
math
number theory
|
800
|
| 1767-F |
Two Subtrees
|
data structures
trees
|
3100
|
| 1767-E |
Algebra Flash
|
bitmasks
brute force
dp
+4
|
2500
|
| 1767-D |
Playoff
|
combinatorics
constructive algorithms
dp
+2
|
1500
|
| 1767-C |
Count Binary Strings
|
data structures
dp
|
2100
|
| 1767-B |
Block Towers
|
data structures
greedy
sortings
|
800
|
| 1767-A |
Cut the Triangle
|
implementation
|
800
|
| 1766-F |
MCF
|
flows
|
2800
|
| 1766-E |
Decomposition
|
binary search
brute force
data structures
+3
|
2300
|
| 1766-D |
Lucky Chains
|
math
number theory
|
1600
|
| 1766-C |
Hamiltonian Wall
|
dp
implementation
|
1300
|
| 1766-B |
Notepad#
|
implementation
|
1000
|
| 1766-A |
Extremely Round
|
brute force
implementation
|
800
|
| 1765-N |
Number Reduction
|
greedy
|
1500
|
| 1765-M |
Minimum LCM
|
math
number theory
|
1000
|
| 1765-L |
Project Manager
|
brute force
data structures
implementation
|
2400
|
| 1765-K |
Torus Path
|
greedy
math
|
1500
|
| 1765-J |
Hero to Zero
|
graph matchings
math
|
2900
|
| 1765-I |
Infinite Chess
|
implementation
shortest paths
|
2800
|
| 1765-H |
Hospital Queue
|
binary search
graphs
greedy
+1
|
2200
|
| 1765-G |
Guess the String
|
constructive algorithms
interactive
probabilities
|
2600
|
| 1765-F |
Chemistry Lab
|
dp
geometry
probabilities
|
2200
|
| 1765-E |
Exchange
|
brute force
math
|
1000
|
| 1765-D |
Watch the Videos
|
binary search
constructive algorithms
two pointers
|
1700
|
| 1765-C |
Card Guessing
|
combinatorics
dp
probabilities
|
2600
|
| 1765-B |
Broken Keyboard
|
greedy
|
800
|
| 1765-A |
Access Levels
|
bitmasks
dsu
flows
+1
|
2400
|
| 1764-H |
Doremy's Paint 2
|
data structures
|
3400
|
| 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
|