Cod sursa(job #252652)
Utilizator | Data | 4 februarie 2009 19:40:23 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream.h>
int n,m,a[50],ok[50],k,i,j;
ofstream fout("combinari.out");
void cit()
{
int i;
ifstream fin("combinari.in");
fin>>n>>m;
fin.close();
}
void afis()
{
int i;
for(i=1;i<=m;i++)
fout<<a[i]<<" ";
fout<<'\n';
}
void gen(int k)
{
int i;
if(k>m)
afis();
else
for(i=a[k-1]+1;i<=n-m+k;i++)
{
a[k]=i;
gen(k+1);
}
}
int main()
{
cit();
gen(1);
fout.close();
return 0;
}