2011年12月7日

EOJ201 Software Industry Revolution
摘要： EOJ201 Software Industry RevolutionTime Limit: 5000MS Memory Limit: 65536KTotal Submits: 34 Accepted: 12DescriptionMaking revolutions in the software industry is not an easy task. That’s why this problem is about something else. Stanescu has just invented a new super-cool way to develop software. It 阅读全文
posted @ 2011-12-07 15:32 Fatedayt 阅读(352) 评论(0) 推荐(0) 编辑

2011年12月4日

POJ2185 Milking Grid
摘要： POJ2185 Milking GridTime Limit:3000MSMemory Limit:65536KTotal Submissions:3220Accepted:1317DescriptionEvery morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As we all know, Farmer John is quite 阅读全文
posted @ 2011-12-04 15:33 Fatedayt 阅读(823) 评论(0) 推荐(0) 编辑

2011年12月3日

HDU1711 Number Sequence
摘要： HDU1711 Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3852Accepted Submission(s): 1781Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N & 阅读全文
posted @ 2011-12-03 16:10 Fatedayt 阅读(512) 评论(0) 推荐(0) 编辑
HDU1358 Period
摘要： HDU1358 PeriodTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 675Accepted Submission(s): 321Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know w 阅读全文
posted @ 2011-12-03 15:40 Fatedayt 阅读(925) 评论(0) 推荐(0) 编辑

2011年11月28日

HDU3828 A + B problem
摘要： HDU3828 A + B problemTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 544Accepted Submission(s): 116Problem DescriptionQQ and OO always play the game of A + B. QQ gives tow decimal number A and B, and OO answers the sum at once. But to do the same 阅读全文
posted @ 2011-11-28 22:28 Fatedayt 阅读(467) 评论(0) 推荐(0) 编辑

2011年11月23日

POJ3648 Wedding
摘要： POJ3648 WeddingTime Limit: 1000MSMemory Limit: 65536KTotal Submissions: 4751Accepted: 1435Special JudgeDescriptionUp to thirty couples will attend a wedding feast, at which they will be seated on either side of a long table. The bride and groom sit at one end, opposite each other, and the bride wear 阅读全文
posted @ 2011-11-23 21:52 Fatedayt 阅读(648) 评论(0) 推荐(0) 编辑
POJ2749 Building roads
摘要： POJ2749 Building roadsTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 4522Accepted: 1485DescriptionFarmer John's farm has N barns, and there are some cows that live in each barn. The cows like to drop around, so John wants to build some roads to connect these barns. If he builds roads f 阅读全文
posted @ 2011-11-23 19:38 Fatedayt 阅读(626) 评论(0) 推荐(0) 编辑
POJ3683 Priest John's Busiest Day
摘要： POJ3683 Priest John's Busiest DayTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 5196Accepted: 1802Special JudgeDescriptionJohn is the only priest in his town. September 1st is the John's busiest day in a year because there is an old legend in the town that the couple who get marrie 阅读全文
posted @ 2011-11-23 16:02 Fatedayt 阅读(525) 评论(0) 推荐(0) 编辑

2011年11月17日

HDU3062 Party
摘要： HDU3062 PartyTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1267Accepted Submission(s): 393Problem Description有n对夫妻被邀请参加一个聚会，因为场地的问题，每对夫妻中只有1人可以列席。在2n 个人中，某些人之间有着很大的矛盾（当然夫妻之间是没有矛盾的），有矛盾的2个人是不会同时出现在聚会上的。有没有可能会有n 个人同时列席？Inputn： 表示有n对夫妻被邀请 (n<= 10 阅读全文
posted @ 2011-11-17 08:23 Fatedayt 阅读(518) 评论(0) 推荐(0) 编辑

2011年11月14日

POJ1793&&EOJ21 Software Company
摘要： POJ1793&&EOJ21 Software CompanyTime Limit:1000MSMemory Limit:30000KTotal Submissions:864Accepted:348DescriptionA software developing company has been assigned two programming projects. As both projects are within the same contract, both must be handed in at the same time. It does not help if 阅读全文
posted @ 2011-11-14 09:46 Fatedayt 阅读(270) 评论(0) 推荐(0) 编辑

导航