| 960-A |
Check the string
|
implementation
|
1200
|
| 959-F |
Mahmoud and Ehab and yet another xor task
|
bitmasks
dp
math
+1
|
2400
|
| 959-E |
Mahmoud and Ehab and the xor-MST
|
bitmasks
dp
graphs
+2
|
1900
|
| 959-D |
Mahmoud and Ehab and another array construction task
|
constructive algorithms
greedy
math
+1
|
1900
|
| 959-C |
Mahmoud and Ehab and the wrong algorithm
|
constructive algorithms
trees
|
1500
|
| 959-B |
Mahmoud and Ehab and the message
|
dsu
greedy
implementation
|
1200
|
| 959-A |
Mahmoud and Ehab and the even-odd game
|
games
math
|
800
|
| 958-F3 |
Lightsabers (hard)
|
fft
|
2600
|
| 958-F2 |
Lightsabers (medium)
|
binary search
two pointers
|
1800
|
| 958-F1 |
Lightsabers (easy)
|
implementation
|
1500
|
| 958-E3 |
Guard Duty (hard)
|
geometry
|
2700
|
| 958-E2 |
Guard Duty (medium)
|
binary search
dp
greedy
+1
|
2200
|
| 958-E1 |
Guard Duty (easy)
|
brute force
geometry
greedy
+1
|
1600
|
| 958-D2 |
Hyperspace Jump (hard)
|
|
2700
|
| 958-D1 |
Hyperspace Jump (easy)
|
expression parsing
math
|
1400
|
| 958-C3 |
Encryption (hard)
|
data structures
dp
|
2500
|
| 958-C2 |
Encryption (medium)
|
dp
|
2000
|
| 958-C1 |
Encryption (easy)
|
brute force
|
1200
|
| 958-B2 |
Maximum Control (medium)
|
data structures
dfs and similar
graphs
+2
|
2200
|
| 958-B1 |
Maximum Control (easy)
|
implementation
|
1000
|
| 958-A3 |
Death Stars (hard)
|
|
3100
|
| 958-A2 |
Death Stars (medium)
|
hashing
strings
|
2000
|
| 958-A1 |
Death Stars (easy)
|
implementation
|
1400
|
| 957-A |
Tritonic Iridescence
|
implementation
|
1300
|
| 955-F |
Heaps
|
dp
trees
|
2600
|
| 955-E |
Icicles
|
|
2900
|
| 955-D |
Scissors
|
brute force
strings
|
2600
|
| 955-C |
Sad powers
|
binary search
math
number theory
|
2100
|
| 955-B |
Not simply beatiful strings
|
implementation
|
1400
|
| 955-A |
Feed the cat
|
greedy
math
|
1100
|
| 954-I |
Yet Another String Matching Problem
|
fft
math
|
2200
|
| 954-H |
Path Counting
|
combinatorics
dp
|
2500
|
| 954-G |
Castle Defense
|
binary search
data structures
greedy
+1
|
2000
|
| 954-F |
Runner's Problem
|
dp
matrices
sortings
|
2100
|
| 954-E |
Water Taps
|
binary search
greedy
sortings
|
2000
|
| 954-D |
Fight Against Traffic
|
dfs and similar
graphs
shortest paths
|
1600
|
| 954-C |
Matrix Walk
|
implementation
|
1700
|
| 954-B |
String Typing
|
implementation
strings
|
1400
|
| 954-A |
Diagonal Walking
|
implementation
|
800
|
| 952-G |
Puzzling Language
|
*special
constructive algorithms
|
2200
|
| 952-F |
2 + 2 != 4
|
*special
|
2400
|
| 952-E |
Cheese Board
|
*special
|
2000
|
| 952-D |
I'm Feeling Lucky!
|
*special
probabilities
|
1800
|
| 952-C |
Ravioli Sort
|
implementation
|
1600
|
| 952-B |
A Map of the Cat
|
*special
brute force
interactive
|
1900
|
| 952-A |
Quirky Quantifiers
|
*special
math
|
800
|
| 950-B |
Intercepted Message
|
greedy
implementation
|
1100
|
| 950-A |
Left-handers, Right-handers and Ambidexters
|
implementation
math
|
800
|
| 949-F |
Astronomy
|
geometry
probabilities
|
3300
|
| 949-E |
Binary Cards
|
brute force
|
2700
|