AOJ

ALDS1_1_A: Insertion Sort
ALDS1_1_B: Greatest Common Divisor
ALDS1_1_C: Prime Numbers
ALDS1_1_D: Maximum Profit

ALDS1_2_A: Bubble Sort
ALDS1_2_B: Selection Sort
ALDS1_2_C: Stable Sort
ALDS1_2_D: Shell Sort

ALDS1_3_A: Stack
ALDS1_3_B: Queue
ALDS1_3_C: Doubly Linked List
ALDS1_3_D: Areas on the Cross-Section Diagram

ALDS1_4_A: Linear Search
ALDS1_4_B: Binary Search
ALDS1_4_C: Dictionary
ALDS1_4_D: Allocation

ALDS1_5_A: Exhaustive Search
ALDS1_5_B: Merge Sort
ALDS1_5_D: The Number of Inversions

ALDS1_6_A: Counting Sort
ALDS1_6_B: Partition
ALDS1_6_C: Quick Sort
ALDS1_6_D: Minimum Cost Sort

ALDS1_7_A: Rooted Trees
ALDS1_7_B: Binary Tree
ALDS1_7_C: Tree Walk
ALDS1_7_D: Reconstruction of the Tree

ALDS1_8_A: Binary Search Tree I
ALDS1_8_B: Binary Search Tree II
ALDS1_8_C: Binary Search Tree III

ALDS1_9_A: Complete Binary Tree
ALDS1_9_B: Maximum Heap
ALDS1_9_C: Priority Queue

ALDS1_10_A: Fibonacci Number
ALDS1_10_B: Matrix Chain Multiplication
ALDS1_10_C: Longest Common Subsequence

ALDS1_11_A: Graph
ALDS1_11_B: Depth First Search
ALDS1_11_C: Breadth First Search
ALDS1_11_D: Connected Components

ALDS1_12_A: Minimum Spanning Tree
ALDS1_12_B: Single Source Shortest Path I
ALDS1_12_C: Single Source Shortest Path II

ALDS1_13_A: 8 Queens Problem
ALDS1_13_B: 8 Puzzle
ALDS1_13_C: 15 Puzzle

DSL_1_A: Disjoint Set: Union Find Tree

DSL_2_A: Range Minimum Query
DSL_2_B: Range Sum Query
DSL_2_C: Range Search (kD Tree)
DSL_2_D: Range Update Query (RUQ)
DSL_2_E: Range Add Query (RAQ)
DSL_2_F: RMQ and RUQ
DSL_2_G: RSQ and RAQ
DSL_2_H: RMQ and RAQ
DSL_2_I: RSQ and RUQ
DSL_3_D: Sliding Minimum Elements

GRL_1_B: Single Source Shortest Path (Negative Edges)
GRL_1_C: All Pairs Shortest Path

GRL_2_A: Minimum Spanning Tree
GRL_2_B: Minimum-Cost Arborescence

GRL_3_A: Articulation Point
GRL_3_B: Bridge
GRL_3_C: Strongly Connected Components

GRL_4_B: Topological Sort

GRL_5_A: Diameter of a Tree

GRL_6_A: Maximum Flow
GRL_6_B: Minimum Cost Flow

GRL_7_A: Bipartite Matching

CGL_1_A: Projection
CGL_1_B: Reflection
CGL_1_C: Counter-Clockwise

CGL_2_A: Parallel/Orthogonal
CGL_2_B: Intersection
CGL_2_C: Cross Point
CGL_2_D: Distance

CGL_3_C: Polygon-Point Containment

CGL_4_A: Convex Hullt

CGL_6_A: Segment Intersections: Manhattan Geometry

CGL_7_D: Cross Points of a Circle and a Line
CGL_7_E: Cross Points of Circles

DPL_1_A: Coin Changing Problem
DPL_1_B: 0-1 Knapsack Problem
DPL_1_C: Knapsack Problem
DPL_1_D: Longest Increasing Subsequence
DPL_1_E: Edit Distance (Levenshtein Distance)

DPL_2_A: Traveling Salesman Problem

DPL_3_A: Largest Square
DPL_3_B: Largest Rectangle

DPL_5_A: Balls and Boxes 1
DPL_5_B: Balls and Boxes 2
DPL_5_C: Balls and Boxes 3
DPL_5_D: Balls and Boxes 4
DPL_5_E: Balls and Boxes 5
DPL_5_F: Balls and Boxes 6
DPL_5_G: Balls and Boxes 7
DPL_5_H: Balls and Boxes 8
DPL_5_I: Balls and Boxes 9
DPL_5_J: Balls and Boxes 10
DPL_5_K: Balls and Boxes 11
DPL_5_L: Balls and Boxes 12

NTL_1_A: Prime Factorize
NTL_1_B: Power
NTL_1_C: Least Common Multiple
NTL_1_D: Euler's Phi Function

0507 Square
0529 ダーツ
0539 ピザ
0558 チーズ (Cheese)
0561 古本屋 (Books)
1163 カードゲーム
1173 世界の天秤
1196 橋の撤去
1549 Hard Beans
1595 Traffic Tree
1611 ダルマ落とし
2272 蝉
2431 引越し
2895 回文部分列 (Palindromic Subsequences)