zoukankan      html  css  js  c++  java
  • 北大ACM 1002题—4873279

    487-3279
    Time Limit: 2000MS   Memory Limit: 65536K
    Total Submissions: 214502   Accepted: 37379

    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 <iostream>
    #include <string>
    #include <map>
    using namespace std;
    
    char input[100000][7];
    map<string,int>data;
    map<string,int>::iterator it;
    int main()
    {
    	int max,line,pos;
    	string temp;
    	cin>>max;
    	
    	//输入数据
    	for(int i=0,line=0;i<max;i++)
    	{
    		cin>>temp;
    		pos=0;
    		for(int j=0;j<temp.length();j++)
    		{
    			if(temp[j]=='-')
    				;
    			else if(temp[j]=='A'||temp[j]=='B'||temp[j]=='C')
    				input[line][pos++]='2';
    			else if(temp[j]=='D'||temp[j]=='E'||temp[j]=='F')
    				input[line][pos++]='3';
    			else if(temp[j]=='G'||temp[j]=='H'||temp[j]=='I')
    				input[line][pos++]='4';
    			else if(temp[j]=='J'||temp[j]=='K'||temp[j]=='L')
    				input[line][pos++]='5';
    			else if(temp[j]=='M'||temp[j]=='N'||temp[j]=='O')
    				input[line][pos++]='6';
    			else if(temp[j]=='P'||temp[j]=='R'||temp[j]=='S')
    				input[line][pos++]='7';
    			else if(temp[j]=='T'||temp[j]=='U'||temp[j]=='V')
    				input[line][pos++]='8';
    			else if(temp[j]=='W'||temp[j]=='X'||temp[j]=='Y')
    				input[line][pos++]='9';
    			else if(temp[j]>=48&&temp[j]<=57)
    				input[line][pos++]=temp[j];
    			else
    				pos++;
    		}
    		line++;
    	}
    
    	//排序统计次数
    	for(int i=0;i<max;i++)
    	{
    		string temp;
    		for(int j=0;j<7;j++)
    			temp.push_back(input[i][j]);
    		it=data.find(temp);
    		if(it==data.end())
    			data.insert(pair<string,int>(temp,1));
    		else
    		{
    			int hh=it->second;
    			data.erase(it);
    			data.insert(pair<string,int>(temp,hh+1));
    		}
    	}
    	if(data.size()==max)
    		cout<<"No duplicates."<<endl;
    	else
    	{
    		for(it=data.begin();it!=data.end();it++)
    		{
    			if(it->second==1)
    				continue;
    			else
    				cout<<it->first[0]<<it->first[1]<<it->first[2]\
    				<<'-'<<it->first[3]<<it->first[4]<<it->first[5]<<it->first[6]<<" "<<it->second<<endl;
    		}
    	}
    	return 0;
    }



  • 相关阅读:
    DHCP工作过程
    园区网——网络架构
    ARP协议
    网络拓扑结构设计+网络设备简介
    Linux- 常用命令
    Linux-FTP
    【noip2018】【luogu5021】赛道修建
    【noip2018】【luogu5024】保卫王国
    【codeforces】【Round#523D】TV shows
    【bzoj4810】【ynoi2018】由乃的玉米田
  • 原文地址:https://www.cnblogs.com/finlay/p/3234732.html
Copyright © 2011-2022 走看看