2012年2月18日

HDU OJ Employment Planning

摘要： Employment PlanningTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 27 Accepted Submission(s) : 14Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionA project manager wants to determine the number of the workers needed in ever 阅读全文

posted @ 2012-02-18 22:47 lzm风雨无阻 阅读(297) 评论(0) 推荐(0)

HDU OJ City Game

摘要： City GameTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 14 Accepted Submission(s) : 8Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionBob is a strategy game programming specialist. In his new city building game the gaming 阅读全文

posted @ 2012-02-18 16:58 lzm风雨无阻 阅读(520) 评论(0) 推荐(0)

HDU OJ Humble Numbers

摘要： Humble NumbersTime Limit : 2000/1000ms (Java/Other) Memory Limit : 65536/32768K (Java/Other)Total Submission(s) : 33 Accepted Submission(s) : 21Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionA number whose only prime factors are 2,3,5 or 7 is called a humble number. The se 阅读全文

posted @ 2012-02-18 14:42 lzm风雨无阻 阅读(268) 评论(0) 推荐(0)

HDU OJ Matrix Swapping II

摘要： Matrix Swapping IITime Limit : 9000/3000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)Total Submission(s) : 12 Accepted Submission(s) : 8Font: Times New Roman | Verdana | GeorgiaFont Size: ← →Problem DescriptionGiven an N * M matrix with each entry equal to 0 or 1. We can find some rectang 阅读全文

posted @ 2012-02-18 11:44 lzm风雨无阻 阅读(300) 评论(0) 推荐(0)

导航