uva 10361(字符串)

题目：

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

题意：字符串问题，第一种将<><>去掉输出，另一种需要将上一句中的s1<s2>s3<s4>s5以s4 s3 s2 s5的顺序输出代替字符串的'...'。可以标记一下，然后按顺序 if,else 输出并储存下来就可以了。另外。。还可以用fgetss()函数，和fgets()有点像，不同的是读取字符串到有'<'或者'>'的时候停止读取，可以直接将第一种字符串读取五部分到五个字符串里就好操作了。

#include <iostream>
#include <string>
#include <cstdio>
using namespace std;
string a,b,c,d;
int main()
{
    string str;
    int t,i,length1,flag,j;
    cin >> t;
    t=2*t;
    getchar();
    while(t--)
    {
        getline(cin,str);
        length1=str.length();
        if(t%2!=0)
        {
            flag=0;
            a="",b="",c="",d="";
            for(i=0;i<length1;i++)
            {
                if(str[i]!='<'&&flag==0&&str[i]!='>')
                    cout << str[i];
                else if(flag==0)
                    flag=1;
                else if(str[i]=='<'&&flag==1)
                    continue;
                else if(str[i]!='>'&&flag==1)
                {
                    a+=str[i];
                    cout << str[i];
                }
                else if(flag==1)
                    flag=2;
                else if(str[i]!='<'&&flag==2)
                {
                    b+=str[i];
                    cout << str[i];
                }
                else if(flag==2)
                    flag=3;
                else if(str[i]!='>'&&flag==3)
                {
                    c+=str[i];
                    cout << str[i];
                }
                else if(flag==3)
                    flag=4;
                else
                {
                    d+=str[i];
                    cout << str[i];
                }
            }
            cout << endl;
        }
        else
        {
            for(i=0;i<length1-2;i++)
            {
                if(str[i]!='.')
                    cout << str[i];
                else
                    cout << c << b << a << d << endl;
            }
        }
    }
    return 0;
}