Automatic Poetry - UVa 10361 简单字符串处理
2014-05-29 21:34
337 查看
Problem I
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.
s1<s2>s3<s4>s5
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
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
...
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。
思路:没有什么好说的。
AC代码如下:
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.
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 forms1<s2>s3<s4>s5
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.
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
3ein 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 nurwenn 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。
思路:没有什么好说的。
AC代码如下:
#include<cstdio> #include<cstring> using namespace std; char str1[110],str2[110],s[6][110]; int main() { int t,i,j,k,len,pos; scanf("%d\n",&t); while(t--) { gets(str1); len=strlen(str1); i=0;k=1;pos=0; for(i=0;i<len;i++) { if(str1[i]=='<' || str1[i]=='>') { s[k][pos]='\0';k++;pos=0; } else s[k][pos++]=str1[i]; } s[5][pos]='\0'; printf("%s%s%s%s%s\n",s[1],s[2],s[3],s[4],s[5]); gets(str2); len=strlen(str2); for(i=0;i<len;i++) { if(str2[i]=='.') break; printf("%c",str2[i]); } printf("%s%s%s%s\n",s[4],s[3],s[2],s[5]); } }
相关文章推荐
- uva 10361 - Automatic Poetry (简单字符串)
- UVA 401(palindorme)简单字符串处理
- uva 10361 Automatic Poetry(字符串处理)
- UVa 10361 Automatic Poetry (字符串处理&两种读入方式)
- UVA - 10340 All in All :简单字符串处理
- UVA - 1368 DNA Consensus String :简单字符串处理
- UVA - 1339 Ancient Cipher :简单字符串处理
- NSString字符串处理简单总结
- hud 1860 简单字符串处理
- 处理PHP字符串的10个简单方法
- USACO Section 1.3 Calf Flac - 简单的字符串处理
- ADA程序实例(字符串类型及其简单处理)
- HDOJ 1039 Easier Done Than Said? 简单的字符串处理
- 字符串处理的一个简单题
- SDUT 2364 || POJ 2934 Automatic Correction of Misspellings(简单字符串处理)
- poj1035 简单的字符串处理
- ADA程序实例(字符串类型及其简单处理)
- 处理PHP字符串的10个简单方法
- 处理PHP字符串的10个简单方法
- 字符串处理的一个简单Function 仅作记录