| 1957-F2 |
Frequency Mismatch (Hard Version)
|
binary search
data structures
dfs and similar
+3
|
2700
|
| 1957-F1 |
Frequency Mismatch (Easy Version)
|
binary search
data structures
divide and conquer
+3
|
2600
|
| 1957-E |
Carousel of Combinations
|
brute force
combinatorics
dp
+2
|
2400
|
| 1957-D |
A BIT of an Inequality
|
bitmasks
brute force
dp
+1
|
1900
|
| 1957-C |
How Does the Rook Move?
|
combinatorics
dp
math
|
1600
|
| 1957-B |
A BIT of a Construction
|
bitmasks
constructive algorithms
greedy
+1
|
1100
|
| 1957-A |
Stickogon
|
constructive algorithms
greedy
|
800
|
| 1956-F |
Nene and the Passing Game
|
constructive algorithms
data structures
dsu
+2
|
3000
|
| 1956-E2 |
Nene vs. Monsters (Hard Version)
|
brute force
greedy
implementation
+1
|
2700
|
| 1956-E1 |
Nene vs. Monsters (Easy Version)
|
brute force
implementation
math
|
2500
|
| 1956-D |
Nene and the Mex Operator
|
bitmasks
brute force
constructive algorithms
+5
|
2000
|
| 1956-C |
Nene's Magical Matrix
|
constructive algorithms
greedy
math
|
1600
|
| 1956-B |
Nene and the Card Game
|
games
greedy
|
800
|
| 1956-A |
Nene's Game
|
binary search
brute force
data structures
+2
|
800
|
| 1955-H |
The Most Reckless Defense
|
bitmasks
brute force
constructive algorithms
+4
|
2300
|
| 1955-G |
GCD on a grid
|
brute force
dfs and similar
dp
+3
|
1900
|
| 1955-F |
Unfair Game
|
dp
games
greedy
+2
|
1800
|
| 1955-E |
Long Inversions
|
brute force
greedy
implementation
+1
|
1700
|
| 1955-D |
Inaccurate Subsequence Search
|
data structures
two pointers
|
1400
|
| 1955-C |
Inhabitant of the Deep Sea
|
greedy
implementation
math
|
1300
|
| 1955-B |
Progressive Square
|
constructive algorithms
data structures
implementation
+1
|
1000
|
| 1955-A |
Yogurt Sale
|
math
|
800
|
| 1954-F |
Unique Strings
|
combinatorics
dp
math
|
3100
|
| 1954-E |
Chain Reaction
|
binary search
data structures
dsu
+4
|
2200
|
| 1954-D |
Colored Balls
|
combinatorics
dp
math
+1
|
1800
|
| 1954-C |
Long Multiplication
|
greedy
math
number theory
|
1200
|
| 1954-B |
Make It Ugly
|
implementation
math
|
1200
|
| 1954-A |
Painting the Ribbon
|
constructive algorithms
greedy
math
|
900
|
| 1953-A |
Accuracy-Preserving Summation Algorithm
|
*special
|
—
|
| 1952-J |
Help, what does it mean to be "Based"
|
*special
brute force
constructive algorithms
+3
|
—
|
| 1952-I |
Dark Matter
|
*special
bitmasks
geometry
|
—
|
| 1952-H |
Palindrome
|
*special
implementation
strings
|
—
|
| 1952-G |
Mathematician Takeover
|
*special
binary search
dfs and similar
+1
|
—
|
| 1952-F |
Grid
|
*special
brute force
|
—
|
| 1952-E |
Sweep Line
|
*special
combinatorics
games
+1
|
—
|
| 1952-D |
Are You a Procrastinator?
|
*special
implementation
|
—
|
| 1952-C |
They Have Fooled
|
*special
brute force
schedules
|
—
|
| 1952-B |
Is it stated?
|
*special
strings
|
—
|
| 1952-A |
Are You a Robot, Again?
|
*special
strings
|
—
|
| 1951-I |
Growing Trees
|
binary search
constructive algorithms
flows
+2
|
3200
|
| 1951-H |
Thanos Snap
|
binary search
dp
games
+2
|
3200
|
| 1951-G |
Clacking Balls
|
combinatorics
math
probabilities
|
3100
|
| 1951-F |
Inversion Composition
|
constructive algorithms
data structures
greedy
|
2500
|
| 1951-E |
No Palindromes
|
brute force
constructive algorithms
divide and conquer
+5
|
2000
|
| 1951-D |
Buying Jewels
|
constructive algorithms
greedy
math
|
2000
|
| 1951-C |
Ticket Hoarding
|
greedy
math
sortings
|
1400
|
| 1951-B |
Battle Cows
|
binary search
data structures
greedy
|
1200
|
| 1951-A |
Dual Trigger
|
constructive algorithms
greedy
math
|
900
|
| 1950-G |
Shuffling Songs
|
bitmasks
dfs and similar
dp
+4
|
1900
|
| 1950-F |
0, 1, 2, Tree!
|
bitmasks
brute force
greedy
+2
|
1700
|