알고리즘89 :: SWEA_스도쿠검증

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Solution {
 
    static int[][] map = {
            {1,1,1,2,2,2,3,3,3},
            {1,1,1,2,2,2,3,3,3},
            {1,1,1,2,2,2,3,3,3},
            {4,4,4,5,5,5,6,6,6},
            {4,4,4,5,5,5,6,6,6},
            {4,4,4,5,5,5,6,6,6},
            {7,7,7,8,8,8,9,9,9},
            {7,7,7,8,8,8,9,9,9},
            {7,7,7,8,8,8,9,9,9}     
    };
    public static void main(String[] args) throws Exception{
        // TODO Auto-generated method stub
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
     
        int total = Integer.parseInt(br.readLine());
        for(int a=1; a<=total; a++) {
        int[][] sdoku = new int[10][10];
        for(int i=0; i<9; i++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            for(int j=0; j<9; j++) {
                 
                sdoku[i][j] = Integer.parseInt(st.nextToken());
            }
        }//입력
         
         
        boolean flag = false;
        //가로
        int[] test;
        for(int i=0; i<9; i++) {
            test = new int[10];
            for(int j=0; j<9; j++) {
                test[sdoku[i][j]]+=1;
            }
            for(int j=1; j<10; j++) {
                if(test[j]>=2) {
                    flag = true;
                }
            }
        }
        //세로
        for(int i=0; i<9; i++) {
            test = new int[10];
            for(int j=0; j<9; j++) {
                test[sdoku[j][i]]+=1;
            }
            for(int j=1; j<10; j++) {
                if(test[j]>=2) {
                    flag = true;
                }
            }
        }
        //칸
        int cnt = 0; 
        for(int i=0; i<9; i++) {
            cnt += 1;
            test = new int[10];
            for(int j=0; j<9; j++) {
                for(int z=0; z<9; z++) {
                    if(map[j][z] == cnt) {
                        test[sdoku[j][z]]+=1;
                    }
                }
            }
            for(int j=1; j<10; j++) {
                if(test[j]>=2) {
                    flag = true;
                }
            }
        }
        if(flag == true)
            System.out.println("#"+a+" 0");
        else
            System.out.println("#"+a+" 1");
        }
    }
}