| 1312-D |
Count the Arrays
|
combinatorics
math
|
1700
|
| 1312-C |
Adding Powers
|
bitmasks
greedy
implementation
+3
|
1400
|
| 1312-B |
Bogosort
|
constructive algorithms
sortings
|
1000
|
| 1312-A |
Two Regular Polygons
|
geometry
greedy
math
+1
|
800
|
| 1311-F |
Moving Points
|
data structures
divide and conquer
implementation
+1
|
1900
|
| 1311-E |
Construct the Binary Tree
|
brute force
constructive algorithms
trees
|
2200
|
| 1311-D |
Three Integers
|
brute force
math
|
2000
|
| 1311-C |
Perform the Combo
|
brute force
|
1300
|
| 1311-B |
WeirdSort
|
dfs and similar
sortings
|
1200
|
| 1311-A |
Add Odd or Subtract Even
|
greedy
implementation
math
|
800
|
| 1310-F |
Bad Cryptography
|
math
number theory
|
3400
|
| 1310-E |
Strange Function
|
dp
|
2900
|
| 1310-D |
Tourism
|
dp
graphs
probabilities
|
2300
|
| 1310-C |
Au Pont Rouge
|
binary search
dp
strings
|
2800
|
| 1310-B |
Double Elimination
|
dp
implementation
|
2500
|
| 1310-A |
Recommendations
|
data structures
greedy
sortings
|
1700
|
| 1307-G |
Cow and Exercise
|
flows
graphs
shortest paths
|
3100
|
| 1307-F |
Cow and Vacation
|
dfs and similar
dsu
trees
|
3300
|
| 1307-E |
Cow and Treats
|
binary search
combinatorics
dp
+3
|
2500
|
| 1307-D |
Cow and Fields
|
binary search
data structures
dfs and similar
+4
|
1900
|
| 1307-C |
Cow and Message
|
brute force
dp
math
+1
|
1500
|
| 1307-B |
Cow and Friend
|
geometry
greedy
math
|
1300
|
| 1307-A |
Cow and Haybales
|
greedy
implementation
|
800
|
| 1305-H |
Kuroni the Private Tutor
|
binary search
greedy
|
3500
|
| 1305-G |
Kuroni and Antihype
|
bitmasks
brute force
dp
+2
|
3500
|
| 1305-F |
Kuroni and the Punishment
|
math
number theory
probabilities
|
2500
|
| 1305-E |
Kuroni and the Score Distribution
|
constructive algorithms
greedy
implementation
+1
|
2200
|
| 1305-D |
Kuroni and the Celebration
|
constructive algorithms
dfs and similar
interactive
+1
|
1900
|
| 1305-C |
Kuroni and Impossible Calculation
|
brute force
combinatorics
math
+1
|
1600
|
| 1305-B |
Kuroni and Simple Strings
|
constructive algorithms
greedy
strings
+1
|
1200
|
| 1305-A |
Kuroni and the Gifts
|
brute force
constructive algorithms
greedy
+1
|
800
|
| 1304-F2 |
Animal Observation (hard version)
|
data structures
dp
greedy
|
2400
|
| 1304-F1 |
Animal Observation (easy version)
|
data structures
dp
|
2300
|
| 1304-E |
1-Trees and Queries
|
data structures
dfs and similar
shortest paths
+1
|
2000
|
| 1304-D |
Shortest and Longest LIS
|
constructive algorithms
graphs
greedy
+1
|
1800
|
| 1304-C |
Air Conditioner
|
dp
greedy
implementation
+2
|
1500
|
| 1304-B |
Longest Palindrome
|
brute force
constructive algorithms
greedy
+2
|
1100
|
| 1304-A |
Two Rabbits
|
math
|
800
|
| 1303-G |
Sum of Prefix Sums
|
data structures
divide and conquer
geometry
+1
|
2700
|
| 1303-F |
Number of Components
|
dsu
implementation
|
2800
|
| 1303-E |
Erase Subsequences
|
dp
strings
|
2200
|
| 1303-D |
Fill The Bag
|
bitmasks
greedy
|
1900
|
| 1303-C |
Perfect Keyboard
|
dfs and similar
greedy
implementation
|
1600
|
| 1303-B |
National Project
|
math
|
1400
|
| 1303-A |
Erasing Zeroes
|
implementation
strings
|
800
|
| 1302-J |
Keep talking and nobody explodes -- hard
|
|
—
|
| 1302-I |
Deja vu
|
|
—
|
| 1302-H |
Who needs suffix structures?
|
|
—
|
| 1302-G |
Keep talking and nobody explodes -- medium
|
|
—
|
| 1302-F |
Keep talking and nobody explodes -- easy
|
bitmasks
brute force
expression parsing
|
—
|