URAL 1993-This cheeseburger you don't need (模拟)
2014-07-28 22:22
627 查看
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
WA 了N 多遍的模拟题,没有注意到任何括号中的单词都可以作为句子开头!
CODE:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
const int inf=0xfffffff;
typedef long long ll;
using namespace std;
string s;
void work(int st)
{
for(int i=st;i<s.size();i++){
if(s[i]=='{'){
i++;
if(st == 0) s[i]=toupper(s[i]);
while(s[i]!='}'){
cout<<s[i];
i++;
}
cout<<" ";
break;
}
}
for(int i=st;i<s.size();i++){
if(s[i]=='('){
i++;
s[i]=tolower(s[i]);
while(s[i]!=')'){
cout<<s[i];
i++;
}
cout<<" ";
break;
}
}
for(int i=st;i<s.size();i++){
if(s[i]=='['){
i++;
s[i]=tolower(s[i]);
while(s[i]!=']'){
cout<<s[i];
i++;
}
break;
}
}
}
int main()
{
//freopen("in.in","r",stdin);
while(getline(cin,s))
{
int t=0;
for(int i=0;i<s.size();i++){
if(s[i] == ',') {
t=i;break;
}
}
if(t == 0){
work(0);
cout<<endl;
}
else{
work(0);
for(int i=t;;i++){
if(s[i]=='('|| s[i]=='['||s[i]=='{') break;
cout<<s[i];
}
work(t);
cout<<endl;
}
}
return 0;
}
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 |
WA 了N 多遍的模拟题,没有注意到任何括号中的单词都可以作为句子开头!
CODE:
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
const int inf=0xfffffff;
typedef long long ll;
using namespace std;
string s;
void work(int st)
{
for(int i=st;i<s.size();i++){
if(s[i]=='{'){
i++;
if(st == 0) s[i]=toupper(s[i]);
while(s[i]!='}'){
cout<<s[i];
i++;
}
cout<<" ";
break;
}
}
for(int i=st;i<s.size();i++){
if(s[i]=='('){
i++;
s[i]=tolower(s[i]);
while(s[i]!=')'){
cout<<s[i];
i++;
}
cout<<" ";
break;
}
}
for(int i=st;i<s.size();i++){
if(s[i]=='['){
i++;
s[i]=tolower(s[i]);
while(s[i]!=']'){
cout<<s[i];
i++;
}
break;
}
}
}
int main()
{
//freopen("in.in","r",stdin);
while(getline(cin,s))
{
int t=0;
for(int i=0;i<s.size();i++){
if(s[i] == ',') {
t=i;break;
}
}
if(t == 0){
work(0);
cout<<endl;
}
else{
work(0);
for(int i=t;;i++){
if(s[i]=='('|| s[i]=='['||s[i]=='{') break;
cout<<s[i];
}
work(t);
cout<<endl;
}
}
return 0;
}
相关文章推荐
- URAL 1993 This cheeseburger you don't need
- ural 1993 This cheeseburger you don't need
- URAL1993-This cheeseburger you don't need
- Ural 1993 This cheeseburger you don't need
- UVA 1993 This cheeseburger you don't need
- 多校联合训练赛 第三场D - This cheeseburger you don't need
- This cheeseburger you don't need
- ACM ICPC 2013-2014 D. This cheeseburger you don’t need(水~)
- You need to use a Theme.AppCompat theme (or descendant) with this activity解决方法
- 【Android】You need to use a Theme.AppCompat theme (or descendant) with this activity解决方法
- Github出现failed to sync branch You might need to open a shell and debug the state of this repo的解决方法
- wamp出现You don’t have permission to access/on this server提示
- apache 之 you don't have permission to access / on this server linux 下 错误解决方法
- You Don't Need jQuery
- phpStudy出现You don't have permission to access / on this server.
- 蛋疼的 403 Forbidden You don’t have permission to access / on this server.
- apache 问题 You don't have permission to access /test.php on this server 解决方法
- wamp You don't have permission to access / on this server等问题的解决.
- Android:真机调试遇到的问题(You need to use a Theme.AppCompat theme (or descendant) with this activity)
- CentOS 7.4 解决 403 Forbidden : You don't have permission to access / on this server