字符串系列——磁带破解 Decode the tape

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.

___________| 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 |___________

A quick brown fox jumps over the lazy dog.

很水的题，判断读入8个二进制转换后用ASCII码输出就解决了。

代码如下：

#include<stdio.h>#include<ctype.h>int main(){    int i = 0, num;    int n[10] = {0}, tmp;    for (; (tmp = getchar()) != EOF;)    {        if (tmp == ' ')        {            n[i] = 0;            i ++;        }        if (tmp == 'o')        {            n[i] = 1;            i ++;        }        //printf("i = %d, n[%d] = %d\n", i, i - 1, n[i - 1]);        if (i == 8)        {            i = 0;            num = n[0]*128+n[1]*64+n[2]*32+n[3]*16+n[4]*8+n[5]*4+n[6]*2+n[7]*1;            printf("%c", num);        }    }    return 0;}