随笔分类 -  简单模拟

摘要:COCI 2009/2010 Task MALI1. round, 24. october 2009.Author: Marko Ivankovi., Filip BarlMirko and Slavko are playing a new game. Again. Slavko starts each round bygiving Mirko two numbers A and B, both smaller than 100. Mirko then has toslove the following task for Slavko: how to pair all given A numb 阅读全文
posted @ 2012-10-09 21:40 jiai 阅读(603) 评论(0) 推荐(0)
摘要:PROFESORTime Limit: 1000 ms Memory Limit: 65536 kB Solved: 37 Tried: 89 SubmitStatusBest SolutionDiscuss-->BackDescriptionIn a long classroom, N desks are arranged in a single row, with two students sitting at each desk. Students are cranky because they are about to have an art class, and their p 阅读全文
posted @ 2012-10-08 21:22 jiai 阅读(271) 评论(0) 推荐(0)
摘要:G. SwimmingProblem DescriptionIn the 2012 London Olympics, Sun Yang, the young Chinese swimmer, wins 2 golden medals and breaks the world record of men's 1500m freestyle. As a Chinese, we are proud of him, and as a ACMer, we can do some simple research on the results show system of the swimming. 阅读全文
posted @ 2012-08-12 16:40 jiai 阅读(345) 评论(0) 推荐(0)
摘要:E. 住房安排Time Limit:3000MSDescription第三十届夏季奥林匹克运动会于2012年7月27日至8月12日在英国首都伦敦举行,历时19天。为了更好地接待在这期间来自世界各地的参赛者,如何合理安排各宾馆的住房问题提到了日程。组委会已接到了大量的客户住宿定单,每张定单的内容包括要住宿的房间数,开始住宿时间和要住的天数。为了便于整个城市各宾馆的管理,组委会希望对这些定单进行安排,目的是用尽可能少的房间来满足这些定单,以便空出更多的房间用于安排流动游客。组委会请求Jenny来完成这个任务,对这些定单进行合理安排,使得满足这些定单要求的房间数最少。假设某个定单上的游客一旦被安排到 阅读全文
posted @ 2012-08-05 17:12 jiai 阅读(471) 评论(0) 推荐(0)
摘要:FlowersTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0Accepted Submission(s): 0Problem DescriptionAs is known to all, the blooming time and duration varies between different kinds of flowers. Now there is a garden planted full of flowers. The gar 阅读全文
posted @ 2012-07-31 17:25 jiai 阅读(266) 评论(7) 推荐(0)
摘要:A Famous GridProblem DescriptionMr. B has recently discovered the grid named "spiral grid".Construct the grid like the following figure. (The grid is actually infinite. The figure is only a small part of it.)Considering traveling in it, you are free to any cell containing a composite numbe 阅读全文
posted @ 2012-07-24 17:40 jiai 阅读(217) 评论(0) 推荐(0)
摘要:BetProblem DescriptionMirko doesn’t like Latin homeworks so he made a bet with Slavko. Loser will be writing homeworks for both of them the entire month. Mirko wants to win so he designed this problem they could have something to bet on.At his desk he found a cube, with numbers 1 to 6 on its faces. 阅读全文
posted @ 2012-07-24 17:03 jiai 阅读(245) 评论(0) 推荐(0)