[SWEA] 7985. Rooted Binary Tree 재구성_JAVA

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

SW Expert Academy

 

 

import java.util.Scanner;
class Solution{
    public static void main(String args[]) throws Exception{
        Scanner sc = new Scanner(System.in);
        int T;
        T=sc.nextInt();
        for(int test_case = 1; test_case <= T; test_case++) {
            int k=sc.nextInt();
            int n=(int)Math.pow(2,k)-1;
            int arr[]=new int[n];
            for(int i=0;i<n;i++){
                arr[i]=sc.nextInt();
            }
            System.out.print("#"+test_case+" ");
            while(k>0){
                for(int i=(int)Math.pow(2,k-1)-1;i<n; i+=Math.pow(2,k)){
                    System.out.print(arr[i]+" ");
                }
                k--;
                System.out.println();
            }
        }
    }
}