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 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.

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

TUD Programming Contest

字符串问题，c1是由l1去掉‘<‘和‘>‘得到的，c2是由l2去掉"...“再加上l1的一部分得到的，很简单的一道题

 1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 
 5 using namespace std;
 6 
 7 int main()
 8 {
 9     int n;
10 
11     scanf("%d",&n);
12     getchar();
13 
14     while(n--)
15     {
16         char a1[200],a2[200],c1[200],c2[200],s[6][200];
17         gets(a1);
18         gets(a2);
19         int t=0;
20         bool first=true;
21         for(int i=0;a1[i]!=‘\0‘;i++)
22         {
23             if(a1[i]!=‘<‘&&a1[i]!=‘>‘)
24                 c1[t++]=a1[i];
25             else if(a1[i]==‘<‘&&first)
26             {
27                 first=false;
28                 int j=i+1,k=0;
29                 while(a1[j]!=‘>‘)
30                 {
31                     s[2][k++]=a1[j];
32                     j++;
33                 }
34                 s[2][k]=‘\0‘;
35                 j++;
36                 k=0;
37                 while(a1[j]!=‘<‘)
38                 {
39                     s[3][k++]=a1[j];
40                     j++;
41                 }
42                 s[3][k]=‘\0‘;
43                 j++;
44                 k=0;
45                 while(a1[j]!=‘>‘)
46                 {
47                     s[4][k++]=a1[j];
48                     j++;
49                 }
50                 s[4][k]=‘\0‘;
51                 j++;
52                 k=0;
53                 while(a1[j]!=‘\0‘)
54                 {
55                     s[5][k++]=a1[j];
56                     j++;
57                 }
58                 s[5][k]=‘\0‘;
59                 j++;
60                 k=0;
61             }
62         }
63         c1[t]=‘\0‘;
64         t=0;
65         for(int i=0;a2[i]!=‘.‘;i++)
66             c2[t++]=a2[i];
67         c2[t]=‘\0‘;
68 
69         puts(c1);
70         printf("%s%s%s%s%s\n",c2,s[4],s[3],s[2],s[5]);
71     }
72 
73     return 0;
74 }

[C++]

UVa 10361 Automatic Poetry