求助悬一关

#include<bits/stdc++.h>
using namespace std;
int a[15],n,vis[15],vis2[15],vis3[15],ans=0;
void dfs(int x)
{
    if(ans<=2)
    {
        for (int i=1;i<=n;i++)
        {
            cout<<a[i]<<" ";
        }
		cout<<endl;
		ans++;
    }
	
    if(x==n+1)
    {
    	return ;
	}
    for (int i=1;i<=n;i++)
    {
        if(!vis[i]&&!vis2[i+x]&&!vis3[i-x+n])
 	    {
 		    a[x]=i;
 		    vis[i]=1;
 		    vis2[x+i]=1;
 		    vis3[i-x+n]=1;
 		    dfs(x+1);
 		    vis[i]=0;
 		    vis2[x+i]=0;
 		    vis3[i-x+n]=0;
 	    }
    }
}
int main()
{
    cin>>n;
    dfs(1);
    cout<<ans<<endl;
    return 0;
}