Cod sursa(job #352512)
Utilizator | Data | 2 octombrie 2009 09:18:52 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<stdio.h>
const int N=19;
int n,sol[N],k;
void afisare ()
{
for (int i=1 ; i<=k ; ++i)
printf ("%d ",sol[i]);
printf ("\n");
}
void bkt (int p)
{
if (p==k+1)
{
afisare();
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 ("%d",&n);
scanf ("%d",&k);
bkt(1);
return 0;
}