UVa - 10361 - Automatic Poetry

最新推荐文章于 2016-07-23 23:10:14 发布

最爱林丽明小姐

最新推荐文章于 2016-07-23 23:10:14 发布

阅读量704

点赞数

分类专栏：字符串

本文链接：https://blog.csdn.net/kissme_a/article/details/9746629

版权

字符串专栏收录该内容

11 篇文章 0 订阅

订阅专栏

在Tomb Raider XIV中，Lara Croft面对一道需要解决的诗歌谜题来通过一道德国风格的门。这道谜题涉及到一种称为Schuttelreim的特殊韵律，玩家需要通过编写程序来自动完成这些诗歌。文章提供了输入示例、输出格式说明以及解决方案代码。

摘要由CSDN通过智能技术生成

题目大意：

如：输入

s1 <s2>s3 <s4>s5

s6 ...

则我们要输出：

s1 s2s3 s4s5

s6 s4s3 s2s5

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

s₁<s₂>s₃<s₄>s₅

where the s_i 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 l₁ and l₂ you are to output two lines c₁ and c₂ in the following way: c₁ is the same as l₁ only that the bracket marks “<” and “>” are removed. Line c₂ is the same as l₂ , except that instead of the three dots the string s₄s₃s₂s₅ should appear.

Sample Input

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

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<algorithm>

using namespace std;

int main()
{
	char l[2][100];
	int n, f[2], s[2], i, j, h1, h2;
	scanf("%d%*c", &n);
	while (n --)
	{
		i = 0;
		memset(l, 0, sizeof(l));
		gets(l[0]);
		gets(l[1]);
		while (l[0][i] != '<')
		{
			putchar(l[0][i]);
			i ++;
		}
		f[0] = i ++;    //标记第一个'<'的位置
		while (l[0][i] != '>')
		{
			putchar(l[0][i]);
			i ++;
		}
		s[0] = i ++;  //标记第一个'>'的位置
		while (l[0][i] != '<')
		{
			putchar(l[0][i]);
			i ++;
		}
		f[1] = i++;    //标记第二个'<'的位置
		while (l[0][i] != '>')
		{
			putchar(l[0][i]);
			i ++;
		}
		s[1] = i ++;    //标记第二个'>'的位置
		while (l[0][i])
		{
			putchar(l[0][i ++]);
		}
		putchar('\n');
		i = 0;

                //根据标记的位置输出
		for (i = 0; l[1][i] != '.'; i ++)
		{
			putchar(l[1][i]);
		}
		for (i = f[1] + 1; i < s[1]; i ++)
		{
			printf("%c", l[0][i]);
		}
		for (i = s[0] + 1; i < f[1]; i ++)
		{
			printf("%c", l[0][i]);
		}
		for (i = f[0] + 1; i < s[0]; i ++)
		{
			printf("%c", l[0][i]);
		}
		for (i = s[1] + 1; i < strlen(l[0]); i ++)
		{
			printf("%c", l[0][i]);
		}
		putchar('\n');
	}
	return 0;
}