POJ 1002 487-3279 map
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 287874 | Accepted: 51669 |
Description
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
Output
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
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
#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
#include <map>
#include <string>
using namespace std;
int num[]=//初始化每个字母对应的值
{
,,,
,,,
,,,
,,,
,,,
,,,,
,,,
,,,
};
map<int,int>s;
char buf[];
int main()
{
int t;
cin >> t;
bool flag = false;
for(int i=;i<t;i++)
{
cin >> buf;
int c = ;
for(int j=;buf[j];j++)//用数直接存下号码
{
if(isdigit(buf[j]))
c = c*+buf[j]-'';
else if(isalpha(buf[j]))
c = c*+num[buf[j]-'A'];
}
s[c]++;
}
for(map<int,int>::iterator it = s.begin();it!=s.end();it++)
if(it->second > )
{
flag = true;
printf("%03d-%04d %d\n",it->first/,it->first%,it->second);//注意输出时可以通过取余,除以10000来输出后四位,前四位,加个0避免省略0的情况,这种方法个人觉得挺好的
}
if(!flag)
puts("No duplicates.");
return ;
}
最新文章
- Django Admin 录入中文错误解决办法
- Linux snmp
- childNodes 和children
- ok6410 android driver(10)
- ASP.NET中的事件处理
- 重构6-Push Down Field(字段下移)
- HDU 4461 The Power of Xiangqi (水题)
- javaScript 要点(十五)HTML DOM 导航
- ~/.ssh目录找不到解决方法
- WebDriverWait自定义等待事件
- (转载)在Linux下删除文件行末尾的^M符号方法
- Python学习笔记总结(四)异常处理
- CentOS磁盘分区、格式化并挂载外置存储的方法
- 12个CSS高级技巧汇总
- Traits技法
- lower_bound()返回值
- QTableView
- UNIX网络编程——UDP编程模型
- Log file location for Oracle E-Business Suite R12
- K8s-Pod控制器