Cod sursa(job #486007)
| Utilizator | Data | 20 septembrie 2010 12:21:57 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 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=sol[p-1]+1;i<=n-k+p;++i)
{
sol[p]=i;
bkt(p+1);
}
}
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;
}