蘑菇--走在通往梦想的道路上。

转载http://blog.youkuaiyun.com/ACM_cxlove?viewmode=contents    by---cxlove首先当然要献上一些非常好的学习资料：基础博弈的小结：http://blog.youkuaiyun.com/acm_cxlove/article/details/7854530经典翻硬币游戏小结：http://blog.youkuaiyun.com/acm_cxlo

解题思路：通过打表发现，当x % 4 == 0 的时候SG值为x - 1，当x % 4 == 3的时候SG值为x + 1，其他时候SG值为x；//AC代码#include #include #include #include #include #include #include #include using namespace std;const int MAXN =

解题思路：打表，发现是一个带尾巴的循环，找循环节，34；#include #include #include #include #include #include #include #include using namespace std;const int MAXN = 1000 + 10;int vis[MAXN];int SG[MAXN];int mex(in

Problem Description:Aekdycoin and abcdxyzk are playing a game. They get a circle chain with some beads. Initially none of the beads is painted. They take turns to paint the chain. In Each turn one p

Problem Description:Tang and Jiang are good friends. To decide whose treat it is for dinner, they are playing a game. Specifically, Tang and Jiang will alternatively write numbers (integers) on a wh

解题思路：博弈问题不会出现平局，若右下角为0，先手永远也不可能赢。所以右下角为0先手输，右下角为1后手输#include #include #include #include using namespace std;const int MAXN = 100 + 10;int N, M;int m[MAXN][MAXN];int main(){ int T; scanf

Problem Description:Let's design a new chess game. There are N positions to hold M chesses in this game. Multiple chesses can be located in the same position. The positions are constituted as a topo