| 1728-G |
Illumination
|
binary search
bitmasks
brute force
+4
|
2700
|
| 1728-F |
Fishermen
|
flows
graph matchings
greedy
|
3100
|
| 1728-E |
Red-Black Pepper
|
brute force
data structures
greedy
+2
|
2300
|
| 1728-D |
Letter Picking
|
constructive algorithms
dp
games
+1
|
1800
|
| 1728-C |
Digital Logarithm
|
data structures
greedy
sortings
|
1400
|
| 1728-B |
Best Permutation
|
constructive algorithms
greedy
|
800
|
| 1728-A |
Colored Balls: Revisited
|
brute force
greedy
implementation
+1
|
800
|
| 1726-H |
Mainak and the Bleeding Polygon
|
binary search
geometry
implementation
+1
|
3500
|
| 1726-G |
A Certain Magical Party
|
combinatorics
data structures
greedy
+1
|
3300
|
| 1726-E |
Almost Perfect
|
combinatorics
fft
math
|
2400
|
| 1726-D |
Edge Split
|
brute force
constructive algorithms
dfs and similar
+4
|
2000
|
| 1726-C |
Jatayu's Balanced Bracket Sequence
|
data structures
dsu
graphs
+1
|
1300
|
| 1726-B |
Mainak and Interesting Sequence
|
bitmasks
constructive algorithms
math
|
1100
|
| 1726-A |
Mainak and Array
|
greedy
math
|
900
|
| 1725-M |
Moving Both Hands
|
dp
graphs
shortest paths
|
1800
|
| 1725-L |
Lemper Cooking Competition
|
data structures
|
2400
|
| 1725-K |
Kingdom of Criticism
|
data structures
dsu
|
2500
|
| 1725-J |
Journey
|
dp
trees
|
2500
|
| 1725-I |
Imitating the Key Tree
|
combinatorics
dsu
trees
|
2800
|
| 1725-H |
Hot Black Hot White
|
constructive algorithms
math
|
1800
|
| 1725-G |
Garage
|
binary search
geometry
math
|
1500
|
| 1725-F |
Field Photography
|
bitmasks
data structures
sortings
|
2100
|
| 1725-E |
Electrical Efficiency
|
combinatorics
data structures
dp
+3
|
2500
|
| 1725-D |
Deducing Sortability
|
binary search
bitmasks
math
|
2900
|
| 1725-C |
Circular Mirror
|
binary search
combinatorics
geometry
+2
|
2000
|
| 1725-B |
Basketball Together
|
binary search
greedy
sortings
|
1000
|
| 1725-A |
Accumulation of Dominoes
|
math
|
800
|
| 1722-G |
Even-Odd XOR
|
bitmasks
constructive algorithms
greedy
|
1500
|
| 1722-F |
L-shapes
|
dfs and similar
implementation
|
1700
|
| 1722-E |
Counting Rectangles
|
brute force
data structures
dp
+1
|
1600
|
| 1722-D |
Line
|
greedy
sortings
|
1100
|
| 1722-C |
Word Game
|
data structures
implementation
|
800
|
| 1722-B |
Colourblindness
|
implementation
|
800
|
| 1722-A |
Spell Check
|
implementation
|
800
|
| 1721-F |
Matching Reduction
|
brute force
constructive algorithms
dfs and similar
+4
|
2800
|
| 1721-E |
Prefix Function Queries
|
dfs and similar
dp
hashing
+3
|
2200
|
| 1721-D |
Maximum AND
|
bitmasks
dfs and similar
divide and conquer
+2
|
1800
|
| 1721-C |
Min-Max Array Transformation
|
binary search
greedy
two pointers
|
1400
|
| 1721-B |
Deadly Laser
|
implementation
|
1000
|
| 1721-A |
Image
|
greedy
implementation
|
800
|
| 1720-E |
Misha and Paintings
|
constructive algorithms
data structures
greedy
+2
|
2700
|
| 1720-D2 |
Xor-Subsequence (hard version)
|
bitmasks
data structures
dp
+2
|
2400
|
| 1720-D1 |
Xor-Subsequence (easy version)
|
bitmasks
brute force
dp
+3
|
1800
|
| 1720-C |
Corners
|
greedy
implementation
|
1200
|
| 1720-B |
Interesting Sum
|
brute force
data structures
greedy
+2
|
800
|
| 1720-A |
Burenka Plays with Fractions
|
math
number theory
|
900
|
| 1719-C |
Fighting Tournament
|
binary search
data structures
implementation
+1
|
1400
|
| 1719-B |
Mathematical Circus
|
constructive algorithms
math
|
800
|
| 1719-A |
Chip Game
|
games
math
|
800
|
| 1718-F |
Burenka, an Array and Queries
|
data structures
math
number theory
|
3300
|