Cod sursa(job #2542421)
| Utilizator | Data | 9 februarie 2020 22:47:36 | |
|---|---|---|---|
| Problema | Combinari | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include<fstream>
#include<vector>
#define NMAX 18
//in-out
std::ifstream f("combinari.in");
std::ofstream g("combinari.out");
//data
int n, m;
std::vector<int> sol;
//readData
void readData(){
f >> n >> m;
}
//backtracking
void bkt(){
if(sol.size() == m){
for(const auto& elem : sol){
g << elem + 1 << ' ';
}
g << '\n';
}
for(int i = sol.size() > 0 ? sol[sol.size() - 1] + 1 : 0; i<n; i++){
sol.push_back(i);
bkt();
sol.pop_back();
}
}
int main(){
readData();
bkt();
return 0;
}