陈老师的多校联合 D题 字符串处理起来挺麻烦
2014-07-28 21:33
218 查看
http://vjudge.net/contest/view.action?cid=51327#problem/D
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
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
input |
---|
(We) [are] {blind}, if (we) [could not see] {creation of this clone army} |
output |
Blind we are, if creation of this clone army we could not see |
input |
{Truly wonderful} (the mind of a child) [is] |
output |
Truly wonderful the mind of a child is |
#include <stdio.h> #include <string.h> #include <iostream> using namespace std; char all[1002]; int main() { memset(all,0,sizeof(all)); while(gets(all)!=NULL) { int count=-1; for(int i=0; all[i]!=0; i++) { if(all[i]==',') { count=i-1; break; } } if(count!=-1) { int big1=0; int big2=0; int mid1=0; int mid2=0; int sma1=0; int sma2=0; for(int i=0; i<=count; i++) { if(all[i]=='[') mid1=i+1; if(all[i]==']') mid2=i-1; if(all[i]=='(') sma1=i+1; if(all[i]==')') sma2=i-1; if(all[i]=='{') big1=i+1; if(all[i]=='}') big2=i-1; } if(all[big1]>='a') printf("%c",all[big1]-'a'+'A'); else printf("%c",all[big1]); for(int i=big1+1; i<=big2; i++) printf("%c",all[i]); printf(" "); for(int i=sma1; i<=sma2; i++) if(all[i]<='Z'&&all[i]>='A') printf("%c",all[i]-'A'+'a'); else printf("%c",all[i]); printf(" "); for(int i=mid1; i<=mid2; i++) if(all[i]<='Z'&&all[i]>='A') printf("%c",all[i]-'A'+'a'); else printf("%c",all[i]); printf(","); for(int i=count+1; all[i]!=0; i++) { if(all[i]>='a'&&all[i]<='z') printf("%c",all[i]); if(all[i]==' ') printf(" "); if(all[i]=='('||all[i]=='['||all[i]=='{') { count=i; break; } } big1=0; big2=0; mid1=0; mid2=0; sma1=0; sma2=0; for(int i=count; all[i]!=0; i++) { if(all[i]=='[') mid1=i+1; if(all[i]==']') mid2=i-1; if(all[i]=='(') sma1=i+1; if(all[i]==')') sma2=i-1; if(all[i]=='{') big1=i+1; if(all[i]=='}') big2=i-1; } for(int i=big1; i<=big2; i++) printf("%c",all[i]); printf(" "); for(int i=sma1; i<=sma2; i++) printf("%c",all[i]); printf(" "); for(int i=mid1; i<=mid2; i++) printf("%c",all[i]); printf("\n"); } else { int big1=0; int big2=0; int mid1=0; int mid2=0; int sma1=0; int sma2=0; for(int i=0; all[i]!=0; i++) { if(all[i]=='[') mid1=i+1; if(all[i]==']') mid2=i-1; if(all[i]=='(') sma1=i+1; if(all[i]==')') sma2=i-1; if(all[i]=='{') big1=i+1; if(all[i]=='}') big2=i-1; } if(all[big1]>='a') printf("%c",all[big1]-'a'+'A'); else printf("%c",all[big1]); for(int i=big1+1; i<=big2; i++) if(all[i]<='Z'&&all[i]>='A') printf("%c",all[i]-'A'+'a'); else printf("%c",all[i]); printf(" "); for(int i=sma1; i<=sma2; i++) if(all[i]<='Z'&&all[i]>='A') printf("%c",all[i]-'A'+'a'); else printf("%c",all[i]); printf(" "); for(int i=mid1; i<=mid2; i++) if(all[i]<='Z'&&all[i]>='A') printf("%c",all[i]-'A'+'a'); else printf("%c",all[i]); printf("\n"); } memset(all,0,sizeof(all)); } return 0; }
相关文章推荐
- 陈老师的多校联合20140815 ||uvalive 5881 区间处理
- 陈老师的多校联合20180808 map映射字符串
- 陈老师的多校联合 20140809
- 陈老师的多校联合 20140809 C题
- hdu 4674 边双连通缩点+倍增lca+麻烦的讨论 (2013多校联合)
- 多校联合集训 A. 字符串“水”题 (状压+哈希)
- 2015多校联合第十场 hdu5414CRB and String字符串思维题
- 陈老师的多校联合 20140808 E题
- UVALive 5691 二分图匹配||陈老师的多校联合20140818 J题
- 陈老师的多校联合20140816A题||spoj 10228 动态规划
- 陈老师的多校联合20140811||HDU 3236 ||2009年武汉站G题 01背包问题
- 陈老师的多校联合20140816||spoj10237 bfs
- HDU 5414(2015多校10)-CRB and String(字符串处理)
- 陈老师的多校联合2009年武汉站D题 ||hdu 3033
- HDU 5414 CRB and String(字符串处理)——多校练习10
- 陈老师的多校联合 I题 二分
- 陈老师的多校联合2010811c题||09年武汉站||hdu3232
- 陈老师的多校联合20140818||Uvalive 5683 模拟
- 陈老师的多校联合20140816||SPOJ AMR11B 三角形的有向面积
- 用正则表达式处理含中文字符串的问题