java 7-4 判断上三角矩阵(PTA)

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
		// TODO Auto-generated method stub
		int t,n,i,j,k;
		
		int [][]a=new int[10][10];
		
		Scanner scanner=new Scanner(System.in);
		  t = scanner.nextInt();
		int count=0;
	
		int []b=new int[100];//记录判断记录
		for( i=0;i<100;i++) {
			b[i]=0;
		}
		for(k=0; k<t; k++){
			//读入矩阵 
			
			 n = scanner.nextInt();
			for(i=0; i<n; i++){
				for(j=0; j<n; j++){
						
					 a[i][j]=scanner.nextInt();
				}		
			}
			//判断矩阵 
			for(i=0; i<n; i++){
				for(j=0; j<n; j++){
					if(i>j && a[i][j] != 0){
						count++;
					}
				}		
			}
			if(count==0 ){
	    		b[k] = 1;
	    	}else{
	    		b[k] = 0;
	    	}
	    	count=0;		
		}
		for(k=0; k<t; k++){
			if(b[k]==1){
				System.out.printf("YES\n");
			}else{
				System.out.printf("NO\n");
			} 
		}
	}
}