您的位置:首页 > 其它

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.
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: