| 672-B |
Different is Good
|
constructive algorithms
implementation
strings
|
1000
|
| 672-A |
Summer Camp
|
implementation
|
800
|
| 671-E |
Organizing a Race
|
data structures
greedy
|
3300
|
| 671-D |
Roads in Yusland
|
data structures
dp
greedy
|
2900
|
| 671-C |
Ultimate Weirdness of an Array
|
data structures
number theory
|
2800
|
| 671-B |
Robin Hood
|
binary search
greedy
|
2000
|
| 671-A |
Recycling Bottles
|
dp
geometry
greedy
+1
|
1800
|
| 670-F |
Restore a Number
|
brute force
constructive algorithms
strings
|
2300
|
| 670-E |
Correct Bracket Sequence Editor
|
data structures
dsu
strings
|
1700
|
| 670-D2 |
Magic Powder - 2
|
binary search
implementation
|
1500
|
| 670-D1 |
Magic Powder - 1
|
binary search
brute force
implementation
|
1400
|
| 670-C |
Cinema
|
implementation
sortings
|
1300
|
| 670-B |
Game of Robots
|
implementation
|
1000
|
| 670-A |
Holidays
|
brute force
constructive algorithms
greedy
+1
|
900
|
| 669-A |
Little Artem and Presents
|
math
|
800
|
| 667-B |
Coat of Anticubism
|
constructive algorithms
geometry
|
1100
|
| 667-A |
Pouring Rain
|
geometry
math
|
1100
|
| 666-E |
Forensic Examination
|
data structures
string suffix structures
|
3100
|
| 666-D |
Chain Reaction
|
brute force
geometry
|
3000
|
| 666-C |
Codeword
|
combinatorics
strings
|
2500
|
| 666-B |
World Tour
|
graphs
shortest paths
|
2000
|
| 666-A |
Reberland Linguistics
|
dp
implementation
strings
|
1800
|
| 665-F |
Four Divisors
|
data structures
dp
math
+3
|
2400
|
| 665-E |
Beautiful Subarrays
|
data structures
divide and conquer
strings
+1
|
2100
|
| 665-D |
Simple Subset
|
constructive algorithms
greedy
number theory
|
1800
|
| 665-C |
Simple Strings
|
dp
greedy
strings
|
1300
|
| 665-B |
Shopping
|
brute force
|
1400
|
| 665-A |
Buses Between Cities
|
implementation
|
1600
|
| 664-A |
Complicated GCD
|
math
number theory
|
800
|
| 663-A |
Rebus
|
constructive algorithms
expression parsing
greedy
+1
|
1800
|
| 662-E |
To Hack or not to Hack
|
brute force
dp
greedy
|
3100
|
| 662-D |
International Olympiad
|
constructive algorithms
greedy
implementation
+1
|
2000
|
| 662-C |
Binary Table
|
bitmasks
brute force
divide and conquer
+3
|
2600
|
| 662-B |
Graph Coloring
|
dfs and similar
graphs
|
2200
|
| 662-A |
Gambling Nim
|
bitmasks
math
matrices
+1
|
2400
|
| 661-H |
Rotate Matrix
|
*special
|
2400
|
| 661-G |
Hungarian Notation
|
*special
|
2200
|
| 661-F |
Primes in Interval
|
*special
|
1900
|
| 661-E |
Divisibility Check
|
*special
|
2000
|
| 661-D |
Maximal Difference
|
*special
|
2100
|
| 661-C |
Array Sum
|
*special
|
2000
|
| 661-B |
Seasons
|
*special
|
1900
|
| 661-A |
Lazy Caterer Sequence
|
*special
|
1300
|
| 660-F |
Bear and Bowling 4
|
binary search
data structures
divide and conquer
+2
|
2500
|
| 660-E |
Different Subsets For All Tuples
|
combinatorics
math
|
2300
|
| 660-D |
Number of Parallelograms
|
geometry
|
1900
|
| 660-C |
Hard Process
|
binary search
dp
two pointers
|
1600
|
| 660-B |
Seating On Bus
|
implementation
|
1000
|
| 660-A |
Co-prime Array
|
greedy
implementation
math
+1
|
1200
|
| 659-G |
Fence Divercity
|
combinatorics
dp
number theory
|
2300
|