Cod sursa(job #2961863)
Utilizator | Florea Andrei XTrim07 | Data | 7 ianuarie 2023 10:50:10 |
---|---|---|---|
Problema | Combinari | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
using namespace std;
const int MAX_LENGTH = 18;
int n, k, freq[MAX_LENGTH];
void gen(int lg, int sir[MAX_LENGTH]) {
if (lg == k + 1) {
for (int i = 1; i <= k; ++i) {
cout << sir[i] << ' ';
}
cout << "\n";
return;
}
for (int i = 1; i <= n; ++i) {
if (freq[i] == 0 && i > sir[lg - 1]) {
sir[lg] = i;
freq[i] = 1;
gen(lg + 1, sir);
freq[i] = 0;
}
}
}
int main() {
cin >> n >> k;
int sir[MAX_LENGTH];
gen(1, sir);
return 0;
}