Cod sursa(job #2520734)
| Utilizator | Data | 9 ianuarie 2020 18:23:13 | |
|---|---|---|---|
| Problema | Combinari | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int n, fr[20], m, v[20];
void generare(int lg, int v[], int m) {
if (n == lg) {
for (int i = 1; i <= m; i++)
fout << v[i] << " ";
fout << "\n";
}
for (int i = 1; i <= n; i++)
if (fr[i - 1] == 0) {
v[lg] = i;
if (v[lg - 1] > v[lg])
continue;
fr[i - 1] = 1;
generare(lg + 1, v, m);
fr[i - 1] = 0;
}
}
int main(int argc, const char * argv[]) {
fin >> n >> m;
generare(1, v, m);
}
