DataMuseum.dk

algol<
begin
_____
integer m,n,p,q,r,k,l,i,j,s;
_______
select(19);writecr;
m:=read integer;n:=read integer;p:=read integer;q:=read integer;r:=0;
 begin
 _____
 integer array A[1:m],B[1:n],C[1:p];
 _______ _____
 for i:=1 step 1 until m do
 ___      ____   _____   __
 A[i]:=read integer;
 for i:=1 step 1 until p do
 ___      ____   _____   __
 C[i]:=0;
 again:r:=r+1;
  begin
  _____
  for i:=1 step 1 until n do
  ___      ____   _____   __
  B[i]:=read integer;k:=0;l:=0;
  for i:=1 step 1 until p do
  ___      ____   _____   __
   beginl:=l+k+1;k:=A[l]/2;s:=0;
   _____
   for j:=1 step 1 until k do
   ___      ____   _____   __
    begin
    _____
    l:=l+1;
    if A[j+l]=B[A[j+l-1]] then
    __                    ____
    s:=s+1;
    end;
    ___
  if s=k then C[i]:=C[i]+1;
  __     ____
     end;if r|q then go to again;
     ___ __  =  ____ __ __
  end;
  ___
 for i:=1 step 1 until p do
 ___      ____   _____   __
  begin
  _____
  writetext(|< question number |);
            <                  >
  write(|ddd|,i);writecr;
        <   >
  writetext(|< number of datagroups: |);
            <                        >
  write(|dddd|,C[i]);writecr;writecr;writecr;
        <    >
  end
  ___
 end
 ___
end;t<
___