1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246
| unit Unit3;
interface
uses System.Classes,
System.Generics.Collections;
type
TNumber = Byte;
TNumberList = class(System.Generics.Collections.TList<TNumber>)
private
function GetNumber(Index: Integer): TNumber;
public
function Clone(): TNumberList;
procedure ToStrings(AStrings: TStrings; ADoClear: Boolean = True);
procedure ToFlatStrings(AStrings: TStrings; ADoClear: Boolean = True);
property Numbers[Index: Integer]: TNumber read GetNumber; default;
end;
TNumbers = class(TObject)
strict private
FAvailableNumbers: TNumberList;
procedure FillAvailableNumbers(AMax: Byte);
public
constructor Create(AMax: Byte);
destructor Destroy(); override;
property AvailableNumbers: TNumberList read FAvailableNumbers;
end;
TNumberLists = class(System.Generics.Collections.TObjectList<TNumberList>)
public
procedure ToStrings(AStrings: TStrings; ADoClear: Boolean = True);
procedure ToFlatStrings(AStrings: TStrings; ADoClear: Boolean = True);
end;
function GetAllNumberTirages(ANumbers: TNumberList; ACount: Byte; ATirages: TNumberLists; ADoClear: Boolean = True; const AOffset: Integer = -1): Integer;
implementation
uses
System.SysUtils, System.Math;
{ TNumberList }
function TNumberList.GetNumber(Index: Integer): TNumber;
begin
Result := Items[Index - 1];
end;
procedure TNumberList.ToStrings(AStrings: TStrings; ADoClear: Boolean = True);
var
C: TNumber;
begin
AStrings.BeginUpdate();
try
if ADoClear then
AStrings.Clear();
for C in Self do
AStrings.Add(IntToStr(C));
finally
AStrings.EndUpdate();
end;
end;
procedure TNumberList.ToFlatStrings(AStrings: TStrings; ADoClear: Boolean = True);
var
I: Integer;
S: string;
begin
AStrings.BeginUpdate();
try
if ADoClear then
AStrings.Clear();
if Count > 1 then
begin
S := IntToStr(Items[0]);
for I := 1 to Count - 1 do
S := S + ' + ' + IntToStr(Items[I]);
end;
AStrings.Add(S);
finally
AStrings.EndUpdate();
end;
end;
function TNumberList.Clone(): TNumberList;
var
C: TNumber;
begin
Result := TNumberList.Create();
for C in Self do
Result.Add(C);
end;
{ TNumbers }
constructor TNumbers.Create(AMax: Byte);
begin
FAvailableNumbers := TNumberList.Create();
FillAvailableNumbers(AMax);
end;
destructor TNumbers.Destroy();
begin
FreeAndNil(FAvailableNumbers);
inherited Destroy();
end;
procedure TNumbers.FillAvailableNumbers(AMax: Byte);
var
I: Byte;
begin
for I := 1 to AMax do
FAvailableNumbers.Add(I);
end;
{ TNumberLists }
procedure TNumberLists.ToStrings(AStrings: TStrings; ADoClear: Boolean);
var
List: TNumberList;
begin
AStrings.BeginUpdate();
try
if ADoClear then
AStrings.Clear();
for List in Self do
begin
List.ToStrings(AStrings, False);
AStrings.Add('');
end;
finally
AStrings.EndUpdate();
end;
end;
procedure TNumberLists.ToFlatStrings(AStrings: TStrings; ADoClear: Boolean);
var
List: TNumberList;
begin
AStrings.BeginUpdate();
try
if ADoClear then
AStrings.Clear();
for List in Self do
List.ToFlatStrings(AStrings, False);
finally
AStrings.EndUpdate();
end;
end;
{ fonctions diverses }
function GetAllNumberTirages(ANumbers: TNumberList; ACount: Byte; ATirages: TNumberLists; ADoClear: Boolean = True; const AOffset: Integer = -1): Integer;
function CoefficientBinomial(N, K: Integer): Integer;
var
D: Integer;
CB: Double;
begin
if N < K then
Abort;
if N = K then
Exit(1);
if N = K + 1 then
Exit(N);
CB := 1;
D := N - K;
while D > 0 do
begin
CB := CB * (N / D);
Dec(N);
Dec(D);
end;
Result := Round(CB);
end;
var
Remaining: TNumberList;
I, K: Integer;
TirageCount, TirageExistingCount: Integer;
begin
if not Assigned(ANumbers) then
Abort;
if not Assigned(ATirages) then
Abort;
if ADoClear then
ATirages.Clear();
if ANumbers.Count < ACount then
Exit(0);
if ANumbers.Count = ACount then
begin
ATirages.Add(ANumbers.Clone());
Exit(1);
end;
TirageExistingCount := ATirages.Count;
if AOffset = -1 then
begin
TirageCount := CoefficientBinomial(ANumbers.Count, ACount);
if ATirages.Capacity < TirageCount + TirageExistingCount then
ATirages.Capacity := TirageCount + TirageExistingCount;
end
else
TirageCount := -1;
K := Max(AOffset, 0);
for I := K to ANumbers.Count - 1 do
begin
Remaining := ANumbers.Clone();
try
Remaining.Delete(I);
GetAllNumberTirages(Remaining, ACount, ATirages, False, K);
Inc(K);
finally
Remaining.Free();
end;
end;
if TirageCount > 0 then
Assert(TirageCount = ATirages.Count - TirageExistingCount);
Result := ATirages.Count;
end;
end. |
Partager