Cod sursa(job #1575105)
Utilizator | Data | 21 ianuarie 2016 09:48:19 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n,m,v[19];
void afis()
{ int i;
for(i=1;i<=m;i++) g<<v[i]<<' ';
g<<'\n';
}
int valid(int k)
{
if(v[k]<=v[k-1]) return 0;
return 1;
}
void bak(int k)
{ int i;
for(i=1;i<=n;i++) { v[k]=i;
if(valid(k)==1) if(k==m) afis();
else bak(k+1);
}
}
int main()
{
f>>n>>m;
bak(1);
f.close();g.close();return 0;
}