UVA 10921 Find the Telephone
来源:互联网 发布:网站安全监测软件 编辑:程序博客网 时间:2024/05/20 05:03
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 expressionMY LOVE means 69 5683. Of course there are someproblems, because some phone numbers can not form a word or a phrase and the digits1 and0 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 numbers1 and 0.
LettersNumberABC2DEF3GHI4JKL5MNO6PQRS7TUV8WXYZ9Input
The input consists of a set of expressions. Each expression is in a line by itselfand hasC 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-HOMEMY-MISERABLE-JOB
Sample Output
1-4663-79338-466369-647372253-562
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <set>#include <queue>using namespace std;#define maxn 35#define inf 0x7ffffffpair <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;}
- UVa 10921 - Find the Telephone
- UVA 10921 Find the Telephone
- UVa 10921 Find the Telephone (water ver.)
- UVA - 10921 - Problem B - Find the Telephone
- The Telephone
- UVA 4683 - Find The Number
- UVa 10219 - Find the ways !
- Find the Permutations [Uva 11077]
- Frequencies of the Telephone Tones
- UVa 11077 Find the Permutations / 置换
- UVA 11077 Find the Permutations(置换+dp)
- UVA 10548 - Find the Right Changes(数论)
- UVA 11077 - Find the Permutations(递推)
- uva 11077 - Find the Permutations(置换)
- UVA - 11077 Find the Permutations (置换)
- UVA 11077 Find the Permutations DP
- UVA 11077 Find the Permutations(置换)
- uva 11077 - Find the Permutations(置换+dp)
- 2015春,乍暖还寒——我在北京!
- gradle user guide
- sniffer原理
- 汽车排量T和L有什么区别
- Android开发——使用fragment仿微信底部菜单栏
- UVA 10921 Find the Telephone
- Linq多表链接分页,Select new{"需要的字段列.."},配合杨涛Mvcpager,前台遍历展示自定义字段
- Java中可变长参数的使用及注意事项
- Linux命令之ar - 创建静态库.a文件和动态库.so
- SQL范围查询: 查询某个人属于哪个工资区间
- 基础动画(二)
- Oracle的游标介绍
- Android开发之binder机制详解
- keepalived nginx简单配置