2013年8月2日
HDU 3980 Paint Chain （sg函数）
摘要： Paint ChainTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 804Accepted Submission(s): 292Problem DescriptionAekdycoin and abcdxyzk are playing a game. They get a circle chain with some beads. Initially none of the beads is painted. They take turns 阅读全文
posted @ 2013-08-02 15:07 Jack Ge 阅读(391) 评论(0) 推荐(0) 编辑
HDU 3951 Coin Game （简单博弈）
摘要： Coin GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 888Accepted Submission(s): 547Problem DescriptionAfter hh has learned how to play Nim game, he begins to try another coin game which seems much easier.The game goes like this:Two players star 阅读全文
posted @ 2013-08-02 14:18 Jack Ge 阅读(741) 评论(0) 推荐(0) 编辑
HDU 1850 Being a Good Boy in Spring Festival （Nim博弈）
摘要： Being a Good Boy in Spring FestivalTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3142Accepted Submission(s): 1821Problem Description一年在外 父母时刻牵挂春节回家 你能做几天好孩子吗寒假里尝试做做下面的事情吧陪妈妈逛一次菜场悄悄给爸爸买个小礼物主动地 强烈地 要求洗一次碗某一天早起 给爸妈用心地做回早餐如果愿意 你还可以和爸妈说咱们玩个小游戏吧 ACM课上学 阅读全文
posted @ 2013-08-02 13:56 Jack Ge 阅读(297) 评论(0) 推荐(0) 编辑
HDU 3389 Game （阶梯博弈）
摘要： GameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 217Accepted Submission(s): 152Problem DescriptionBob and Alice are playing a new game. There are n boxes which have been numbered from 1 to n. Each box is either empty or contains several cards. B 阅读全文
posted @ 2013-08-02 13:40 Jack Ge 阅读(766) 评论(0) 推荐(0) 编辑
HDU 3032 Nim or not Nim? （sg函数）
摘要： Nim or not Nim?Time Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 623Accepted Submission(s): 288Problem DescriptionNim is a two-player mathematic game of strategy in which players take turns removing objects from distinct heaps. On each turn, a player 阅读全文
posted @ 2013-08-02 13:12 Jack Ge 阅读(2186) 评论(0) 推荐(0) 编辑
HDU 1907 John （Nim博弈）
摘要： JohnTime Limit: 5000/1000 MS (Java/Others)Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2034Accepted Submission(s): 1096Problem DescriptionLittle John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has 阅读全文
posted @ 2013-08-02 11:27 Jack Ge 阅读(1051) 评论(0) 推荐(0) 编辑
HDU 4638 Group （线段树 | 树状数组 + 离线处理）
摘要： GroupTime Limit: 4000/2000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 208Accepted Submission(s): 122Problem DescriptionThere are n men ,every man has an ID(1..n).their ID is unique. Whose ID is i and i-1 are friends, Whose ID is i and i+1 are friends. These n men s 阅读全文
posted @ 2013-08-02 10:20 Jack Ge 阅读(647) 评论(0) 推荐(0) 编辑
HDU 4635 Strongly connected （Tarjan）
摘要： Strongly connectedTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 437Accepted Submission(s): 193Problem DescriptionGive a simple directed graph with N nodes and M edges. Please tell me the maximum number of the edges you can add that the graph is s 阅读全文
posted @ 2013-08-02 09:16 Jack Ge 阅读(996) 评论(0) 推荐(0) 编辑