Cod sursa(job #1096026)
| Utilizator | Data | 1 februarie 2014 14:13:54 | |
|---|---|---|---|
| Problema | Combinari | Scor | 10 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
var n,k,i:byte;
a:array[1..20] of integer;
procedure back(b:integer);
var i:integer;
begin
for i:=1 to k do
write(a[i],' ');
writeln;
if b>=1 then
for i:=b+1 to n do
begin
a[b]:=i;
if a[b]=a[b+1] then break;
back(b-1);
end;
end;
begin
assign(input,'combinari.in');
assign(output,'combinari.out');
reset(input);
rewrite(output);
read(n); readln(k);
for i:=1 to k do
a[i]:=i;
back(k);
close(input);
close(output);
{Totusi este trist in lume}
end.
