Pagini recente » Cod sursa (job #2177510) | Cod sursa (job #870256) | Cod sursa (job #893787) | Cod sursa (job #2970111) | Cod sursa (job #2206256)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("combinari.in");
ofstream out("combinari.out");
int r[19], n, k;
void show(int x) {
for(int i = 1; i < x; i++)
out << r[i] << ' ';
out << '\n';
}
void backt(int x) {
if(x <= k) {
for(int i = r[x-1]+1; i <= n-k+x; i++) {
r[x] = i;
backt(x+1);
}
} else show(x);
}
int main()
{
in >> n >> k;
backt(1);
return 0;
}