题目描述
blablabla
样例
// ac 92
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <cstring>
#include <cmath>
#include <cstdio>
#include <string>
#define ll long long
using namespace std;
bool v[100];
int n, m;
void dfs(int cur, int s) {
ios::sync_with_stdio(0);
// cerr << cur << " " << s << endl;
if (cur + s > n + 1) {
return;
}
if (s < 0)
return;
if (cur == n + 1) {
bool sp = 0;
for (int i = 1; i <= n; ++i) {
if (v[i]) {
if (sp) {
cout << " ";
} else {
sp = 1;
}
cout << i;
}
}
cout << endl;
return;
}
if (s > 0) {
v[cur] = 1;
dfs(cur + 1, s - 1);
}
v[cur] = 0;
dfs(cur + 1, s);
}
int main() {
ios::sync_with_stdio(0);
while (cin >> n >> m) {
memset(v, 0, sizeof(v));
dfs(1, m);
}
return 0;
}
算法1
(暴力枚举) $O(n^2)$
blablabla
时间复杂度分析:blablabla
C++ 代码
blablabla
算法2
(暴力枚举) $O(n^2)$
blablabla
时间复杂度分析:blablabla
C++ 代码
blablabla