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

URAL/1038

来自"NOCOW"

跳转到: 导航, 搜索

比较容易的字符串题目,注意一些细节即可.

program cao;
var
  ch:char;
  a,b,c,d,e,f,g,h,i,j,k,l,n,m,p,q,ans,now:longint;
 
begin
  ans:=0;
  now:=0;
  while not(eof) do
  begin
    read(ch);
    case now of
      0:
      begin
        if ch in [‘a’..‘z’] then inc(ans);
        if ch in [‘A’..‘Z’,‘a’..‘z’] then now:=1;
      end;
      1:
      begin
        if ch in [‘A’..‘Z’] then inc(ans);
        if (ch in [‘A’..‘Z’,‘a’..‘z’])=false then
          if (ch in [‘?’,‘.’,‘!’]) then now:=0 else now:=2;
      end;
      2:
      begin
        if ch in [‘A’..‘Z’,‘a’..‘z’] then now:=1;
        if ch in [‘?’,‘.’,‘!’] then now:=0;
      end;
    end;
  end;
  writeln(ans);
end.

http://withflying.com/?p=90

http://withflying.com/

http://www.withflying.com/

个人工具