DFS全WA求Debug

#include<iostream>
using namespace std;
int n, ans[15];
bool visit[10];
void dfs(int x) {
	if (x > n) {
		for (int i = 1; i <= n; i++) cout << "   " << ans[i];
		cout << endl;
	}
	for (int i = 1; i <= n; i++) {
		if (!visit[i]) {
			visit[i] = true;
			ans[x] = i;
			dfs(x + 1);
			ans[x] = 0;
			visit[i] = false;
		}
	}
}
int main() {
	cin >> n;
	dfs(1);
	return 0;
}