| 1356-B1 |
Increment
|
*special
|
—
|
| 1356-A5 |
Distinguish Z from -Z
|
*special
|
—
|
| 1356-A4 |
Distinguish I ⊗ X from CNOT
|
*special
|
—
|
| 1356-A3 |
Distinguish Z from S
|
*special
|
—
|
| 1356-A2 |
Distinguish I from Z
|
*special
|
—
|
| 1356-A1 |
Distinguish I from X
|
*special
|
—
|
| 1355-F |
Guess Divisors Count
|
constructive algorithms
interactive
number theory
|
2600
|
| 1355-E |
Restorer Distance
|
binary search
greedy
math
+2
|
2100
|
| 1355-D |
Game With Array
|
constructive algorithms
math
|
1400
|
| 1355-C |
Count Triangles
|
binary search
implementation
math
+1
|
1800
|
| 1355-B |
Young Explorers
|
dp
greedy
sortings
|
1200
|
| 1355-A |
Sequence with Digits
|
brute force
implementation
math
|
1200
|
| 1354-G |
Find a Gift
|
binary search
interactive
probabilities
|
2600
|
| 1354-F |
Summoning Minions
|
constructive algorithms
dp
flows
+3
|
2500
|
| 1354-E |
Graph Coloring
|
dfs and similar
dp
graphs
|
2100
|
| 1354-D |
Multiset
|
binary search
data structures
|
1900
|
| 1354-C2 |
Not So Simple Polygon Embedding
|
binary search
brute force
geometry
+1
|
2000
|
| 1354-C1 |
Simple Polygon Embedding
|
binary search
geometry
math
+1
|
1400
|
| 1354-B |
Ternary String
|
binary search
dp
implementation
+1
|
1200
|
| 1354-A |
Alarm Clock
|
math
|
900
|
| 1353-F |
Decreasing Heights
|
brute force
dp
|
2200
|
| 1353-E |
K-periodic Garland
|
brute force
dp
greedy
|
1900
|
| 1353-D |
Constructing the Array
|
constructive algorithms
data structures
sortings
|
1600
|
| 1353-C |
Board Moves
|
math
|
1000
|
| 1353-B |
Two Arrays And Swaps
|
greedy
sortings
|
800
|
| 1353-A |
Most Unstable Array
|
constructive algorithms
greedy
math
|
800
|
| 1352-G |
Special Permutation
|
constructive algorithms
|
1600
|
| 1352-F |
Binary String Reconstruction
|
constructive algorithms
dfs and similar
math
|
1500
|
| 1352-E |
Special Elements
|
brute force
implementation
two pointers
|
1500
|
| 1352-D |
Alice, Bob and Candies
|
implementation
|
1300
|
| 1352-C |
K-th Not Divisible by n
|
binary search
math
|
1200
|
| 1352-B |
Same Parity Summands
|
constructive algorithms
math
|
1200
|
| 1352-A |
Sum of Round Numbers
|
implementation
math
|
800
|
| 1351-C |
Skier
|
data structures
implementation
|
1400
|
| 1351-B |
Square?
|
brute force
implementation
math
|
900
|
| 1351-A |
A+B (Trial Problem)
|
implementation
|
800
|
| 1350-B |
Orac and Models
|
dp
math
number theory
|
1400
|
| 1350-A |
Orac and Factors
|
math
|
900
|
| 1349-F2 |
Slime and Sequences (Hard Version)
|
dp
fft
math
|
3500
|
| 1349-F1 |
Slime and Sequences (Easy Version)
|
dp
fft
math
|
3100
|
| 1349-E |
Slime and Hats
|
constructive algorithms
dp
greedy
|
3500
|
| 1349-D |
Slime and Biscuits
|
math
probabilities
|
3200
|
| 1349-C |
Orac and Game of Life
|
dfs and similar
graphs
implementation
+1
|
2000
|
| 1349-B |
Orac and Medians
|
constructive algorithms
greedy
math
|
2000
|
| 1349-A |
Orac and LCM
|
data structures
math
number theory
|
1600
|
| 1348-F |
Phoenix and Memory
|
data structures
dfs and similar
graphs
+1
|
2600
|
| 1348-E |
Phoenix and Berries
|
brute force
dp
greedy
+1
|
2400
|
| 1348-D |
Phoenix and Science
|
binary search
constructive algorithms
greedy
+2
|
1900
|
| 1348-C |
Phoenix and Distribution
|
constructive algorithms
greedy
sortings
+1
|
1600
|
| 1348-B |
Phoenix and Beauty
|
constructive algorithms
data structures
greedy
+1
|
1400
|