|
ID
|
Origin
|
Title
| ||
|---|---|---|---|---|
| 0 / 5 | Problem A | HDU 4116 | Fruit Ninja | |
| 3 / 10 | Problem B | HDU 4127 | Flood-it! | |
| Problem C | HDU 4130 | Shadow | ||
 |
33 / 61 | Problem D | HDU 4161 | Iterated Difference |
|
15 / 35 | Problem E | HDU 4162 | Shape Number |
|
32 / 39 | Problem F | HDU 4165 | Pills |
| 2 / 25 | Problem G | HDU 4166 | Robot Navigation | |
|
17 / 49 | Problem H | HDU 4167 | User Names |
| 4 / 25 | Problem I | HDU 4169 | Wealthy Family | |
|
20 / 90 | Problem J | HDU 4173 | Party Location |
D题模拟
E题后来做的，字符串最小表示法 O(n)
F题组合数学
H题 字典树模拟
J题计算几何 给你平面上N个点，求半径为2.5的圆能够包含的最多的点。
原文：http://www.cnblogs.com/macinchang/p/4677460.html