Pagini recente » Cod sursa (job #1557994) | Cod sursa (job #2138412) | Cod sursa (job #1762482) | Cod sursa (job #103738) | Cod sursa (job #393753)
Cod sursa(job #393753)
#include <stdio.h>
int n,sol[16],k;
void afisare()
{
for (int i=2;i<=k+1;++i)
printf("%d ",sol[i]);
printf("\n");
}
bool valid (int p)
{
for (int i=1;i<p;++i )
if (sol[i]==sol [ p ] )
return false;
return true;
}
void bkt(int p)
{
if (p==k+1)
{
afisare();
return;
}
for (int i=sol[p]+1;i<=n;++i )
{
sol[p+1]=i;
bkt(p+1);
}
}
int main ()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}