| 1998-A |
Find K Distinct Points with Fixed Center
|
constructive algorithms
implementation
math
|
800
|
| 1997-F |
Chips on a Line
|
brute force
combinatorics
dp
+2
|
2700
|
| 1997-E |
Level Up
|
binary search
brute force
data structures
+2
|
2200
|
| 1997-D |
Maximize the Root
|
binary search
dfs and similar
dp
+2
|
1500
|
| 1997-C |
Even Positions
|
constructive algorithms
data structures
greedy
|
1100
|
| 1997-B |
Make Three Regions
|
constructive algorithms
two pointers
|
1100
|
| 1997-A |
Strong Password
|
brute force
implementation
strings
|
800
|
| 1996-G |
Penacony
|
brute force
data structures
graphs
+2
|
2200
|
| 1996-F |
Bomb
|
binary search
greedy
math
|
1900
|
| 1996-E |
Decode
|
combinatorics
data structures
implementation
+1
|
1600
|
| 1996-D |
Fun
|
binary search
brute force
combinatorics
+2
|
1500
|
| 1996-C |
Sort
|
dp
greedy
sortings
+1
|
1200
|
| 1996-B |
Scale
|
greedy
implementation
|
800
|
| 1996-A |
Legs
|
binary search
math
ternary search
|
800
|
| 1995-E2 |
Let Me Teach You a Lesson (Hard Version)
|
data structures
dp
matrices
+1
|
2900
|
| 1995-E1 |
Let Me Teach You a Lesson (Easy Version)
|
2-sat
data structures
dp
+2
|
2700
|
| 1995-D |
Cases
|
bitmasks
brute force
dp
+1
|
2300
|
| 1995-C |
Squaring
|
brute force
constructive algorithms
greedy
+3
|
1800
|
| 1995-B2 |
Bouquet (Hard Version)
|
binary search
data structures
greedy
+3
|
1700
|
| 1995-B1 |
Bouquet (Easy Version)
|
binary search
brute force
greedy
+2
|
1100
|
| 1995-A |
Diagonals
|
brute force
greedy
implementation
+1
|
800
|
| 1994-H |
Fortnite
|
combinatorics
constructive algorithms
games
+6
|
3500
|
| 1994-G |
Minecraft
|
bitmasks
brute force
dp
+2
|
2600
|
| 1994-F |
Stardew Valley
|
constructive algorithms
dfs and similar
graphs
+1
|
2500
|
| 1994-E |
Wooden Game
|
bitmasks
greedy
math
+1
|
2000
|
| 1994-D |
Funny Game
|
constructive algorithms
dsu
graphs
+4
|
1900
|
| 1994-C |
Hungry Games
|
binary search
dp
two pointers
|
1600
|
| 1994-B |
Fun Game
|
bitmasks
constructive algorithms
greedy
+1
|
1100
|
| 1994-A |
Diverse Game
|
constructive algorithms
greedy
implementation
|
800
|
| 1993-F2 |
Dyn-scripted Robot (Hard Version)
|
chinese remainder theorem
math
number theory
|
2800
|
| 1993-F1 |
Dyn-scripted Robot (Easy Version)
|
brute force
chinese remainder theorem
constructive algorithms
+2
|
2400
|
| 1993-E |
Xor-Grid Problem
|
bitmasks
constructive algorithms
dp
+1
|
2700
|
| 1993-D |
Med-imize
|
binary search
dp
greedy
|
2200
|
| 1993-C |
Light Switches
|
implementation
math
|
1400
|
| 1993-B |
Parity and Sum
|
constructive algorithms
greedy
|
1100
|
| 1993-A |
Question Marks
|
greedy
implementation
|
800
|
| 1992-G |
Ultra-Meow
|
combinatorics
dp
math
|
2000
|
| 1992-F |
Valuable Cards
|
brute force
dp
greedy
+2
|
1900
|
| 1992-E |
Novice's Mistake
|
brute force
constructive algorithms
implementation
+2
|
1700
|
| 1992-D |
Test of Love
|
dp
greedy
implementation
|
1200
|
| 1992-C |
Gorilla and Permutation
|
constructive algorithms
math
|
900
|
| 1992-B |
Angry Monk
|
greedy
math
sortings
|
800
|
| 1992-A |
Only Pluses
|
brute force
constructive algorithms
greedy
+2
|
800
|
| 1991-I |
Grid Game
|
constructive algorithms
games
graph matchings
+2
|
3500
|
| 1991-H |
Prime Split Game
|
bitmasks
dp
fft
+3
|
3300
|
| 1991-G |
Grid Reset
|
constructive algorithms
greedy
implementation
|
2700
|
| 1991-F |
Triangle Formation
|
brute force
greedy
implementation
+2
|
2200
|
| 1991-E |
Coloring Game
|
constructive algorithms
dfs and similar
games
+3
|
1900
|
| 1991-D |
Prime XOR Coloring
|
bitmasks
constructive algorithms
graphs
+3
|
1900
|
| 1991-C |
Absolute Zero
|
constructive algorithms
greedy
math
|
1300
|