Submission #757664

---

Source Code Expand

import std.stdio;
import std.conv;
import std.string;
import std.bigint;
 
BigInt det(BigInt[][] a) {
	ulong size = a.length;
	int sign = 1;
	BigInt pivot = 1;
	for(int k = 0;k < size;k++){
		BigInt previous_pivot = pivot;
		pivot = a[k][k];
		if(pivot == 0){
			bool flag = true;
			int row;
			for(row = k+1;row < size;row++)
				if(a[row][k] != 0) {
					flag = false;
					break;
				}
			if(flag) return to!(BigInt)(0);
			BigInt[] temp = a[row];
			a[row] = a[k];
			a[k] = temp;
			pivot = a[k][k];
			sign = - sign;
		}
		for(int i = k+1;i < size;i++) {
			BigInt[] ai = a[i];
			for(int j = k+1;j < size;j++) {
				ai[j] = ( pivot * ai[j] - ai[k] * a[k][j] ) / previous_pivot;
			}
		}
	}
	return sign * pivot;
}
 
void main(){
	int n = to!(int)(chomp(readln()));
	BigInt[][] a;
	a.length = n;
	for(int i = 0;i < n;i++){
		a[i].length = n;
		string s = readln();
		for(int j = 0;j < n;j++) a[i][j] = s[j] - 48;	
	}
	BigInt det = det(a);
	if(det % 2 == 0) writeln("Even");
	else writeln("Odd");
}

Submission Info

Judge Result