qq_46907547的博客

题目#include <iostream>using namespace std;const int N = 20;int n;bool st[N];void dfs(int k){ if (k == n) { for (int i = 1; i <= n; i ++ ) { if (st[i]) printf("%d ", i); } puts(""); return; } dfs(k + 1); st[k + 1]

最小公倍数LCM#include <iostream>using namespace std;long long a, b;long long gcd(int a, int b){ return b ? gcd(b, a % b) : a;}int main(){ cin >> a >> b; cout << a * b / gcd(a, b); return 0;}

题目算法：递归递归算法需要考虑：按一种什么样的顺序来枚举#include <iostream>using namespace std;const int N = 10;int n;bool st[N];int ans[N];void dfs(int k){ if (k == n) { for (int i = 0; i < n; i ++ ) cout << ans[i] << ' '; c