博弈
overload1997
努力 努力 再努力
展开
-
HDU1848 Fibonacci again and again(SG函数的应用)
学习自SG函数讲解http://blog.sina.com.cn/s/blog_83d1d5c70100y9yd.html上代码#include#include#include#include#include#include#includeint book[1005];using namespace std;int f[1005]原创 2016-04-21 21:45:23 · 391 阅读 · 0 评论 -
HDU1536 S-Nim(博弈入门暴力打SG表)
还是跟之前的博弈题一样 暴力打SG表之前每次循环都memset(book,0,sizeof(book)) 这里的数据比较大。所以用一个技巧,只要在开始memset一次。然后之后设book[...]=i+1 然后判断 if(book[k]!=i+1)是否成立就好了。187ms 好险。AC代码如下:#include#include#include#includ原创 2016-04-22 17:04:57 · 469 阅读 · 0 评论 -
2016多校联赛3C (hdu5754) Life Winner Bo
Life Winner BoTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 61 Accepted Submission(s): 16Problem DescriptionBo is a "Life原创 2016-07-26 17:27:09 · 319 阅读 · 0 评论 -
ACM2016多校联赛1B hdu5724 Chess(博弈)
感谢围巾师兄,不然完全想不到。ChessTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 1006 Accepted Submission(s): 439Problem Description原创 2016-07-21 10:50:41 · 395 阅读 · 0 评论