博弈论
Rocky0429
我愿能朝着太阳生长,做一个温暖的人。
展开
-
POJ 1067-取石子游戏(威佐夫博奕)
取石子游戏Time Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 1067Appoint description: System Crawler (2015-03-14)Description有两原创 2015-03-14 22:18:01 · 1373 阅读 · 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): 1099 Accepted Submission(s): 547Problem DescriptionNim is a tw原创 2015-03-31 17:23:50 · 1390 阅读 · 0 评论 -
POJ 2348-Euclid's Game(博弈论)
Euclid's GameTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2348Appoint description: System Crawler (2015-03-11)Descripti原创 2015-03-14 13:41:19 · 1777 阅读 · 0 评论 -
HDU 1850-Being a Good Boy in Spring Festival(尼姆博弈)
Being a Good Boy in Spring FestivalTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1850Appoint description: System Crawler (2015原创 2015-03-13 15:24:08 · 1296 阅读 · 0 评论 -
HDU 2188-悼念512汶川大地震遇难同胞――选拔志愿者(巴什博奕)
悼念512汶川大地震遇难同胞――选拔志愿者Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2188Appoint description: System Crawler (2015-03-09)Des原创 2015-03-12 17:03:55 · 1426 阅读 · 0 评论 -
HDU 2147-kiki's game(NP图解决博弈论)
kiki's gameTime Limit:1000MS Memory Limit:10000KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2147Appoint description: System Crawler (2015-03-09)Description原创 2015-03-12 20:31:25 · 1419 阅读 · 0 评论 -
POJ 2488-A Funny Game(简单博弈)
A Funny GameTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice POJ 2484Appoint description: System Crawler (2015-03-06)Descriptio原创 2015-03-12 20:14:06 · 1388 阅读 · 0 评论 -
HDU 2149-Public Sale(巴什博奕)
Public SaleTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2149Appoint description: System Crawler (2015-03-07)Description原创 2015-03-12 17:41:43 · 1319 阅读 · 0 评论 -
ACM博弈知识汇总
序:博弈是信息学和数学试题中常会出现的一种类型,算法灵活多变是其最大特点,而其中有一类试题更是完全无法用常见的博弈树来进行解答。 寻找必败态即为针对此类试题给出一种解题思路。此类问题一般有如下特点:1、博弈模型为两人轮流决策的非合作博弈。即两人轮流进行决策,并且两人都使用最优策略来获取胜利。2、博弈是有限的。即无论两人怎样决策,都会在有限步后决出胜负。转载 2015-03-12 16:51:53 · 1515 阅读 · 0 评论 -
HDU 5011-Game(尼姆博弈)
GameTime Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 5011Appoint description: System Crawler (2015-03-07)DescriptionHere原创 2015-03-11 20:32:29 · 1384 阅读 · 0 评论 -
HDU 1849-Rabbit and Grass(尼姆博弈)
Rabbit and GrassTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 1849Appoint description: System Crawler (2015-03-11)Descri原创 2015-03-11 21:23:14 · 1141 阅读 · 0 评论 -
HDU 4994-Revenge of Nim(博弈论)
Revenge of NimTime Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 4994Appoint description: System Crawler (2015-03-07)Descript原创 2015-03-11 19:59:14 · 1214 阅读 · 0 评论 -
HDU 2897-邂逅明下(sg函数)
邂逅明下Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit Status Practice HDU 2897Appoint description: System Crawler (2015-03-13)Description当日遇到月原创 2015-03-18 20:52:13 · 1389 阅读 · 0 评论