如果发现广告等破坏行为,请尽量将条目恢复到较早的版本而不是把相应内容直接删除,谢谢合作。

URAL/1050

来自"NOCOW"

跳转到: 导航, 搜索

这种题目细心做就行了

program cao;
const
  maxn=300;
 
var
  data:array[0..maxn] of string;
  a,b,c,d,e,f,g,h,i,j,k,l,n,m,p,q:longint;
  flag:boolean;
 
begin
  n:=0;
  while not(eof) do
  begin
    inc(n);
    readln(data[n]);
  end;
  flag:=false;
  for i:=1 to n do
  begin
    j:=1;
    while j<=length(data[i]) do
    begin
      if (data[i][j]=#34)and((j=1)or(data[i][j-1]<>”\“)) then  //“ should be ‘
      begin
        if flag=false then
        begin
          flag:=true;
          p:=i;
          q:=j;
        end
        else
        begin
          flag:=false;
          delete(data[p],q,1);
          insert(#96#96,data[p],q);
          if p=i then inc(j);
          delete(data[i],j,1);
          insert(#39#39,data[i],j);
          inc(j);
        end;
      end
      else
      if (copy(data[i],j,4)=”\par“) then    //“ should be ‘
      begin
        if flag=true then
        begin
          flag:=false;
          delete(data[p],q,1);
          if p=i then dec(j);
        end;
      end;
      inc(j);
    end;
    if (flag=true)and(length(data[i+1])=0) then
    begin
      flag:=false;
      delete(data[p],q,1);
      if p=i then dec(j);
    end;
  end;
  for i:=1 to n do
    writeln(data[i]);
end.
个人工具