|
|
A |
Aizu ALDS1_10_A
|
Fibonacci Number
|
|
|
B |
Aizu ALDS1_10_B
|
Matrix Chain Multiplication
|
|
|
C |
Aizu CGL_1_B
|
Reflection
|
|
|
D |
Aizu ALDS1_10_C
|
Longest Common Subsequence
|
|
|
E |
UVA 10282
|
Babelfish
|
|
|
F |
LightOJ 1122
|
Digit Count
|
|
|
G |
Aizu ALDS1_10_D
|
Optimal Binary Search Tree
|
|
|
H |
Aizu DPL_1_A
|
Coin Changing Problem
|
|
|
I |
Aizu DPL_1_B
|
0-1 Knapsack Problem
|
|
|
J |
Aizu DPL_1_C
|
Knapsack Problem
|
|
|
K |
LightOJ 1032
|
Fast Bit Calculations
|
|
|
L |
Aizu CGL_1_C
|
Counter-Clockwise
|
|
|
M |
Aizu DPL_1_D
|
Longest Increasing Subsequence
|
|
|
N |
SPOJ NHAY
|
A Needle in the Haystack
|
|
|
O |
Aizu DPL_1_E
|
Edit Distance (Levenshtein Distance)
|
|
|
P |
SPOJ GONE
|
G-One Numbers
|
|
|
Q |
SPOJ ACMCEG2B
|
FIGUREFUL
|
|
|
R |
Aizu DPL_1_F
|
0-1 Knapsack Problem II
|
|
|
S |
Aizu DPL_1_G
|
Knapsack Problem with Limitations
|
|
|
T |
Aizu DPL_1_H
|
Huge Knapsack Problem
|
|
|
U |
Aizu DPL_1_I
|
Knapsack Problem with Limitations II
|
|
|
V |
LightOJ 1068
|
Investigation
|
|
|
W |
Aizu CGL_1_A
|
Projection
|
|
|
X |
CodeForces 514C
|
Watto and Mechanism
|