01 - hyperspace （）
02 - building fence （计算几何，求圆和多边形的凸包，网上找的模版）
03 - finding string
04 - Mutiples on a circle (DP，环形数列DP，分类讨论拆环后有两种情况，第一种情况DP处理，第二种情况用区间查找值的优化技巧处理。对于取模的运算法则要清楚，细节注意）
06 - Backup Plan （构造，分两步，第一步考虑没有服务器坏的情况下，每台服务器active的数据库；然后依次考虑某一台服务器坏的之后，原来active的数据库平均分配到其他服务器上，优先选择active数据库少的sever）
10 - GCD of Sequence
Hard:
05 - Cube number on a tree
07 - Present Day,Present Time
08 -
09 -
传送门：
| Solved | Pro.ID | Title | Author | Source | (AC/Submit)Ratio |
| 4666 | Hyperspace |
2013 Multi-University Training Contest 7 |
(183/367)49.86% | ||
| 4667 | Building Fence |
2013 Multi-University Training Contest 7 |
(96/521)18.43% | ||
| 4668 | Finding string |
2013 Multi-University Training Contest 7 |
(24/78)30.77% | ||
| 4669 | Mutiples on a circle |
2013 Multi-University Training Contest 7 |
(107/449)23.83% | ||
| 4670 | Cube number on a tree |
2013 Multi-University Training Contest 7 |
(23/148)15.54% | ||
| 4671 | Backup Plan |
2013 Multi-University Training Contest 7 |
(121/272)44.49% | ||
| 4672 | Present Day, Present Time |
2013 Multi-University Training Contest 7 |
(64/134)47.76% | ||
| 4673 | Pirate's Chest |
2013 Multi-University Training Contest 7 |
(2/15)13.33% | ||
| 4674 | Trip Advisor |
2013 Multi-University Training Contest 7 |
(19/147)12.93% | ||
| 4675 | GCD of Sequence |
2013 Multi-University Training Contest 7 |
(47/162)29.01% |