[백준] 21180 Reconstruct Sum - Brute Force / Java

• 문제 링크

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

 

• 풀이 코드

import java.io.BufferedWriter;
import java.io.IOException;
import java.io.OutputStreamWriter;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        int[] arr = new int[read()];
        int sum = 0;
        for (int i = 0; i < arr.length; i++) sum += arr[i] = read();

        String s = "BAD";
        for (int i : arr) {
            if (sum - i != i) continue;
            s = String.valueOf(i);
            break;
        }

        bw.write(s);
        bw.flush();
    }

    private static int read() throws IOException {
        int c, n = System.in.read() & 15;
        boolean flag = n == 13;

        if (flag) n = System.in.read() & 15;
        while ((c = System.in.read()) > 32) n = (n << 3) + (n << 1) + (c & 15);

        return flag ? ~n + 1 : n;
    }

}