zoukankan      html  css  js  c++  java
  • POJ 1002 487-3279

    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 306973   Accepted: 54856

    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 input will consist of one case. The first line of the input 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. 

    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. 

    Sample Input

    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

    Source

    #include<map>
    #include<cstdio>
    #include<cstring>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    map<char,int>ma;
    int n,i,j,d,s;
    char str[100];
    int a[10000000];
    int swap(char a) {
        if(a>='A'&&a<='C')    return 2;
        else if(a>='D'&&a<='F')    return 3;
        else if(a>='G'&&a<='I')    return 4;
        else if(a>='J'&&a<='L')    return 5;
        else if(a>='M'&&a<='O')    return 6;
        else if(a=='P'||a=='S'||a=='R')    return 7;
        else if(a>='T'&&a<='V')    return 8;
        else if(a>='W'&&a<='Y')    return 9;
    }
    int main(){
        cin>>n;
        for(i=0;i<n;i++){
            scanf("%s",str);d=0;
            for(j=0;str[j]!='';j++){
                if(str[j]>='A'&&str[j]<='Z'){
                    s=swap(str[j]);
                    d=d*10+s;
                }
                else if(str[j]>='0'&&str[j]<='9') {
                    s=str[j]-'0';
                    d=d*10+s;
                }
            }
            a[d]++;
        }
        int f=0;
        for(i=0;i<10000000;i++){
            if(a[i]>1) {
                printf("%03d-%04d %d
    ",i/10000,i%10000,a[i]);
                f=1;
            }
        }
        if(f==0)    cout<<"No duplicates."<<endl;
    }
    细雨斜风作晓寒。淡烟疏柳媚晴滩。入淮清洛渐漫漫。 雪沫乳花浮午盏,蓼茸蒿笋试春盘。人间有味是清欢。
  • 相关阅读:
    mysql指定字符位置截取字符串(多行重复信息进行合并)
    数据库按某字段去重查询结果集做法
    poi从数据库导出百万数据并写入excel
    自定义消息弹框以及跳转
    Django使用distinct报错:DISTINCT ON fields is not supported by this database backend
    Mysql】Mysql中CURRENT_TIMESTAMP,CURRENT_DATE,CURRENT_TIME,now(),sysdate()各项值的区别
    HTML文件直接在浏览器打开和本地服务器localhost打开有什么区别?
    pip下载加速的方式
    Python字符串格式化方式之format
    chmod: changing permissions of 'xxx': Operation not permitted
  • 原文地址:https://www.cnblogs.com/cangT-Tlan/p/9192193.html
Copyright © 2011-2022 走看看