UVA 10921 Find the Telephone

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

sunnykema

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

阅读量670

点赞数

CC 4.0 BY-SA版权

分类专栏： uva 算法设计实验编程

本文链接：https://blog.youkuaiyun.com/sunnykema/article/details/43648059

算法设计实验编程同时被 2 个专栏收录

17 篇文章

订阅专栏

uva

10 篇文章

订阅专栏

本文介绍了一种将电话号码转换为字母表达的方法，通过给定的对应表将数字映射到字母，支持包含数字1和0及连字符的输入表达式。文章提供了完整的C++实现代码，展示了如何读取字符串并输出对应的电话号码。

Problem B - Find the Telephone

Time Limit: 1 second

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 someproblems, because some phone numbers can not form a word or a phrase and the digits1 and 0 are not associated to any letter.

Your task is to read an expression and find the corresponding phone number based onthe 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 itselfand has C characters, where 1 ≤ C ≤ 30. The input isterminated 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

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
#define maxn 35
#define inf 0x7ffffff
pair <int ,int > p;
int arr[27];
char num[maxn];
int n;
//int cmpD(Node a,Node b){
//    return a.h > b.h;
//}
//int cmpI(Node a,Node b){
//    return a.h < b.h;
//}
int main()
{
    for(int i = 0; i < 18;i++){
        arr[i] = i / 3 + 2;
    }
    arr[18] = 7;
    arr[19] = arr[20] = arr[21] = 8;
    arr[22] = arr[23] = arr[24] = arr[25] = 9;
    while(gets(num)){
        for(int i = 0; num[i];i++){
            if(num[i] >= 'A' && num[i] <= 'Z'){
                printf("%d",arr[num[i] - 'A']);
            }else{
                printf("%c",num[i]);
            }
        }
        printf("\n");
    }
    return 0;
}