7-1 Good in C (20分)

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.

Code:

#include<iostream>
#include<string>
#include<cctype>
#include<algorithm>
using namespace std;
const int maxn = 26;
struct node{string str[7];
}alp[27];
int main(){for(int i = 0; i < 26;i ++){for(int j = 0; j < 7; j++){cin>>alp[i].str[j];}}string temp;getchar();getline(cin,temp); while(temp.size() > 1 && !isupper(temp[0]))temp.erase(temp.begin());node ans;bool flag = false;int x = 0;for(int i = 0; i < temp.size(); ){if(isupper(temp[i])){int v = temp[i] - 'A';if(!flag){flag = true;for(int j = 0; j < 7; j++)ans.str[j] += alp[v].str[j];   }else {for(int j = 0; j < 7; j++){ans.str[j] += " ";ans.str[j] += alp[v].str[j];}   }if(i == temp.size()-1){for(int j = 0; j < 7; j++){cout<<ans.str[j]<<"\n";}return 0;  }i++;}else {for(int j = 0; j < 7; j++){cout<<ans.str[j]<<"\n";ans.str[j].clear();}for(x = i; x < temp.size();x++){if(isupper(temp[x]))break;}if(x < temp.size())printf("\n");flag = false;i  = x;}}return 0;
}

PAT（甲级）2019年冬季考试 7-1 Good in C (20分)相关推荐

PAT甲级 2019年冬季题解
题目1:7-1 Good in C (20分) When your interviewer asks you to write "Hello World" using C, can ...
【PAT甲级大数运算】1065 A+B and C (64bit) (20 分) Python 全部AC
题目初学python,第一次用python刷oj,挑了个简单题试试手. 在大数运算方面,python没有数的大小限制,简直开挂. total = int(input()) for i in rang ...
【PAT甲级删除字符串中重复字母】1084 Broken Keyboard (20 分) Java 全部AC
题目题解 Java import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamRead ...
【PAT甲级 U形打印】1031 Hello World for U (20 分) Java版 6/6通过
题目一开始没看懂"as squared as possible"和那个max不等式到底是什么意思,看了别人的解答才明白: 如果n % 3 == 0,n正好被3整除,直接n1 = ...
【PAT甲级素数判断进制转换】1015 Reversible Primes (20 分) Java版 4/4通过
题目思路: 为了提高效率,判断素数采用打表的方式先计算100000以内的所有素数,然后如果要判断一个数是否为素数的话,直接与表中比对题目中的意思是: 首先,判断一个数N1是否为素数如果N1是素 ...
pat甲级考试报名费_PAT（甲级）2019年冬季考试题解
总结写在前头: 考了字符串.链表(伪链表).图.树.考点比较均衡. 本次考试难度还行,需要较扎实的数据结构底子,对于字符串处理的技巧有一定的要求. 说句题外话,字符串是个重点,主要因为很多人会忽视字符 ...
PAT（乙级）2019年冬季考试【答案+题解】
7-1 2019数列 (15分) 7-2 老鼠爱大米 (20分) 7-3 String复读机 (20分) 7-4 擅长C (20分) 7-5 区块反转 (25分) 7-1 2019数列 (15分) 把 ...
【PAT甲级】2020冬季 PAT 甲级
2020冬季 PAT 甲级记录第一次参加PAT,本来九月份报名的时候是打算到十二月份的时候把乙级的题库刷完,然后甲级的题库刷一半,结果因为各种各样的事情(主要是懒又没坚持0.0)这次直到考前乙级才刷 ...
PAT（甲级）2019年冬季考试 7-2 Block Reversing
这题是做过的,B1025,我还总结过,果然早晚复相逢,只改了一点点,见1025 反转链表. 点睛之笔是结构体数组的哈希,地址既做下标,又有实际含义,妙啊. node[add].add = add; 当 ...
PAT（甲级）2019年冬季考试 7-4 Cartesian Tree
这道题利用的是最小堆和中序排序的属性:只要知道根节点,就能得出哪些属于左子树,哪些属于右子树. 开始我一直报段错误,经过筛查,发现是创建树的函数忘记写返回语句 return root. AC代码 #i ...

PAT（甲级）2019年冬季考试 7-1 Good in C (20分)