Pagini recente » Cod sursa (job #341361) | Cod sursa (job #1605423) | Cod sursa (job #2599118) | Cod sursa (job #623063) | Cod sursa (job #2568810)
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define nmax 50005
#define oo 1e9
#include <bitset>
using namespace std;
int st[20],viz[20],k,n;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void Backtracking(int top )
{
if (top == k+1)
{
for (int i = 1; i < top; i++)
fout << st[i] << " ";
fout << "\n";
}
else
for (int i = 1; i <= n; i++)
if (viz[i] == 0 && i > st[top - 1])
{
st[top] = i;
viz[i] = 1;
Backtracking(top + 1);
viz[i] =0;
}
}
int main()
{
fin >> n >> k;
Backtracking(1);
fin.close();
fout.close();
return 0;
}