Cod sursa(job #486012)
Utilizator | Pirvu Cristina chrisu | Data | 20 septembrie 2010 12:24:32 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <stdio.h>
int n, k, s[20];
void afisare ();
void bkt(int p)
{
if(p==k+1)
{
afisare();
return;
}
for(int i= s[p-1]+1; i<=n; i++)
{
s[p]=i;
bkt(p+1);
}
}
void afisare()
{
for (int i=1; i<=k;++i)
printf("%d ", s[i]);
printf("\n");
}
int main ()
{
freopen("combinari.in","r",stdin);
freopen("combinari.out","w",stdout);
scanf("%d%d", &n, &k);
bkt(1);
return 0;
}