| 1065-E |
Side Transmutations
|
combinatorics
strings
|
2300
|
| 1065-D |
Three Pieces
|
dfs and similar
dp
shortest paths
|
2200
|
| 1065-C |
Make It Equal
|
greedy
|
1600
|
| 1065-B |
Vasya and Isolated Vertices
|
constructive algorithms
graphs
|
1300
|
| 1065-A |
Vasya and Chocolate
|
implementation
math
|
800
|
| 1064-B |
Equations of Mathematical Magic
|
math
|
1200
|
| 1064-A |
Make a triangle!
|
brute force
geometry
math
|
800
|
| 1063-F |
String Journey
|
data structures
dp
string suffix structures
|
3300
|
| 1063-E |
Lasers and Mirrors
|
constructive algorithms
math
|
3000
|
| 1063-D |
Candies for Children
|
brute force
math
|
2600
|
| 1063-C |
Dwarves, Hats and Extrasensory Abilities
|
binary search
constructive algorithms
geometry
+1
|
1900
|
| 1063-B |
Labyrinth
|
graphs
shortest paths
|
1800
|
| 1063-A |
Oh Those Palindromes
|
constructive algorithms
strings
|
1300
|
| 1062-F |
Upgrading Cities
|
dfs and similar
graphs
|
2900
|
| 1062-E |
Company
|
binary search
data structures
dfs and similar
+2
|
2300
|
| 1062-D |
Fun with Integers
|
dfs and similar
graphs
implementation
+1
|
1800
|
| 1062-C |
Banh-mi
|
greedy
implementation
math
|
1600
|
| 1062-B |
Math
|
greedy
math
number theory
|
1500
|
| 1062-A |
A Prank
|
greedy
implementation
|
1300
|
| 1061-F |
Lost Root
|
interactive
probabilities
|
2400
|
| 1061-E |
Politics
|
flows
graphs
|
2600
|
| 1061-D |
TV Shows
|
data structures
greedy
implementation
+1
|
2000
|
| 1061-C |
Multiplicity
|
data structures
dp
implementation
+2
|
1700
|
| 1061-B |
Views Matter
|
greedy
implementation
sortings
|
1400
|
| 1061-A |
Coins
|
greedy
implementation
math
|
800
|
| 1060-H |
Sophisticated Device
|
constructive algorithms
|
3300
|
| 1060-G |
Balls and Pockets
|
data structures
|
3400
|
| 1060-F |
Shrinking Tree
|
combinatorics
dp
|
2900
|
| 1060-E |
Sergey and Subway
|
dfs and similar
dp
trees
|
2000
|
| 1060-D |
Social Circles
|
greedy
math
|
1900
|
| 1060-C |
Maximum Subrectangle
|
binary search
implementation
two pointers
|
1600
|
| 1060-B |
Maximum Sum of Digits
|
greedy
|
1100
|
| 1060-A |
Phone Numbers
|
brute force
|
800
|
| 1059-E |
Split the Tree
|
binary search
data structures
dp
+2
|
2400
|
| 1059-D |
Nature Reserve
|
binary search
geometry
ternary search
|
2200
|
| 1059-C |
Sequence Transformation
|
constructive algorithms
math
|
1600
|
| 1059-B |
Forgery
|
implementation
|
1300
|
| 1059-A |
Cashier
|
implementation
|
1000
|
| 1057-C |
Tanya and Colored Candies
|
*special
dp
|
2000
|
| 1057-B |
DDoS
|
*special
brute force
|
1400
|
| 1057-A |
Bmail Computer Network
|
*special
dfs and similar
trees
|
900
|
| 1056-H |
Detect Robots
|
data structures
strings
|
3200
|
| 1056-G |
Take Metro
|
brute force
data structures
graphs
|
2900
|
| 1056-F |
Write The Contest
|
binary search
dp
math
|
2500
|
| 1056-E |
Check Transcription
|
brute force
data structures
hashing
+1
|
2100
|
| 1056-D |
Decorate Apple Tree
|
constructive algorithms
dfs and similar
dp
+4
|
1600
|
| 1056-C |
Pick Heroes
|
greedy
implementation
interactive
+1
|
1700
|
| 1056-B |
Divide Candies
|
math
number theory
|
1600
|
| 1056-A |
Determine Line
|
implementation
|
800
|
| 1055-G |
Jellyfish Nightmare
|
|
3500
|