58 lines
1.1 KiB
ObjectPascal
58 lines
1.1 KiB
ObjectPascal
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20> <20><><EFBFBD><EFBFBD><EFBFBD>. <20> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> B <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>.
|
|||
|
|
// <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
const Sz=100;
|
|||
|
|
|
|||
|
|
type IntArr = array [1..Sz] of integer;
|
|||
|
|
|
|||
|
|
procedure PrintArr(const A: IntArr; n: integer);
|
|||
|
|
begin
|
|||
|
|
for var i:=1 to n do
|
|||
|
|
write(A[i],' ');
|
|||
|
|
writeln;
|
|||
|
|
end;
|
|||
|
|
|
|||
|
|
procedure TrySolve(n: integer; const B: IntArr; nb: integer);
|
|||
|
|
var
|
|||
|
|
Subset: IntArr;
|
|||
|
|
space: integer;
|
|||
|
|
ns: integer;
|
|||
|
|
|
|||
|
|
procedure TrySolve0(i: integer);
|
|||
|
|
begin
|
|||
|
|
if space=0 then
|
|||
|
|
PrintArr(Subset,ns)
|
|||
|
|
else if (space<0) or (i>nb) then
|
|||
|
|
exit // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
else // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> B
|
|||
|
|
begin
|
|||
|
|
TrySolve0(i+1); // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><> <20><><EFBFBD><EFBFBD><EFBFBD> i-<2D><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
|
|||
|
|
ns += 1;
|
|||
|
|
Subset[ns] := B[i];
|
|||
|
|
space := space - B[i];
|
|||
|
|
TrySolve0(i+1); // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD> i-<2D><><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
space := space + B[i];
|
|||
|
|
ns -= 1;
|
|||
|
|
end;
|
|||
|
|
end;
|
|||
|
|
|
|||
|
|
begin
|
|||
|
|
space:=n;
|
|||
|
|
TrySolve0(1);
|
|||
|
|
end;
|
|||
|
|
|
|||
|
|
procedure FillArr(var B: IntArr; var n: integer);
|
|||
|
|
begin
|
|||
|
|
n:=5; // <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
B[1]:=8; B[2]:=5; B[3]:=13; B[4]:=3; B[5]:=15; // <20><><EFBFBD><EFBFBD> <20><><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD><EFBFBD>
|
|||
|
|
end;
|
|||
|
|
|
|||
|
|
var
|
|||
|
|
B: IntArr;
|
|||
|
|
nb: integer;
|
|||
|
|
|
|||
|
|
begin
|
|||
|
|
FillArr(B,nb);
|
|||
|
|
TrySolve(23,B,5);
|
|||
|
|
end.
|