Cod sursa(job #1058242)
| Utilizator | Data | 15 decembrie 2013 12:22:34 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
#include <stdio.h>
int k,n,sol[20];
void afisare()
{
int i;
for(i=1;i<=k;i++)
printf("%d ",sol[i]);
printf("\n");
}
void bkt(int p)
{
int i;
if(p-1==k)
{
afisare();
return ;
}
for(i=1;i<=n;i++)
{
sol[p]=i;
if(sol[p]>sol[p-1]) bkt(p+1);
}
}
int main()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d",&n,&k);
bkt(1);
return 0;
}
