Pagini recente » Cod sursa (job #1912892) | Cod sursa (job #751053) | Cod sursa (job #2335638) | Cod sursa (job #2283892) | Cod sursa (job #2068597)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int uz[40],n,sol[40],m;
void prelucrari();
void backtracking(int k);
int main()
{
fin >> n >> m;
backtracking(1);
return 0;
}
void backtracking(int k)
{
int i;
if (k > m)
{
prelucrari();
}
else
for (i = sol[k-1]+1; i <= n; ++i)
{
if (uz[i] == 0)
{
uz[i] = 1;
sol[k] = i;
backtracking(k+1);
uz[i] = 0;
}
}
}
void prelucrari()
{
int j;
for (j = 1; j <= m; ++j) fout << sol[j] << " ";
fout << '\n';
}