UVa 755 487--3279

原创 2015年07月10日 14:47:30

Description


Businesses like to have memorable telephone numbers. One way to make a telephone number memorable is to have it spell a memorable word or phrase. For example, you can call the University of Waterloo by dialing the memorable TUT-GLOP. Sometimes only part of the number is used to spell a word. When you get back to your hotel tonight you can order a pizza from Gino's by dialing 310-GINO. Another way to make a telephone number memorable is to group the digits in a memorable way. You could order your pizza from Pizza Hut by calling their ``three tens'' number 3-10-10-10.


The standard form of a telephone number is seven decimal digits with a hyphen between the third and fourth digits (e.g. 888-1200). The keypad of a phone supplies the mapping of letters to numbers, as follows:


A, B, and C map to 2

D, E, and F map to 3

G, H, and I map to 4

J, K, and L map to 5

M, N, and O map to 6

P, R, and S map to 7

T, U, and V map to 8

W, X, and Y map to 9


There is no mapping for Q or Z. Hyphens are not dialed, and can be added and removed as necessary. The standard form of TUT-GLOP is 888-4567, the standard form of 310-GINO is 310-4466, and the standard form of 3-10-10-10 is 310-1010.


Two telephone numbers are equivalent if they have the same standard form. (They dial the same number.)


Your company is compiling a directory of telephone numbers from local businesses. As part of the quality control process you want to check that no two (or more) businesses in the directory have the same telephone number.

Input 

The first line of the input contains the number of datasets in the input. A blank line follows. The first line of each dataset specifies the number of telephone numbers in the directory (up to 100,000) as a positive integer alone on the line. The remaining lines list the telephone numbers in the directory, with each number alone on a line. Each telephone number consists of a string composed of decimal digits, uppercase letters (excluding Q and Z) and hyphens. Exactly seven of the characters in the string will be digits or letters. There's a blank line between datasets.

Output 

Generate a line of output for each telephone number that appears more than once in any form. The line should give the telephone number in standard form, followed by a space, followed by the number of times the telephone number appears in the directory. Arrange the output lines by telephone number in ascending lexicographical order. If there are no duplicates in the input print the line:

No duplicates.

Print a blank line between datasets.

Sample Input 

1

12
4873279
ITS-EASY
888-4567
3-10-10-10
888-GLOP
TUT-GLOP
967-11-11
310-GINO
F101010
888-1200
-4-8-7-3-2-7-9-
487-3279

Sample Output 

310-1010 2
487-3279 4
888-4567 3



Miguel A. Revilla
2000-02-09

输入T,后面跟着T个输入块。

每个输入块第一行输入N,后面跟着N个电话号码,电话号码由数字字母和“-”组成。

通过给出的字母映射表把字母转化为数字,并去除多余的“-”,最后输出的电话格式为xxx-xxxx。

统计相同号码出现的次数,输出重复的电话号码及出现次数,按电话号码的数字排序。

若全部没有重复,输出一行表示没有重复。

每个输入块对应的输出块之间有一个空行。


基本的字符串处理,使用了cctype中判断数字字母的方法。

然后使用map存入,键值为电话号码,值为次数,自带排序。


#include <iostream>
#include <cstdio>
#include <cstring>
#include <map>
#include <cctype>           //包含isdigit()和isalpha()方法
using namespace std;

map<string,int> m;
char p[10];
char str[100];

//字母所对应的数字的映射
char let2num[26] = {'2', '2', '2', '3', '3', '3', '4', '4', '4',
                '5', '5', '5', '6', '6', '6', '7', '7', '7',
                '7', '8', '8', '8', '9', '9', '9', '9'};

int main(){
//freopen("test.in","rt",stdin);
    int t,n,i,j;
    cin >>t;
    while(t--){
        cin >>n;
        int flag = 0;   //记录是否有重复的号码
        m.clear();
        for(i = 0;i < n;i++){
            cin >>str;
            int len = strlen(str);
            int cnt = 0;
            p[3] = '-';
            for(j = 0;j < len;j++){
                if(cnt == 3){           //电话号码格式固定第4个为“-”
                    cnt ++;
                }
                if(isdigit(str[j])){        //若为数字,则不变
                    p[cnt++] = str[j];
                }
                else if(isalpha(str[j]) && (str[j] != 'Q'|| str[j] != 'Z')){    //将除Q,Z外的字母转换为数字
                    p[cnt++] = let2num[str[j] - 'A'];
                }
            }
            string phone(p);    //构造字符串
            if(m.count(phone)){    //记录判断次数及将其插入map中
                m[phone]++;
            }
            else{
                m[phone] = 1;
            }
        }
        for(map<string,int>::iterator it = m.begin();it != m.end();++it){     //迭代器遍历map输出
            if(it->second > 1){                                                //只输出重复的电话号码,若有重复则flag = 1;
                cout <<it->first <<" " <<it->second <<endl;
                flag = 1;
            }
        }
        if(!flag){                          //当没有重复时输出 No duplicates.
            cout <<"No duplicates." <<endl;
        }
        if(t != 0){                         //输出块之间的空行
            cout <<endl;
        }
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

相关文章推荐

POJ 1002 UVA 755 487--3279 电话排序 简单但不容易的水题

题意:给你许多串字符串,从中提取电话号码,输出出现复数次的电话号码及次数。 以下是我艰难的AC历程:(这题估计是我刷的题目题解次数排前的了。。。) 题目不是很难理解,刚开始想到用map,但stl的ma...
  • hcbbt
  • hcbbt
  • 2013年07月31日 10:30
  • 1853

uva 755 poj 1002 487-3279

题意: 给一堆只有数字  大写字母除(Q,Z)外和字符‘-’    组成的字符串    他们的标准形式是如   123-1234   最后要求判断标准形式是否与重复的电话号码   有重复的输出标准形式...

UVA 755 487-3279

这写的跑得真慢,不过还是过了。。 #include #include #include #include #include #include #include #incl...
  • cfzjxz
  • cfzjxz
  • 2012年09月01日 21:20
  • 1120

UVa 755 - 487--3279 Or Poj 1002

UVa上没法提交这题,就去了Poj, poj上提交要略微修改。 方法一:电话号码转换为数字后排序。 #include #include #include #include using na...
  • cugfjp
  • cugfjp
  • 2013年07月26日 20:38
  • 303

uva 755 - 487--3279

487-3279  Businesses like to have memorable telephone numbers. One way to make a telephone ...

UVa 755 - 487--3279

487-3279 Businesses like to have memorable telephone numbers. One way to make a telephone...

UVa755 487-3279

487-3279  Businesses like to have memorable telephone numbers. One way to make a telephon...

uva 755/poj 1002 487-3279

一道简单题目,在uva上提交一直submission error,最后在poj上找到了一样的题目,数据的读入方式有些不一样,下面的代码是poj1002的代码: #include #include ...

UVa 755 / POJ 1002 - 487-3279

本题需注意以下三点: 1、读入的字符串可能包含多个“-”,如果开数组到10明显不够,尽量开到30以上 2、只输出出现多于1次的电话号码 3、没有符合条件的电话号码时要输出...

排序/查找 755-487-3279

487-3279  Businesses like to have memorable telephone numbers. One way to make a telephone numb...
  • SIOFive
  • SIOFive
  • 2013年07月15日 14:25
  • 592
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:UVa 755 487--3279
举报原因:
原因补充:

(最多只允许输入30个字)