1:
2:

m:= m1[a] * m2[b];
if CountMenge(@m, sizeof(m)) > x then DeleteArrayElement(m2[b]);					

1:
2:
3:
4:
5:
6:
7:
8:
9:
10:
11:
12:
13:
14:
15:
16:
17:
18:
19:

function CountMenge(P: Pointer; Count: Cardinal): Cardinal;  //CountMenge(@m, sizeof(m))
const
  lu : packed array[0..15] of Byte = (0,1,1,2,1,2,2,3,1,2,2,3,2,3,3,4);
var
  b: Byte;
begin
  Result := 0;
  while Count > 0 do
  begin
    b := PByte(P)^;
    // lower Nibble
    Inc(Result, lu[b and $0F]);
    // upper Nibble
    Inc(Result, lu[b shr 4]);

    Dec(Count);
    Inc(PByte(P));
  end;
end;					

1:
2:
3:
4:
5:

procedure DeleteArrayElement(var AArray: TIntArray; const AIndex: Integer);
begin
  Move(AArray[AIndex + 1], AArray[AIndex], SizeOf(AArray[0]) * (Length(AArray) - AIndex - 1)); //Dahinterliegende Daten aufrücken
  SetLength(AArray, Length(AArray) - 1); // Länge kürzen
end;					

1:

DeleteArrayElement(m2, b);					

1:
2:
3:
4:
5:
6:
7:
8:

if cbKongru.Checked then begin                                                     //b2
n := RGKongru.ItemIndex+2;
for a := 0 to high(ungef)-1 do begin                                              //b3
for b := high(ungef) downto a +1 do  begin                                        //b4
     m:= ungef[a].m * ungef[b].m;
    if CountMenge(@m, sizeof(m)) > n then DeleteArrayElement(ungef,b);
  end;                                                                            //e4
  end;                                                                            //e3