PAT-2019年冬季考试-甲级-7-1 Good in C (20分)——字符串

妖狐艹你老母 2023-02-19 08:22 103阅读 0赞

本题在2021年12月之后才会解封放到免费题库里，目前需要收费。
题目：
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:
  1. ..C..
  2. .C.C.
  3. C...C
  4. CCCCC
  5. C...C
  6. C...C
  7. C...C
  8. CCCC.
  9. C...C
  10. C...C
  11. CCCC.
  12. C...C
  13. C...C
  14. CCCC.
  15. .CCC.
  16. C...C
  17. C....
  18. C....
  19. C....
  20. C...C
  21. .CCC.
  22. CCCC.
  23. C...C
  24. C...C
  25. C...C
  26. C...C
  27. C...C
  28. CCCC.
  29. CCCCC
  30. C....
  31. C....
  32. CCCC.
  33. C....
  34. C....
  35. CCCCC
  36. CCCCC
  37. C....
  38. C....
  39. CCCC.
  40. C....
  41. C....
  42. C....
  43. CCCC.
  44. C...C
  45. C....
  46. C.CCC
  47. C...C
  48. C...C
  49. CCCC.
  50. C...C
  51. C...C
  52. C...C
  53. CCCCC
  54. C...C
  55. C...C
  56. C...C
  57. CCCCC
  58. ..C..
  59. ..C..
  60. ..C..
  61. ..C..
  62. ..C..
  63. CCCCC
  64. CCCCC
  65. ....C
  66. ....C
  67. ....C
  68. ....C
  69. C...C
  70. .CCC.
  71. C...C
  72. C..C.
  73. C.C..
  74. CC...
  75. C.C..
  76. C..C.
  77. C...C
  78. C....
  79. C....
  80. C....
  81. C....
  82. C....
  83. C....
  84. CCCCC
  85. C...C
  86. C...C
  87. CC.CC
  88. C.C.C
  89. C...C
  90. C...C
  91. C...C
  92. C...C
  93. C...C
  94. CC..C
  95. C.C.C
  96. C..CC
  97. C...C
  98. C...C
  99. .CCC.
  100. C...C
  101. C...C
  102. C...C
  103. C...C
  104. C...C
  105. .CCC.
  106. CCCC.
  107. C...C
  108. C...C
  109. CCCC.
  110. C....
  111. C....
  112. C....
  113. .CCC.
  114. C...C
  115. C...C
  116. C...C
  117. C.C.C
  118. C..CC
  119. .CCC.
  120. CCCC.
  121. C...C
  122. CCCC.
  123. CC...
  124. C.C..
  125. C..C.
  126. C...C
  127. .CCC.
  128. C...C
  129. C....
  130. .CCC.
  131. ....C
  132. C...C
  133. .CCC.
  134. CCCCC
  135. ..C..
  136. ..C..
  137. ..C..
  138. ..C..
  139. ..C..
  140. ..C..
  141. C...C
  142. C...C
  143. C...C
  144. C...C
  145. C...C
  146. C...C
  147. .CCC.
  148. C...C
  149. C...C
  150. C...C
  151. C...C
  152. C...C
  153. .C.C.
  154. ..C..
  155. C...C
  156. C...C
  157. C...C
  158. C.C.C
  159. CC.CC
  160. C...C
  161. C...C
  162. C...C
  163. C...C
  164. .C.C.
  165. ..C..
  166. .C.C.
  167. C...C
  168. C...C
  169. C...C
  170. C...C
  171. .C.C.
  172. ..C..
  173. ..C..
  174. ..C..
  175. ..C..
  176. CCCCC
  177. ....C
  178. ...C.
  179. ..C..
  180. .C...
  181. C....
  182. CCCCC
  183. HELLO~WORLD!
Sample output:
  1. C...C CCCCC C.... C.... .CCC.
  2. C...C C.... C.... C.... C...C
  3. C...C C.... C.... C.... C...C
  4. CCCCC CCCC. C.... C.... C...C
  5. C...C C.... C.... C.... C...C
  6. C...C C.... C.... C.... C...C
  7. C...C CCCCC CCCCC CCCCC .CCC.
  9. C...C .CCC. CCCC. C.... CCCC.
  10. C...C C...C C...C C.... C...C
  11. C...C C...C CCCC. C.... C...C
  12. C.C.C C...C CC... C.... C...C
  13. CC.CC C...C C.C.. C.... C...C
  14. C...C C...C C..C. C.... C...C
  15. C...C .CCC. C...C CCCCC CCCC.

题意:

每个输入文件包含一个测试用例。对于每种情况，第一部分给出26个大写英文字母A-Z，每个字母在C’s和.’s的7×5矩阵中。然后一个句子在一行中给出，以一个回车结束。句子由几个单词组成（每个单词不超过10个连续的大写英文字母），单词之间用大写英文字母以外的任何字符隔开。

保证至少有一个单词被给出。

代码：

  1. //代码仅通过测试样例
  2. //神圣之光原创代码
  3. #include<bits/stdc++.h>
  4. using namespace std;
  5. vector <string> vi[26];
  6. string s;
  7. int main(){ 
  8.     for(int i=0;i<26;i++){ 
  9.         for(int j=0;j<7;j++){ 
  10.             getline(cin,s);
  11.             vi[i].push_back(s);
  12.         }
  13.     }
  14.     getline(cin,s);
  15.     int pre=0;
  16.     for(int i=0;i<s.size();i++){ 
  17.         if(s[i]>'Z' ||  s[i]<'A'){ 
  18.             for(int p=0;p<7;p++){ 
  19.                 for(int j=pre;j<i-1;j++){ 
  20.                   cout<<vi[s[j]-'A'][p]<<" ";
  21.                 }
  22.                 cout<<vi[s[i-1]-'A'][p]<<endl;;
  23.             }
  24.             pre=i+1;
  25.             cout<<endl;    
  26.         }
  27.     }
  28.     return 0;
  29. }
  31. //代码来源网络
  32. #include <iostream>
  33. #include <vector>
  34. using namespace std;
  35. int main(){ 
  36.     vector<string> v[26], word;
  37.     string s, temp;
  38.     for(int i = 0; i < 26; i++){ 
  39.         for(int j = 0; j < 7; j++){ 
  40.             getline(cin, s);
  41.             v[i].push_back(s);
  42.         }        
  43.     }
  44.     getline(cin, s);
  45.     for(int i = 0; i < s.length(); i++){ 
  46.         if(s[i] <= 'Z' && s[i] >= 'A'){ 
  47.             temp += s[i];
  48.         }else{ 
  49.             if(temp != ""){ 
  50.                 word.push_back(temp);
  51.                 temp = "";
  52.             }
  53.         }
  54.     }
  55.     if(temp != "") word.push_back(temp);
  56.     for(int i = 0; i < word.size(); i++){ 
  57.         for(int j = 0; j < 7; j++){ 
  58.             for(int k = 0; k < word[i].size(); k++){ 
  59.                 int ind = word[i][k] - 'A';
  60.                 printf("%s%s", k == 0?"":" ", v[ind][j].c_str());
  61.             }
  62.             if( !(i == word.size() - 1 && j == 6) )printf("\n");
  63.         }
  64.         if(i != word.size() - 1) printf("\n");
  65.     }
  66.     return 0;
  67. }
  69. //代码来源网络
  70. #include<iostream>
  71. #include<cctype>
  72. #include<vector>
  73. int n,m;
  74. char v[26][7][5];
  75. int main(){ 
  76.     for(int i=0;i<26;i++){ 
  77.        for(int j=0;j<7;j++){ 
  78.            scanf("%c%c%c%c%c\n",&v[i][j][0],&v[i][j][1],&v[i][j][2]
  79.                ,&v[i][j][3],&v[i][j][4]);
  80.         }
  81.     }
  82.     char ch;
  83.     bool f=false;
  84.     vector<int> word;
  85.     while(~scanf("%c",&ch)){ 
  86.         if(isupper(ch)){ 
  87.             word.push_back(ch-'A');
  88.         }else if(!word.empty()){ 
  89.             if(f)printf("\n\n");
  90.             int len=word.size()*6-1;
  91.             char w[7][len];
  92.             for(int i=0;i<7;i++){ 
  93.                 int k=0;
  94.                 for(int j=0;j<len;j++){ 
  95.                     if(j>0&& (j+1)%6==0){ 
  96.                         w[i][j]=' ';
  97.                         k++;
  98.                     }
  99.                     else w[i][j]=v[word[k]][i][j%6];
  100.                 }
  101.             }
  102.             for(int i=0;i<7;i++){ 
  103.                 if(i!=0)printf("\n");
  104.                 for(int j=0;j<len;j++){ 
  105.                     if(w[i][j]-' '!=0)printf("%c",w[i][j]);
  106.                     else printf(" ");
  107.                 }
  108.             }
  109.             //if(ch=='\n')return 0;//写不写都行，这里没测试点
  110.             f=true;
  111.             word.clear();
  112.         }
  113.     }
  114.     return 0;
  115. }
  117. //本代码没有经过PAT官网测试，仅提供思路。
  118. #include<bits/stdc++.h>
  119. using namespace std;
  120. string s[27][8];
  121. int main(){ 
  122.     for(int i=1;i<=26;i++){ 
  123.         for(int j=1;j<=7;j++){ 
  124.             cin>>s[i][j];
  125.         }
  126.     }
  127.     string a;
  128.     getchar ();
  129.     getline(cin,a);
  130.     int sit=0,qsit=0;//sit为当前位置，qsit为前一次位置。
  131.     while(a.length() >= sit+1)
  132.     { 
  133.         if(a[sit]<='A' || a[sit]>='Z'){ 
  134.             for(int i=1;i<=7;i++){ 
  135.                 for(int j=qsit;j<sit;j++){     
  136.                 cout<<s[a[j]-'A'+1][i];
  137.                 if(j<sit-1)printf(" ");
  138.                 }
  139.                 cout<<endl;
  140.            } 
  141.            qsit=sit+1;
  142.            if(a.length() > sit+1)cout<<endl;
  143.         } 
  144.         sit++;
  145.     }
  146.     //最后一个字符为字母，不是任意字符，将最后一个单词输出
  147.     if(qsit < a.length()  ){ 
  148.         for(int i=1;i<=7;i++){ 
  149.               for(int j=qsit;j<a.length();j++){     
  150.               cout<<s[a[j]-'A'+1][i];
  151.               if(j<a.length()-1)printf(" ");
  152.               }
  153.               cout<<endl;
  154.         } 
  155.     }
  156.     return 0;
  157. }

发表评论

表情：
评论列表 （有 0 条评论，103人围观）

还没有评论，来说两句吧...

相关阅读