八皇后问题-输出边长N正方格中满足条件的位置

给定正方格的边长，然后用递归及位操作的思路，使得每一行每一列及对角线上只放置一个点，具体代码如下：

#include <stdio.h>
#include <time.h>

int result[3][13] = { 0 };
int retNum = 0;
#define ABS(a) (((a)>0)?(a):(-(a)))
char path[13] = { 0 };
int put = 0;
long sum = 0, upperlim = 1;

void dfs(int cur, int level)
{
	if (cur == level)
	{
		if (retNum < 3)
		{
			for (int i = 0; i < level; i++)
			{
				result[retNum][i] = path[i] + 1;
			}
		}
		retNum++;
	}
	else
	{
		for (int i = 0; i < level; i++)
		{
			bool flag = false;
			if (put&(1 << i))continue;
			for (int j = 0; j < cur; j++)
			{
				if (ABS(path[j] - i) == (cur - j))
				{
					flag = true;
					break;
				}
			}
			if (flag)continue;
			path[cur] = i;
			put |= (1 << i);
			dfs(cur + 1, level);
			if (retNum == 3)
			{
				return;
			}
			put ^= (1 << i);
		}
	}
}

void test(long row, long ld, long rd)
{
	if (row != upperlim)
	{
		long pos = upperlim & ~(row | ld | rd);
		while (pos)
		{
			long p = pos & -pos;
			pos -= p;
			test(row + p, (ld + p) << 1, (rd + p) >> 1);
		}
	}
	else
	{
		retNum++;
	}
}


int main(void)
{
	freopen("input.txt", "r", stdin);
	int N;
	time_t start = clock();
	scanf("%d\n", &N);
	for (int i = 0; i < N; i++)
	{
		int M;
		scanf("%d\n", &M);
		dfs(0, M);
		printf("#%d ", i + 1);
		for (int i = 0; i < 3; i++)
		{
			for (int j = 0; j < M; j++)
			{
				printf("%d ", result[i][j]);
			}
		}

		retNum = 0;
		upperlim = (1 << M) - 1;
		test(0, 0, 0);
		printf("%d\n", retNum);
		retNum = 0;
		for (int i = 0; i < 13; i++)path[i] = 0;
		put = 0;
	}

	time_t end = clock();
	printf("%f\n", difftime(end, start));
}

其中input.txt内容如下：

8
6
7
8
9
10
11
12

13

输出结果：

#1 2 4 6 1 3 5 3 6 2 5 1 4 4 1 5 2 6 3 4
#2 1 3 5 7 2 4 6 1 4 7 3 6 2 5 1 5 2 6 3 7 4 40
#3 1 5 8 6 3 7 2 4 1 6 8 3 7 4 2 5 1 7 4 6 8 2 5 3 92
#4 1 3 6 8 2 4 9 7 5 1 3 7 2 8 5 9 4 6 1 3 8 6 9 2 5 7 4 352
#5 1 3 6 8 10 5 9 2 4 7 1 3 6 9 7 10 4 2 5 8 1 3 6 9 7 10 4 2 8 5 724
#6 1 3 5 7 9 11 2 4 6 8 10 1 3 6 9 2 8 11 4 7 5 10 1 3 7 9 4 2 10 6 11 5 8 2680
#7 1 3 5 8 10 12 6 11 2 7 9 4 1 3 5 10 8 11 2 12 6 9 7 4 1 3 5 10 8 11 2 12 7 9 4 6 14200
#8 1 3 5 2 9 12 10 13 4 6 8 11 7 1 3 5 7 9 11 13 2 4 6 8 10 12 1 3 5 7 12 10 13 6 4 2 8 11 9 73712
233.000000