Pagini recente » Cod sursa (job #1310649) | Cod sursa (job #1341324) | Cod sursa (job #53618) | Cod sursa (job #2920134) | Cod sursa (job #1058242)
#include <stdio.h>
int k,n,sol[20];
void afisare()
{
int i;
for(i=1;i<=k;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p)
{
int i;
if(p-1==k)
{
afisare();
return ;
}
for(i=1;i<=n;i++)
{
sol[p]=i;
if(sol[p]>sol[p-1]) bkt(p+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}