Pagini recente » Cod sursa (job #2112734) | Cod sursa (job #2731031) | Cod sursa (job #1520397) | Cod sursa (job #1066861) | Cod sursa (job #3321942)
#include <fstream>
using namespace std;
ifstream f("combinari.in");
ofstream g("combinari.out");
int n, m;
int comb[20];
bool is_partial_solution(int k) {
return true;
}
bool is_solution(int k) {
return k == m;
}
void write_solution() {
for (int i = 1; i<=m; i++) {
g<< comb[i] <<" ";
}
g<< "\n";
}
void backtracking() {
int k = 1;
comb[k] = 0;
while (k > 0) {
if (comb[k] < n) {
comb[k]++;
if (is_solution(k)) {
write_solution();
}
else {
k++;
comb[k] = comb[k-1];
}
}
else {
k--;
}
}
}
int main() {
f>> n >> m;
backtracking();
return 0;
}