Cod sursa(job #2168438)
Utilizator | Data | 14 martie 2018 10:59:01 | |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
int n, k, a[20];
ofstream fo("combinari.out");
void afisare() {
for (int i = 1; i <= k; i++)
fo << a[i] << ' ';
fo << '\n';
}
void bt(int l) {
for (int i = a[l-1]+1; i <= n; i++) {
a[l] = i;
if (l == k)
afisare();
else
bt(l+1);
}
}
int main () {
ifstream fi("combinari.in");
fi >> n >> k;
bt(1);
return 0;
}