Cod sursa(job #168010)
Utilizator | Danci Emanuel Sebastian zalman | Data | 30 martie 2008 16:08:45 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include<fstream.h>
#define dim 20
int st[dim],x,y;
ifstream f("cobinari.in");
ofstream g("combinari.out");
int valid(int k)
{
for(register int i=1;i<k;i++)
if(st[i]>=st[k])
return 0;
return 1;
}
void tip()
{
for(int i=1;i<=y;i++)
g<<st[i]<<' ';
g<<'\n';
}
void back(int k)
{
int i;
for(i=1;i<=x;i++)
{
st[k]=i;
if(valid(k))
if(k==y)
tip();
else
back(k+1);
}
}
int main()
{
f>>x>>y;
back(0);
f.close();
g.close();
return 0;
}