Блок-схема

uses crt;
var s,s1,s2:string;
    i,t,r:integer;
begin
clrscr;
writeln('Ââåñòè ñòðîêó: ');readln(s);
writeln('Ââåñòè ñëîâî: ');readln(s1);
while copy (s,1,1)=' ' do delete (s,1,1);
while copy (s,length(s),1)=' 'do delete (s,length(s),1);
while pos('  ',s)<>0 do delete (s,pos(' ',s),1);
while copy (s1,1,1)=' ' do delete (s1,1,1);
while copy (s1,length(s1),1)=' 'do delete (s1,length(s1),1);
while pos('  ',s1)<>0 do delete (s1,pos(' ',s1),1);
s:=s+' ';
repeat
t:=pos(' ',s);
s2:=copy(s,1,t-1);
if s2=s1 then r:=1;
delete(s,1,t);
writeln;
until length(s)=0;
if r=1 then write('Ýòî ñëîâî âñòðå÷àåòñÿ â ýòîé ñòðîêå')
  else write('Ýòîãî ñëîâà íåò â ýòîé ñòðîêå');
end.

const
  dividers = [' ', ',', '.', ';', ':']; {äîïèñàòü íóæíûå}
var
  s,sub,temp: string;
  i: byte;
begin
  ReadLn(s, sub);
  for i := 1 to Length(s) do
  begin
    if not (s[i] in dividers) then
      temp := temp + s[i];
    if ((s[i] in dividers) or (i = ord(s[0]))) and (temp <> '') then
      if temp = sub then
      begin
        WriteLn('Yes');
        ReadLn;
        exit;
      end
      else
        temp := '';
  end;
  WriteLn('No');
  ReadLn;
end.

const
  dividers = [' ', ',', '.', ';', ':']; {äîïèñàòü íóæíûå}
var
  s,sub,temp: string;
  i, len: byte;
begin
  ReadLn(s, sub);
  i := 1;
  len := ord(s[0]);
  while i <= len do
  begin
    if not (s[i] in dividers) then
      temp := temp + s[i];
    if ((s[i] in dividers) or (i = len)) and (temp <> '') then
      if temp = sub then
      begin
        WriteLn('Yes');
        ReadLn;
        exit;
      end
      else
        temp := '';
    Inc(i);
  end;
  WriteLn('No');
  ReadLn;
end.

var
  s,sub,temp: string;
  i, len: byte;
begin
  ReadLn(s, sub);
  i := 1;
  len := ord(s[0]);
  while i <= len do
  begin
    if s[i] <> ' ' then
      temp := temp + s[i];
    if ((s[i] = ' ') or (i = len)) and (temp <> '') then
      if temp = sub then
      begin
        WriteLn('Yes');
        ReadLn;
        exit;
      end
      else
        temp := '';
    Inc(i);
  end;
  WriteLn('No');
  ReadLn;
end.