BEAKJOON JAVA ALGORITHM #11403(경로찾기)

https://www.acmicpc.net/problem/11403

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Stack; import java.util.StringTokenizer; public class a11403 { public static void main(String[] args) throws NumberFormatException, IOException { BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); int num=Integer.parseInt(br.readLine()); int[][] arr1=new int[num+1][num+1]; int[][] arr2=new int[num+1][num+1]; boolean[][] b=new boolean[num+1][num+1]; boolean flag; for(int i=1;i<=num;i++){ StringTokenizer token=new StringTokenizer(br.readLine()); for(int j=1;j<=num;j++){ arr1[i][j]=Integer.parseInt(token.nextToken()); arr2[i][j]=0; } } Stack<Integer> s=new Stack<>(); for(int i=1;i<=num;i++){ s.push(i); while(!s.isEmpty()){ int v=s.peek(); flag=false; for(int j=1;j<=num;j++){ if(arr1[v][j]==1 && !b[i][j]){ s.push(j); arr2[i][j]=1; b[i][j]=true; flag=true; break; } } if(!flag){ s.pop(); } } } for(int i=1;i<=num;i++){ for(int j=1;j<=num;j++){ System.out.print(arr2[i][j]+" "); } System.out.println(); } } }