这道题我们还是先放出我们的决策树

根据决策树来写我们的代码

#include <iostream>
#include <vector>
using namespace std;string ret;
int n,m;
vector <int> path;
void dfs(int begin)
{if(path.size() == m){for(auto e : path){cout << e << " ";}cout << endl;}for(int i = begin;i<=n;i++){path.push_back(i);dfs(i+1);path.pop_back();}
}
int main()
{cin >> n >> m;dfs(1);
}