Cod sursa(job #2811680)
Utilizator | Data | 2 decembrie 2021 21:02:06 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#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;
}