uva10361 Automatic Poetry

10361 Automatic Poetry

“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, prehistoriccaves and medival hallways. Now she is standing in front of some important Germanic lookingdoorway and has to solve a linguistic riddle to pass. As usual, the riddle is not very intellectuallychallenging.

This time, the riddle involves poems containing a “Schuttelreim”. An example of a Schuttelreim isthe following short poem:Ein Kind halt seinen Schnabel nur,wenn es hangt an der Nabelschnur.Note: German users, please, forgive me. I had to modify something as they were not appearingcorrectly in plain text formatA Schuttelreim seems to be a typical German invention. The funny thing about this strange typeof poetry is that if somebody gives you the first line and the beginning of the second one, you cancomplete the poem yourself. Well, even a computer can do that, and your task is to write a programwhich completes them automatically. This will help Lara concentrate on the “action” part of TombRaider 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 linescontaining Schuttelreims. The first line of each pair will be of the forms1s3s5where the si are possibly empty, strings of lowercase characters or blanks. The second line will bea string of lowercase characters or blanks ending with three dots ‘...’. Lines will we at most 100characters 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

思路：用数组存这些数据，然后输出。

#include<iostream>
#include<string>
#include<stdio.h>
#include<cstring>
using namespace std;

int main()
{
	char a1[100],a2[100],a3[100],a4[100],a5[100],a6[500],s1[500],s2[500];
	int t,i,j;
	scanf("%d",&t);
	getchar();
	while(t!= EOF){ 
		while(t--) {
			gets(s1);			
			gets(s2);
			//	while(s1!=EOF)  {
			//第一个字符串
			for(i=0,j=0;s1[j]!='<';i++,j++) {
				a1[i]=s1[j];
			}
			a1[i]='\0';
			//第二个字符串
			for(i=0,j=j+1;s1[j]!='>';i++,j++) {
				a2[i]=s1[j];
				
			}
			a2[i]='\0';
			//第3个字符串
			for(i=0,j=j+1;s1[j]!='<';i++,j++) {
				a3[i]=s1[j];
			}
			a3[i]='\0';
			//第4个字符串
			for(i=0,j=j+1;s1[j]!='>';i++,j++) {
				a4[i]=s1[j];
			}
			a4[i]='\0';
			//第5个字符串
			for(i=0,j=j+1;j<strlen(s1);i++,j++) {
				a5[i]=s1[j];
			}
			a5[i]='\0';
			
			//第2个大串
			for(i=0,j=0;s2[i] != '.';i++,j++){  
				a6[j]=s2[i];
			}
			a6[j]='\0';
			cout<<a1<<a2<<a3<<a4<<a5<<endl;
			cout<<a6<<a4<<a3<<a2<<a5<<endl;
			
		}
	}
	return 0;
}