uva 10878(字符串)

题目:

"Machines take me by surprise with great frequency."

Alan Turing

Your boss has just unearthed a roll of old computer tapes. The tapes have holes in them and might contain some sort of useful information. It falls to you to figure out what is written on them.

input

The input will contain one tape.

output

Output the message that is written on the tape.

sample input

___________
| o   .  o|
|  o  .   |
| ooo .  o|
| ooo .o o|
| oo o.  o|
| oo  . oo|
| oo o. oo|
|  o  .   |
| oo  . o |
| ooo . o |
| oo o.ooo|
| ooo .ooo|
| oo o.oo |
|  o  .   |
| oo  .oo |
| oo o.ooo|
| oooo.   |
|  o  .   |
| oo o. o |
| ooo .o o|
| oo o.o o|
| ooo .   |
| ooo . oo|
|  o  .   |
| oo o.ooo|
| ooo .oo |
| oo  .o o|
| ooo . o |
|  o  .   |
| ooo .o  |
| oo o.   |
| oo  .o o|
|  o  .   |
| oo o.o  |
| oo  .  o|
| oooo. o |
| oooo.  o|
|  o  .   |
| oo  .o  |
| oo o.ooo|
| oo  .ooo|
|  o o.oo |
|    o. o |
___________
sample output

A quick brown fox jumps over the lazy dog.

题解:‘o’代表 1, ‘ ’代表 0,其他字符无意义,转换成二进制计算ASCII值得到文本。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
using namespace std;

int s[8], flag;
int a[8] = {128, 64, 32, 16, 8, 4, 2, 1};
void fun(){
	int ans = 0, i;
	for (i = 0; i < 8; i++)
			ans += a[i] * s[i];
	char k = ans;
	cout << k;
	flag = 0;
}
int main(){
	char c;
	while(1){
		c = getchar();
		if(c == '\n')
			break;
	}
	while(1){
		scanf("%c", &c);
		if (c == ' ' && flag < 8)
			s[flag++] = 0;
		else if (c == 'o' && flag < 8)
			s[flag++] = 1;
		else if (flag == 8)
			fun();
		else if (c == '_')
			return 0;
		else
			continue;	
	}
	return 0;
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值