• 2024-04-01
• dfs搜索

#include<bits/stdc++.h>


void solve()
{
	std::vector<int> vis(10);
	int n; std::cin >> n;
	std::vector<int> ans;
	std::vector<int> path(10);
	std::function<void(int)> dfs = [&](int u)
	{
		if(u == n)
		{
			for(int i = 0; i < n; i++) std::cout << path[i];
			std::cout << "\n";
			return;
		}
		
		for(int i = 1; i <= n; i++)
		{
			if(vis[i]) continue;
			path[u] = i;
			vis[i] = 1;
			dfs(u + 1);
			vis[i] = 0;
		}
	};
	
	dfs(0);
}
int main()
{
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int t = 1;
	while(t--) solve();
	return 0;
}