Pagini recente » Cod sursa (job #422386) | Cod sursa (job #1545963) | Cod sursa (job #2927990) | Istoria paginii preoni-2008/runda-2/solutii | Cod sursa (job #158197)
Cod sursa(job #158197)
#include <stdio.h>
#define NMAX 20
int v[NMAX],n,k;
void wtf(int p, int l)
{
int i;
if (p==k)
{
for (i=0; i<k-1; i++)
printf("%d ",v[i]);
printf("%d\n",v[k-1]);
}
else
{
for (i=l+1; i<=n; i++)
{
v[p]=i;
wtf(p+1,i);
v[p]=0;
}
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
wtf(0,0);
fclose(stdin);
fclose(stdout);
return 0;
}