https://blog.youkuaiyun.com/Terry__Jzh-cnhttps://blog.youkuaiyun.com/https://blog.youkuaiyun.com/Terry__J/article/details/7541891https://blog.youkuaiyun.com/Terry__J/article/details/7541891Terry__JMon, 07 May 2012 12:27:23 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7462538https://blog.youkuaiyun.com/Terry__J/article/details/7462538Terry__JSun, 15 Apr 2012 12:13:41 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7457758https://blog.youkuaiyun.com/Terry__J/article/details/7457758Terry__JFri, 13 Apr 2012 14:27:57 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7454788https://blog.youkuaiyun.com/Terry__J/article/details/7454788Terry__JThu, 12 Apr 2012 17:26:36 +0800 q; int main() { int n, k; while (scanf("%d %d", &n, &k)]]>https://blog.youkuaiyun.com/Terry__J/article/details/7445047https://blog.youkuaiyun.com/Terry__J/article/details/7445047Terry__JTue, 10 Apr 2012 13:47:30 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7435769https://blog.youkuaiyun.com/Terry__J/article/details/7435769Terry__JSat, 07 Apr 2012 18:41:38 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7425923https://blog.youkuaiyun.com/Terry__J/article/details/7425923Terry__JWed, 04 Apr 2012 16:54:35 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7422038https://blog.youkuaiyun.com/Terry__J/article/details/7422038Terry__JMon, 02 Apr 2012 17:59:42 +0800 dp[i](0 #include #include #include #include using namespace std; const i]]>https://blog.youkuaiyun.com/Terry__J/article/details/7421666https://blog.youkuaiyun.com/Terry__J/article/details/7421666Terry__JMon, 02 Apr 2012 14:57:19 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7421087https://blog.youkuaiyun.com/Terry__J/article/details/7421087Terry__JMon, 02 Apr 2012 09:30:57 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7420367https://blog.youkuaiyun.com/Terry__J/article/details/7420367Terry__JSun, 01 Apr 2012 20:23:58 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7417062https://blog.youkuaiyun.com/Terry__J/article/details/7417062Terry__JSat, 31 Mar 2012 20:28:10 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7416164https://blog.youkuaiyun.com/Terry__J/article/details/7416164Terry__JSat, 31 Mar 2012 16:06:57 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7415108https://blog.youkuaiyun.com/Terry__J/article/details/7415108Terry__JSat, 31 Mar 2012 12:15:16 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7415063https://blog.youkuaiyun.com/Terry__J/article/details/7415063Terry__JSat, 31 Mar 2012 12:08:28 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7408766https://blog.youkuaiyun.com/Terry__J/article/details/7408766Terry__JThu, 29 Mar 2012 20:45:17 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7404832https://blog.youkuaiyun.com/Terry__J/article/details/7404832Terry__JWed, 28 Mar 2012 21:47:34 +08002时，Bob都有必胜的策略。当n为偶数时，Bob选取与Alice相同的硬币数，且与Alice中心对称即可；若n为奇数，Bob只在第一次选取与Alice不通数目的硬币，其他次相同，仍是中心对称即可。 #include #include #include using namespace std; int main() { int n]]>https://blog.youkuaiyun.com/Terry__J/article/details/7403923https://blog.youkuaiyun.com/Terry__J/article/details/7403923Terry__JWed, 28 Mar 2012 17:56:49 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7400410https://blog.youkuaiyun.com/Terry__J/article/details/7400410Terry__JTue, 27 Mar 2012 20:51:09 +0800https://blog.youkuaiyun.com/Terry__J/article/details/7398435https://blog.youkuaiyun.com/Terry__J/article/details/7398435Terry__JTue, 27 Mar 2012 12:50:00 +0800