随笔分类 -  acm--水题

press any key to Ac
poj 1936 -- All in All
摘要：All in AllTime Limit: 1000MSMemory Limit: 30000KTotal Submissions: 27556Accepted: 11286DescriptionYou have devised a new encryption technique which en... 阅读全文
posted @ 2014-07-20 11:43 ZeroCode_1337 阅读(124) 评论(0) 推荐(0) 编辑
poj 2299 -- Ultra-QuickSort
摘要：Ultra-QuickSortTime Limit: 7000MSMemory Limit: 65536KTotal Submissions: 39538Accepted: 14259DescriptionIn this problem, you have to analyze a particul... 阅读全文
posted @ 2014-07-14 10:37 ZeroCode_1337 阅读(136) 评论(0) 推荐(0) 编辑
poj 2388 -- Who's in the Middle
摘要：Who's in the MiddleTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 31287Accepted: 18163DescriptionFJ is surveying his herd to find the most a... 阅读全文
posted @ 2014-07-14 10:35 ZeroCode_1337 阅读(139) 评论(0) 推荐(0) 编辑
水题—— 区间最大数
摘要：区间最大数Time Limit:1 SecMemory Limit:128 MBSubmit:16Solved:4[Submit][Status][Discuss]Description给出一列数共N个，将其从1到N编号，进行M次查询[X,Y](X<=Y)，给出第X个数到第Y个数间最大的数Input一组测试数据，第一行输入N，M（1<=N,M<=10^5），第二行N个数；之后M行，每行分别为X，Y。给出一列数共N个，将其从1到N编号，进行M次查询[X,Y](X<=Y)，给出第X个数到第Y个数间最大的数。Output对于每个[X,Y]输出编号在X和Y之间（包括X，Y）的最 阅读全文
posted @ 2013-04-17 21:42 ZeroCode_1337 阅读(232) 评论(0) 推荐(0) 编辑
ZOJ 2524 Football Match
摘要：Football MatchTime Limit:2 Seconds Memory Limit:32768 KBToday football has become the most popular sport all over the world. Many countries have their own football league matches. And the FIFA wants to hold a great league match which could contains all the clubs throughout the world. It is difficult 阅读全文
posted @ 2013-03-09 20:28 ZeroCode_1337 阅读(249) 评论(0) 推荐(0) 编辑
Edge
摘要：EdgeTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1129Accepted Submission(s): 742Problem DescriptionFor products that are wrapped in small packings it is necessary that the sheet of paper containing the directions for use is folded until its size 阅读全文
posted @ 2013-02-18 18:24 ZeroCode_1337 阅读(225) 评论(0) 推荐(0) 编辑
water- Encoding
摘要：EncodingTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 18521Accepted Submission(s): 7973Problem DescriptionGiven a string containing only 'A' - 'Z', we could encode it using the following method:1. Each sub-string containing k same 阅读全文
posted @ 2013-01-28 22:37 ZeroCode_1337 阅读(121) 评论(0) 推荐(0) 编辑
water- Fibonacci Again
摘要：Fibonacci AgainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25156Accepted Submission(s): 12182Problem DescriptionThere are another kind of Fibonacci numbers: F(0) = 7, F(1) = 11, F(n) = F(n-1) + F(n-2) (n>=2).InputInput consists of a sequence 阅读全文
posted @ 2013-01-28 22:02 ZeroCode_1337 阅读(128) 评论(0) 推荐(0) 编辑
water-Average is not Fast Enough
摘要：Average is not Fast Enough!Time Limit : 2000/1000ms (Java/Other)Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 4Accepted Submission(s) : 3Font:Times New Roman|Verdana|GeorgiaFont Size:←→Problem DescriptionA relay is a race for two or more teams of runners. Each member of a team runs o 阅读全文
posted @ 2013-01-28 20:01 ZeroCode_1337 阅读(143) 评论(0) 推荐(0) 编辑
water-Uniform Generator
摘要：Uniform GeneratorTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 11259Accepted Submission(s): 4442Problem DescriptionComputer simulations often require random numbers. One way to generate pseudo-random numbers is via a function of the formseed(x+1) 阅读全文
posted @ 2013-01-26 18:00 ZeroCode_1337 阅读(145) 评论(0) 推荐(0) 编辑