c++编程基础
| ·UVa 568 阶乘 (2014-11-24) |
| ·POJ 2886 Who Gets the Most Candies? (高合成数&用线段树维护约瑟.. (2014-11-24) |
| ·UVaOJ-674 Coin Change (完全背包) (2014-11-24) |
| ·POJ 1014 Dividing 这算是优化吗 (2014-11-24) |
| ·hdu 1166 敌兵布阵 线段树（单点更新） (2014-11-24) |
| ·二叉树中节点的最大的距离（编程之美3.8） (2014-11-24) |
| ·Leetcode Distinct Subsequences 动态规划法活用总结 (2014-11-24) |
| ·九度OJ 1442 A sequence of numbers (2014-11-24) |
| ·hdu 3903 Trigonometric Function (2014-11-24) |
| ·CodeForce 393A Nineteen (2014-11-24) |
| ·LeetCode | Palindrome Partitioning II (2014-11-24) |
| ·POJ 2186 Popular Cows / 强连通分量 (2014-11-24) |
| ·hdu 1297 Children’s Queue (2014-11-24) |
| ·hdu 4284 floyd+暴搜 (2014-11-24) |
| ·HDU 3292 No more tricks, Mr Nanguo 矩阵快速幂求佩尔方程第k大的解 (2014-11-24) |
| ·poj 2486 Apple Tree (树形dp) (2014-11-24) |
| ·zoj 1102 Phylogenetic Trees Inherited (2014-11-24) |
| ·uva 11825 - Hackers' Crackdown(dp+子集枚举） (2014-11-24) |
| ·POJ 3352 Road Construction / 边双连通分量 (2014-11-24) |
| ·九度OJ 1410 垒积木 -- 动态规划 (2014-11-24) |
