2013上机二 八皇后问题8*8 任意两个皇后不在同行同列对角

#include<iostream>using namespace std;int c[20], n = 8, cnt = 0;void PRint() {	for (int i = 0;i < n;i++)		cout << c[i]+1;	cout << endl;}void search(int r) {	if (r == n) {		cnt++;		print();		return;	}	for (int i = 0;i < n;i++) {		c[r] = i;		int ok = 1;		for (int j = 0;j < r;j++) {			if (c[r] == c[j] || r - j == c[r] - c[j] || r - j == c[j] - c[r]) {				ok = 0;				break;			}		}		if (ok) 			search(r + 1);	}}void main() {	c[0] = 0;	search(1);	cout << cnt << endl;}