Cod sursa(job #715066)
Utilizator | Data | 16 martie 2012 16:29:15 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include<stdio.h>
int sol[20],n,k;
void prelucrare ()
{
int i;
for (i=1;i<=k;i++)
{
printf("%d ",sol[i]);
}
printf("\n");
}
void bkt (int p)
{
int i;
if (p-1==k)
{
prelucrare();
return ;
}
for (i=1+sol[p-1];i<=n;i++)
{
sol[p]=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;
}