摘要:
用dfs搜索每种情况所对应的sg值(这里也就是对应的是N位还是P位),若下一步为P位,则当前一步为N位。。。代码:#include <iostream>#include <cstdio>using namespace std;const int N = 55;char map[N][N];int m, n;int judge(int i, int j){ if(map[i][j] == '0' && map[i][j+1] == '0' && map[i+1][j] == '0' & 阅读全文