Cod sursa(job #2234056)
| Utilizator | Data | 25 august 2018 11:35:49 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream cin ("combinari.in");
ofstream cout ("combinari.out");
int n, k, f[20], v[20];
int backtr(int poz) {
int i;
if (poz == k) {
for (i = 0; i < k; i++)
cout << v[i] << " ";
cout << "\n";
}
else {
for (i = 1; i <= n; i++) {
if ((poz == 0 || v[poz - 1] < i) && f[i] == 0) {
v[poz] = i;
f[i]++;
backtr(poz + 1);
f[i]--;
}
}
}
}
int main() {
cin >> n >> k;
backtr(0);
return 0;
}
