- 博客(4)
- 资源 (1)
- 收藏
- 关注
RSS订阅原创 HDU 1258 Sum It Up
Problem Description Given a specified total t and a list of n integers, find all distinct sums using numbers from the list that add up to t. For example, if t=4, n=6, and the list is [4,3,2,2,1,1], t...
2015-03-26 21:20:50
489
原创 HDU 2614 Beat
Problem Description Zty is a man that always full of enthusiasm. He wants to solve every kind of difficulty ACM problem in the world. And he has a habit that he does not like to solve a problem that ...
2015-03-25 21:26:52
570
原创 HDU 1501 Zipper （DFS）
Problem Description Given three strings, you are to determine whether the third string can be formed by combining the characters in the first two strings. The first two strings can be mixed arbitrari...
2015-03-25 20:15:15
590
原创 HDU 1520 Anniversary party（DFS或树形DP）
Problem Description There is going to be a party to celebrate the 80-th Anniversary of the Ural State University. The University has a hierarchical structure of employees. It means that the superviso...
2015-03-19 21:34:04
580
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人