Cod sursa(job #395172)
| Utilizator | Data | 12 februarie 2010 12:39:06 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<cstdio>
int k,n,sol[101];
char marc[101];
void afisare()
{
int i;
for (i=1;i<=k;++i)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p)
{
int i;
if (p==k+1)
{
afisare();
return;
}
for (i=1;i<=n;++i)
if (!marc[i]&&sol[p-1]<i)
{
marc[i]=1;
sol[p]=i;
bkt(1+p);
marc[i]=0;
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
sol[0]=-1;
bkt(1);
return 0;
}