| 263-D |
Cycle in Graph
|
dfs and similar
graphs
|
1800
|
| 263-C |
Circle of Numbers
|
brute force
dfs and similar
implementation
|
2000
|
| 263-B |
Squares
|
greedy
implementation
sortings
|
900
|
| 263-A |
Beautiful Matrix
|
implementation
|
800
|
| 262-B |
Roma and Changing Signs
|
greedy
|
1200
|
| 262-A |
Roma and Lucky Numbers
|
implementation
|
800
|
| 261-E |
Maxim and Calculator
|
brute force
dp
two pointers
|
2800
|
| 261-D |
Maxim and Increasing Subsequence
|
dp
|
2600
|
| 261-C |
Maxim and Matrix
|
constructive algorithms
dp
math
|
2000
|
| 261-B |
Maxim and Restaurant
|
dp
math
probabilities
|
1900
|
| 261-A |
Maxim and Discounts
|
greedy
sortings
|
1400
|
| 260-E |
Dividing Kingdom
|
binary search
brute force
data structures
|
2500
|
| 260-D |
Black and White Tree
|
constructive algorithms
dsu
graphs
+2
|
2100
|
| 260-C |
Balls and Boxes
|
constructive algorithms
greedy
implementation
|
1700
|
| 260-B |
Ancient Prophesy
|
brute force
implementation
strings
|
1600
|
| 260-A |
Adding Digits
|
implementation
math
|
1400
|
| 259-B |
Little Elephant and Magic Square
|
brute force
implementation
|
1100
|
| 259-A |
Little Elephant and Chess
|
brute force
strings
|
1000
|
| 258-E |
Little Elephant and Tree
|
data structures
dfs and similar
trees
|
2400
|
| 258-D |
Little Elephant and Broken Sorting
|
dp
math
probabilities
|
2600
|
| 258-C |
Little Elephant and LCM
|
binary search
combinatorics
dp
+1
|
2000
|
| 258-B |
Little Elephant and Elections
|
brute force
combinatorics
dp
|
1900
|
| 258-A |
Little Elephant and Bits
|
greedy
math
|
1100
|
| 257-E |
Greedy Elevator
|
data structures
implementation
|
2200
|
| 257-D |
Sum
|
greedy
math
|
1900
|
| 257-C |
View Angle
|
brute force
geometry
math
|
1800
|
| 257-B |
Playing Cubes
|
games
greedy
implementation
|
1300
|
| 257-A |
Sockets
|
greedy
implementation
sortings
|
1100
|
| 256-E |
Lucky Arrays
|
data structures
|
2400
|
| 256-D |
Liars and Serge
|
dp
|
2700
|
| 255-E |
Furlo and Rublo and Game
|
games
implementation
math
|
2200
|
| 255-D |
Mr. Bender and Square
|
binary search
implementation
math
|
1800
|
| 255-C |
Almost Arithmetical Progression
|
brute force
dp
|
1500
|
| 255-B |
Code Parsing
|
implementation
|
1200
|
| 255-A |
Greg's Workout
|
implementation
|
800
|
| 254-E |
Dormitory
|
dp
implementation
|
2100
|
| 254-D |
Rats
|
brute force
dfs and similar
graphs
+2
|
2300
|
| 254-C |
Anagram
|
greedy
strings
|
1800
|
| 254-B |
Jury Size
|
brute force
implementation
|
1500
|
| 254-A |
Cards with Numbers
|
constructive algorithms
sortings
|
1200
|
| 253-E |
Printer
|
binary search
data structures
implementation
+1
|
2200
|
| 253-D |
Table with Letters - 2
|
brute force
two pointers
|
2000
|
| 253-C |
Text Editor
|
data structures
dfs and similar
graphs
+2
|
1600
|
| 253-B |
Physics Practical
|
binary search
dp
sortings
+1
|
1400
|
| 253-A |
Boys and Girls
|
greedy
|
1100
|
| 252-B |
Unsorting Array
|
brute force
sortings
|
1800
|
| 252-A |
Little Xor
|
brute force
implementation
|
1100
|
| 251-E |
Tree and Table
|
dfs and similar
dp
implementation
+1
|
3000
|
| 251-D |
Two Sets
|
bitmasks
math
|
2700
|
| 251-C |
Number Transformation
|
dp
greedy
number theory
|
2000
|