UVa 10361 Automatic Poetry

Automatic Poetry

Input: standard input

Output: standard output

Time Limit: 2 seconds

Memory Limit: 32 MB

“Oh God”, Lara Croft exclaims, “it’s one of these dumb riddles again!”

In Tomb Raider XIV, Lara is, as ever, gunning her way through ancient Egyptian pyramids, prehistoric caves and medival hallways. Now she is standing in front of some important Germanic looking doorway and has to solve a linguistic riddle to pass. As usual, the riddle is not very intellectually challenging.

This time, the riddle involves poems containing a “Schuttelreim”. An example of a Schuttelreim is the following short poem:

Ein Kind halt seinen Schnabel nur,

wenn es hangt an der Nabelschnur.

/*German contestants please forgive me. I had to modify something as they were not appearing correctly in plain text format*/

A Schuttelreim seems to be a typical German invention. The funny thing about this strange type of poetry is that if somebody gives you the first line and the beginning of the second one, you can complete the poem yourself. Well, even a computer can do that, and your task is to write a program which completes them automatically. This will help Lara concentrate on the “action” part of Tomb Raider and not on the “intellectual” part.

Input

The input will begin with a line containing a single number n. After this line follow n pairs of lines containing Schuttelreims. The first line of each pair will be of the form

s1<s2>s3<s4>s5

where the si are possibly empty, strings of lowercase characters or blanks. The second line will be a string of lowercase characters or blanks ending with three dots “...”. Lines will we at most 100 characters long.

Output

For each pair of Schuttelreim lines l1 and l2 you are to output two lines c1 and c2 in the following way: c1 is the same as l1 only that the bracket marks “<” and “>” are removed. Line c2 is the same as l2 , except that instead of the three dots the string s4s3s2s5 should appear.

Sample Input

3

ein kind haelt seinen <schn>abel <n>ur

wenn es haengt an der ...

weil wir zu spaet zur <>oma <k>amen

verpassten wir das ...

<d>u <b>ist

...

Sample Output

ein kind haelt seinen schnabel nur

wenn es haengt an der nabel schnur

weil wir zu spaet zur oma kamen

verpassten wir das koma amen

du bist

bu dist

这是一道很简单的字符串处理的题目,我是设置cin.getline()函数的第三个参数来取si的。

注意第二个字符串后面的3个‘.‘,其他没什么好说的。

 1 //#define LOCAL
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstring>
 5 using namespace std;
 6
 7 const int maxn = 105;
 8 char s1[5][maxn];
 9 char s2[maxn];
10
11 int main(void)
12 {
13     #ifdef LOCAL
14         freopen("10361in.txt", "r", stdin);
15     #endif
16     int N, i;
17     scanf("%d", &N);
18     while(N--)
19     {
20         memset(s1, 0, sizeof(s1));
21         getchar();
22         cin.getline(s1[0], maxn, ‘<‘);
23         cin.getline(s1[1], maxn, ‘>‘);
24         cin.getline(s1[2], maxn, ‘<‘);
25         cin.getline(s1[3], maxn, ‘>‘);
26         cin.getline(s1[4], maxn);
27         for(i = 0; i < 5; ++i)
28         {
29             cout << s1[i];
30         }
31         cout << endl;
32
33         cin.getline(s2, maxn, ‘.‘);
34         getchar();
35         getchar();
36         cout << s2 <<s1[3] << s1[2] << s1[1] << s1[4] << endl;
37
38     }
39     return 0;
40 }

代码君

UVa 10361 Automatic Poetry

时间: 2024-10-24 11:18:28

UVa 10361 Automatic Poetry的相关文章

UVA之10361 - Automatic Poetry

Problem I Automatic Poetry Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB "Oh God", Lara Croft exclaims, "it's one of these dumb riddles again!" In Tomb Raider XIV, Lara is, as ever, gunning her

10361 - Automatic Poetry

#include<iostream> #include<cctype> #include<cstring> #include<algorithm> using namespace std; char str1[105],str2[105]; string s2,s4; int main(){ int n; cin >> n; getchar(); while(n--){ gets(str1); gets(str2); s2 = "&qu

UVa 10115 - Automatic Editing

题目:给你一些字符串的替换关系,以及一个句子.按顺序替换,输出最后结果. 分析:字符串.按照替换顺序依次替换(这个替换用过之后,就不再使用),每个替换可能出现多次. 这里注意,如果当前串中有多个可被当前单词替换的位置,只替换最前面的那个, 下次用本次生成的串替换,而不是整体一次性替换. 说明:注意数据清空. #include <iostream> #include <cstdlib> #include <cstring> #include <cstdio>

小白书训练-Automatic Poetry

题目链接:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1302 题意:就是用<和>吧一句话截断为5部分,然后先打印s1s2s3s4s5,然后再输入一句话,然后在打印这句话(去除'.'),然后打印s4s3s2s5.其实就是个模拟,没有难度,就是英语有点问题,用指针分分钟的事情. 代码: #include <iostream

UVA 10115 Automatic Editing(字符处理)

Text-processing tools like awk and sed allow you to automatically perform a sequence of editing operations based on a script. For this problem we consider the specific case in which we want to perform a series of string replacements, within a single

UVA题目分类

题目 Volume 0. Getting Started 开始10055 - Hashmat the Brave Warrior 10071 - Back to High School Physics 10300 - Ecological Premium 458 - The Decoder 494 - Kindergarten Counting Game 414 - Machined Surfaces 490 - Rotating Sentences 445 - Marvelous Mazes

UVA 10361-Automatic Poetry(模拟)

Automatic Poetry Time Limit:3000MS     Memory Limit:0KB     64bit IO Format:%lld & %llu Submit Status Description Problem I Automatic Poetry Input: standard input Output: standard output Time Limit: 2 seconds Memory Limit: 32 MB "Oh God", La

寒假练习 02

今天刷了小白书的字符串专题,各种WA以及PE.UVaOJ中有时候会把PE判成WA,这样会导致很难查错. UVa 401 这道题目有个坑,只有表格中列出的才是镜像字母,没有列出了的表示没有镜像字母,在这上WA了一次. #include <iostream> #include <string> using namespace std; const char pAlphabet[] = { 'A', '*', '*', '*', '3', '*', '*', 'H', 'I', 'L',

UVA10361 -自动作诗机

UVA10361 - Automatic Poetry(自动作诗机) A Schuttelreim seems to be a typical German invention. The funny thing about this strange type of poetry is that if somebody gives you the first line and the beginning of the second one, you can complete the poem yo