poj2965（门把手问题）

此题算是一个不太传统的广搜题，大致题意是：一个门有16个把手，‘+’代表关闭，‘-’代表打开，只有16个把手都打开，门才开，而且，这些个把手开关的时候需要遵循一个奇怪的原则就是，要转换某个把手的状态，则得同时改变它所在行和所在列的所有把手的状态，要求输出最少次数，及相应路径。

The Pilots Brothers' refrigerator

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 16517		Accepted: 6255		Special Judge

Description

The game “The Pilots Brothers: following the stripy elephant” has a quest where a player needs to open a refrigerator.

There are 16 handles on the refrigerator door. Every handle can be in one of two states: open or closed. The refrigerator is open only when all handles are open. The handles are represented as a matrix 4х4. You can change the state of a handle in any location [i, j] (1 ≤ i, j ≤ 4). However, this also changes states of all handles in row i and all handles in column j.

The task is to determine the minimum number of handle switching necessary to open the refrigerator.

Input

The input contains four lines. Each of the four lines contains four characters describing the initial state of appropriate handles. A symbol “+” means that the handle is in closed state, whereas the symbol “−” means “open”. At least one of the handles is initially closed.

Output

The first line of the input contains N – the minimum number of switching. The rest N lines describe switching sequence. Each of the lines contains a row number and a column number of the matrix separated by one or more spaces. If there are several solutions, you may give any one of them.

Sample Input

-+--
----
----
-+--

Sample Output

6
1 1
1 3
1 4
4 1
4 3
4 4

#include <stdio.h>

char str[8];
int map[5][5];

void count(int i, int j);
void result();
void output();

int main()
{
	int i, j;
	for(i=0; i<4; i++)
	{
		scanf("%s",str);//读入
		for(j=0; j<4; j++)
		{
			if(str[j] == '+')//遇到‘+’，进入count函数
				count(i,j);
		}
	}
	result();
	output();
	return 0;
}

void count(int i, int j)//把该位置所在的行列翻转，这里只记录翻转次数，并不实际翻转
{
	int k;
	for(k=0; k<4; k++)
	{
		map[i][k] ++;//对应一个map数组，记录翻转次数
		map[k][j] ++;
	}
	map[i][j] --;//map[i][j]多翻转一次，这里减一次
}

void result()//遍历map，如果是奇数次，则翻转，如果是偶数次，则相当于不用翻转
{
	int ans = 0;
	int i, j;
	for(i=0; i<4; i++)
	{
		for(j=0; j<4; j++)
		{
			if(map[i][j] % 2 == 1)
				ans ++;//累加翻转次数
		}
	}
	printf("%d\n",ans);
}

void output()//输出翻转路径
{
	int i, j;
	for(i=0; i<4; i++)
	{
		for(j=0; j<4; j++)
		{
			if(map[i][j] % 2 == 1)//如果需要翻转，则输出
				printf("%d %d\n",i + 1, j + 1);
		}
	}
}