Pagini recente » Cod sursa (job #1722337) | Cod sursa (job #1076844) | Cod sursa (job #1522390) | Cod sursa (job #2951130) | Cod sursa (job #2177848)
#include <iostream>
#include <fstream>
using namespace std;
int A[20];
int N, K;
ifstream iff("combinari.in");
ofstream off("combinari.out");
void back(int l) {
if (l >= K) {
for (int i = 0; i < K; ++i) {
off << A[i] << " ";
}
off << endl;
}
else {
int start = l < 0 ? 1 : A[l - 1];
for (int i = start + 1; i <= N; ++i) {
A[l] = i;
back(l + 1);
}
}
}
int main() {
iff >> N >> K;
back(0);
}