Cod sursa(job #1468411)
| Utilizator | Data | 5 august 2015 23:46:33 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("combinari.in");
ofstream fout ("combinari.out");
int v[20], k, n;
void write() {
for (int i = 1; i <= k; i++) {
fout << v[i] << " ";
}
fout << "\n";
}
void backtracking(int pas) {
int i;
if (pas <= k) {
for (i = v[pas - 1] + 1; i <= n; i++){
v[pas] = i;
backtracking(pas + 1);
}
}
else {
write();
}
}
int main() {
fin >> n >> k;
backtracking(1);
return 0;
}
