题意概括：你已经赢得两局，最后一局是N个棋子往后移动，最后一个无法移动的玩家失败。 题目分析：有向无环图sg值游戏，尼姆游戏的抽象表达。得到每个棋子的sg值之后，把他们异或起来，考察异或值是否为0. 1 #include "cstdio" 2 int figure[1004][1004]; 3 in ...
分类：
其他好文 时间：
2016-08-06 19:02:21
阅读次数：
96
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 topological graph, i.e. there are directed edges connecting so...
分类：
其他好文 时间：
2015-03-01 13:14:04
阅读次数：
294
