Cod sursa(job #166308)
Utilizator | Data | 27 martie 2008 20:24:21 | |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
var n,m,k,i:longint;
s:array [1..20] of longint;
begin
assign(input,'combinari.in'); reset(input);
assign(output,'combinari.out'); rewrite(output);
readln(n,m); k:=1;
while k>0 do begin
repeat
inc(s[k]);
until (s[k]>n) or ((s[k]<=n) and (s[k]>s[k-1]));
if s[k]<=n then
if k=m then begin
for i:=1 to m do write(s[i],' ');
writeln;
end
else inc(k)
else begin
s[k]:=0; dec(k);
end;
end;
close(input); close(output);
end.