deep_lee 2022. 11. 8. 19:42

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV7GLXqKAWYDFAXB 

 

SW Expert Academy

SW ν”„λ‘œκ·Έλž˜λ° μ—­λŸ‰ 강화에 도움이 λ˜λŠ” λ‹€μ–‘ν•œ ν•™μŠ΅ 컨텐츠λ₯Ό ν™•μΈν•˜μ„Έμš”!

swexpertacademy.com

 


 

아직 κ·Έλ¦Όλ¬Έμ œμ— μ΅μˆ™ν•˜μ§€ μ•Šμ€λ°, 

κ³ λ―Όν•˜λ‹€κ°€ λ§ˆλ¦„λͺ¨λ₯Ό λ‚˜λˆ μ„œ κ΅¬ν•˜λ©΄ λœλ‹€.

 

κ°€μš΄λ° κ°€λ‘œμ€„μ„ ν¬ν•¨ν•˜μ—¬ 상단, 그리고 ν•˜λ‹¨μ˜ μ‚Όκ°ν˜• λΆ€λΆ„.

 

 

import java.util.Scanner;
class Solution{
    public static void main(String args[]) throws Exception{
        
         Scanner kb = new Scanner(System.in);
        int t = kb.nextInt();
        for (int test_case = 1; test_case <= t; test_case++) {
            int n=kb.nextInt();
            int[][] arr=new int[n][n];
            for(int i=0; i<n; i++){
                String str=kb.next();
                for(int j=0; j<n; j++){
                    arr[i][j]=str.charAt(j)-'0';
                }
            }
            int sum=0;
            // 쀑간뢀 ~ 상단 
            for(int i=0; i<=n/2; i++){
                for(int j=n/2-i; j<=n/2+i; j++){
                    sum+=arr[i][j];
                }
            }
            // μ€‘κ°„λΆ€μ œμ™Έ ~ ν•˜λ‹¨ μ‚Όκ°ν˜•
            int a=1; // aλŠ” ν–‰μ˜ μ‹œμž‘μ  ( 점점 ++ )
            for(int i=n/2+1; i<n; i++){
                for(int j=a; j<=n-1-a; j++){ // jλŠ” ν–‰μ˜ 끝점 ( 점점 -- )
                    sum+=arr[i][j];
                }
                a++;
            }
            System.out.println("#" + test_case +" "+sum);
        }
    }
}