Cod sursa(job #163984)
Utilizator | Data | 23 martie 2008 13:13:59 | |
---|---|---|---|
Problema | Combinari | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
/*infoarena combinari*/
#include<fstream.h>
int x[30],n,m;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void afisare(int k)
{
int i;
for(i=0;i<m;i++)
fout<<x[i]<<" ";
fout<<'\n';
}
int valid(int k)
{
int i;
for(i=0;i<k;i++)
if(x[i]>=x[k]) return 0;
return 1;
}
void back(int k)
{
int i;
for(i=1;i<=n;i++)
{
x[k]=i;
if(valid(k)==1)
if(k==m-1) afisare(k);
else back(k+1);
}
}
int main()
{
fin>>n>>m;
back(0);
fout.close();
return 0;
}