poj 字符串相关之1002 487-3279

poj 字符串相关之1002 487-3279
map

#include<iostream>
#include<cstring>
#include<string>
#include<cstdio>
#include<math.h>
#include<algorithm>
#include<vector>
#include<queue>
#include<map>
using namespace std;
int N;
char res[20], str[300];
char TONumber[26] = {'2', '2', '2', '3', '3', '3','4', '4', '4', '5', '5', '5', '6', '6', '6', '7', '0', '7', '7', '8', '8', '8', '9', '9', '9', '0' }; 
map<string, int>mp;
int main()
{
    freopen("1.txt", "r", stdin);
    int i, j, k, t;
    scanf("%d", &N);
    for (i = 0; i < N; i++)
    {
        scanf("%s", str);
        t = 0;
        for (j = 0; j < strlen(str); j++)
        {
            if (str[j] >= 'A'&&str[j] <= 'Z')
                res[t++] = TONumber[str[j] - 'A'];
            else if (str[j] >= '0'&&str[j] <= '9')
                res[t++] = str[j];
        }
        for (j = 7; j >= 4; j--)
            res[j] = res[j - 1];
        res[3] = '-';
        string tmp(res, 8);
        if (mp[tmp])
            mp[tmp]++;
        else
            mp[tmp] = 1;
    }
    k = 0;
    map<string, int>::iterator iter = mp.begin();
    for (; iter != mp.end(); iter++)
    {
        if (iter->second > 1)
        {
            cout << iter->first << " " << iter->second << endl;
            k++;
        }
    }
    if (!k)
        printf("No duplicates.\n");


}