Cod sursa(job #157016)
Utilizator | Data | 12 martie 2008 20:30:11 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.52 kb |
#include <fstream.h>
int n,k,st[25];
ifstream f("combinari.in");
ofstream g("combinari.out");
int valid (int p)
{ int i;
if (p>=2) if (st[p]<=st[p-1]) return 0;
for ( i=1;i<=p-1;i++)
if (st[p]==st[i]) return 0;
return 1;
}
void back(int p)
{ int i,j;
for ( i=st[p-1]+1; i<=n;i++)
{
st[p]=i;
if (valid(p)) if (p==k){ for ( j=1; j<=p;j++)
g<<st[j]<<' ';
g<<'\n' ;
}
else back(p+1);
}
}
int main()
{
f>>n>>k;
st[0]=0;
back(1);
f.close();
g.close();
return 0;
}