PAT甲级 1164 Good in C(PAT 乙级 1109 擅长C)

Fontion

已于 2022-10-15 14:12:06 修改

阅读量425

点赞数 2

分类专栏： PAT甲级文章标签： c语言 c++ linux pat考试

于 2022-10-14 17:41:20 首次发布

本文链接：https://blog.csdn.net/weixin_50625837/article/details/127323973

版权

PAT甲级专栏收录该内容

1 篇文章 0 订阅

订阅专栏

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.

**大意：**将给定的字符串按特殊的格式输出并且在遇到特殊字符进行换行

解题思路：

1、将测试用例中给定单词数据用三维字符数组存储起来

c[i][j][k] 其中 **i ** 下标用来做数字对26个字母的映射关系，例如：0 -> A、1 -> B

2、用getline去接收待处理的字符串（因为要考虑空格输入，不用cin）

3、拆分待处理的单词（因为每一个单词输出完后要进行换行）

定义一个vector二维数组存储每一个单词对应的字母vector<vector<int>> v;

4、遍历v并输出结果

在这里插入图片描述

//输出结果的代码
for (int l = 0; l < v.size(); l++){//控制单词
        for (int j = 0; j < 7; j++){//控制输出构成某个单词的某个字母的行
            for (int i = 0,k = 0; i < v[l].size(); i++){//控制字母
                while(k<5){//控制输出构成某个单词的某个字母的列
                    cout<<c[v[l][i]][j][k];
                    k++;
                }
                if(i != v[l].size()-1) cout<<" ";
                k=0;
            }
            cout<<endl;
        }
        if(l != v.size()-1){
            cout<<endl;
        }
    }

完整代码：

#include<bits/stdc++.h>
using namespace std;
char c[26][7][5];
int main(){
    //将字母存起来
    for (int i = 0; i < 26; i++){
        for (int j = 0; j < 7; j++){
            for (int k = 0; k < 5; k++){
                char t;
                cin>>t;
                c[i][j][k]=t;
            }
        }
    }
    string s;
    vector<vector<int>> v;//存储所有单词的集合
    vector<int> tv;//存一个单词的所有字母
    getchar();//输入s前有一个回车符要处理一下
    getline(cin,s);
    for (int i = 0; i < s.length(); i++){
        int cur_i = s[i];
        if(cur_i >= 'A' && cur_i <= 'Z'){
            tv.push_back(cur_i-'A');
        }else{
            if(!tv.empty()) v.push_back(tv);//处理有连续非法字符的情况
            tv.clear();
            continue;
        }
        if((i==(s.length()-1))&&(cur_i >= 'A' && cur_i <= 'Z')) v.push_back(tv);
    }
    //控制目标单词输出
    for (int l = 0; l < v.size(); l++){    
        for (int j = 0; j < 7; j++){
            for (int i = 0,k = 0; i < v[l].size(); i++){
                while(k<5){
                    cout<<c[v[l][i]][j][k];
                    k++;
                }
                if(i != v[l].size()-1) cout<<" ";
                k=0;
            }
            cout<<endl;
        }
        if(l != v.size()-1){
            cout<<endl;
        }
    }
}

测试点：

    第0个测试点与题目所给格式等各方面都相同，基本上测试例过了测试点也可以过。

    第1，2，3个测试点都要考虑空格的情况，所以不能用scanf。

    第4个测试点要考虑最后以大写字母结尾，要注意不要少输出。

    第1，2个测试点中还存在两个单词中间有多个非大写字母字符的情况。

这里给出几个测试用例

（1）HELLO WORLD

（2） A B C

（3）A B C########## 1164 Good in C