UVa 10921 Find the Telephone (water ver.)

最新推荐文章于 2018-12-05 01:07:04 发布

原创最新推荐文章于 2018-12-05 01:07:04 发布 · 1.1k 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#UVa #acm #c++

UVa 同时被 2 个专栏收录

407 篇文章

订阅专栏

acm之路--字符串

42 篇文章

订阅专栏

本文介绍了一种将电话号码转换为字母表达的方法，通过给定的映射表将每个数字对应的字母进行转换，同时保留非字母字符不变。适用于长度1到30之间的字符串输入。

10921 - Find the Telephone

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=24&page=show_problem&problem=1862

In some places is common to remember a phone number associating its digits to letters. In this way the expression MY LOVE means 69 5683. Of course there are some problems, because some phone numbers can not form a word or a phrase and the digits 1 and 0 are not associated to any letter.

Your task is to read an expression and find the corresponding phone number based on the table below. An expression is composed by the capital letters (A-Z), hyphens (-) and the numbers 1 and 0.

Letters	Number
ABC	2
DEF	3
GHI	4
JKL	5
MNO	6
PQRS	7
TUV	8
WXYZ	9

Input

The input consists of a set of expressions. Each expression is in a line by itself and has C characters, where 1 ≤ C ≤ 30. The input is terminated by enf of file (EOF).

Output

For each expression you should print the corresponding phone number.

Sample Input

1-HOME-SWEET-HOME
MY-MISERABLE-JOB

Sample Output

1-4663-79338-4663
69-647372253-562

完整代码：

/*0.018s*/

#include<cstdio>
#include<cctype>
#include<cstring>
const char num[] = {" 22233344455566677778889999"};

char str[35];

int main()
{
	int len, i;
	while (gets(str))
	{
		len = strlen(str);
		for (i = 0; i < len; ++i)
			putchar(isalpha(str[i]) ? num[str[i] & 31] : str[i]);
		putchar(10);
	}
	return 0;
}