10 2013 档案

hdu 4539 郑厂长系列故事——排兵布阵
摘要:郑厂长系列故事——排兵布阵Time Limit: 10000/5000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 1294Accepted Submission(s): 470Problem Description 郑厂长不是正厂长 也不是副厂长 他根本就不是厂长 事实上 他是带兵打仗的团长 一天,郑厂长带着他的军队来到了一个n*m的平原准备布阵。 根据以往的战斗经验,每个士兵可以攻击到并且只能攻击到与之曼哈顿距离为2的位置以及士兵本身所在的位置。当然,一个士兵不能站... 阅读全文

posted @ 2013-10-25 10:05 _log__ 阅读(224) 评论(0) 推荐(0) 编辑

hdu4336 Card Collector
摘要:Card CollectorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1910Accepted Submission(s): 888Special JudgeProblem DescriptionIn your childhood, do you crazy for collecting the beautiful cards in the snacks? They said that, for example, if you colle 阅读全文

posted @ 2013-10-18 18:06 _log__ 阅读(135) 评论(0) 推荐(0) 编辑

Vasya and Robot
摘要:A. Vasya and Robottime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputVasya hasnitems lying in a line. The items are consecutively numbered by numbers from1tonin such a way that the leftmost item has number1, the rightmost item has numbern. Each item 阅读全文

posted @ 2013-10-14 18:24 _log__ 阅读(347) 评论(0) 推荐(0) 编辑

Easy Tree Problem
摘要:A tree structure is very special structure, there is exactly one path connecting each pair of nodes.Now, given a tree structure, which has N nodes(conveniently labeled from 1 to N). And the root of the tree is always labeled with 1. You are to write a program to figure out that, for every node V in 阅读全文

posted @ 2013-10-07 20:48 _log__ 阅读(207) 评论(0) 推荐(0) 编辑

hust 1427 Funny Funny Game
摘要:HUST - 1427Funny Funny GameTime Limit:1000MSMemory Limit:131072KB64bit IO Format:%lld & %llu[Submit] [Go Back] [Status]DescriptionSuper Hanhan(SH) loves playing all kinds of little games very much. Today rocket323 recommends a new game to SH.The game’s name is “Eating stones”, and it’s played li 阅读全文

posted @ 2013-10-07 20:40 _log__ 阅读(222) 评论(0) 推荐(0) 编辑

Necessary Coins
摘要:DescriptionVasya has been on vacation on Mars. He's a big fan of foreign coins, and thus has collected exactly one martian coin of each denomination, for a total ofncoins:a1martian dollars,a2martian dollars, etc,anmartian dollars. Unfortunately, he couldn't stand ordering the Pan Galactic Ga 阅读全文

posted @ 2013-10-06 23:55 _log__ 阅读(248) 评论(0) 推荐(0) 编辑

hdu 4182 Help-or-else
摘要:Help-or-elseTime Limit: 10000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 56Accepted Submission(s): 33Problem DescriptionA penal colony for finance professionals will soon be holding its annual community service activity with some rules that are considered suit 阅读全文

posted @ 2013-10-05 22:10 _log__ 阅读(221) 评论(0) 推荐(0) 编辑

hdu4185 Oil Skimming
摘要:Oil Skimming Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 648Accepted Submission(s): 288Problem DescriptionThanks to a certain "green" resources company, there is a new profitable industry of oil skimming. There are large slicks of cr 阅读全文

posted @ 2013-10-05 20:55 _log__ 阅读(240) 评论(0) 推荐(0) 编辑

hdu 4180 RealPhobia
摘要:RealPhobia Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 250Accepted Submission(s): 98Problem DescriptionBert is a programmer with a real fear of floating point arithmetic. Bert has quite successfully used rational numbers to write his programs. 阅读全文

posted @ 2013-10-05 20:40 _log__ 阅读(299) 评论(0) 推荐(0) 编辑