Pagini recente » Cod sursa (job #2033443) | Cod sursa (job #545059) | Cod sursa (job #1645910) | Borderou de evaluare (job #508775) | Cod sursa (job #2761710)
#include<fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n,m,x[21];
void Afisare()
{
for(int i=1;i<=m;i++)
fout<<x[i]<<" ";
fout<<"\n";
}
int Valid(int k)
{
if(k>1 && x[k-1]>=x[k])
return 0;
return 1;
}
void Backtracking(int k)
{
if(k>m)
Afisare();
else
{
for(int i=1;i<=n;i++)
{
x[k]=i;
if(Valid(k))
Backtracking(k+1);
}
}
}
int main()
{
fin>>n>>m;
Backtracking(1);
fin.close();
fout.close();
return 0;
}