上一页 1 ··· 34 35 36 37 38 39 40 41 42 ··· 53 下一页
摘要: BabelfishTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 26420Accepted: 11341DescriptionYou have just moved from Waterloo to a big city. The people here speak an incomprehensible dialect of a foreign language. Fortunately, you have a dictionary to help you understand them.InputInput consist 阅读全文
posted @ 2013-02-05 16:36 剑不飞 阅读(271) 评论(0) 推荐(0) 编辑
摘要: C - ParquetCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 26C DescriptionOnce Bob decided to lay a parquet floor in his living room. The living room is of sizen × m metres. Bob had planks of three typ 阅读全文
posted @ 2013-02-04 22:00 剑不飞 阅读(281) 评论(0) 推荐(0) 编辑
摘要: Farm IrrigationTime Limit: 2 Seconds Memory Limit: 65536 KB Benny has a spacious farm land to irrigate. The farm land is a rectangle, and is divided into a lot of samll squares. Water pipes are placed in these squares. Different square has a different type of pipe. There are 11 types of pipes, which 阅读全文
posted @ 2013-02-04 16:13 剑不飞 阅读(128) 评论(0) 推荐(0) 编辑
摘要: Tempter of the BoneTime Limit: 2 Seconds Memory Limit: 65536 KB The doggie found a bone in an ancient maze, which fascinated him a lot. However, when he picked it up, the maze began to shake, and the doggie could feel the ground sinking. He realized that the bone was a trap, and he tried desperately 阅读全文
posted @ 2013-02-04 15:12 剑不飞 阅读(114) 评论(0) 推荐(0) 编辑
摘要: Frogs' NeighborhoodTime Limit:5000MSMemory Limit:10000KTotal Submissions:5524Accepted:2388Special JudgeDescription未名湖附近共有N个大小湖泊L1,L2, ...,Ln(其中包括未名湖),每个湖泊Li里住着一只青蛙Fi(1 ≤i≤N)。如果湖泊Li和Lj之间有水路相连,则青蛙Fi和Fj互称为邻居。现在已知每只青蛙的邻居数目x1,x2, ...,xn,请你给出每两个湖泊之间的相连关系。Input第一行是测试数据的组数T(0 ≤T≤ 20)。每组数据包括两行,第一行是整数N(2 阅读全文
posted @ 2013-02-04 13:53 剑不飞 阅读(162) 评论(0) 推荐(0) 编辑
摘要: Greatest Common Increasing SubsequenceTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2081Accepted Submission(s): 626Problem DescriptionThis is a problem from ZOJ 2432.To make it easyer,you just need output the length of the subsequence.InputEach s 阅读全文
posted @ 2013-02-03 14:16 剑不飞 阅读(115) 评论(0) 推荐(0) 编辑
摘要: 重温世界杯Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3018Accepted Submission(s): 944Problem Description世界杯结束了,意大利人连本带利的收回了法国人6年前欠他们的债,捧起了大力神杯,成就了4星意大利.世界杯虽然结束了,但是这界世界杯给我们还是留下许多值得回忆的东西.比如我们听到了黄名嘴的3分钟激情解说,我们懂得了原来可以向同一个人出示3张黄牌,我们还看到了齐达内的头不仅能顶球还能顶人………… 阅读全文
posted @ 2013-02-03 12:51 剑不飞 阅读(162) 评论(0) 推荐(0) 编辑
摘要: 搬寝室Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 10915Accepted Submission(s): 3661Problem Description搬寝室是很累的,xhd深有体会.时间追述2006年7月9号,那天xhd迫于无奈要从27号楼搬到3号楼,因为10号要封楼了.看着寝室里的n件物品,xhd开始发呆,因为n是一个小于2000的整数,实在是太多了,于是xhd决定随便搬2*k件过去就行了.但还是会很累,因为2*k也不小是一个不大于n 阅读全文
posted @ 2013-02-03 11:40 剑不飞 阅读(301) 评论(0) 推荐(0) 编辑
摘要: E - TestCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB 64bit IO Format:%I64d & %I64uSubmitStatus Practice CodeForces 25E DescriptionSometimes it is hard to prepare tests for programming problems. Now Bob is preparing tests to new problem about strings — input data to 阅读全文
posted @ 2013-02-02 22:10 剑不飞 阅读(237) 评论(0) 推荐(0) 编辑
摘要: D - Roads not only in BerlandCrawling in process...Crawling failedTime Limit:2000MSMemory Limit:262144KB64bit IO Format:%I64d & %I64uSubmitStatusPracticeCodeForces 25D DescriptionBerland Government decided to improve relations with neighboring countries. First of all, it was decided to build new 阅读全文
posted @ 2013-02-02 21:55 剑不飞 阅读(316) 评论(0) 推荐(0) 编辑
上一页 1 ··· 34 35 36 37 38 39 40 41 42 ··· 53 下一页