Pagini recente » Clasament mda | Cod sursa (job #2602244) | Cod sursa (job #3251136) | Cod sursa (job #975248) | Cod sursa (job #2762995)
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void bkt(int);
int n, k, x[20], used[20];
int main() {
fin >> n >> k;
//fout<<n<<" "<<k;
bkt(1);
return 0;
}
void bkt(int poz) {
if (poz == k + 1) {
for (int i = 1; i < poz; i++)
fout << x[i] << " ";
fout << '\n';
return;
}
for (int i = 1; i <= n; i++)
if (!used[i]) {
if (i < x[poz - 1])
continue;
used[i] = 1;
x[poz] = i;
bkt(poz + 1);
used[i] = 0;
}
}