Cod sursa(job #393753)
Utilizator | HoriaC HoriaClement | Data | 9 februarie 2010 21:43:49 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#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;
}