| 1130-A |
Be Positive
|
implementation
|
800
|
| 1129-E |
Legendary Tree
|
binary search
interactive
trees
|
3100
|
| 1129-D |
Isolation
|
data structures
dp
|
2900
|
| 1129-C |
Morse Code
|
binary search
data structures
dp
+4
|
2400
|
| 1129-B |
Wrong Answer
|
constructive algorithms
|
2000
|
| 1129-A2 |
Toy Train
|
brute force
greedy
|
1800
|
| 1129-A1 |
Toy Train (Simplified)
|
brute force
greedy
|
1700
|
| 1121-C |
System Testing
|
implementation
|
1600
|
| 1121-B |
Mike and Children
|
brute force
implementation
|
1200
|
| 1121-A |
Technogoblet of Fire
|
implementation
sortings
|
1100
|
| 1120-F |
Secret Letters
|
data structures
dp
greedy
|
3100
|
| 1120-E |
The very same Munchhausen
|
brute force
|
2600
|
| 1120-D |
Power Tree
|
dfs and similar
dp
dsu
+3
|
2500
|
| 1120-C |
Compress String
|
dp
strings
|
2100
|
| 1120-B |
Once in a casino
|
constructive algorithms
greedy
implementation
+1
|
2700
|
| 1120-A |
Diana and Liana
|
greedy
implementation
two pointers
|
1900
|
| 1119-H |
Triple
|
fft
math
|
3200
|
| 1119-G |
Get Ready for the Battle
|
constructive algorithms
implementation
|
3100
|
| 1119-F |
Niyaz and Small Degrees
|
data structures
dp
trees
|
3400
|
| 1119-E |
Pavel and Triangles
|
brute force
dp
fft
+2
|
1900
|
| 1119-D |
Frets On Fire
|
binary search
sortings
|
1800
|
| 1119-C |
Ramesses and Corner Inversion
|
constructive algorithms
greedy
implementation
+1
|
1500
|
| 1119-B |
Alyona and a Narrow Fridge
|
binary search
flows
greedy
+1
|
1300
|
| 1119-A |
Ilya and a Colorful Walk
|
greedy
implementation
|
1100
|
| 1118-F2 |
Tree Cutting (Hard Version)
|
combinatorics
dfs and similar
dp
+1
|
2700
|
| 1118-F1 |
Tree Cutting (Easy Version)
|
dfs and similar
trees
|
1800
|
| 1118-E |
Yet Another Ball Problem
|
constructive algorithms
implementation
|
1700
|
| 1118-D2 |
Coffee and Coursework (Hard Version)
|
binary search
greedy
|
1700
|
| 1118-D1 |
Coffee and Coursework (Easy version)
|
brute force
greedy
|
1700
|
| 1118-C |
Palindromic Matrix
|
constructive algorithms
implementation
|
1700
|
| 1118-B |
Tanya and Candies
|
implementation
|
1200
|
| 1118-A |
Water Buying
|
math
|
800
|
| 1117-G |
Recursive Queries
|
data structures
|
2500
|
| 1117-F |
Crisp String
|
bitmasks
dp
|
2500
|
| 1117-E |
Decypher the String
|
bitmasks
chinese remainder theorem
constructive algorithms
+2
|
2200
|
| 1117-D |
Magic Gems
|
dp
math
matrices
|
2100
|
| 1117-C |
Magic Ship
|
binary search
|
1900
|
| 1117-B |
Emotes
|
greedy
math
sortings
|
1000
|
| 1117-A |
Best Subsegment
|
implementation
math
|
1100
|
| 1116-D6 |
Hessenberg matrix
|
*special
|
—
|
| 1116-D5 |
Creeper
|
*special
|
—
|
| 1116-D4 |
TIE fighter
|
*special
|
—
|
| 1116-D3 |
X-wing fighter
|
*special
|
—
|
| 1116-D2 |
Pattern of increasing blocks
|
*special
|
—
|
| 1116-D1 |
Block diagonal matrix
|
*special
|
—
|
| 1116-C3 |
``Is the number of ones divisible by 3?'' oracle
|
*special
|
—
|
| 1116-C2 |
``Is the bit string periodic?'' oracle
|
*special
|
—
|
| 1116-C1 |
Alternating bits oracle
|
*special
|
—
|
| 1116-B2 |
Not A, not B or not C?
|
*special
|
—
|
| 1116-B1 |
Distinguish three-qubit states
|
*special
|
—
|