| 2013-B |
Battle for Survive
|
constructive algorithms
greedy
math
|
900
|
| 2013-A |
Zhan's Blender
|
constructive algorithms
math
|
800
|
| 2011-I |
Stack and Queue
|
*special
data structures
divide and conquer
|
—
|
| 2011-H |
Strange Matrix
|
*special
graphs
greedy
|
—
|
| 2011-G |
Removal of a Permutation
|
*special
|
—
|
| 2011-F |
Good Subarray
|
*special
data structures
greedy
|
—
|
| 2011-E |
Rock-Paper-Scissors Bot
|
*special
greedy
strings
|
—
|
| 2011-D |
Among Wolves
|
*special
|
—
|
| 2011-C |
Split the Expression
|
*special
|
—
|
| 2011-B |
Shuffle
|
*special
|
—
|
| 2011-A |
Problem Solving
|
*special
|
—
|
| 2010-C2 |
Message Transmission Error (hard version)
|
hashing
string suffix structures
strings
+1
|
1700
|
| 2010-C1 |
Message Transmission Error (easy version)
|
brute force
strings
|
1400
|
| 2010-B |
Three Brothers
|
brute force
implementation
math
|
800
|
| 2010-A |
Alternating Sum of Numbers
|
brute force
implementation
math
|
800
|
| 2009-G3 |
Yunli's Subarray Queries (extreme version)
|
data structures
dp
implementation
|
2700
|
| 2009-G2 |
Yunli's Subarray Queries (hard version)
|
binary search
data structures
dp
|
2200
|
| 2009-G1 |
Yunli's Subarray Queries (easy version)
|
binary search
data structures
two pointers
|
1900
|
| 2009-F |
Firefly's Queries
|
bitmasks
data structures
flows
+1
|
1700
|
| 2009-E |
Klee's SUPER DUPER LARGE Array!!!
|
binary search
math
ternary search
|
1400
|
| 2009-D |
Satyam and Counting
|
geometry
math
|
1400
|
| 2009-C |
The Legend of Freya the Frog
|
implementation
math
|
1100
|
| 2009-B |
osu!mania
|
brute force
implementation
|
800
|
| 2009-A |
Minimize!
|
brute force
math
|
800
|
| 2008-H |
Sakurako's Test
|
binary search
brute force
greedy
+2
|
2100
|
| 2008-G |
Sakurako's Task
|
binary search
greedy
math
+1
|
1800
|
| 2008-F |
Sakurako's Box
|
combinatorics
math
number theory
|
1400
|
| 2008-E |
Alternating String
|
brute force
data structures
dp
+3
|
1500
|
| 2008-D |
Sakurako's Hobby
|
dp
dsu
graphs
+1
|
1100
|
| 2008-C |
Longest Good Array
|
binary search
brute force
math
|
800
|
| 2008-B |
Square or Not
|
brute force
math
strings
|
800
|
| 2008-A |
Sakurako's Exam
|
brute force
constructive algorithms
greedy
+1
|
800
|
| 2007-C |
Dora and C++
|
math
number theory
|
1500
|
| 2007-B |
Index and Maximum Value
|
data structures
greedy
|
900
|
| 2007-A |
Dora's Set
|
greedy
math
number theory
|
800
|
| 2006-F |
Dora's Paint
|
brute force
combinatorics
constructive algorithms
+2
|
3500
|
| 2006-E |
Iris's Full Binary Tree
|
brute force
data structures
dfs and similar
+1
|
3100
|
| 2006-D |
Iris and Adjacent Products
|
data structures
greedy
implementation
+1
|
2600
|
| 2006-C |
Eri and Expanded Sets
|
data structures
divide and conquer
math
+2
|
2300
|
| 2006-B |
Iris and the Tree
|
brute force
data structures
dfs and similar
+3
|
1800
|
| 2006-A |
Iris and Game on the Tree
|
constructive algorithms
dfs and similar
games
+3
|
1700
|
| 2005-E2 |
Subtangle Game (Hard Version)
|
data structures
dp
games
+2
|
2500
|
| 2005-E1 |
Subtangle Game (Easy Version)
|
dp
games
greedy
+1
|
2100
|
| 2005-D |
Alter the GCD
|
binary search
brute force
data structures
+3
|
2400
|
| 2005-C |
Lazy Narek
|
dp
implementation
strings
|
1800
|
| 2005-B2 |
The Strict Teacher (Hard Version)
|
binary search
greedy
math
+1
|
1200
|
| 2005-B1 |
The Strict Teacher (Easy Version)
|
greedy
math
sortings
|
1000
|
| 2005-A |
Simple Palindrome
|
combinatorics
constructive algorithms
greedy
+1
|
900
|
| 2004-G |
Substring Compression
|
data structures
dp
matrices
|
3200
|
| 2004-F |
Make a Palindrome
|
binary search
brute force
data structures
+2
|
2600
|