Cod sursa(job #2789140)
Utilizator | Liscan Rares RaresLiscan | Data | 26 octombrie 2021 22:26:34 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.58 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int v[20];
void combinationsGeneration(int n, int k, int s, int idx) {
if (idx > k && s > k) {
for (int i = 1; i <= k; i ++) {
fout << v[i] << " ";
}
fout << "\n";
return;
}
for (int i = s; i <= n; i ++) {
v[idx] = i;
combinationsGeneration(n, k, i + 1, idx + 1);
}
}
int main()
{
int n, k;
fin >> n >> k;
combinationsGeneration(n, k, 1, 1);
return 0;
}