2012年9月25日
POJ 1426 Find The Multiple
摘要： Find The MultipleTime Limit: 1000MSMemory Limit: 10000KTotal Submissions: 12564Accepted: 5175Special JudgeDescriptionGiven a positive integer n, write a program to find out a nonzero multiple m of n whose decimal representation contains only the digits 0 and 1. You may assume that n is not greater t 阅读全文
posted @ 2012-09-25 20:15 史力普神 阅读(269) 评论(0) 推荐(0) 编辑
HDOJ 4296 Buildings
摘要： 这是2012亚洲区域网络预选赛成都赛区的一道贪心题。BuildingsTime Limit: 5000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 801Accepted Submission(s): 380Problem Description Have you ever heard the story of Blue.Mary, the great civil engineer? Unlike Mr. Wolowitz, Dr. Blue.Mary has accom. 阅读全文
posted @ 2012-09-25 19:18 史力普神 阅读(284) 评论(1) 推荐(0) 编辑
POJ 1562 Oil Deposit经验教训
摘要： DescriptionThe GeoSurvComp geologic survey company is responsible for detecting underground oil deposits. GeoSurvComp works with one large rectangular region of land at a time, and creates a grid that divides the land into numerous square plots. It then analyzes each plot separately, using sensing e 阅读全文
posted @ 2012-09-25 18:24 史力普神 阅读(107) 评论(0) 推荐(0) 编辑