Cod sursa(job #550083)
| Utilizator | Data | 9 martie 2011 11:14:50 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include<cstdio>
const short N=19;
short k,n,sol[N];
void prelucrare()
{
for(int i=1;i<=k;i++)
printf("%hd ", sol[i]);
printf("\n");
}
void bkt(int p)
{
if(p-1==k)
{
prelucrare();
return;
}
for(int i=1+sol[p-1];i<=n-k+p;i++)
{
sol[p]=i;
bkt(p+1);
}
}
int main()
{
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
scanf("%hd%hd", &n,&k);
bkt(1);
}