36pts求助
查看原帖
36pts求助
739817
xdnjf楼主2023/6/2 22:00
#include<cstdio>
#include<iostream>
using namespace std;
long long ans,zl[15][15],n;
void bfs(long long x) {
	if(x>n) {
		ans++;
		if(ans<=3) {
			for(long long i=1; i<=n; i++) {
				cout<<zl[1][i]<<' ';
			}
			puts("");
		}
		return;
	} else {
		for(long long i=1; i<=n; i++) {
			if(zl[2][i]!=1&&zl[3][x+i]!=1&&zl[4][n+x-i]!=1) {
				zl[1][x]=i;
				zl[2][i]=1;
				zl[3][x+i]=1;
				zl[4][n+x-i]=1;
				bfs(x+1);
				zl[2][i]=0;
				zl[3][x+i]=0;
				zl[4][n+x-i]=0;
			}
		}
	}
}
signed main() {
	scanf("%lld",&n);
	bfs(1);
	printf("%lld\n",ans);
	return 0;
}
2023/6/2 22:00
加载中...