代码求调

#include <bits/stdc++.h>
using namespace std;
vector<vector<int>> vis;
void dfs(int n, vector<int>& path) {
	if (n == 0 && path[0] != n) {
		sort(path.begin(), path.end());
		bool hasVis = false;
		for (int i = 0; i < vis.size(); i++) {
			if (path == vis[i]) {
				hasVis = true;
			}
		}
		if (hasVis == false) {
			vis.push_back(path);
			for (int i = 0; i < path.size(); i++) {
				printf("%d", path[i]);
				if (i != path.size() - 1) {
					printf("+");
				}
			}
			printf("\n");
		}
		return;
	}
	for (int num = 1; num <= n; num++) {
		path.push_back(num);
		dfs(n - num, path);
		path.pop_back();
	}
}
int main() {
	int n;
	scanf("%d", &n);
	vector<int> path;
	dfs(n, path);
	return 0;
}