| 2004-E |
Not a Nim Problem
|
brute force
games
math
+1
|
2100
|
| 2004-D |
Colored Portals
|
binary search
brute force
data structures
+4
|
1600
|
| 2004-C |
Splitting Items
|
games
greedy
sortings
|
1100
|
| 2004-B |
Game with Doors
|
brute force
greedy
|
1000
|
| 2004-A |
Closest Point
|
implementation
math
|
800
|
| 2003-F |
Turtle and Three Sequences
|
brute force
data structures
dp
+4
|
2800
|
| 2003-E2 |
Turtle and Inversions (Hard Version)
|
brute force
data structures
divide and conquer
+4
|
2700
|
| 2003-E1 |
Turtle and Inversions (Easy Version)
|
brute force
divide and conquer
dp
+2
|
2600
|
| 2003-D2 |
Turtle and a MEX Problem (Hard Version)
|
dfs and similar
dp
graphs
+3
|
2100
|
| 2003-D1 |
Turtle and a MEX Problem (Easy Version)
|
greedy
math
|
1500
|
| 2003-C |
Turtle and Good Pairs
|
constructive algorithms
greedy
sortings
+1
|
1200
|
| 2003-B |
Turtle and Piggy Are Playing a Game 2
|
games
greedy
sortings
|
800
|
| 2003-A |
Turtle and Good Strings
|
greedy
strings
|
800
|
| 2002-H |
Counting 101
|
greedy
|
3500
|
| 2002-G |
Lattice Optimizing
|
bitmasks
brute force
hashing
+1
|
3400
|
| 2002-F2 |
Court Blue (Hard Version)
|
brute force
dp
math
+1
|
2800
|
| 2002-F1 |
Court Blue (Easy Version)
|
brute force
dfs and similar
dp
+2
|
2600
|
| 2002-E |
Cosmic Rays
|
brute force
data structures
dp
|
2300
|
| 2002-D2 |
DFS Checker (Hard Version)
|
binary search
data structures
dfs and similar
+3
|
2300
|
| 2002-D1 |
DFS Checker (Easy Version)
|
brute force
data structures
dfs and similar
+3
|
1900
|
| 2002-C |
Black Circles
|
brute force
geometry
greedy
+1
|
1200
|
| 2002-B |
Removals Game
|
constructive algorithms
games
|
1000
|
| 2002-A |
Distanced Coloring
|
constructive algorithms
implementation
math
|
800
|
| 2001-E2 |
Deterministic Heap (Hard Version)
|
combinatorics
dp
trees
|
2900
|
| 2001-E1 |
Deterministic Heap (Easy Version)
|
combinatorics
dp
math
+1
|
2400
|
| 2001-D |
Longest Max Min Subsequence
|
brute force
constructive algorithms
data structures
+2
|
1900
|
| 2001-C |
Guess The Tree
|
binary search
brute force
dfs and similar
+5
|
1500
|
| 2001-B |
Generate Permutation
|
constructive algorithms
|
800
|
| 2001-A |
Make All Equal
|
greedy
implementation
|
800
|
| 2000-H |
Ksyusha and the Loaded Set
|
binary search
brute force
data structures
+1
|
2200
|
| 2000-G |
Call During the Journey
|
binary search
brute force
graphs
+2
|
2100
|
| 2000-F |
Color Rows and Columns
|
dp
greedy
implementation
+1
|
1900
|
| 2000-E |
Photoshoot for Gorillas
|
combinatorics
data structures
greedy
+1
|
1400
|
| 2000-D |
Right Left Wrong
|
greedy
implementation
two pointers
|
1200
|
| 2000-C |
Numeric String Template
|
data structures
strings
|
1000
|
| 2000-B |
Seating in a Bus
|
two pointers
|
800
|
| 2000-A |
Primary Task
|
implementation
math
strings
|
800
|
| 1999-G2 |
Ruler (hard version)
|
binary search
interactive
ternary search
|
1700
|
| 1999-G1 |
Ruler (easy version)
|
binary search
interactive
|
1500
|
| 1999-F |
Expected Median
|
combinatorics
math
|
1500
|
| 1999-E |
Triple Operations
|
dp
implementation
math
|
1300
|
| 1999-D |
Slavic's Exam
|
greedy
implementation
strings
|
1100
|
| 1999-C |
Showering
|
greedy
implementation
|
800
|
| 1999-B |
Card Game
|
brute force
constructive algorithms
implementation
|
1000
|
| 1999-A |
A+B Again?
|
implementation
math
|
800
|
| 1998-E2 |
Eliminating Balls With Merging (Hard Version)
|
binary search
brute force
data structures
+3
|
2500
|
| 1998-E1 |
Eliminating Balls With Merging (Easy Version)
|
binary search
brute force
data structures
+2
|
2200
|
| 1998-D |
Determine Winning Islands in Race
|
data structures
dp
graphs
+2
|
2100
|
| 1998-C |
Perform Operations to Maximize Score
|
binary search
brute force
constructive algorithms
+2
|
1900
|
| 1998-B |
Minimize Equal Sum Subarrays
|
constructive algorithms
math
number theory
|
1000
|