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