![](https://img-blog.csdnimg.cn/20201014180756922.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
zoj ACM
文章平均质量分 85
sooowhat
这个作者很懒,什么都没留下…
展开
-
zoj 1003 Crashing Balloon
自己的水平还是不够,这题想了好久也没有想出该怎么做,最后google了 看了一下别人的标题 dfs,这才想着怎么用dfs求解. 代码是自己写的 ...以后还要锻炼独立思考能力:On every June 1st, the Children's Day, there will be a game named "crashing balloon" on TV. The rule is very simple. On the ground there are 100 labeled balloons原创 2011-06-01 18:26:00 · 335 阅读 · 0 评论 -
zoj 1004 Anagrams by Stack (回溯)
开始觉得无从下手啊 毕竟自己是个菜鸟....用递归,回溯法程序写的有点乱,主要是变量命名时没有什么规则,让人看不懂,自己也懒得修改了, 注释也有点不清楚......原题:How can anagrams result from sequences of stack operations? There are two sequences of stack operators whic原创 2011-06-03 10:13:00 · 365 阅读 · 0 评论 -
zoj 1005 Jugs
广搜 就是往桶里倒水 每次都有六种方案 写的有一点小麻烦 可以把重复的东西弄成函数的 In the movie "Die Hard 3", Bruce Willis and Samuel L. Jackson were confronted with the following puzzle. They were given a 3-gallon jug and a 5-gallon jug and were asked to fill the 5-gallon jug with exactly原创 2011-06-01 20:40:00 · 307 阅读 · 0 评论 -
zoj 1009 Enigma (模拟)
原题In World War II, Germany once used an electronic encryption machine called Enigma, which played a decisive role in the initial victories of Nazi Germany. It was proved to be one of the most reliab原创 2011-06-05 16:48:00 · 147 阅读 · 0 评论