博客
关于我
强烈建议你试试无所不能的chatGPT,快点击我
POJ 1002 487-3279
阅读量:5066 次
发布时间:2019-06-12

本文共 3720 字,大约阅读时间需要 12 分钟。

487-3279
Time Limit: 2000MS   Memory Limit: 65536K
Total Submissions: 294197   Accepted: 52694

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

124873279ITS-EASY888-45673-10-10-10888-GLOPTUT-GLOP967-11-11310-GINOF101010888-1200-4-8-7-3-2-7-9-487-3279

Sample Output

310-1010 2487-3279 4888-4567 3
#include 
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
#include
using namespace std; #define lowbit(x) (x&(-x)) #define max(x,y) (x>y?x:y) #define min(x,y) (x
m;map
vis;set
v;set
::iterator it;char ss[110];int n;void init(){ for(int i=0;i<24;i++) vis[(char)(i+'A')]=(i/3)+2; vis['S']=7;vis['V']=8;vis['Y']=9;}int main(){ init(); ios(); scanf("%d",&n); while(n--) { scanf("%s",ss); int ans=0; int len=strlen(ss); for(int i=0;i
='0' && ss[i]<='9') ans=ans*10+(int)(ss[i]-'0'); else if((ss[i]>='A' && ss[i]<'Q') ||(ss[i]>'Q' && ss[i]<='Y')) ans=ans*10+vis[ss[i]]; } v.insert(ans); if(m[ans]==0) m[ans]=1; else m[ans]++; } bool flag=false; for(it=v.begin();it!=v.end();it++) { if(m[*it]<=1) continue; flag=true; printf("%03d-%04d %d\n",*it/10000,*it%10000,m[*it]); } if(!flag) printf("No duplicates.\n"); return 0;}

 

转载于:https://www.cnblogs.com/shinianhuanniyijuhaojiubujian/p/7300058.html

你可能感兴趣的文章
Azure Site Recovery 通过一键式流程将虚拟机故障转移至 Azure虚拟机
查看>>
Hello China操作系统STM32移植指南(一)
查看>>
cocos2dx CCEditBox
查看>>
VC++2012编程演练数据结构《8》回溯法解决迷宫问题
查看>>
第一阶段冲刺06
查看>>
WIN下修改host文件并立即生效
查看>>
十个免费的 Web 压力测试工具
查看>>
ckeditor 粘贴后去除html标签
查看>>
面试题
查看>>
51Nod:活动安排问题之二(贪心)
查看>>
EOS生产区块:解析插件producer_plugin
查看>>
数据库框架的log4j日志配置
查看>>
lintcode-easy-Remove Element
查看>>
Android 常用开源框架源码解析 系列 (四)Glide
查看>>
操作系统概述
查看>>
mysql 根据地图 坐标 查询 周边景区、酒店
查看>>
<CDQ分治> Jam's problem again [HDU - 5618]
查看>>
mysql重置密码
查看>>
使用request简单爬虫
查看>>
jQuery轮 播的封装
查看>>