1164 Good in C

When your interviewer asks you to write “Hello World” using C, can you do as the following figure shows?

Input Specification:

Each input file contains one test case. For each case, the first part gives the 26 capital English letters A-Z, each in a 7×5 matrix of C’s and .'s. Then a sentence is given in a line, ended by a return. The sentence is formed by several words (no more than 10 continuous capital English letters each), and the words are separated by any characters other than capital English letters.

It is guaranteed that there is at least one word given.

Output Specification:

For each word, print the matrix form of each of its letters in a line, and the letters must be separated by exactly one column of space. There must be no extra space at the beginning or the end of the word.

Between two adjacent words, there must be a single empty line to separate them. There must be no extra line at the beginning or the end of the output.

Sample Input:

..C..
.C.C.
C...C
CCCCC
C...C
C...C
C...C
CCCC.
C...C
C...C
CCCC.
C...C
C...C
CCCC.
.CCC.
C...C
C....
C....
C....
C...C
.CCC.
CCCC.
C...C
C...C
C...C
C...C
C...C
CCCC.
CCCCC
C....
C....
CCCC.
C....
C....
CCCCC
CCCCC
C....
C....
CCCC.
C....
C....
C....
CCCC.
C...C
C....
C.CCC
C...C
C...C
CCCC.
C...C
C...C
C...C
CCCCC
C...C
C...C
C...C
CCCCC
..C..
..C..
..C..
..C..
..C..
CCCCC
CCCCC
....C
....C
....C
....C
C...C
.CCC.
C...C
C..C.
C.C..
CC...
C.C..
C..C.
C...C
C....
C....
C....
C....
C....
C....
CCCCC
C...C
C...C
CC.CC
C.C.C
C...C
C...C
C...C
C...C
C...C
CC..C
C.C.C
C..CC
C...C
C...C
.CCC.
C...C
C...C
C...C
C...C
C...C
.CCC.
CCCC.
C...C
C...C
CCCC.
C....
C....
C....
.CCC.
C...C
C...C
C...C
C.C.C
C..CC
.CCC.
CCCC.
C...C
CCCC.
CC...
C.C..
C..C.
C...C
.CCC.
C...C
C....
.CCC.
....C
C...C
.CCC.
CCCCC
..C..
..C..
..C..
..C..
..C..
..C..
C...C
C...C
C...C
C...C
C...C
C...C
.CCC.
C...C
C...C
C...C
C...C
C...C
.C.C.
..C..
C...C
C...C
C...C
C.C.C
CC.CC
C...C
C...C
C...C
C...C
.C.C.
..C..
.C.C.
C...C
C...C
C...C
C...C
.C.C.
..C..
..C..
..C..
..C..
CCCCC
....C
...C.
..C..
.C...
C....
CCCCC
HELLO~WORLD!

Sample Output:

C...C CCCCC C.... C.... .CCC.
C...C C.... C.... C.... C...C
C...C C.... C.... C.... C...C
CCCCC CCCC. C.... C.... C...C
C...C C.... C.... C.... C...C
C...C C.... C.... C.... C...C
C...C CCCCC CCCCC CCCCC .CCC.

C...C .CCC. CCCC. C.... CCCC.
C...C C...C C...C C.... C...C
C...C C...C CCCC. C.... C...C
C.C.C C...C CC... C.... C...C
CC.CC C...C C.C.. C.... C...C
C...C C...C C..C. C.... C...C
C...C .CCC. C...C CCCCC CCCC.

思路

模拟题

cpp代码

#include<iostream>
#include<cstring>
using namespace std;
char word[26][7][6];
char res[7][60];
bool st=true;
void output(string s){
	memset(res,0,sizeof res);
	if(s.empty())return ;//读到字符串为空的情况，即读到回车
	if(st)st=false;
	else puts("");
	for(int i=0;i<s.size();i++){//对于每个字母
		for(int j=0;j<7;j++){//总共有7行，这里遍历这7行
			for(int k=0;k<5;k++){//每一行有五个元素
			                      //s[i]-'A'选择是第几个单词,j,k是该单词的行列
				res[j][i*6+k]=word[s[i]-'A'][j][k];//s[i]-'A'导入的是第几版单词
			//行与行之间是直接对应的，i*6+k是每一行开始书写的位置
			}
		}
	}
	
	for(int i=1;i<s.size();i++){
		for(int j=0;j<7;j++){//每一行都加空格
			res[j][6*i-1]=' ';//6*i-1,i从1开始，0开始的位置不用空格,6*i-1是书写的前一个位置加空格
		}
	}
	for(int i=0;i<7;i++)cout<<res[i]<<endl;//按行输出
}
int main(){
    //26*7*6
	for(int i=0;i<26;i++)
		for(int j=0;j<7;j++)
			cin>>word[i][j];
	
	char ch;
	string s="";
	while((ch=getchar())!=-1){
		if(ch>='A'&&ch<='Z'){
			s+=ch;
		}
		else output(s),s="";
	}
	return 0;	

}