[POJ 1002] 487-3279 C++解题报告
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 228365 | Accepted: 39826 |
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
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
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
Time Limit: 2000MS | Memory Limit: 65536K | |
Total Submissions: 228365 | Accepted: 39826 |
Description
电话号码的标准格式是七位十进制数,并在第三、第四位数字之间有一个连接符。电话拨号盘提供了从字母到数字的映射,映射关系如下:
A, B, 和C 映射到 2
D, E, 和F 映射到 3
G, H, 和I 映射到 4
J, K, 和L 映射到 5
M, N, 和O 映射到 6
P, R, 和S 映射到 7
T, U, 和V 映射到 8
W, X, 和Y 映射到 9
Q和Z没有映射到任何数字,连字符不需要拨号,可以任意添加和删除。 TUT-GLOP的标准格式是888-4567,310-GINO的标准格式是310-4466,3-10-10-10的标准格式是310-1010。
如果两个号码有相同的标准格式,那么他们就是等同的(相同的拨号)
你的公司正在为本地的公司编写一个电话号码薄。作为质量控制的一部分,你想要检查是否有两个和多个公司拥有相同的电话号码。
Input
Output
No duplicates.
解决思路
这是一道简单的模拟题,第一,要记得处理无重复号码的情况,第二,要记得处理只有两个号码,且两个号码相同的情况,不注意边界的话,很容易弄错。
源码
C++解题
/*
poj 1002
version:1.0
author:Knight
Email:S.Knight.Work@gmail.com www.getyourwant.com
*/ #include<cstdio> #include<cstring> #include<cstdlib> using namespace std; char Stand[][]; //建立26个字母对应的数字键,如A-2,B-2,D-3此时Map【0】=2,Map【1】=2,Map【3】=3.即Map的下标为字母在字母表中的序列号,从0开始 int Map[]= {,,,,,, ,,, ,,, ,,, ,-,,, ,,, ,,,-}; //将PhoneNO转换成标准号码 void TransToStand(char* PhoneNO,char* StandNO); //用于qsort字符串排序的比较函数 int StrCmp(const void *a, const void *b); int main(void) { //printf("%d", sizeof(Map)/sizeof(int)); int T; int i; char Tmp[]; scanf("%d", &T); getchar(); for (i=; i<T; i++) { gets(Tmp); TransToStand(Tmp, Stand[i]); } qsort(Stand, T, sizeof(Stand[]), StrCmp); int Cnt = ;//当前相同标准号码的数量 bool IsDuplicate = false; strcpy(Stand[T], ""); for (i=; i<T; i++) { if (strcmp(Stand[i], Stand[i+]) == ) { Cnt++; } else { if (Cnt > ) { printf("%s %d\n", Stand[i], Cnt); IsDuplicate = true; } Cnt = ; } } if (!IsDuplicate) { printf("No duplicates.\n"); } return ; } //将PhoneNO转换成标准号码 void TransToStand(char* PhoneNO,char* StandNO) { int i,j=; int Len = strlen(PhoneNO); StandNO[] = '-'; StandNO[] = '\0'; for (i=; i<Len; i++) { if (PhoneNO[i] >= '' && PhoneNO[i] <= '')//是数字则直接转换 { StandNO[j] = PhoneNO[i]; j++; if ( == j) { j++; } else if ( == j) { return ; } } else if (PhoneNO[i] >= 'A' && PhoneNO[i] <= 'Z') { StandNO[j] = Map[PhoneNO[i] - 'A'] + ''; j++; if ( == j) { j++; } else if ( == j) { return ; } } } } //用于qsort字符串排序的比较函数 int StrCmp(const void *a, const void *b) { return strcmp((char*)a, (char*)b); }
最新文章
- w3svc服务启动 不了,错误 1068:依赖服务或组件无法启动
- [解决方案]在Sql Server 2008/2005 数据库还原出现 3154错误
- shell中如何判断某一命令是否存在
- symfony在模板中生成url
- LA 4725 (二分) Airport
- ren
- Linux process state codes
- C#中英文混合字符串过长截断
- HDU5107---K-short Problem (线段树区间 合并、第k大)
- C++外观设计模式模式(三)
- Spring 依赖注入的理解
- python学习之爬虫初体验
- python requests与aiohttp 速度对比
- Elasticsearch5.5.1插件开发指南
- ElasticSearch实践系列(一):安装
- java注解的简单介绍
- jenkins 设置钉钉通知--钉钉机器人
- js实现类似微信网页版在可编辑的div中粘贴内容时过滤剪贴板的内容,光标始终在粘贴内容后面,以及将光标定位到最后的方法
- VS2008:Failed to return new Code Element
- SoftMax多分类器原理及代码理解
热门文章
- VueJs $watch()方法总结!!
- 零基础逆向工程13_C语言07_指针01_反汇编
- 我们为什么要看《超实用的HTML代码段》
- ftp错误
- pc端常见布局---垂直居中布局 单元素定高
- 似水流年 ? Chrome调试大全
- 让您的 VS 2012/2013 升级开发 .NET 4.6 -- Targeting the .NET Framework 4.6 (多目标包)
- [视觉识别]OpenCV + CNN 大神符识别
- Python 多线程应用
- 关于List的remove方法我遇到的坑