Cod sursa(job #2605252)
| Utilizator | Data | 24 aprilie 2020 17:49:26 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include <iostream>
using namespace std;
int n, rep[50], v[50], k, nr;
void generate(int lng, int v[], int k) {
if (lng == k + 1) {
for (int i = 1; i <= k; i++)
cout << v[i] << " ";
cout << "\n";
}
for (int i = 1; i < n + 1; i++)
if (rep[i - 1] == 0) {
v[lng] = i;
if (v[lng - 1] < v[lng]) {
rep[i - 1] = 1;
generate(lng + 1, v, k);
rep[i - 1] = 0;
}
}
}
int main() {
cin >> n >> k;
generate(1, v, k);
}
