//Najdluzsze wspolne podslowo
//www.algorytm.org
//(c)2007 Tomasz Lubinski

program podtekst;
{$APPTYPE CONSOLE}
uses
  SysUtils, Math;

var
        s1,s2 : String;
        m,n,maxi,ind,i,j : Integer;
        a: array of array of Integer;
begin

        writeln('Podaj pierwszy ciag');
        readln(s1);
        writeln('Podaj drugi ciag');
        readln(s2);

        m := length(s1);
        n := length(s2);
        maxi := 0;
        ind := 0;
        setLength(a, max(m,n)+1);
        for i:=0 to max(m,n) do
        begin
                setLength(a[i], max(m,n)+1);
        end;
        for i:=0 to max(m,n) do
        begin
                a[0,i] := 0;
                a[i,0] := 0;
        end;
        for i:=1 to m do
                for j:=1 to n do
                        if s1[i] <> s2[j] then
                                a[i,j] := 0
                        else
                        begin
                                a[i,j] := a[i-1,j-1]+1;
                                if a[i,j] > maxi then
                                begin
                                       maxi := a[i,j];
                                       ind := i;
                                end;
                        end;

        writeln('Najdluzszy wspolny podciag ma dlugosc ' + IntToStr(maxi));
        if maxi <> 0 then
        begin
                write('Jest to: ');
                for i:=1 to maxi do
                      write(s1[ind+i-maxi]);
        end;
        readln;
end.