[백준] 28445 알록달록 앵무새 - Data Structure / Java

• 문제 링크

28445번: 알록달록 앵무새

 

• 풀이 코드

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Set;
import java.util.StringTokenizer;
import java.util.TreeSet;

public class Main {

    public static void main(String[] args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
        StringBuilder sb = new StringBuilder();

        Set<String> set = new TreeSet<>();
        for (int i = 0; i < 2; i++) {
            StringTokenizer st = new StringTokenizer(br.readLine());
            set.add(st.nextToken());
            set.add(st.nextToken());
        }

        for (String a : set)
            for (String b : set)
                sb.append(a).append(" ").append(b).append("\n");

        bw.write(sb.toString());
        bw.flush();
    }

}