| 1991-B |
AND Reconstruction
|
bitmasks
constructive algorithms
greedy
|
1100
|
| 1991-A |
Maximize the Last Element
|
greedy
implementation
|
800
|
| 1990-F |
Polygonal Segments
|
brute force
data structures
divide and conquer
+3
|
2800
|
| 1990-E2 |
Catch the Mole(Hard Version)
|
binary search
data structures
dfs and similar
+3
|
2600
|
| 1990-E1 |
Catch the Mole(Easy Version)
|
binary search
data structures
dfs and similar
+2
|
2500
|
| 1990-D |
Grid Puzzle
|
bitmasks
brute force
dp
+2
|
1800
|
| 1990-C |
Mad MAD Sum
|
brute force
greedy
math
|
1500
|
| 1990-B |
Array Craft
|
constructive algorithms
greedy
|
1200
|
| 1990-A |
Submission Bait
|
brute force
games
greedy
+1
|
900
|
| 1989-F |
Simultaneous Coloring
|
dfs and similar
divide and conquer
graphs
|
3000
|
| 1989-E |
Distance to Different
|
combinatorics
dp
math
|
2300
|
| 1989-D |
Smithing Skill
|
brute force
data structures
dp
+4
|
1900
|
| 1989-C |
Two Movies
|
greedy
math
|
1400
|
| 1989-B |
Substring and Subsequence
|
brute force
greedy
strings
|
1200
|
| 1989-A |
Catch the Coin
|
implementation
|
800
|
| 1988-F |
Heartbeat
|
combinatorics
dp
fft
+1
|
3000
|
| 1988-E |
Range Minimum Sum
|
binary search
brute force
data structures
+2
|
2300
|
| 1988-D |
The Omnipotent Monster Killer
|
brute force
dfs and similar
dp
+1
|
2000
|
| 1988-C |
Increasing Sequence with Fixed OR
|
bitmasks
constructive algorithms
greedy
|
1300
|
| 1988-B |
Make Majority
|
greedy
implementation
|
900
|
| 1988-A |
Split the Multiset
|
brute force
greedy
implementation
+1
|
900
|
| 1987-H |
Fumo Temple
|
interactive
|
3500
|
| 1987-G2 |
Spinning Round (Hard Version)
|
divide and conquer
dp
trees
|
3500
|
| 1987-G1 |
Spinning Round (Easy Version)
|
divide and conquer
dp
trees
|
2900
|
| 1987-F2 |
Interesting Problem (Hard Version)
|
dp
|
2600
|
| 1987-F1 |
Interesting Problem (Easy Version)
|
dp
|
2500
|
| 1987-E |
Wonderful Tree!
|
brute force
data structures
dfs and similar
+3
|
2000
|
| 1987-D |
World is Mine
|
dp
games
|
1800
|
| 1987-C |
Basil's Garden
|
dp
greedy
|
1200
|
| 1987-B |
K-Sort
|
greedy
|
1000
|
| 1987-A |
Upload More RAM
|
greedy
math
|
800
|
| 1986-G2 |
Permutation Problem (Hard Version)
|
brute force
data structures
hashing
+2
|
2500
|
| 1986-G1 |
Permutation Problem (Simple Version)
|
binary search
brute force
combinatorics
+3
|
2200
|
| 1986-F |
Non-academic Problem
|
dfs and similar
graphs
trees
|
1900
|
| 1986-E |
Beautiful Array
|
greedy
math
number theory
+1
|
1700
|
| 1986-D |
Mathematical Problem
|
brute force
dp
greedy
+3
|
1400
|
| 1986-C |
Update Queries
|
data structures
greedy
sortings
|
1100
|
| 1986-B |
Matrix Stabilization
|
brute force
data structures
greedy
+1
|
1000
|
| 1986-A |
X Axis
|
brute force
geometry
math
+1
|
800
|
| 1985-H2 |
Maximize the Largest Component (Hard Version)
|
data structures
dfs and similar
dp
+2
|
2200
|
| 1985-H1 |
Maximize the Largest Component (Easy Version)
|
brute force
data structures
dfs and similar
+3
|
1700
|
| 1985-G |
D-Function
|
combinatorics
math
number theory
|
1600
|
| 1985-F |
Final Boss
|
binary search
data structures
|
1500
|
| 1985-E |
Secret Box
|
brute force
combinatorics
math
|
1200
|
| 1985-D |
Manhattan Circle
|
implementation
math
|
900
|
| 1985-C |
Good Prefixes
|
greedy
|
1000
|
| 1985-B |
Maximum Multiple Sum
|
brute force
math
number theory
|
800
|
| 1985-A |
Creating Words
|
implementation
strings
|
800
|
| 1984-H |
Tower Capturing
|
combinatorics
dp
geometry
|
3300
|
| 1984-G |
Magic Trick II
|
constructive algorithms
implementation
sortings
|
3200
|