Cod sursa(job #2772788)
Utilizator | Data | 2 septembrie 2021 21:23:45 | |
---|---|---|---|
Problema | Combinari | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <bits/stdc++.h>
using namespace std;
int n, k, c[10];
void afisare() {
for (int i = 1; i <= k; i++) {
cout << c[i] << " ";
}
cout << endl;
}
void bkt(int p) {
int i;
for (i = c[p - 1]+1; i <= n-k+p; i++) {
c[p] = i;
if (p == k) {
afisare();
}
else {
bkt(p+1);
}
}
}
int main() {
freopen("combinari.in", "r", stdin);
freopen("combinari.out", "w", stdout);
cin >> n >> k;
bkt(1);
}