| Subiectul anterior :: Subiectul urmator |
| Autor |
Mesaj |
Carmen Junior

Data inscrierii: 08/Noi/2007 Mesaje: 1
|
Trimis: 15/11/2007 10:56 Titlul subiectului: pr 8 pag 126 |
|
|
| Cod: |
var n,i,p,max:integer;
j,sol,v:array[1..50] of integer;
procedure init(k:integer);
begin
sol[k]:=0;
end;
function succesor(k:integer):boolean;
begin
if sol[k]<n then
begin
sol[k]:=sol[k]+1;
succesor:=true
end
else succesor:=false;
end;
function valid(k:integer):boolean;
var i:integer;
begin
valid:=true;
for i:= 1 to k-1 do
if (sol[k-1]>=sol[k]) and (k>1) then valid:=false;
end;
function solutie(k:integer):boolean;
begin
solutie:=(k=p+1);
end;
procedure tipar;
var i:integer;
begin
for i:= 1 to p do
write(v[j[i]], ' ');
writeln;
end;
procedure back(k:integer);
var s:integer;
begin
if solutie(k) then
begin
s:=0;
for i:= 1 to p do
s:=s+v[sol[i]];
if s>max then begin
max:=s;
for i:= 1 to p do
j[i]:=sol[i];
end
end
else
begin
init(k);
while succesor(k) do
if valid(k) then
back(k+1);
end;
end;
begin
write('n=');readln(n);
write('p=');readln(p);
for i:= 1 to n do
readln(v[i]);
max:=0;
back(1);
tipar;
readln;
end. |
|
|
| Sus |
|
 |
misanchik Junior

Data inscrierii: 21/Iul/2012 Mesaje: 5 Localitate: Bulgaria
|
Trimis: 07/08/2012 12:50 Titlul subiectului: |
|
|
| How cool is that! |
|
| Sus |
|
 |
misanchik Junior

Data inscrierii: 21/Iul/2012 Mesaje: 5 Localitate: Bulgaria
|
Trimis: 09/08/2012 00:04 Titlul subiectului: |
|
|
| I am always happy to find something autentic on the internet and I can tell you that your information is really original. |
|
| Sus |
|
 |
tcapital Junior

Data inscrierii: 21/Iul/2012 Mesaje: 4 Localitate: Great Britain
|
Trimis: 04/09/2012 15:32 Titlul subiectului: |
|
|
| I am always happy to find something original on the internet and I can tell you that your information is really original. |
|
| Sus |
|
 |
|