Pagini recente » Cod sursa (job #1951659) | Cod sursa (job #584688) | Cod sursa (job #49562) | Cod sursa (job #150036) | Cod sursa (job #2926171)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
const int KMAX = 18;
int N, K;
int st[KMAX + 1];
void print(int p) {
for(int i = 1; i <= p; i++) {
fout << st[i] << " ";
}
fout << '\n';
}
void bkt(int p) {
for(int i = st[p - 1] + 1; i <= N; i++) {
st[p] = i;
if(p == K) {
print(p);
} else {
bkt(p + 1);
}
}
}
int main() {
fin >> N >> K;
bkt(1);
fin.close();
fout.close();
return 0;
}