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