Cod sursa(job #276182)
Utilizator | Alex Chindea al3x3 | Data | 10 martie 2009 22:12:53 |
---|---|---|---|
Problema | Combinari | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <stdio.h>
FILE *fi, *fo;
int v[19], o[19], n, k;
void afis()
{
int i;
for(i=1; i<=k; i++)
fprintf(fo, "%d ", v[i]);
fprintf(fo, "\n");
}
void bk(int p)
{
int i;
for(i=p; i<=n-k+p; i++)
if(!o[i])
{
o[i]=1;
v[p]=i;
if(p==k) afis();
bk(p+1);
o[i]=0;
}
}
int main()
{
fi=fopen("combinari.in", "r");
fo=fopen("combinari.out", "w");
fscanf(fi, "%d%d", &n, &k);
bk(1);
fclose(fi);
fclose(fo);
return 0;
}