随笔分类 -  博弈 & 概率 & 汗诺塔系列

HDU 4576 Robot （概率 & 期望）
摘要：RobotTime Limit: 8000/4000 MS (Java/Others)Memory Limit: 102400/102400 K (Java/Others)Total Submission(s): 779Accepted Submission(s): 304Problem DescriptionMichael has a telecontrol robot. One day he put the robot on a loop with n cells. The cells are numbered from 1 to n clockwise.At first the robo 阅读全文
posted @ 2013-08-11 10:40 Jack Ge 阅读(661) 评论(0) 推荐(0) 编辑
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 阅读(392) 评论(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 阅读(745) 评论(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 阅读(300) 评论(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 阅读(768) 评论(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 阅读(2189) 评论(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 阅读(1055) 评论(0) 推荐(0) 编辑
HDU 4642 Fliping game （简单博弈）
摘要：Fliping gameTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 307Accepted Submission(s): 220Problem DescriptionAlice and Bob are playing a kind of special game on an N*M board (N rows, M columns). At the beginning, there are N*M coins in this board w 阅读全文
posted @ 2013-08-01 23:51 Jack Ge 阅读(794) 评论(0) 推荐(0) 编辑
HDU 2077 汉诺塔IV
摘要：汉诺塔IVTime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2735Accepted Submission(s): 2085Problem Description还记得汉诺塔III吗？他的规则是这样的：不允许直接从最左(右)边移到最右(左)边(每次移动一定是移到中间杆或从中间移出)，也不允许大盘放到小盘的上面。xhd在想如果我们允许最大的盘子放到最上面会怎么样呢？（只允许最大的放在最上面）当然最后需要的结果是盘子从小到大排在最右边。Input输入 阅读全文
posted @ 2013-07-26 22:35 Jack Ge 阅读(1411) 评论(0) 推荐(0) 编辑
HDU 1996 汉诺塔VI
摘要：汉诺塔VITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1097Accepted Submission(s): 775Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产生2^n个系列。由于发生错移产生的系列就增加了，这种错误是放错了柱子，并不会把大盘放到小盘上，即各柱子从下往上的大小仍保持如下关系 ：n=m+p+qa1>a2>...>amb1>b2>...&g 阅读全文
posted @ 2013-07-26 21:59 Jack Ge 阅读(1379) 评论(0) 推荐(0) 编辑
HDU 1995 汉诺塔V
摘要：汉诺塔VTime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1832Accepted Submission(s): 1095Problem Description用1,2,...,n表示n个盘子，称为1号盘，2号盘,...。号数大盘子就大。经典的汉诺塔问题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于印度传说的一个故事，上帝创造世界时作了三根金刚石柱子，在一根柱子上从下往上按大小顺序摞着64片黄金圆盘。上帝命令婆罗门 阅读全文
posted @ 2013-07-26 21:43 Jack Ge 阅读(1371) 评论(0) 推荐(0) 编辑
HDU 2064 汉诺塔III
摘要：汉诺塔IIITime Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7113Accepted Submission(s): 3120Problem Description约19世纪末，在欧州的商店中出售一种智力玩具，在一块铜板上有三根杆，最左边的杆上自上而下、由小到大顺序串着由64个圆盘构成的塔。目的是将最左边杆上的盘全部移到右边的杆上，条件是一次只能移动一个盘，且不允许大盘放在小盘的上面。现在我们改变游戏的玩法，不允许直接从最左(右)边移到最右(左) 阅读全文
posted @ 2013-07-26 21:31 Jack Ge 阅读(1685) 评论(0) 推荐(0) 编辑
HDU 1207 汉诺塔II
摘要：汉诺塔IITime Limit: 2000/1000 MS (Java/Others)Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3747Accepted Submission(s): 1862Problem Description经典的汉诺塔问题经常作为一个递归的经典例题存在。可能有人并不知道汉诺塔问题的典故。汉诺塔来源于印度传说的一个故事，上帝创造世界时作了三根金刚石柱子，在一根柱子上从下往上按大小顺序摞着64片黄金圆盘。上帝命令婆罗门把圆盘从下面开始按大小顺序重新摆放在另一根柱子上。并且规定，在小圆盘上不能放 阅读全文
posted @ 2013-07-26 21:16 Jack Ge 阅读(4528) 评论(0) 推荐(1) 编辑
HDU 汉诺塔VII (DFS | 非递归)
摘要：汉诺塔VIITime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 863 Accepted Submission(s): 642Problem Descriptionn个盘子的汉诺塔问题的最少移动次数是2^n-1,即在移动过程中会产生2^n个系列。由于发生错移产生的系列就增加了，这种错误是放错了柱子，并不会把大盘放到小盘上，即各柱子从下往上的大小仍保持如下关系 ： n=m+p+q a1>a2>...>am b1>b2> 阅读全文
posted @ 2013-03-17 07:58 Jack Ge 阅读(835) 评论(0) 推荐(0) 编辑
HDU 4438 Hunters （概率 & 期望）
摘要：Huntershttp://acm.hdu.edu.cn/showproblem.php?pid=4438Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 382 Accepted Submission(s): 281 Problem DescriptionAlice and Bob are the topmost hunters in the forest, so no preys can escape from them. However 阅读全文
posted @ 2012-12-27 11:56 Jack Ge 阅读(365) 评论(0) 推荐(0) 编辑

点击右上角即可分享
微信分享提示