• 문제 링크
https://www.acmicpc.net/problem/1411
• 풀이 코드
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;
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));
int[] arr = new int[Integer.parseInt(br.readLine())];
for (int i = 0; i < arr.length; i++) arr[i] = convert(br.readLine());
int cnt = 0;
for (int i = 0; i < arr.length; i++) for (int j = i + 1; j < arr.length; j++) if (arr[i] == arr[j]) cnt++;
bw.write(String.valueOf(cnt));
bw.flush();
}
private static int convert(String s) {
Map<Character, Integer> map = new HashMap<>();
int i = 1, sum = 0;
for (char c : s.toCharArray()) {
if (!map.containsKey(c)) map.put(c, i++);
sum = sum * 10 + map.get(c);
}
return sum;
}
}
'Problem Solving > Baekjoon' 카테고리의 다른 글
[백준] 14040 Hidden Palindrome - Brute Force / Java (0) | 2025.06.28 |
---|---|
[백준] 33171 いずれか片方 (Either, but Not Both) - Brute Force / Java (0) | 2025.06.27 |
[백준] 14782 Bedtime Reading, I - Brute Force / Java (0) | 2025.06.25 |
[백준] 3077 임진왜란 - Data Structure / Java (0) | 2025.06.24 |
[백준] 33094 Diet Plan - Data Structure / Java (0) | 2025.06.23 |
댓글