UVa 11223 - O: dah dah dah!

题目：把摩斯码翻译成对应的明文。每个编码的结束标志是空格或者换行，其他原样输出。

分析：模拟，字符串。直接存到数组中查找即可。

说明：其他字符按原样输出即可。

#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>using namespace std;char str[54][8] = {"A.-","B-...","C-.-.","D-..","E.","F..-.","G--.","H....","I..","J.---","K-.-","L.-..","M--","N-.","O---","P.--.","Q--.-","R.-.","S...","T-","U..-","V...-","W.--","X-..-","Y-.--", "Z--..","0-----","1.----","2..---","3...--","4....-", "5.....","6-....","7--...","8---..","9----.","..-.-.-",",--..--","?..--..","'.----.","!-.-.--","/-..-.","(-.--.",")-.--.-","&.-...",":---...",";-.-.-.","=-...-","+.-.-.","--....-","_..--.-","\".-..-.","@.--.-.",""}; void find_str( char *a )
{for ( int i = 0 ; i < 54 ; ++ i )if ( !strcmp( a, &str[i][1] ) ) {printf("%c",str[i][0]);return;}
}int main()
{int T;scanf("%d",&T);getchar();for ( int t = 1 ; t <= T ; ++ t ) {char buf[1000];int  count = 0;printf("Message #%d\n",t);while ( (buf[count] = getchar()) != '\n' ) {if ( buf[count] == ' ' ) {if ( count ) {buf[count] = 0;find_str( buf );count = 0;}else printf(" ");}else if ( buf[count] == '.' || buf[count] == '-' ) count ++;else {printf("%c",buf[count]);count = 0;}}if ( count ) {buf[count] = 0;find_str( buf );}printf("\n");if ( t < T ) printf("\n");}return 0;
}

UVa 11223 - O: dah dah dah!相关推荐

无主之地kill ajax,阿克斯顿 - 无主之地中文维基 - 灰机wiki
阿克斯顿艾克斯顿和军刀枪塔角色类型可选角色(无主之地2) NPC(无主之地:前奏) 性别男性种族人类 Axton is the playable Commando class character ...
计算机无法与硬盘,无法识别的硬盘原因和解决方法[详细]
我相信许多用户都遇到了无法识别的硬盘故障. 作为计算机中重要的存储设备,硬盘的重要性不言而喻. 大量数据存储在硬盘中. 一旦发生故障,数据丢失就非常严重. 那么如何解决硬盘无法识别的问题呢?以下编辑器 ...
PC/UVA 110207/10258
uva上面题的的输入输出格式各种怪晚几天会整理下放上. 2.8.7比赛记分板输入 :第一行为一个整数表示测试数据的组数,接下来一行空行.以后每两组测试数据之间一组空行隔开(各组数据的多少不 ...
[搜索]UVa 129 困难的串
题意:将一个包含两个相邻的重复子串的子串,称为"容易的串",其他为"困难的串". 输入正整数n和l,输出由前l个字符组成的,字典序第n小的困难的串. 输入样例: ...
uva 401.Palindromes
题目链接:https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem ...
Uva 3767 Dynamic len(set(a[L:R])) 树套树
Dynamic len(set(a[L:R])) Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 https://uva.onlinejudge.org/in ...
UVA 11752 超级幂
UVA 11752 超级幂 Z - The Super Powers Time Limit:1000MS Memory Limit:0KB 64bit IO Format:%lld & ...
UVa 11174 - Stand in a Line
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&p ...
UVa 10112 - Myacm Triangles
UVa第一卷最后一题. 求内部不含点并且面积最大的三角形. 暴力. 代码如下: 1 #include<iostream> 2 #include<cstdio> 3 #inclu ...
UVa 10180 - Rope Crisis in Ropeland!
题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=41&pa ...

UVa 11223 - O: dah dah dah!

UVa 11223 - O: dah dah dah!相关推荐

最新文章

热门文章