Cod sursa(job #1839800)
| Utilizator | Data | 3 ianuarie 2017 14:33:16 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<cstdio>
#define NMAX 19
using namespace std;
int s[NMAX], n, m;
FILE *fout = fopen("combinari.out","w");
void Gen_Comb(int k)
{
if(k-1 == m)
{
for(int j=1; j<=m; j++)
fprintf(fout,"%d ",s[j]);
fprintf(fout,"\n");
}
else
for(int i=s[k-1]+1; i<=n-m+k; i++)
{
s[k] = i;
Gen_Comb(k+1);
}
}
int main()
{
FILE *fin = fopen("combinari.in","r");
fscanf(fin,"%d%d",&n,&m);
fclose(fin);
Gen_Comb(1);
fclose(fout);
return 0;
}
