| 13-A |
Numbers
|
implementation
math
|
1000
|
| 12-E |
Start of the session
|
constructive algorithms
|
2100
|
| 12-D |
Ball
|
data structures
sortings
|
2400
|
| 12-C |
Fruits
|
greedy
implementation
sortings
|
1100
|
| 12-B |
Correct Solution?
|
implementation
sortings
|
1100
|
| 12-A |
Super Agent
|
implementation
|
800
|
| 11-E |
Forward, march!
|
binary search
dp
greedy
|
2800
|
| 11-D |
A Simple Task
|
bitmasks
dp
graphs
|
2200
|
| 11-C |
How Many Squares?
|
implementation
|
2200
|
| 11-B |
Jumping Jack
|
math
|
1600
|
| 11-A |
Increasing Sequence
|
constructive algorithms
implementation
math
|
900
|
| 10-E |
Greedy Change
|
constructive algorithms
|
2600
|
| 10-D |
LCIS
|
dp
|
2800
|
| 10-C |
Digital Root
|
number theory
|
2000
|
| 10-B |
Cinema Cashier
|
dp
implementation
|
1500
|
| 10-A |
Power Consumption Calculation
|
implementation
|
900
|
| 9-E |
Interestring graph and Apples
|
dfs and similar
dsu
graphs
|
2300
|
| 9-D |
How many trees?
|
combinatorics
divide and conquer
dp
|
1900
|
| 9-C |
Hexadecimal's Numbers
|
brute force
implementation
math
|
1200
|
| 9-B |
Running Student
|
brute force
geometry
implementation
|
1200
|
| 9-A |
Die Roll
|
math
probabilities
|
800
|
| 8-E |
Beads
|
dp
graphs
|
2600
|
| 8-D |
Two Friends
|
binary search
geometry
|
2600
|
| 8-C |
Looking for Order
|
bitmasks
dp
|
2000
|
| 8-B |
Obsession with Robots
|
constructive algorithms
graphs
implementation
|
1400
|
| 8-A |
Train and Peter
|
strings
|
1200
|
| 7-E |
Defining Macros
|
dp
expression parsing
implementation
|
2600
|
| 7-D |
Palindrome Degree
|
hashing
strings
|
2200
|
| 7-C |
Line
|
math
number theory
|
1800
|
| 7-B |
Memory Manager
|
implementation
|
1600
|
| 7-A |
Kalevitch and Chess
|
brute force
constructive algorithms
|
1100
|
| 6-E |
Exposition
|
binary search
data structures
dsu
+2
|
1900
|
| 6-D |
Lizards and Basements 2
|
brute force
dp
|
2600
|
| 6-C |
Alice, Bob and Chocolate
|
greedy
two pointers
|
1200
|
| 6-B |
President's Office
|
implementation
|
1100
|
| 6-A |
Triangle
|
brute force
geometry
|
900
|
| 5-E |
Bindian Signalizing
|
data structures
|
2400
|
| 5-D |
Follow Traffic Rules
|
implementation
math
|
2100
|
| 5-C |
Longest Regular Bracket Sequence
|
constructive algorithms
data structures
dp
+3
|
1900
|
| 5-B |
Center Alignment
|
implementation
strings
|
1200
|
| 5-A |
Chat Servers Outgoing Traffic
|
implementation
|
1000
|
| 4-D |
Mysterious Present
|
dp
sortings
|
1700
|
| 4-C |
Registration System
|
data structures
hashing
implementation
|
1300
|
| 4-B |
Before an Exam
|
constructive algorithms
greedy
|
1200
|
| 4-A |
Watermelon
|
brute force
math
|
800
|
| 3-D |
Least Cost Bracket Sequence
|
greedy
|
2600
|
| 3-C |
Tic-tac-toe
|
brute force
games
implementation
|
1800
|
| 3-B |
Lorry
|
greedy
sortings
|
1900
|
| 3-A |
Shortest path of the king
|
greedy
shortest paths
|
1000
|
| 2-C |
Commentator problem
|
geometry
|
2600
|