Cod sursa(job #465220)
| Utilizator | Data | 23 iunie 2010 17:58:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.47 kb |
#include <stdio.h>
#define nmax 20
using namespace std;
FILE *fin=fopen("combinari.in","r");
FILE *fout=fopen("combinari.out","w");
int n,m,x[nmax];
void write(void)
{for(register int i=1;i<=m;i++) fprintf(fout,"%d ",x[i]);
fprintf(fout,"\n");
}
void gen(int k)
{if(k>m) write();
else for(register int i=x[k-1]+1;i<=n-m+k;i++)
{x[k]=i; gen(k+1); }
}
int main(void)
{fscanf(fin,"%d%d",&n,&m);
gen(1);
fclose(fin); fclose(fout);
return 0;
}
