Pagini recente » Cod sursa (job #2514609) | Cod sursa (job #319041) | Cod sursa (job #2254290) | Cod sursa (job #2438591) | Cod sursa (job #2211803)
#include<iostream>
#include<fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n, k;
int a[20];
void backtrack(int pos, int mx) {
for (int i = mx; i <= n; i++) {
a[pos] = i;
if (pos == k) {
fo << a[1];
for (int j = 2; j <= k; j++)
fo << ' ' << a[j];
fo << "\n";
} else {
backtrack(pos + 1, i + 1);
}
}
}
int main() {
fi >> n >> k;
backtrack(1, 1);
fi.close();
fo.close();
return 0;
}