Cod sursa(job #3355036)
| Utilizator | Data | 21 mai 2026 17:01:21 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <bits/stdc++.h>
using namespace std;
#define NMAX 18
int n, k;
int v[NMAX], f[NMAX];
ifstream fin("combinari.in");
ofstream fout("combinari.out");
void perm(int pos) {
if (pos == k) {
for (int i = 0; i < k - 1; ++i)
fout << v[i] << ' ';
fout << v[k-1] << '\n';
return;
}
for (int i = (pos == 0 ? 1 : v[pos - 1] + 1); i <= n; ++i) {
if (f[i] == 0) {
v[pos] = i;
f[i] = 1;
perm(pos + 1);
f[i] = 0;
}
}
return;
}
int main() {
fin>>n>>k;
perm(0);
return 0;
}
