[SWEA] 1974. 스도쿠 검증_JAVA

https://swexpertacademy.com/main/code/problem/problemDetail.do?problemLevel=2&contestProbId=AV5Psz16AYEDFAUq&categoryId=AV5Psz16AYEDFAUq&categoryType=CODE&problemTitle=&orderBy=FIRST_REG_DATETIME&selectCodeLang=ALL&select-1=2&pageSize=10&pageIndex=2 

SW Expert Academy

 

행,열,블록 검사를 통해서 숫자가 겹치지 않으면 1을 출력해준다.

 

import java.util.Scanner;
import java.io.FileInputStream;
class Solution{
    public static void main(String args[]) throws Exception
    {
        Scanner sc = new Scanner(System.in);
        int T;
        T=sc.nextInt();
        int[][] board = new int[9][9];
        for(int test_case = 1; test_case <= T; test_case++)
        {
            int flag=1;
            //배열 입력
            for(int i=0;i<9;i++)
                for(int j=0;j<9;j++)
                    board[i][j]=sc.nextInt();
            //행, 열 검사하기
            for(int i=0;i<9;i++){
                int col=0;
                int row=0;
                for(int j=0;j<9;j++){
                    row += board[i][j];
                    col += board[j][i];
                }
                if(row!=45 || col !=45){
                    flag=0;
                    break;
                }
            }
 
            //flag가 0이면 블록 단위는 안봐도 패스
            if(flag==0){
                System.out.println("#" + test_case + " 0");
                continue;
            }
 
            //블록 검사하기
            for(int i=0;i<9;i+=3){
                for(int j=0;j<9;j+=3){
                    int sum=0;
                    for(int x=0;x<3;x++)
                        for(int y=0;y<3;y++)
                            sum+=board[x][y];
                        if(sum!=45){
                            flag=0;
                            break;
                        }
                }
                if(flag==0) break;
            }
            System.out.println("#" + test_case + " "+flag);
        }
    }
}