Cod sursa(job #1394171)
| Utilizator | Data | 20 martie 2015 08:41:28 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
FILE *f=fopen("combinari.in","r");
FILE *g=fopen("combinari.out","w");
int n,k,x[20];
void read();
void comb(int k);
void write();
int main()
{
read();
comb(1);
return 0;
}
void read()
{
fscanf(f,"%d%d",&n,&k);
}
void comb(int m)
{
int i=0;
if (m==k+1)
write();
else
{
for (i=x[m-1]+1;i<=n;i++)
x[m]=i,comb(m+1);
}
}
void write()
{
for (int i=1;i<=k;i++)
fprintf(g,"%d ",x[i]);
fprintf(g,"\n");
}
