[완전탐색] 백준 10448 유레카 이론 JAVA

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class ES_3_10448 {
    static int[] triangleArr = new int[44];

    public static void main(String[] args) throws Exception{
            // [완전탐색] 10448 유레카 이론
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(br.readLine());
        int[] input = new int[n];
        for (int i = 0 ; i < n ; i++) {
            input[i] = Integer.parseInt(br.readLine());
        }

        // Tn 배열을 미리 만든다.
        for (int i = 1 ; i <= 44 ; i++) {
            int temp = i * (i+1) / 2;
            triangleArr[i-1] = temp;
        }

        for (int k : input) {
            System.out.println(eureka(k) ? 1 : 0);
        }

    }
    private static boolean eureka(int k) {
        for (int a = 0 ; a < 44 ; a++) {
            for (int b = 0 ; b < 44 ; b++) {
                for (int c = 0 ; c < 44 ; c++) {
                    if (k == triangleArr[a] + triangleArr[b] + triangleArr[c]) {
                        return true;
                    }

                }
            }
        }
        return false;
    }
}