POJ 2345 Central heating 高斯消元

n个人n个开关，每个人可以开或者关一些开关，选出一部分人，使得所有的开关都是开的。

package fd;

import java.util.Scanner;

public class Main {

	static void rank(int[][] A, int m, int n)
	{
		int i = 0, j = 0, k, r, u;
		while(i < m && j < n)
		{
			r = i;
			for(k = i; k < m; k++)
				if(A[k][j] == 1)
				{
					r = k;
					break;
				}
			if(A[r][j] == 1)
			{
				if(r != i)
					for(k = 0; k <= n; k++) {
						int tmp = A[r][k];
						A[r][k] = A[i][k];
						A[i][k] = tmp;
					}
				for(u = i+1; u < m; u++)
					if(A[u][j] == 1)
						for(k = i; k <= n; k++)
							A[u][k] ^= A[i][k];
				i++;
			}
			j++;
		}
		for(i = m-1; i >= 0; i--) {
			for(j = i-1; j >=0; j--) {
				A[j][n] ^= (A[i][n]&A[j][i]);
			}
		}
		int tmp = 0;
		for(i = 0; i < m; i++) {
			if(A[i][n] == 1) {
				if(tmp++ > 0) {
					System.out.print(" ");
				}
				System.out.print(i+1);
			}
		}
		if(tmp == 0) {
			System.out.print("No solution");
		}
		System.out.println();
	}
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[][] a = new int[n+1][n+2];
		for(int i = 0; i < n; i++) {
			int t;
			while(sc.hasNext()) {
				t = sc.nextInt();
				if(t == -1) {
					break;
				}
				a[t-1][i] = 1;
			}
			a[i][n] = 1;
		}
		rank(a, n, n);
	}
}