<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>巴什博奕 on 111qqz's blog</title><link>https://111qqz.com/en/tags/%E5%B7%B4%E4%BB%80%E5%8D%9A%E5%A5%95/</link><description>Recent content in 巴什博奕 on 111qqz's blog</description><generator>Hugo -- gohugo.io</generator><language>en</language><copyright>© 2015-2026 111qqz</copyright><lastBuildDate>Wed, 20 Jul 2016 10:59:43 +0000</lastBuildDate><atom:link href="https://111qqz.com/en/tags/%E5%B7%B4%E4%BB%80%E5%8D%9A%E5%A5%95/index.xml" rel="self" type="application/rss+xml"/><item><title>hdu 1847 Good Luck in CET-4 Everybody! (巴什博奕,找规律｜｜sg函数)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-hdu-1847/</link><pubDate>Wed, 20 Jul 2016 10:59:43 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-hdu-1847/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1847" target="_blank" rel="noreferrer"&gt;hdu1847题目链接&lt;/a&gt;
题意：n个石子，每次只能取2的幂次个。。。问先手是否有必赢策略。。。
思路：画n点p点。。。发现n为３的倍数的时候先手必输。。。否则先手必赢。。。&lt;/p&gt;</description></item><item><title>hdu 2147 kiki's game (巴什博奕)</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-hdu-2147/</link><pubDate>Wed, 20 Jul 2016 07:35:25 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-07-20-hdu-2147/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2147" target="_blank" rel="noreferrer"&gt;hdu 2147 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：一个n*m的方格，有一个棋子初始在右上角（１，m）,每次可以将棋子向下或者向左或者向左下移动**一个格子，**不能移出边界，当无路可走的时候就输了，问谁存在必赢策略。&lt;/p&gt;</description></item><item><title>hdu 1846 Brave Game　（巴什博奕）</title><link>https://111qqz.com/en/post/acm-icpc/2016/2016-07-19-hdu-1846-brave-gamee38080efbc88e5b7b4e4bb80e58d9ae5a595efbc89/</link><pubDate>Tue, 19 Jul 2016 11:55:09 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2016/2016-07-19-hdu-1846-brave-gamee38080efbc88e5b7b4e4bb80e58d9ae5a595efbc89/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=1846" target="_blank" rel="noreferrer"&gt;hdu 1846 题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意：有n个石子，每次最多取m个，最少取１个，如果没有石子可取就输了。给出n,m，两个人都很聪明，问先手和后手谁赢。。&lt;/p&gt;</description></item><item><title>hdu 2149Public Sale(博弈论　巴什博奕)</title><link>https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-hdu2149/</link><pubDate>Tue, 22 Sep 2015 12:26:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-hdu2149/</guid><description>&lt;p&gt;&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2149" target="_blank" rel="noreferrer"&gt;hdu 2149题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意＆思路：巴什博奕，点m是n点。。。然后往前画即可。。。&lt;/p&gt;</description></item><item><title>hdu 2188 悼念512汶川大地震遇难同胞——选拔志愿者 (巴什博奕)</title><link>https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-hdu2188/</link><pubDate>Tue, 22 Sep 2015 12:14:00 +0000</pubDate><guid>https://111qqz.com/en/post/acm-icpc/2015/2015-09-22-hdu2188/</guid><description>&lt;p&gt;题目链接：&lt;a href="http://acm.hdu.edu.cn/showproblem.php?pid=2188" target="_blank" rel="noreferrer"&gt;hdu 2188题目链接&lt;/a&gt;&lt;/p&gt;
&lt;p&gt;题意＆思路：巴什博奕。。画n点p点。。。&lt;/p&gt;</description></item></channel></rss>