多校联合训练赛 第三场D - This cheeseburger you don't need

 

D -This cheeseburger you don't need

Time Limit:1000MS    Memory Limit:65536KB    64bit IO Format:%I64d & %I64u

SubmitStatusPracticeURAL 1993

Description

Yoda: May the Force be with you.

Master Yoda is the oldest member of the Jedi Council. He conducts preparatory classes of little Younglings up to the moment they get a mentor. All Younglings adore master Yoda and they hope to grow as strong and wise as he is. Just like all little children, Younglings are absolutely hooked on new games and ideas. Now they decided to learn to speak just like master Yoda. Help the Younglings understand how Yoda would say this or that sentence.

Yoda is speaking the Galactic language using the specific word order — so-called "object-subject-verb".

Your program receives a sentence that interests the Younglings. They have already highlighted all important parts in the sentence. They use the curly {}-brackets for objects, round ()-brackets for subjects and square []-brackets for verbs.

A sentence in the input can be simple or complex. If the sentence is complex, then it consists of two simple sentences separated by a comma. Sometimes a comma is followed by a conjunction that is not in the brackets.

Each simple question has exactly one object, one subject and one verb. Your task is to simply put them in the correct order. Namely, first the object, then the subject, finally the verb. Also, please do not forget that only the first word in the whole sentence should begin with capital letter.

Input

The single line contains a sentence that interests the Younglings. The length of the sentence does not exceed 100 characters. All the words in the sentence consist of Latin letters. The first letter of the first word is capitalized and the rest are small. The sentence may contain a comma. Each simple sentence contains all three types of brackets. Each pair of brackets surrounds one or more words. No pair of brackets can surround the other bracket. Brackets are always located on the borders of words. The words in the sentence are separated by a single space. There is no space character before a comma or a closing bracket and also after an opening bracket. The conjunction (which can be only after a comma) is the only word that is not surrounded by a pair of brackets.

Output

Print the sentence with the word order Yoda would use. All brackets must be omitted. You should separate the words by a single space.

Sample Input

字符串处理题；

题意：已知一行打了各种括号的句子，运用下列的括号优先级还原句子，意思就是根据优先级去掉括号。

注意{},>>字母>>（）>>[  ]>>的优先级，

/******************Times:31ms*****************/#include<cstdio>#include<cstring>#include<cstdlib>#include<iostream>#include<algorithm>#include<cmath>#include<ctime>#include<queue>#include<stack>using namespace std;//#include<windows.h>//#include<conio.h>#define max(a,b) a>b?a:b#define min(a,b) a>b?b:a#define mem(a,b) memset(a,b,sizeof(a))#define malloc(sb) (sb *)malloc(sizeof(sb))//int dir[4][2]= {{0,1},{0,-1},{1,0},{-1,0}};using namespace std;string str;string nn[105],mm[105],vv[105];int c1=0 ,c2=0 ,c3=0 ;int len;void duoxiao(){    for(int i = 0 ; i < len ; i++)    {        if(str[i] == '(')        {            for(int j = i+1 ; j < len ; j++)            {                if(str[j] == ')')                {                    mm[c1++] = str.substr(i+1,j-i-1);                    break;                }            }        }    }    for(int i = 0 ; i < len ; i++)    {        if(str[i] == '[')        {            for(int j = i+1 ; j < len ; j++)            {                if(str[j] == ']')                {                    vv[c2++] = str.substr(i+1,j-i-1);                    break;                }            }        }    }    for(int i = 0 ; i < len ; i++)    {        if(str[i] == '{')        {            for(int j = i+1 ; j < len ; j++)            {                if(str[j] == '}')                {                    nn[c3++] = str.substr(i+1,j-i-1);                    break;                }            }        }    }}int main(){    while(getline(cin,str))    {        string sum[105];        len = str.size();        c1=0 ,c2=0 ,c3=0;        for(int i = 0 ; i < len ; i++)        {            if(str[i] >= 'A' && str[i] <= 'Z')            {                str[i] = str[i] - 'A' + 'a';                break;            }        }         int cnt = 0;        for(int i = 0 ; i < len ; i++)        {   //      cout<<i<<endl;            if(str[i] == '(' || str[i] == '{' || str[i] == '[')            {                for(int j = i+1 ; j < len ; j++)                {                    if(str[j] == ')' || str[j] == ']' || str[j] == '}')                    {                        sum[cnt++] = str.substr(i,j-i+1);  //                     cout<<sub[cnt-1]<<endl;                        i = j;                        break;                    }                }            }            else            {                for(int j = i+1 ; j < len ; j++)                {                    if(str[j] == '(' || str[j] == '{' || str[j] == '[')                    {                        sum[cnt++] = str.substr(i,j-i); //                      cout<<sub[cnt-1]<<endl;                        i = j-1;                        break;                    }                }            }        }        duoxiao();        int flag = 0,c = 0;        string ss;        for(int i = 0 ; i < cnt ; i++)        {            if(sum[i][0] == '(' || sum[i][0] == '{' || sum[i][0] == '[' )            {                if(flag == 0) ss+=nn[c];                else if(flag == 1) ss+=mm[c];                else if(flag == 2) ss+=vv[c];   //             cout<<ss<<endl;                if(++flag == 3)                {                    flag = 0;                    c++;                }            }            else ss+=sum[i];        }  //      cout<<ss<<endl;        if(ss[0] >= 'a' && ss[0] <= 'z')            ss[0] = ss[0] - 'a' + 'A';        cout<<ss<<endl;    }    return 0;}