Pagini recente » Cod sursa (job #132320) | Cod sursa (job #2751496) | Cod sursa (job #2376440) | Cod sursa (job #719560) | Cod sursa (job #263443)
Cod sursa(job #263443)
#include <stdio.h>
const int N = 19;
int n,k,sol[N];
char afisat;
void afisare()
{
if (afisat)
printf ("\n");
else
afisat = 1;
printf ("%d",sol[1]);
for (int i = 2; i <= k; ++i)
printf (" %d",sol[i]);
}
void avansare(int poz)
{
for (sol[poz] = sol[poz-1]+1; sol[poz] <= n-k+poz; ++sol[poz])
{
if (poz == k)
afisare();
else
avansare (poz+1);
}
}
int main()
{
freopen ("combinari.in","r",stdin);
freopen ("combinari.out","w",stdout);
scanf ("%d %d",&n,&k);
avansare(1);
return 0;
}