poj2965

放到枚举里面了，拿位运算做比较方便。

#include <iostream>

using namespace std;

#define ROW 4

int main()
{
    bool HANDLES[ROW][ROW] = {false};
    char handle;
    for(int i = 0; i < ROW; ++i)
    {
        for(int j = 0; j < ROW; ++j)
        {
            cin >> handle;
            if(handle == ‘+‘)
            {
                HANDLES[i][j] = !HANDLES[i][j];
                for(int k = 0; k < ROW; ++k)
                {
                    HANDLES[i][k] = !HANDLES[i][k];
                    HANDLES[k][j] = !HANDLES[k][j];
                }
            }
        }
    }
    int result = 0;
    for(int i = 0; i < ROW; ++i)
    {
        for(int j = 0; j < ROW; ++j)
        {
            if(HANDLES[i][j])
            {
                ++result;
            }
        }
    }
    cout << result << endl;
    for(int i = 0; i < ROW; ++i)
    {
        for(int j = 0; j < ROW; ++j)
        {
            if(HANDLES[i][j])
            {
                cout << i + 1 << " " << j + 1 << endl;
            }
        }
    }
    return 0;
}

poj2965

原文：http://blog.csdn.net/zhengnanlee/article/details/18399761