Cod sursa(job #490473)
Utilizator | Data | 6 octombrie 2010 17:42:07 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <stdio.h>
int n,m,x[20],uz[20];
FILE *f,*g;
void cit(){
f=fopen("combinari.in","r");
fscanf(f,"%d %d",&n,&m);
fclose(f);
}
void afis(){
int i;
for (i=1;i<=m;i++)
fprintf(g,"%d ",x[i]);
fputc('\n',g);
}
void back(int k){
int i;
if (k>m) afis();
else
for (i=x[k-1]+1;i<=n;i++)
if (!uz[i])
{
uz[i]=1;
x[k]=i;
back(k+1);
uz[i]=0;
}
}
int main(){
cit();
g=fopen("combinari.out","w");
x[0]=0;
back(1);
fclose(g);
return 0;
}