2013年8月17日

POJ 2853 Sequence Sum Possibilities

摘要: Sequence Sum PossibilitiesTime Limit:1000MSMemory Limit:65536KTotal Submissions:5537Accepted:3641DescriptionMost positive integers may be written as a sum of a sequence of at least two consecutive positive integers. For instance,6 = 1 + 2 + 39 = 5 + 4 = 2 + 3 + 4but8cannot be so written.Write a prog 阅读全文

posted @ 2013-08-17 22:23 lzm风雨无阻 阅读(597) 评论(0) 推荐(0) 编辑

POJ 3519 Minimal Backgammon

摘要: Minimal BackgammonTime Limit:5000MSMemory Limit:65536KTotal Submissions:1195Accepted:700Special JudgeDescriptionFigure 2: An example gameHere is a very simple variation of the game backgammon, named “Minimal Backgammon”. The game is played by only one player, using only one of the dice and only one 阅读全文

posted @ 2013-08-17 20:54 lzm风雨无阻 阅读(394) 评论(0) 推荐(0) 编辑

POJ 2096 Collecting Bugs

摘要: Collecting BugsTime Limit:10000MSMemory Limit:64000KTotal Submissions:1716Accepted:783Case Time Limit:2000MSSpecial JudgeDescriptionIvan is fond of collecting. Unlike other people who collect post stamps, coins or other material stuff, he collects software bugs. When Ivan gets a new program, he clas 阅读全文

posted @ 2013-08-17 16:48 lzm风雨无阻 阅读(227) 评论(0) 推荐(0) 编辑

POJ 3071 Football

摘要: FootballTime Limit:1000MSMemory Limit:65536KTotal Submissions:2366Accepted:1191DescriptionConsider a single-elimination football tournament involving 2nteams, denoted 1, 2, …, 2n. In each round of the tournament, all teams still in the tournament are placed in a list in order of increasing index. Th 阅读全文

posted @ 2013-08-17 14:17 lzm风雨无阻 阅读(353) 评论(0) 推荐(0) 编辑

导航