| 363-C |
Fixing Typos
|
greedy
implementation
|
1400
|
| 363-B |
Fence
|
brute force
dp
|
1100
|
| 363-A |
Soroban
|
implementation
|
800
|
| 362-E |
Petya and Pipes
|
flows
graphs
shortest paths
|
2300
|
| 362-D |
Fools and Foolproof Roads
|
data structures
dfs and similar
dsu
+2
|
2100
|
| 362-C |
Insertion Sort
|
data structures
dp
implementation
+1
|
1900
|
| 362-B |
Petya and Staircases
|
implementation
sortings
|
1100
|
| 362-A |
Two Semiknights Meet
|
greedy
math
|
1500
|
| 361-B |
Levko and Permutation
|
constructive algorithms
math
number theory
|
1200
|
| 361-A |
Levko and Table
|
constructive algorithms
implementation
|
800
|
| 360-E |
Levko and Game
|
graphs
greedy
shortest paths
|
2800
|
| 360-D |
Levko and Sets
|
number theory
|
2600
|
| 360-C |
Levko and Strings
|
combinatorics
dp
|
2500
|
| 360-B |
Levko and Array
|
binary search
dp
|
2000
|
| 360-A |
Levko and Array Recovery
|
greedy
implementation
|
1700
|
| 359-E |
Neatness
|
constructive algorithms
dfs and similar
|
2400
|
| 359-D |
Pair of Numbers
|
binary search
brute force
data structures
+2
|
2000
|
| 359-C |
Prime Number
|
math
number theory
|
1900
|
| 359-B |
Permutation
|
constructive algorithms
dp
math
|
1400
|
| 359-A |
Table
|
constructive algorithms
greedy
implementation
|
1000
|
| 358-E |
Dima and Kicks
|
brute force
dsu
graphs
+1
|
2300
|
| 358-D |
Dima and Hares
|
dp
greedy
|
1800
|
| 358-C |
Dima and Containers
|
constructive algorithms
greedy
implementation
|
2000
|
| 358-B |
Dima and Text Messages
|
brute force
strings
|
1500
|
| 358-A |
Dima and Continuous Line
|
brute force
implementation
|
1400
|
| 357-B |
Flag Day
|
constructive algorithms
implementation
|
1400
|
| 357-A |
Group of Students
|
brute force
greedy
implementation
|
1000
|
| 356-E |
Xenia and String Problem
|
dp
hashing
implementation
+2
|
3000
|
| 356-D |
Bags and Coins
|
bitmasks
constructive algorithms
dp
+1
|
2700
|
| 356-C |
Compartments
|
combinatorics
constructive algorithms
greedy
+1
|
2100
|
| 356-B |
Xenia and Hamming
|
implementation
math
|
1900
|
| 356-A |
Knight Tournament
|
data structures
dsu
|
1500
|
| 355-B |
Vasya and Public Transport
|
greedy
implementation
|
1100
|
| 355-A |
Vasya and Digital Root
|
constructive algorithms
implementation
|
1100
|
| 354-E |
Lucky Number Representation
|
constructive algorithms
dfs and similar
dp
|
2200
|
| 354-D |
Transferring Pyramid
|
dp
|
2900
|
| 354-C |
Vasya and Beautiful Arrays
|
brute force
dp
number theory
|
2100
|
| 354-B |
Game with Strings
|
bitmasks
dp
games
|
2400
|
| 354-A |
Vasya and Robot
|
brute force
greedy
math
|
1500
|
| 353-E |
Antichain
|
dp
graph matchings
greedy
|
2200
|
| 353-D |
Queue
|
constructive algorithms
dp
|
2000
|
| 353-C |
Find Maximum
|
implementation
math
number theory
|
1600
|
| 353-B |
Two Heaps
|
combinatorics
constructive algorithms
greedy
+3
|
1900
|
| 353-A |
Domino
|
implementation
math
|
1200
|
| 352-B |
Jeff and Periods
|
implementation
sortings
|
1300
|
| 352-A |
Jeff and Digits
|
brute force
implementation
math
|
1000
|
| 351-E |
Jeff and Permutation
|
greedy
|
2200
|
| 351-D |
Jeff and Removing Periods
|
data structures
|
2700
|
| 351-C |
Jeff and Brackets
|
dp
matrices
|
2500
|
| 351-B |
Jeff and Furik
|
combinatorics
dp
probabilities
|
1900
|