Pagini recente » Cod sursa (job #2039269) | Cod sursa (job #1374388) | Cod sursa (job #2728060) | Cod sursa (job #1993295) | Cod sursa (job #2811680)
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
const int NMAX = 20;
int st[NMAX], n, p;
void afisare() {
for (int i = 1; i <= p; i++)
fout << st[i] << " ";
fout << "\n";
}
void bkt(int k) {
if (k == p + 1)
afisare();
else
for (int i = st[k - 1] + 1; i <= n - (p - k); i++) {
st[k] = i;
bkt(k + 1);
}
}
int main() {
fin >> n >> p;
bkt(1);
return 0;
}