Cod sursa(job #2929609)
Utilizator | Matei Filibiu DKMKD | Data | 26 octombrie 2022 12:23:03 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <bits/stdc++.h>
#define N 30
using namespace std;
ifstream fin("combinari.in");
ofstream fout("combinari.out");
int sol[N], n, m;
void afiseaza() {
for (int i = 1; i <= m; ++i)
fout << sol[i] << " ";
fout << "\n";
}
void bkt(int k) {
for (int i = sol[k-1]+1; i <= n; ++i) {
sol[k] = i;
if (k == m)
afiseaza();
else
bkt(k + 1);
}
}
int main() {
fin >> n >> m;
bkt(1);
return 0;
}