Cod sursa(job #2211803)
Utilizator | Tutuldunsa Voronokda zvon | Data | 11 iunie 2018 21:37:41 |
---|---|---|---|
Problema | Combinari | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<iostream>
#include<fstream>
using namespace std;
ifstream fi("combinari.in");
ofstream fo("combinari.out");
int n, k;
int a[20];
void backtrack(int pos, int mx) {
for (int i = mx; i <= n; i++) {
a[pos] = i;
if (pos == k) {
fo << a[1];
for (int j = 2; j <= k; j++)
fo << ' ' << a[j];
fo << "\n";
} else {
backtrack(pos + 1, i + 1);
}
}
}
int main() {
fi >> n >> k;
backtrack(1, 1);
fi.close();
fo.close();
return 0;
}