POJ3239《Solution to the n Queens Puzzle》方法：构造公式法

题目大意：n(8<=n<=300)皇后问题。用传统的DFS回溯（回溯要保存前进中的状态，并且设置好约束条件），当n>30时，传统方法不再使用。所以，网上有巧妙的构造公式方法：

一、当n mod 6 != 2 或 n mod 6 != 3时：

[2,4,6,8,...,n],[1,3,5,7,...,n-1]        (n为偶数)

[2,4,6,8,...,n-1],[1,3,5,7,...,n ]       (n为奇数)

二、当n mod 6 == 2 或 n mod 6 == 3时

(当n为偶数,k=n/2；当n为奇数,k=(n-1)/2)

[k,k+2,k+4,...,n],[2,4,...,k-2],[k+3,k+5,...,n-1],[1,3,5,...,k+1]         (k为偶数,n为偶数)

[k,k+2,k+4,...,n-1],[2,4,...,k-2],[k+3,k+5,...,n-2],[1,3,5,...,k+1],[n]     (k为偶数,n为奇数)

[k,k+2,k+4,...,n-1],[1,3,5,...,k-2],[k+3,...,n],[2,4,...,k+1]              (k为奇数,n为偶数)

[k,k+2,k+4,...,n-2],[1,3,5,...,k-2],[k+3,...,n-1],[2,4,...,k+1],[n ]      (k为奇数,n为奇数)

#include <iostream> using namespace std; int main() { int n, k, i; while (cin >> n) { if (!n) break; if (n%6 != 2 && n%6 != 3) { if (n%2 == 0) { for (i = 2; i <= n; i+=2) cout << i << ' '; for (i = 1; i <= n-1; i+=2) cout << i << ' '; cout << endl; } else { for (i = 2; i <= n-1; i+=2) cout << i << ' '; for (i = 1; i <= n; i+=2) cout << i << ' '; cout << endl; } } else if (n%6 == 2 || n%6 == 3) { if (n%2 == 0) { int k = n/2; if (k%2 == 0) { for (i = k; i <= n; i+=2) cout << i << ' '; for (i = 2; i <= k-2; i+=2) cout << i << ' '; for (i = k+3; i <= n-1; i+=2) cout << i << ' '; for (i = 1; i <= k+1; i+=2) cout << i << ' '; cout << endl; } else { for (i = k; i <= n-1; i+=2) cout << i << ' '; for (i = 2; i <= k-2; i+=2) cout << i << ' '; for (i = k+3; i <= n-2; i+=2) cout << i << ' '; for (i = 1; i <= k+1; i+=2) cout << i << ' '; cout << endl; } } else { int k = (n-1)/2; if (k%2 == 0) { for (i = k; i <= n-1; i+=2) cout << i << ' '; for (i = 2; i <= k-2; i+=2) cout << i << ' '; for (i = k+3; i <= n-2; i+=2) cout << i << ' '; for (i = 1; i <= k+1; i+=2) cout << i << ' '; cout << n; cout << endl; } else { for (i = k; i <= n-2; i+=2) cout << i << ' '; for (i = 1; i <= k-2; i+=2) cout << i << ' '; for (i = k+3; i <= n-1; i+=2) cout << i << ' '; for (i = 2; i <= k+1; i+=2) cout << i << ' '; cout << n; cout << endl; } } } } return 0; }