POJ_1002

//输入
//格式化输入
//直接插入排序
//输出重复
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;
#define N 100000
int main(){
    int n,i,j,p,q,sum;
    string s;
    int b[N+1],temp;
    char c[100];
    
    scanf("%d",&n);
    for(i=0;i<n+1;i++){
        b[i] = 0;
    }
    i = 0;
    
    while(i<n){                                        
        scanf("%s",c);
        
        p = 7;
        q = 1000000;
        temp = 0;
        for(j=0;j<strlen(c)&&p>0;j++,p--,q/=10){    //对输入数据进行加工 
            if(c[j]==‘A‘||c[j]==‘B‘||c[j]==‘C‘){
                temp += 2*q;
            }
            else if(c[j]==‘D‘||c[j]==‘E‘||c[j]==‘F‘){
                temp += 3*q;
            }
            else if(c[j]==‘G‘||c[j]==‘H‘||c[j]==‘I‘){
                temp += 4*q;
            }
            else if(c[j]==‘J‘||c[j]==‘K‘||c[j]==‘L‘){
                temp += 5*q;
            }
            else if(c[j]==‘M‘||c[j]==‘N‘||c[j]==‘O‘){
                temp += 6*q;
            }
            else if(c[j]==‘P‘||c[j]==‘R‘||c[j]==‘S‘){        //没有Q 
                temp += 7*q;
            }
            else if(c[j]==‘T‘||c[j]==‘U‘||c[j]==‘V‘){
                temp += 8*q;
            }
            else if(c[j]==‘W‘||c[j]==‘X‘||c[j]==‘Y‘){        //没有Z 
                temp += 9*q;
            }
            else if(c[j]>=‘0‘&&c[j]<=‘9‘){
                temp += (c[j]-‘0‘)*q;
            }
            else{
                p++;
                q *= 10;
            }
        }
        b[i] = temp;
        //cout<<temp;
/*        j = i;
        while(temp<b[j]){
            b[j+1] = b[j];
            j--;
        }
        b[j+1] = temp;
        //cout<<temp<<" "<<j+1<<endl;
        for(j=1;j<=i;j++){
            cout<<b[j]<<" "<<j<<endl;
        }
*/        i++;
    }//while
    sort(b,b+n);
    b[n] = -1;
    
    p = 0;
    q = 1;
    sum = 0;
    while(q<n){
        while(b[q]==b[p]){
            q++;
        }
        if(q-p>1){
            printf("%03d-%04d %d\n",b[p]/10000,b[p]%10000,q-p);
            sum++;
        }
        p = q;
        q = q+1;
    }
    if(sum==0){
        printf("No duplicates.\n");
    }
 
/*
    for(i=1;i<=n;i++){
        cout<<b[i]<<" "<<endl;
    }
    for(i=1,j=0;i<=sum;i++){
        //if(duplicate[i]>1){
            p = b[i]/10000;
            q = b[i]%10000;
            cout<<p<<"-"<<q<<" "<<duplicate[i]<<endl;
            j++;
        }
    }
*/
    return 0;
}