Cod sursa(job #486001)
Utilizator | Zavoianu Sabina sabina67 | Data | 20 septembrie 2010 12:19:21 |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
# include <stdio.h>
int sol[11],n,k;
bool m[11];
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=sol[p-1]+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%d",&n,&k);
bkt(1);
return 0;
}