Saturday, April 23, 2011


Problem Links:

uva10361, poj1917,


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.


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

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.


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

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

TUD Programming Contest


Keysearch: brackets('&lt;', '&gt;');

Source Code:

//Sat Apr 23 23:52:30 CDT 2011
#include &lt;vector&gt;
#include &lt;list&gt;
#include &lt;map&gt;
#include &lt;set&gt;
#include &lt;deque&gt;
#include &lt;queue&gt;
#include &lt;stack&gt;
#include &lt;bitset&gt;
#include &lt;algorithm&gt;
#include &lt;functional&gt;
#include &lt;numeric&gt;
#include &lt;utility&gt;
#include &lt;sstream&gt;
#include &lt;iostream&gt;
#include &lt;iomanip&gt;
#include &lt;cstdio&gt;
#include &lt;cmath&gt;
#include &lt;cstdlib&gt;
#include &lt;cctype&gt;
#include &lt;string&gt;
#include &lt;cstring&gt;
#include &lt;cstdio&gt;
#include &lt;cmath&gt;
#include &lt;cstdlib&gt;
#include &lt;ctime&gt;

using namespace std;

void processLine(string a, string b) {
    string s1 = "";
    string s2 = "";
    string s3 = "";
    string s4 = "";
    string s5 = "";
    size_t found1 = a.find('&lt;', 0);
    s1 = a.substr(0, found1);
    size_t found2 = a.find('&gt;', 0);
    s2 = a.substr(found1 + 1, found2 - found1 - 1);
    found1 = a.find('&lt;', found1 + 1);
    s3 = a.substr(found2 + 1, found1 - found2 - 1);
    found2 = a.find('&gt;', found2 + 1);
    s4 = a.substr(found1 + 1, found2 - found1 - 1);
    s5 = a.substr(found2 + 1);
    cout &lt;&lt; s1 &lt;&lt; s2 &lt;&lt; s3 &lt;&lt; s4 &lt;&lt; s5 &lt;&lt; endl;
    b = b.substr(0, b.size() - 3);
    cout &lt;&lt; b &lt;&lt; s4 &lt;&lt; s3 &lt;&lt; s2 &lt;&lt; s5 &lt;&lt; endl;

void solve() {
    string a, b;
    getline(cin, a, '\n');
    getline(cin, b, '\n');
    processLine(a, b);

int main(int argc, char* argv[]) {
//  freopen("", "r", stdin);
    //freopen("output.out", "w", stdout);
    int T;
    cin &gt;&gt; T;
    while (T--) {
//  fclose(stdin);
    return 0;

No comments :