Pagini recente » Borderou de evaluare (job #2608807) | Cod sursa (job #1800446) | Cod sursa (job #621426) | Cod sursa (job #2192623) | Cod sursa (job #276193)
Cod sursa(job #276193)
#include <stdio.h>
FILE *fi, *fo;
int v[19], o[19], n, k, max=1;
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=max; i<=n; i++)
if(!o[i])
{
max=i;
o[i]=1;
v[p]=i;
if(p==k) afis();
bk(p+1);
o[i]=0;
max--;
}
}
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;
}