18款禁用网站app入口_网上商城开发设计_搜索引擎优化宝典_葫岛百度seo

#include <iostream>
#include <vector>
using namespace std;
int n,k;
const int N = 20;
vector<int> path;
bool st[N];
void dfs()
{if(path.size() == k){for(auto e : path){cout << e << " ";}cout << endl;}for(int i = 1;i<=n;i++){if(st[i]) continue;path.push_back(i);st[i] = true;dfs();path.pop_back();st[i] = false;}
}int main()
{cin >> n >> k;dfs();
}