BEAKJOON JAVA ALGORITHM #3040(백설공주)

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

import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; import java.util.Scanner; public class a3040 { public static void main(String[] args) throws NumberFormatException, IOException { int[] a=new int[9]; int sum=0; BufferedReader br=new BufferedReader(new InputStreamReader(System.in)); //Scanner sc=new Scanner(System.in); for(int i=0;i<9;i++){ //a[i]=sc.nextInt(); a[i]=Integer.parseInt(br.readLine()); sum+=a[i]; } sum-=100; for(int i=0;i<8;i++){ for(int j=i+1;j<9;j++){ if(a[i]+a[j]==sum){ a[i]=a[j]=0; } } } for(int i=0;i<9;i++){ if(a[i]!=0) System.out.println(a[i]); } } }