acm 北大 1002 487-3279 java版

import java.util.Map;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeMap;

public class Main01 {
/**
*
* @param args
* 11788K 6157MS Java 1280B
*/

public static void main(String[] args) {
Scanner sin = new Scanner(System.in) ;
int sum = sin.nextInt() ;
String temp ;
boolean has = false ;
Map<String ,Integer> map = new TreeMap<String ,Integer>() ;
for(int i=0 ;i<sum ;i++){
temp = sin.next() ;
temp = temp.replace("-", "") ;
char[] c = temp.toCharArray() ;
for(int j=0 ;j<c.length ;j++){
char c1 = c[j] ;
if(Character.isUpperCase(c1)){
int w = (int)c1 ;
if(w<=80){
c[j] = (char)(((w-65)/3+2)+48) ;
}else{
c[j] = (char)(((w-81)/3+7)+48) ;
}
}
}
String temps = new String(c) ;
if (map.containsKey(temps)) {
int count = map.get(temps) + 1;
map.put(temps, count);
} else {
map.put(temps, 1);
}
}
Set<String> set = map.keySet() ;
for(String skey : set){
if(map.get(skey)!=1){
has = true ;
System.out.println(skey.substring(0,3)+"-"+skey.substring(3)+" "+map.get(skey)) ;
}
}
if(!has){
System.out.println("No duplicates.");
}
}
}