Cod sursa(job #485999)
Utilizator | copoiu liviu liv182 | Data | 20 septembrie 2010 12:16:39 |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<stdio.h>
int n,sol[201],k;
void afisare();
bool valid(int p);
void bkt(int p)
{
if(p==k+1)
{
afisare();
return;
}
for(int i=1;i<=k;++i)
{
sol[p]=i;
if(valid(p))
bkt(p+1);
}
}
bool valid(int p)
{
for(int i=1;i<p;++i)
if(sol[i]>=sol[p])
return false;
return true;
}
void afisare()
{
for(int i=1;i<=k;++i)
printf("%d ",sol[i]);
printf("\n");
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}