9375번_패션왕 신해빈_java

의상종류(상의, 신발...) 당 선택가능한 케이스는 그 의상의 케이스+1(해당 의상종류 미선택)   
의상을 입을 수 있는 케이스는 각 의상 종류의 케이스+1의 곱들에 1을 뺀 값(모두 미선택 할 경우)   
1번 테스트 케이스의 경우 아래의 표와 같이 총 6개의 케이스 중에서 모두 미선택 하는 경우만 빠짐   
(eyewear 종류+1) * (headgear 종류+1) - 1 = 2 * 3 - 1 = 5

eyewear	headgear
x	x
x	hat
x	turban
sunglasses	x
sunglasses	hat
sunglasses	turban

● 소스

package acmicpc;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.HashMap;
import java.util.Map;

public class acmicpc9375 {
	public static void main(String[] agrs) {
		try {
			BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
			BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
			
			int num = Integer.parseInt(reader.readLine());
			for(int i=0; i<num; i++) {
				int n = Integer.parseInt(reader.readLine());
				Map<String, Integer> map = new HashMap<>();
				for(int j=0; j<n; j++) {
					String strArr[] = reader.readLine().split(" ");
					String key = strArr[1];
					
					if(map.containsKey(key)) {
						map.put(key, map.get(key)+1); 
					} else {
						map.put(key, 1);
					}
				}
				
				int cnt = 1;
				for(String key : map.keySet()) {
					cnt = cnt * (map.get(key)+1);
				}
				writer.append(String.valueOf(cnt-1)+"\n");
			}
			
			writer.flush();
			writer.close();
		} catch (Exception e) {
			
		}
	}
}