@@ -0,0 +1,950 @@
+package boj_1037;%0A%0Aimport java.io.BufferedReader;%0Aimport java.io.InputStreamReader;%0Aimport java.util.StringTokenizer;%0A%0A/**%0A * %EB%B0%B1%EC%A4%80 %EC%98%A8%EB%9D%BC%EC%9D%B8 %EC%A0%80%EC%A7%80 1037%EB%B2%88 (%EC%95%BD%EC%88%98) %EB%AC%B8%EC%A0%9C%ED%92%80%EC%9D%B4%0A *%0A * @see https://www.acmicpc.net/problem/1037%0A * @author devetude%0A */%0Apublic class Main %7B%0A%09public static void main(String args%5B%5D) throws Exception %7B%0A%09%09// %EB%B2%84%ED%8D%BC%EB%A5%BC %ED%86%B5%ED%95%B4 %EC%9E%85%EB%A0%A5 %EA%B0%92%EC%9D%84 %EB%B0%9B%EC%9D%8C%0A%09%09BufferedReader br = new BufferedReader(new InputStreamReader(System.in));%0A%09%09int divisorsLen = Integer.parseInt(br.readLine());%0A%09%09StringTokenizer st = new StringTokenizer(br.readLine(), %22 %22);%0A%0A%09%09// %EA%B0%80%EC%9E%A5 %ED%81%B0 %EC%95%BD%EC%88%98%EC%99%80 %EA%B0%80%EC%9E%A5 %EC%9E%91%EC%9D%80 %EC%95%BD%EC%88%98 %EB%B3%80%EC%88%98%0A%09%09int minDivisor = Integer.MAX_VALUE;%0A%09%09int maxDivisor = Integer.MIN_VALUE;%0A%0A%09%09// %EB%A3%A8%ED%94%84%EB%A5%BC %EB%8F%8C%EB%A9%B0 %EA%B0%80%EC%9E%A5 %ED%81%B0 %EC%95%BD%EC%88%98%EC%99%80 %EA%B0%80%EC%9E%A5 %EC%9E%91%EC%9D%80 %EC%95%BD%EC%88%98%EB%A5%BC %EA%B5%AC%ED%95%A8%0A%09%09for (int i = 0; i %3C divisorsLen; i++) %7B%0A%09%09%09int divisor = Integer.parseInt(st.nextToken());%0A%0A%09%09%09minDivisor = Math.min(minDivisor, divisor);%0A%09%09%09maxDivisor = Math.max(maxDivisor, divisor);%0A%09%09%7D%0A%0A%09%09br.close();%0A%0A%09%09// %EA%B2%B0%EA%B3%BC %EA%B0%92 %EC%B6%9C%EB%A0%A5 (%EA%B0%80%EC%9E%A5 %ED%81%B0 %EC%95%BD%EC%88%98%EC%99%80 %EA%B0%80%EC%9E%A5 %EC%9E%91%EC%9D%80 %EC%95%BD%EC%88%98%EC%9D%98 %EA%B3%B1)%0A%09%09System.out.println(minDivisor * maxDivisor);%0A%09%7D%0A%7D

add problem 1037