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