Pagini recente » Cod sursa (job #1815089) | Cod sursa (job #137726) | Cod sursa (job #1592940) | Cod sursa (job #3326155) | Cod sursa (job #3305489)
#include <fstream>
#include <vector>
using namespace std;
void printCombination(const vector<int>& solution, ofstream& fout)
{
for (size_t i = 1; i < solution.size(); ++i)
{
fout << solution[i] << " ";
}
fout << "\n";
}
void generateCombinations(int ofN, int takenK, int pos, vector<int>& used, vector<int>& sol, ofstream& fout)
{
if (pos > takenK)
{
printCombination(sol, fout);
return;
}
for (int i = sol[pos - 1] + 1; i <= ofN; ++i)
{
if (!used[i])
{
used[i] = 1;
sol[pos] = i;
generateCombinations(ofN, takenK, pos + 1, used, sol, fout);
used[i] = 0;
}
}
}
int main()
{
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, k;
fin >> n >> k;
vector<int> used(n + 1, 0);
vector<int> sol(k + 1, 0);
generateCombinations(n, k, 1, used, sol, fout);
return 0;
}