https://111qqz.com/en/tags/nim%E6%B8%B8%E6%88%8F/Recent content in Nim游戏 on 111qqz's blogHugo -- gohugo.ioen© 2015-2026 111qqzWed, 20 Jul 2016 12:03:45 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-hdu-1850/Wed, 20 Jul 2016 12:03:45 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-hdu-1850/<p><a href="http://acm.hdu.edu.cn/showproblem.php?pid=1850" target="_blank" rel="noreferrer">hdu1850题目链接</a> 题意：n堆石子。。每堆可以取任意多个。。。先取完的赢。。问先手能否赢。。能赢的话第一步有几种取法。。 思路：sg函数。。对于方案数，可以用nim游戏的结论。</p>https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-nime6b8b8e6888fe4bba5e58f8ae8af81e6988ee8bf87e7a88b/Wed, 20 Jul 2016 08:06:50 +0000https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-nime6b8b8e6888fe4bba5e58f8ae8af81e6988ee8bf87e7a88b/<p><a href="http://acm.hdu.edu.cn/forum/read.php?fid=9&amp;tid=10617" target="_blank" rel="noreferrer">参考资料</a>　　（后面的证明写错了，差评，不要看，看图就好了）</p> <div class="highlight-wrapper"><div class="highlight"><pre tabindex="0" class="chroma"><code class="language-cpp" data-lang="cpp"><span class="line"><span class="ln">1</span><span class="cl"> <span class="mf">1.</span></span></span></code></pre></div></div> <blockquote><p>题目1：今有若干堆火柴，两人依次从中拿取，规定每次只能从一堆中取若干根，</p>https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-hdu1849/Tue, 22 Sep 2015 12:47:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-hdu1849/<h1 class="relative group">Rabbit and Grass <div id="rabbit-and-grass" class="anchor"></div> <span class="absolute top-0 w-6 transition-opacity opacity-0 -start-6 not-prose group-hover:opacity-100 select-none"> <a class="text-primary-300 dark:text-neutral-700 !no-underline" href="#rabbit-and-grass" aria-label="Anchor">#</a> </span> </h1> <p>**Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3058    Accepted Submission(s): 2261 **</p>https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-bestcoder56div2cclarkeandpuzzlenime6b8b8e6888fe38080e6a091e78ab6e695b0e7bb84/Tue, 22 Sep 2015 03:32:00 +0000https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-bestcoder56div2cclarkeandpuzzlenime6b8b8e6888fe38080e6a091e78ab6e695b0e7bb84/<p>比赛的时候没过．还以为是树状数组写残了． 但实际上是有自己不知道的东西． 这种博弈叫　nim游戏 所以这是一个二维的nim游戏． **nim游戏的性质是xor 和为0必败，否则必胜． xor和也有前缀和性质，所以可以用树状数组维护．</p>