![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
博弈
Dust_Heart
这个作者很懒,什么都没留下…
展开
-
HDOJ 1517 A Multiplication Game
A Multiplication GameTime Limit: 5000/1000 MS(Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5844 Accepted Submission(s): 3311Problem DescriptionStan and原创 2017-05-03 21:54:19 · 174 阅读 · 0 评论 -
HDOJ 1848 Fibonacci again and again(SG函数)
Fibonacciagain and againTime Limit: 1000/1000 MS(Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8754 Accepted Submission(s): 3637Problem Description任何一个大学原创 2017-05-04 00:30:20 · 325 阅读 · 0 评论 -
HDOJ 1850 Being a Good Boy in Spring Festival(Nim博弈)
Being a GoodBoy in Spring FestivalTime Limit: 1000/1000 MS(Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 7380 Accepted Submission(s): 4488Problem Descripti原创 2017-05-04 01:06:33 · 230 阅读 · 0 评论 -
HDOJ 1527 取石子游戏(威佐夫博奕)
取石子游戏Time Limit: 2000/1000 MS(Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7095 Accepted Submission(s): 3884Problem Description有两堆石子,数量任意,可以不同。游戏开始由两个人轮原创 2017-05-03 23:22:30 · 225 阅读 · 0 评论 -
2017 Multi-University Training Contest 6 && HDOJ 6105 Gameia 【树形博弈】
2017 Multi-University Training Contest 6 && HDOJ 6105 Gameia 【树形博弈】 Alice and Bob are playing a game called 'Gameia ? Gameia !'. The game goes like this :0. There is a tree with all node unpainted initial.1. Because Bob is the VIP player, so Bob has K c原创 2017-08-10 20:20:48 · 592 阅读 · 2 评论 -
Codeforces 918D - MADMAX 【记忆化搜索+博弈】
Codeforces 918D - MADMAX 【记忆化搜索+博弈】As we all know, Max is the best videogame player among her friends. Her friends were so jealous of hers, that theycreated an actual game just to prove that she's not the best at games. The gameis played on a directed acy原创 2018-02-21 23:04:44 · 476 阅读 · 0 评论 -
Codeforces 937D - Sleepy Game 【博弈+判环】
Codeforces 937D - Sleepy Game 【博弈+判环】Petya and Vasyaarranged a game. The game runs by the following rules. Players have a directedgraph consisting of n vertices and m edges. One of the vertices contains a chip. Initially the chip is locatedat vertex s. Pl原创 2018-03-23 11:52:31 · 328 阅读 · 0 评论