poj 1830 开关问题

高斯消元解异或方程组

具体的可以参照大牛的博客

http://blog.csdn.net/cjoilmd/article/details/6449566

#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;
int a[35][35], str[35], end[35];
int n;
int gauss()
{
  int i, j, k;
   int max_r, col;
   col = 1;
   for(k=1; k<=n &&col<=n; k++, col++)
   	 {
   	 	max_r = k;
   	 	for(i=k+1; i<=n; i++)
   	 	  if(abs(a[i][col]) > abs(a[max_r][col]))
   	 	  	max_r = i;
   	 	if(a[max_r][col] == 0)
   	 	   {
   	 	   	k--;
   	 	   	continue;
   	 	   }
   	 	if(max_r != k)
   	 	  for(j=col; j<=n+1; j++)
   	 	  	swap(a[max_r][j], a[k][j]);
   	 	for(i=k+1; i<=n; i++)
   	 	  if(a[i][col])
   	 	  	for(j=col; j<=n+1; j++)
   	 	  	  a[i][j] ^= a[k][j];
   	 }
   	for(i=k; i<=n; i++)
   	  if(a[i][n+1])
   	  	return -1;
   	return 1<<(n-k+1);
}
int main()
{
	int t;
	scanf("%d", &t);
	while(t--)
	  {
	  	scanf("%d", &n);
	  	for(int i=1; i<=n; i++)
	  	  for(int j=1; j<=n+1; j++)
	  	  	a[i][j] = 0;
	  	for(int i=1; i<=n; i++)
	  	  scanf("%d", &str[i]);
	  	for(int i=1; i<=n; i++)
	  	  {
            scanf("%d", &end[i]);
            a[i][n+1] = str[i]^end[i];
            a[i][i] = 1;
	  	  }
	  	int i, j;
	  	while(scanf("%d %d", &i, &j), i, j)
	  	  a[j][i] = 1;
	  	int ans = gauss();
	  	if(ans == -1)
	  	   printf("Oh,it's impossible~!!\n");
	  	else
	  	   printf("%d\n", ans); 
	  }
	return 0;
}