博弈
brav0
练习算法两年半的ACM选手
展开
-
ICPC North America Qualifier Contest 2015 E. Cutting Brownies(SG函数)
题意:就是给出一个m * n的矩阵,然后Harry每次横切,Vicky每次纵切。但是要求每次切的时候需要切除整数块,轮到谁没法切了,那就是他输了。思路:考虑博弈,设d[n][m][2],0表示Harry先切,1表示Vicky先切。当某一个人切完之后的任何一个状态都使得对方输那么这个人就赢了。比赛的时候一直在考虑切完后每一块因为先手的人不同可能会导致结果不一样,其实写...原创 2020-04-21 16:26:33 · 290 阅读 · 0 评论 -
Nim Game(博弈)
题目描述Nim is a mathematical game of strategy in which two players take turns removing objects from distinct heaps. On each turn, a player must remove at least one object, and may remove any number of ...原创 2019-04-14 12:07:20 · 392 阅读 · 0 评论 -
2019 Multi-University Training Contest 7 Just Repeat (博弈)
Time Limit: 4000/2000 MS (Java/Others)Memory Limit: 524288/524288 K (Java/Others)Total Submission(s): 1134Accepted Submission(s): 204Problem DescriptionWhen Cuber QQ was chatting happil...原创 2019-08-13 14:16:49 · 193 阅读 · 0 评论