| 1553-F |
Pairwise Modulo
|
data structures
math
|
2300
|
| 1553-E |
Permutation Shift
|
brute force
combinatorics
constructive algorithms
+4
|
2100
|
| 1553-D |
Backspace
|
dp
greedy
strings
+1
|
1500
|
| 1553-C |
Penalty
|
bitmasks
brute force
dp
+1
|
1200
|
| 1553-B |
Reverse String
|
brute force
dp
hashing
+2
|
1300
|
| 1553-A |
Digits Sum
|
math
number theory
|
800
|
| 1552-I |
Organizing a Music Festival
|
dfs and similar
math
|
3400
|
| 1552-H |
Guess the Perimeter
|
binary search
interactive
number theory
|
3300
|
| 1552-G |
A Serious Referee
|
bitmasks
brute force
dfs and similar
+1
|
3000
|
| 1552-F |
Telepanting
|
binary search
data structures
dp
+1
|
2200
|
| 1552-E |
Colors and Intervals
|
constructive algorithms
data structures
greedy
+1
|
2300
|
| 1552-D |
Array Differentiation
|
bitmasks
brute force
constructive algorithms
+4
|
1800
|
| 1552-C |
Maximize the Intersections
|
combinatorics
constructive algorithms
geometry
+2
|
1800
|
| 1552-B |
Running for Gold
|
combinatorics
graphs
greedy
+1
|
1500
|
| 1552-A |
Subsequence Permutation
|
sortings
strings
|
800
|
| 1551-F |
Equidistant Vertices
|
brute force
combinatorics
dfs and similar
+2
|
2200
|
| 1551-E |
Fixed Points
|
binary search
brute force
dp
|
2000
|
| 1551-D2 |
Domino (hard version)
|
constructive algorithms
implementation
math
|
2100
|
| 1551-D1 |
Domino (easy version)
|
constructive algorithms
math
|
1700
|
| 1551-C |
Interesting Story
|
greedy
sortings
strings
|
1500
|
| 1551-B2 |
Wonderful Coloring - 2
|
binary search
constructive algorithms
data structures
+1
|
1400
|
| 1551-B1 |
Wonderful Coloring - 1
|
greedy
strings
|
800
|
| 1551-A |
Polycarp and Coins
|
greedy
math
|
800
|
| 1550-F |
Jumping Around
|
binary search
data structures
divide and conquer
+4
|
2700
|
| 1550-E |
Stringforces
|
binary search
bitmasks
brute force
+3
|
2500
|
| 1550-D |
Excellent Arrays
|
binary search
combinatorics
constructive algorithms
+4
|
2300
|
| 1550-C |
Manhattan Subarrays
|
brute force
geometry
greedy
+1
|
1700
|
| 1550-B |
Maximum Cost Deletion
|
greedy
math
|
1000
|
| 1550-A |
Find The Array
|
greedy
math
|
800
|
| 1549-B |
Gregor and the Pawn Game
|
dfs and similar
dp
flows
+4
|
800
|
| 1549-A |
Gregor and Cryptography
|
math
number theory
|
800
|
| 1548-E |
Gregor and the Two Painters
|
data structures
divide and conquer
graphs
+2
|
3400
|
| 1548-D2 |
Gregor and the Odd Cows (Hard)
|
brute force
geometry
math
+1
|
3300
|
| 1548-D1 |
Gregor and the Odd Cows (Easy)
|
bitmasks
geometry
math
+1
|
2300
|
| 1548-C |
The Three Little Pigs
|
combinatorics
dp
fft
+1
|
2500
|
| 1548-B |
Integers Have Friends
|
binary search
data structures
divide and conquer
+3
|
1800
|
| 1548-A |
Web of Lies
|
brute force
graphs
greedy
|
1400
|
| 1547-G |
How Many Paths?
|
dfs and similar
dp
graphs
+1
|
2100
|
| 1547-F |
Array Stabilization (GCD version)
|
binary search
brute force
data structures
+3
|
1900
|
| 1547-E |
Air Conditioners
|
data structures
dp
implementation
+3
|
1500
|
| 1547-D |
Co-growing Sequence
|
bitmasks
constructive algorithms
greedy
|
1300
|
| 1547-C |
Pair Programming
|
greedy
two pointers
|
1100
|
| 1547-B |
Alphabetical Strings
|
greedy
implementation
strings
|
800
|
| 1547-A |
Shortest Path with Obstacle
|
implementation
math
|
800
|
| 1546-B |
AquaMoon and Stolen String
|
interactive
math
|
1200
|
| 1546-A |
AquaMoon and Two Arrays
|
brute force
greedy
|
800
|
| 1545-F |
AquaMoon and Potatoes
|
brute force
data structures
dp
|
3500
|
| 1545-E2 |
AquaMoon and Time Stop (hard version)
|
data structures
dp
|
3500
|
| 1545-E1 |
AquaMoon and Time Stop (easy version)
|
data structures
dp
|
3500
|
| 1545-D |
AquaMoon and Wrong Coordinate
|
constructive algorithms
interactive
math
|
3000
|