Pagini recente » Cod sursa (job #1157746) | Cod sursa (job #2056580) | Cod sursa (job #502092) | Cod sursa (job #1719331) | Cod sursa (job #162574)
Cod sursa(job #162574)
# include <stdio.h>
int n,st[100],p;
FILE *f,*g;
void back(int k)
{
int x,i;
if (k==p+1) { // tiparesc solutia
for (i=1;i<k;i++)
fprintf(g,"%d ",st[i]);
fprintf(g,"\n");
}
else {
for (x=st[k-1]+1;x<=n;x++)
{
st[k]=x;
// verific daca valoarea este valida
int ev=1;
for (i=1;i<k && ev==1;i++)
if (st[i]==st[k]) ev=0;
if (ev) back(k+1);
}
}
}
int main()
{
f=fopen("combinari.in","r");
g=fopen("combinari.out","w");
fscanf(f,"%d %d",&n, &p);
fclose(f);
back(1);
fclose(g);
return 0;
}