Cod sursa(job #162719)
Utilizator | Data | 20 martie 2008 16:48:23 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream.h>
int st[18],n,m;
ofstream fout("combinari.out");
void write()
{ int i;
for(i=0;i<m;i++)
fout<<st[i]<<' ';
fout<<'\n';
}
int ok(int k)
{ int i;
for(i=0;i<k;i++)
if(st[i]>=st[k]) return 0;
return 1;
}
void back(int k)
{ int i;
if(k==m) write();
else for(i=1;i<=n;i++)
{ st[k]=i;
if(ok(k)) back(k+1);
}
}
int main()
{ ifstream fin("combinari.in");
fin>>n>>m;
back(0);
return 0;
}