Cod sursa(job #155122)
Utilizator | Data | 11 martie 2008 19:08:04 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.51 kb |
#include<stdio.h>
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int n,m,st[19];
void tipar()
{int i;
for(i=1;i<=m;i++) {fprintf(g,"%d ",st[i]);}
fprintf(g,"\n");
}
int ok(int k)
{int i;
for(i=1;i<k;i++)
if((st[i]==st[k])||(st[i]>st[k])) return 0;
return 1;
}
void back(int k)
{int i;
if(k>m) tipar();
else
{for(i=1;i<=n;i++)
{st[k]=i;
if(ok(k)) back(k+1);
}
}
}
int main()
{
fscanf(f,"%d %d",&n,&m);
back(1);
return 0;
}