| 766-C |
Mahmoud and a Message
|
brute force
dp
greedy
+1
|
1700
|
| 766-B |
Mahmoud and a Triangle
|
constructive algorithms
geometry
greedy
+3
|
1000
|
| 766-A |
Mahmoud and Longest Uncommon Subsequence
|
constructive algorithms
strings
|
1000
|
| 765-G |
Math, math everywhere
|
brute force
dp
math
+2
|
3200
|
| 765-F |
Souvenirs
|
data structures
|
3100
|
| 765-E |
Tree Folding
|
dfs and similar
dp
greedy
+2
|
2200
|
| 765-D |
Artsem and Saunders
|
constructive algorithms
dsu
math
|
1700
|
| 765-C |
Table Tennis Game 2
|
math
|
1200
|
| 765-B |
Code obfuscation
|
greedy
implementation
strings
|
1100
|
| 765-A |
Neverending competitions
|
implementation
math
|
900
|
| 764-B |
Timofey and cubes
|
constructive algorithms
implementation
|
900
|
| 764-A |
Taymyr is calling you
|
brute force
implementation
math
|
800
|
| 763-E |
Timofey and our friends animals
|
data structures
divide and conquer
dsu
|
2900
|
| 763-D |
Timofey and a flat tree
|
data structures
graphs
hashing
+2
|
2900
|
| 763-C |
Timofey and remoduling
|
brute force
implementation
math
+1
|
2600
|
| 763-B |
Timofey and rectangles
|
constructive algorithms
geometry
|
2100
|
| 763-A |
Timofey and a tree
|
dfs and similar
dp
dsu
+3
|
1600
|
| 762-F |
Tree nesting
|
combinatorics
graphs
trees
|
2800
|
| 762-E |
Radio stations
|
binary search
data structures
|
2200
|
| 762-D |
Maximum path
|
dp
greedy
implementation
|
2300
|
| 762-C |
Two strings
|
binary search
hashing
strings
+1
|
2100
|
| 762-B |
USB vs. PS/2
|
greedy
implementation
sortings
+1
|
1400
|
| 762-A |
k-th divisor
|
math
number theory
|
1400
|
| 761-F |
Dasha and Photos
|
brute force
data structures
dp
+1
|
2600
|
| 761-E |
Dasha and Puzzle
|
constructive algorithms
dfs and similar
graphs
+2
|
2000
|
| 761-D |
Dasha and Very Difficult Problem
|
binary search
brute force
constructive algorithms
+2
|
1700
|
| 761-C |
Dasha and Password
|
brute force
dp
implementation
|
1500
|
| 761-B |
Dasha and friends
|
brute force
implementation
math
|
1300
|
| 761-A |
Dasha and Stairs
|
brute force
constructive algorithms
implementation
+1
|
1000
|
| 760-B |
Frodo and pillows
|
binary search
greedy
|
1500
|
| 760-A |
Petr and a calendar
|
implementation
math
|
800
|
| 758-F |
Geometrical Progression
|
brute force
math
number theory
|
2400
|
| 758-E |
Broken Tree
|
dfs and similar
dp
graphs
+2
|
2600
|
| 758-D |
Ability To Convert
|
constructive algorithms
dp
greedy
+2
|
2000
|
| 758-C |
Unfair Poll
|
binary search
constructive algorithms
implementation
+1
|
1700
|
| 758-B |
Blown Garland
|
brute force
implementation
number theory
|
1100
|
| 758-A |
Holiday Of Equality
|
implementation
math
|
800
|
| 757-G |
Can Bash Save the Day?
|
data structures
divide and conquer
graphs
+1
|
3400
|
| 757-F |
Team Rocket Rises Again
|
data structures
graphs
shortest paths
|
2800
|
| 757-E |
Bash Plays with Functions
|
brute force
combinatorics
dp
+1
|
2500
|
| 757-D |
Felicity's Big Secret Revealed
|
bitmasks
dp
|
2200
|
| 757-C |
Felicity is Coming!
|
data structures
hashing
sortings
+1
|
1900
|
| 757-B |
Bash's Big Day
|
greedy
math
number theory
|
1400
|
| 757-A |
Gotta Catch Em' All!
|
implementation
|
1000
|
| 756-F |
Long number
|
expression parsing
math
number theory
|
3400
|
| 756-E |
Byteland coins
|
combinatorics
dp
math
|
3200
|
| 756-D |
Bacterial Melee
|
brute force
combinatorics
dp
+1
|
2400
|
| 756-C |
Nikita and stack
|
data structures
|
2200
|
| 756-B |
Travel Card
|
binary search
dp
|
1600
|
| 756-A |
Pavel and barbecue
|
constructive algorithms
dfs and similar
|
1700
|