• 문제 링크
https://www.acmicpc.net/problem/1159
• 풀이 코드
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.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<Character> set = new TreeSet<>();
        int[] arr = new int[123];
        char i;
        int n = Integer.parseInt(br.readLine());
        while (n-- > 0) if (++arr[i = br.readLine().charAt(0)] > 4) set.add(i);
        if (set.isEmpty()) sb.append("PREDAJA");
        else for (char c : set) sb.append(c);
        bw.write(sb.toString());
        bw.flush();
    }
}'Problem Solving > Baekjoon' 카테고리의 다른 글
| [백준] 1292 쉽게 푸는 문제 - Implementation / Java (0) | 2024.08.29 | 
|---|---|
| [백준] 1076 저항 - Implementation / Java (0) | 2024.08.28 | 
| [백준] 1100 하얀 칸 - Implementation / Java (0) | 2024.08.26 | 
| [백준] 30068 Stovėjimo aikštelė - Data Structure / Java (0) | 2024.08.25 | 
| [백준] 29934 Important Messages - Data Structure / Java (0) | 2024.08.24 | 
 
										
									 
										
									 
										
									 
										
									
댓글