This problem is not quite difficult (a typical BFS traversal of graph), though, its aceptance rate is relatively low. In fact, the key obstacle in pas...
分类：
其他好文 时间：
2015-06-24 20:52:01
阅读次数：
173
You work in a company which organizes marriages. Marriages are not that easy to be made, so, the job is quite hard for you.The job gets more difficult when people come here and give their bio-data with...
分类：
其他好文 时间：
2015-06-06 12:08:28
阅读次数：
185
/** * ID: 129 * Name: Sum Root to Leaf Numbers * Data Structure: * Time Complexity: * Space Complexity: * Tag: Tree * Difficult: Medium * Algorithm...
分类：
其他好文 时间：
2015-06-04 08:34:32
阅读次数：
108
Buy TicketsTime Limit:4000MSMemory Limit:65536KTotal Submissions:15086Accepted:7530DescriptionRailway tickets were difficult to buy around the Lunar N...
分类：
其他好文 时间：
2015-05-25 16:12:38
阅读次数：
203
题目大意：给你一个奇质数p(p<1000)p(p<1000)，现在有一个集合{1,2,3......2p}\{1,2,3......2p\}，从中选出恰好pp数，使得这些数的和为pp的倍数，要你求出有多少种取法。解题思路：首先我们将其分成两个集合A={1,2,3.......p},B={p+1,p+2........2p}A=\{1,2,3.......p\},B=\{p+1,p+2...........
分类：
其他好文 时间：
2015-05-18 14:47:36
阅读次数：
187
Problem Description
Five hundred years later, the number of dragon balls will increase unexpectedly, so it's too difficult for Monkey King(WuKong) to gather all of the dragon balls together.
...
分类：
其他好文 时间：
2015-05-11 14:53:46
阅读次数：
130
I treated it too difficult.. nothing special, just some optimization mentioned as:http://saraguru.weebly.com/how-i-solved/find-maximum-index-product-h...
分类：
其他好文 时间：
2015-05-10 15:34:33
阅读次数：
178
点击打开杭电1024
Problem Description
Now I think you have got an AC in Ignatius.L's "Max Sum" problem. To be a brave ACMer, we always challenge ourselves to more difficult problems. Now you are faced wi...
分类：
其他好文 时间：
2015-04-30 12:38:42
阅读次数：
214
Description
Railway tickets were difficult to buy around the Lunar New Year in China, so we must get up early and join a long queue…
The Lunar New Year was approaching, but unluckily the Little Ca...
分类：
其他好文 时间：
2015-04-27 10:03:33
阅读次数：
170
Buy TicketsTime Limit: 1 SecMemory Limit: 256 MB题目连接http://acm.hdu.edu.cn/showproblem.php?pid=2795DescriptionRailway tickets were difficult to buy aro...
分类：
其他好文 时间：
2015-04-21 14:30:19
阅读次数：
131
