1164 Good in C (20 point(s)) PAT甲级

最新推荐文章于 2022-07-11 20:36:36 发布
最新推荐文章于 2022-07-11 20:36:36 发布
阅读量331 收藏
点赞数
分类专栏： PAT刷题笔记 文章标签： c++ 算法 字符串
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/weixin_43996404/article/details/122790900
版权

1164 Good in C (20 point(s))

字符串

题目

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

HWC.jpg

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.

思路

题意

用7*5的矩阵图形存储26个字母，读入一行句子，句子中单词以大写字母组成，由任意非大写字母分隔开。要求以矩阵图形输出该句子，每个单词一行，每个字母矩阵用空格隔开。

思路

一开始想的是用26*7*5的char矩阵来存储26个字母的矩阵图形，后来发现可以直接用26*7的string矩阵。具体做法都差不多，读入每个字母每行的表示方式，再读入需要输出的句子，用temp存储句子中当前读到的字母，Word存储单词，一个单词由一个字母index队列组成。temp-'A'即为字母的index，之后按照要求一行一行的输出即可。

难点主要在理清楚图形输出的顺序，思路清晰的话不是很难。

解法

#include<bits/stdc++.h>
using namespace std;

string Capital[26][7];
vector<int> Input;
vector<vector<int>> Word;

int main() {
	for (int i = 0; i < 26; i++) {
		for (int j = 0; j < 7; j++) {
			cin >> Capital[i][j];
		}
	}
	getchar();//跳过字母样例末尾换行符
	int cnt = 0;
	while (true) {
		char temp = getchar();
		if ('A' <= temp && temp <= 'Z') {
			Input.push_back(temp - 'A');//存入字母index
		}
		else if(!Input.empty()){//判断Input是否为空，防止读入连续个中止符号Word数错误增加（会影响最后换行符的输出）
			Word.push_back(Input);
			Input.clear();
		}
		if (temp == '\n')
			break;
	}
	for (int i = 0; i < Word.size(); i++) {
		for (int row = 0; row < 7; row++) {
			for (int j = 0; j < Word[i].size(); j++) {
				cout << Capital[Word[i][j]][row];
				if (j != Word[i].size() - 1) printf(" ");
			}
			printf("\n");
		}
		if (i != Word.size() - 1) printf("\n");
	}
	return 0;
}

注意

  • getchar()不会自动换行
  • cin每次读入一行，末尾的换行符会留下
柴郡猫的耳朵尖
关注
  • 0
    点赞
  • 踩
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
point_in_C.rar_point in
09-21
指针型数据类型一直被很多文献和技术人员认为是C 语言中最难理解和掌握的内容之一，事实上，指针确实是C 语言中非常有特色的内容，也是C 语言众多优秀特征的集中体现，是否能够灵活、正确的运用指针在一定程度反映了...
2019年12月PAT甲级 第一题 Good in C（1164）题解
时间的玫瑰的博客
12-11 1032
题目 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 ...
1164 Good in C
weixin_61168459的博客
07-11 169
PAT
PAT甲级——1164 Good in C (20 分)
小楼一夜听春雨
02-14 449
题目 给出A-Z的形状和一个句子，输出矩阵形式的分词句子 思路 三维数组存每个字母 然后再拼接起来 坑点 空格也有可能是seperator 用getchar()+getline()获得整行 src： #include<bits/stdc++.h> using namespace std; //每个英文字母都是7 * 5的一个matrix char word[26][7][5]; int main() { for(int i = 0; i < 26; i++) { .
1164 Good in C——筛选字母和字符串矩阵的整行输出
net961231的博客
07-21 457
分析 将字符串 存放如 7*26的string的二维数组 由于最后的句子 是根据 每个char来找到二维数组中的对应字母 因此用map映射 char和 i （i*7） 由于cout无法识别空格等字符串，因此用getline读入一整行 1层遍历：每个单词 2层遍历：按照7列输出 3层遍历：单词中的字母 其他 筛选、输出格式 具体看代码 代码 #include<bits/stdc++.h> using namespace std; vector< vecto...
Floating-point arithmetic in C
02-14
定点数据的存储方式，基本的算术运算处理方式，C语言实现
1012 数字分类 (20 point(s)).cpp
08-09
1012 数字分类 (20 point(s))，AC代码，欢迎想考PAT的童鞋们观看
C_point.rar_C point
09-24
"C_point.rar_C point"这个压缩包文件显然聚焦于C语言中的指针概念，对于初学者来说是一份非常宝贵的资源。让我们深入探讨一下C语言指针的知识点。 首先，C语言中的指针是内存地址的别名，它允许我们直接操作内存。...
Case In Point
02-16
Case In Point consultingCase In Point consulting
1161 Merging Linked Lists (25 point(s)) PAT
neko的博客
02-20 1046
1161 Merging Linked Lists (25 point(s)) 题目 Given two singly linked lists L1=a1→a2→⋯→an−1→anL_1=a_1→a_2→⋯→a_{n−1}→a_nL1​=a1​→a2​→⋯→an−1​→an​ and L2=b1→b2→⋯→bm−1→bmL_2=b_1→b_2→⋯→b_{m−1}→b_mL2​=b1​→b2​→⋯→bm−1​→bm​. If n≥2m, you are supposed to reverse and mer
1163 Dijkstra Sequence (30 point(s)) PAT
neko的博客
02-19 644
1163 Dijkstra Sequence (30 point(s)) ☆ 题目 Dijkstra’s algorithm is one of the very famous greedy algorithms. It is used for solving the single source shortest path problem which gives the shortest paths from one particular source vertex to all the other ver
1160 Forever (20 point(s))
neko的博客
02-20 547
1160 Forever (20 point(s)) ☆ 题目 “Forever number” is a positive integer A with K digits, satisfying the following constrains: the sum of all the digits of A is m; the sum of all the digits of A+1 is n; and the greatest common divisor of m and n is a prime n
1166 Summit (25 point(s)) PAT甲级
neko的博客
02-09 440
1166 Summit (25 point(s)) 题目 A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit is not a simple job. The ideal arrangement of one area is to invite those heads so that everyone is a direct friend of everyone
1156 Sexy Primes (20 point(s)) PAT 素数
neko的博客
02-25 370
1156 Sexy Primes (20 point(s)) 素数 题目 “Forever number” is a positive integer A with K digits, satisfying the following constrains: the sum of all the digits of A is m; the sum of all the digits of A+1 is n; and the greatest common divisor of m and n is a pr
1165 Block Reversing (25 point(s)) PAT甲级
neko的博客
02-08 277
1165 Block Reversing (25 point(s)) 题目 Given a singly linked list L. Let us consider every K nodes as a block (if there are less than K nodes at the end of the list, the rest of the nodes are still considered as a block). Your job is to reverse all the bloc
1018 Public Bike Management (30 point(s)) PAT（AVL树，层序遍历，完全二叉树）
neko的博客
03-02 234
1018 Public Bike Management (30 point(s)) ☆AVL树，层序遍历，完全二叉树 题目 An AVL tree is a self-balancing binary search tree. In an AVL tree, the heights of the two child subtrees of any node differ by at most one; if at any time they differ by more than one, rebalanc
1167 Cartesian Tree (30 point(s)) PAT甲级
neko的博客
02-09 157
1167 Cartesian Tree (30 point(s)) 题目 A summit (峰会) is a meeting of heads of state or government. Arranging the rest areas for the summit is not a simple job. The ideal arrangement of one area is to invite those heads so that everyone is a direct friend of
1118 Birds in Forest (25 point(s)) PAT（并查集）
neko的博客
03-01 154
1118 Birds in Forest (25 point(s)) 并查集 题目 Some scientists took pictures of thousands of birds in a forest. Assume that all the birds appear in the same picture belong to the same tree. You are supposed to help the scientists to count the maximum number of
c语言实现pointnet
最新发布
07-13
C语言实现PointNet是一个比较复杂的任务，因为PointNet是一个基于深度学习的模型，而C语言在深度学习方面的支持相对较弱。然而，你可以通过使用第三方库来实现类似的功能。 一个可能的方法是使用TensorFlow C API来...

“相关推荐”对你有帮助么？

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值