Pagini recente » tema | Cod sursa (job #981052) | Cod sursa (job #1004667) | Istoria paginii runda/baftaa/clasament | Cod sursa (job #2074031)
#include <iostream>
#include <fstream>
#define NMAX 19
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int sol[NMAX], n, k, folosit[NMAX];
void printSol() {
for (int i = 0; i < k; i++)
fout<<(int) sol[i]<<' ';
fout<<"\n";
}
void back(unsigned char pos) {
if (pos == k) {
printSol();
return;
}
for (int i = 1; i <= n; i++) {
if (!folosit[i] && pos == 0 sol[pos-1] < i) {
folosit[i] = 1;
sol[pos] = i;
back(pos + 1);
folosit[i] = 0;
}
}
}
int main()
{
fin >> n >> k;
back(0);
fin.close();
fout.close();
return 0;
}