摘要: Painter's ProblemTime Limit:1000MSMemory Limit:10000KTotal Submissions:3880Accepted:1889DescriptionThere is a square wall which is made of n*n small square bricks. Some bricks are white while some bricks are yellow. Bob is a painter and he wants to paint all the bricks yellow. But there is somet 阅读全文
posted @ 2013-05-22 23:36 Jack Ge 阅读(504) 评论(0) 推荐(0) 编辑
摘要: EXTENDED LIGHTS OUTTime Limit:1000MSMemory Limit:10000KTotal Submissions:5383Accepted:3557DescriptionIn an extended version of the game Lights Out, is a puzzle with 5 rows of 6 buttons each (the actual puzzle has 5 rows of 5 buttons each). Each button has a light. When a button is pressed, that butt 阅读全文
posted @ 2013-05-22 22:52 Jack Ge 阅读(1584) 评论(0) 推荐(0) 编辑
摘要: 排列2Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3107Accepted Submission(s): 1220Problem DescriptionRay又对数字的列产生了兴趣:现有四张卡片,用这四张卡片能排列出很多不同的4位数,要求按从小到大的顺序输出这些4位数。Input每组数据占一行,代表四张卡片上的数字(0<=数字<=9),如果四张卡片都是0,则输入结束。Output对每组卡片按从小到大的顺序输出所有能由这四张卡片组 阅读全文
posted @ 2013-05-22 16:53 Jack Ge 阅读(3998) 评论(0) 推荐(0) 编辑
摘要: EquationsTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3853Accepted Submission(s): 1551Problem DescriptionConsider equations having the following form:a*x1^2+b*x2^2+c*x3^2+d*x4^2=0a, b, c, d are integers from the interval [-50,50] and any of them 阅读全文
posted @ 2013-05-22 16:10 Jack Ge 阅读(170) 评论(0) 推荐(0) 编辑
摘要: The Troublesome FrogTime Limit:5000MSMemory Limit:100000KTotal Submissions:9126Accepted:2749Case Time Limit:500MSDescriptionIn Korea, the naughtiness of the cheonggaeguri, a small frog, is legendary. This is a well-deserved reputation, because the frogs jump through your rice paddy at night, flatten 阅读全文
posted @ 2013-05-22 14:22 Jack Ge 阅读(599) 评论(0) 推荐(0) 编辑
摘要: 694. Distinct SubstringsProblem code: DISUBSTRhttp://www.spoj.com/problems/DISUBSTR/Given a string, we need to find the total number of its distinct substrings.InputT- number of test cases. T<=20;Each test case consists of one string, whose length is <= 1000OutputFor each test case output one 阅读全文
posted @ 2013-05-22 08:34 Jack Ge 阅读(305) 评论(0) 推荐(0) 编辑
摘要: Milk PatternsTime Limit:5000MSMemory Limit:65536KTotal Submissions:7748Accepted:3522Case Time Limit:2000MSDescriptionFarmer John has noticed that the quality of milk given by his cows varies from day to day. On further investigation, he discovered that although he can't predict the quality of mi 阅读全文
posted @ 2013-05-22 08:14 Jack Ge 阅读(323) 评论(0) 推荐(0) 编辑
摘要: Musical ThemeTime Limit:1000MSMemory Limit:30000KTotal Submissions:14584Accepted:5026DescriptionA musical melody is represented as a sequence of N (1<=N<=20000)notes that are integers in the range 1..88, each representing a key on the piano. It is unfortunate but true that this representation 阅读全文
posted @ 2013-05-22 07:50 Jack Ge 阅读(221) 评论(0) 推荐(0) 编辑