| 915-E |
Physical Education Lessons
|
data structures
implementation
sortings
|
2300
|
| 915-D |
Almost Acyclic Graph
|
dfs and similar
graphs
|
2200
|
| 915-C |
Permute Digits
|
dp
greedy
|
1700
|
| 915-B |
Browser
|
implementation
|
1300
|
| 915-A |
Garden
|
implementation
|
900
|
| 914-H |
Ember and Storm's Tree Game
|
combinatorics
dp
games
+1
|
3400
|
| 914-G |
Sum the Fibonacci
|
bitmasks
divide and conquer
dp
+2
|
2600
|
| 914-F |
Substrings in a String
|
bitmasks
brute force
data structures
+2
|
3000
|
| 914-E |
Palindromes in a Tree
|
bitmasks
data structures
divide and conquer
+1
|
2400
|
| 914-D |
Bash and a Tough Math Puzzle
|
data structures
number theory
|
1900
|
| 914-C |
Travelling Salesman and Special Numbers
|
brute force
combinatorics
dp
|
1800
|
| 914-B |
Conan and Agasa play a Card Game
|
games
greedy
implementation
|
1200
|
| 914-A |
Perfect Squares
|
brute force
implementation
math
|
900
|
| 913-H |
Don't Exceed
|
math
probabilities
|
3400
|
| 913-G |
Power Substring
|
math
number theory
|
3200
|
| 913-F |
Strongly Connected Tournament
|
dp
graphs
math
+1
|
2800
|
| 913-E |
Logical Expression
|
bitmasks
dp
shortest paths
|
2400
|
| 913-D |
Too Easy Problems
|
binary search
brute force
data structures
+2
|
1800
|
| 913-C |
Party Lemonade
|
bitmasks
dp
greedy
|
1600
|
| 913-B |
Christmas Spruce
|
implementation
trees
|
1200
|
| 913-A |
Modular Exponentiation
|
implementation
math
|
900
|
| 912-E |
Prime Gift
|
binary search
dfs and similar
math
+3
|
2400
|
| 912-D |
Fishes
|
data structures
graphs
greedy
+2
|
2100
|
| 912-C |
Perun, Ult!
|
brute force
greedy
sortings
|
2500
|
| 912-B |
New Year's Eve
|
bitmasks
constructive algorithms
number theory
|
1300
|
| 912-A |
Tricky Alchemy
|
implementation
|
800
|
| 911-G |
Mass Change Queries
|
data structures
|
2500
|
| 911-F |
Tree Destruction
|
constructive algorithms
dfs and similar
graphs
+2
|
2400
|
| 911-E |
Stack Sorting
|
constructive algorithms
data structures
greedy
+1
|
2000
|
| 911-D |
Inversion Counting
|
brute force
math
|
1800
|
| 911-C |
Three Garlands
|
brute force
constructive algorithms
|
1400
|
| 911-B |
Two Cakes
|
binary search
brute force
implementation
|
1200
|
| 911-A |
Nearest Minimums
|
implementation
|
1100
|
| 910-C |
Minimum Sum
|
constructive algorithms
greedy
math
|
1700
|
| 910-B |
Door Frames
|
greedy
implementation
|
1600
|
| 910-A |
The Way to Home
|
dfs and similar
dp
greedy
+1
|
800
|
| 909-F |
AND-permutations
|
constructive algorithms
|
2500
|
| 909-E |
Coprocessor
|
dfs and similar
dp
graphs
+1
|
1900
|
| 909-D |
Colorful Points
|
data structures
greedy
implementation
|
2100
|
| 909-C |
Python Indentation
|
dp
|
1800
|
| 909-B |
Segments
|
constructive algorithms
math
|
1300
|
| 909-A |
Generate Login
|
brute force
greedy
sortings
|
1000
|
| 908-H |
New Year and Boolean Bridges
|
|
3100
|
| 908-G |
New Year and Original Order
|
dp
math
|
2800
|
| 908-F |
New Year and Rainbow Roads
|
graphs
greedy
implementation
|
2400
|
| 908-E |
New Year and Entity Enumeration
|
bitmasks
combinatorics
dp
+1
|
2500
|
| 908-D |
New Year and Arbitrary Arrangement
|
dp
math
probabilities
|
2200
|
| 908-C |
New Year and Curling
|
brute force
geometry
implementation
+1
|
1500
|
| 908-B |
New Year and Buggy Bot
|
brute force
implementation
|
1200
|
| 908-A |
New Year and Counting Cards
|
brute force
implementation
|
800
|