51Nod-1605-棋盘问题

ACM模版

描述

题解

这是我见过最感人的博弈论题目……无需多谈，规律十分明显~~~

代码

#include <iostream>

using namespace std;

//const int MAXN = 105;

int main(int argc, const char * argv[])
{
//    freopen("/Users/zyj/Desktop/input.txt", "r", stdin);

    int T;
    cin >> T;

    int n, m;
    int sqare;
    while (T--)
    {
        cin >> n >> m;
        int res = 0;
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cin >> sqare;
                if (sqare == 1)
                {
                    res++;
                }
            }
        }

        if (res % 2)
        {
            cout << "yadang\n";
        }
        else
        {
            cout << "xiawa\n";
        }
    }

    return 0;
}