摘要：
AreYouBusyTime Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionHappy New Term! As having become a junior, xiaoA recognizes that there is not much time for her to AC problems, because there are some other th 阅读全文
posted @ 2013-04-22 19:40
Jack Ge
阅读(1079)
评论(0)
推荐(0)
摘要：
I love sneakers!Time Limit : 2000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionAfter months of hard working, Iserlohn finally wins awesome amount of scholarship. As a great zealot of sneakers, he decides to spend all 阅读全文
posted @ 2013-04-22 19:01
Jack Ge
阅读(316)
评论(0)
推荐(0)
摘要：
ACboy needs your helpTime Limit : 1000/1000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Problem DescriptionACboy has N courses this term, and he plans to spend at most M days on study.Of course,the profit he will gain from different course 阅读全文
posted @ 2013-04-22 18:30
Jack Ge
阅读(232)
评论(0)
推荐(0)
摘要：
Round and Round We GoTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionA cyclic number is an integer n digits in length which, when multiplied by any integer from 1 to n, yields a"cycle"of the 阅读全文
posted @ 2013-04-22 17:15
Jack Ge
阅读(289)
评论(0)
推荐(0)
摘要：
ParliamentTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 1Problem DescriptionNew convocation of The Fool Land's Parliament consists of N delegates. According to the present regulation delegates should be divided into 阅读全文
posted @ 2013-04-22 16:43
Jack Ge
阅读(654)
评论(0)
推荐(0)
摘要：
False coinTime Limit : 2000/1000ms (Java/Other) Memory Limit : 131072/65536K (Java/Other)Total Submission(s) : 4 Accepted Submission(s) : 1Problem DescriptionThe "Gold Bar"bank received information from reliable sources that in their last group of N coins exactly one coin is false and diff 阅读全文
posted @ 2013-04-22 16:23
Jack Ge
阅读(910)
评论(0)
推荐(0)
摘要：
PacketsTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionA factory produces products packed in square packets of the same height h and of the sizes 1*1, 2*2, 3*3, 4*4, 5*5, 6*6. These products are always 阅读全文
posted @ 2013-04-22 13:54
Jack Ge
阅读(4044)
评论(1)
推荐(0)
摘要：
DividingTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem DescriptionMarsha and Bill own a collection of marbles. They want to split the collection among themselves so that both receive an equal share of the marble 阅读全文
posted @ 2013-04-22 13:29
Jack Ge
阅读(457)
评论(0)
推荐(0)
摘要：
Counterfeit DollarTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 1Problem DescriptionSally Jones has a dozen Voyageur silver dollars. However, only eleven of the coins are true silver dollars; one coin is counterfeit eve 阅读全文
posted @ 2013-04-22 12:39
Jack Ge
阅读(402)
评论(0)
推荐(0)
摘要：
JosephTime Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 0 Accepted Submission(s) : 0Problem DescriptionThe Joseph's problem is notoriously known. For those who are not familiar with the original problem: from among n people, numbered 1, 2, . . ., 阅读全文
posted @ 2013-04-22 11:17
Jack Ge
阅读(1601)
评论(0)
推荐(0)
摘要：
取石子游戏Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 1 Accepted Submission(s) : 1Problem Description有两堆石子，数量任意，可以不同。游戏开始由两个人轮流取石子。游戏规定，每次有两种不同的取法，一是可以在任意的一堆中取走任意多的石子；二是可以在两堆中同时取走相同数量的石子。最后把石子全部取完者为胜者。现在给出初始的两堆石子的数目，如果轮到你先取，假设双方都采取最好的策略，问最后你是胜者还是败者。 阅读全文
posted @ 2013-04-22 10:10
Jack Ge
阅读(8561)
评论(3)
推荐(0)
摘要：
青蛙的约会Time Limit : 2000/1000ms (Java/Other) Memory Limit : 20000/10000K (Java/Other)Total Submission(s) : 2 Accepted Submission(s) : 2Problem Description两只青蛙在网上相识了，它们聊得很开心，于是觉得很有必要见一面。它们很高兴地发现它们住在同一条纬度线上，于是它们约定各自朝西跳，直到碰面为止。可是它们出发之前忘记了一件很重要的事情，既没有问清楚对方的特征，也没有约定见面的具体位置。不过青蛙们都是很乐观的，它们觉得只要一直朝着某个方向跳下去，总能碰 阅读全文
posted @ 2013-04-22 09:40
Jack Ge
阅读(7490)
评论(0)
推荐(1)
摘要：
String Problem Problem Description Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SK 阅读全文
posted @ 2013-04-22 08:43
Jack Ge
阅读(354)
评论(0)
推荐(0)
浙公网安备 33010602011771号