UVa OJ 10361-Automatic Poetry
2011-01-13 15:24
330 查看
还是字符串处理:
{ Author:wzx961008 Problem:UVa 10361-Automatic Poetry Verdict:Accepted Language:PASCAL Run Time:0.008s Submission Date:2011-01-12 06:41:09 } var i,j,n,top:longint; s1,s2,s3:string; word:array[1..5]of string; begin readln(n); for i:=1 to n do begin readln(s1); readln(s2); top:=1; for j:=1 to 5 do word[j]:=''; for j:=1 to length(s1) do if (s1[j]<>'<')and(s1[j]<>'>') then word[top]:=word[top]+s1[j] else inc(top); for j:=1 to 5 do write(word[j]); writeln; delete(s2,length(s2)-2,3); writeln(s2+word[4]+word[3]+word[2]+word[5]); end; end.
相关文章推荐
- uva oj 10361
- Uva oj 11059 Maximum Product(简单枚举)
- UVaOJ10344 - 23 out of 5
- "Accordian" Patience UVa OJ 127 纸牌游戏
- UVa 10361 - Automatic Poetry
- UVA_10361
- Uva 10361 - Automatic Poetry
- uva 10361
- UVa_OJ 10161 棋盘上的蚂蚁
- UVa OJ 199 - Partial differential equations (偏微分方程)
- uva 10361 - Automatic Poetry
- UVa 10361 Automatic Poetry
- UVa OJ The Blocks Problem 木块问题 101
- Uva oj 10976 Fractions Again (简单枚举)
- 100 - The 3n + 1 problem Form UVa OJ
- UVaOJ140 - Bandwidth
- UVa 10361 - Automatic Poetry
- uvaoj401.2
- UVA - 10361 Automatic Poetry
- uva 10361