#include 
       
        int sum,ans[8];int solve(int n, long long mark, int *ans){
       	for (int i=n>8?++sum&0:0; n>8&&i<8; i!=7?std::cout << ans[i++] << " " : std::cout << ans[i++] << std::endl);	for (int i=0; i<8; !(mark>>i&1)&&!(mark>>(n+i+7)&1)&&!(mark>>(n-i+30)&1)?solve(n+(ans[n-1]=i+1)-i, mark|1ll<
        
         <<(n+i+7)|1ll<<(n-i+30), ans):0,i++);	return sum;}int main(){
       	std::cout << solve(1, 0, ans) << std::endl;}
        
       

from itertools import *cols = range(8)for vec in permutations(cols):    if (8 == len(set(vec[i]+i for i in cols))          == len(set(vec[i]-i for i in cols))):        print vec

#include
       
        using namespace std;int position[8];bool isSafe(int queen_number, int row_position) {
       for (int i = 0; i < queen_number; i++) {
       int other_row_pos = position[i];if (other_row_pos == row_position ||other_row_pos == row_position - (queen_number - i) ||other_row_pos == row_position + (queen_number - i))return false;}return true;}void solve(int k){
       if (k == 8){
       for (int i = 0; i < 8; i++)cout << position[i] << " ";cout << endl;}else{
       for (int i = 0; i < 8; i++){
       if (isSafe(k, i)){
       position[k] = i;solve(k + 1);}}}}int main(){
       solve(0);return 0;}
       

int 八皇后(uint64_t current = 0, uint64_t remains = 8, uint64_t rows = 0, uint64_t columns = 0) {
           if (remains == 0) if (rows == 0x0101010101010101UL && columns == 0x0101010101010101UL)        return 1;    if (current == 64) return 0;    uint64_t newRows  = rows | 1 << (current % 8 * 8);    uint64_t newColumns = columns | 1 << (current / 8 * 8);    return 八皇后(current+1, remains-1, newRows, newColumns) + 八皇后(current+1, remains, rows, columns);   }

#include 
       
        int queen(int l, int r, int m, int k){
           int ans = 0;    for (int i = (~(l | r | m)) & 0xff; i; i -= i & -i)        ans += queen((l | (i & -i)) << 1, (r | (i & -i)) >> 1 , m | (i & -i), k + 1);    return k == 8 ? 1 : ans;}int main(){
           printf("%d\n", queen(0, 0, 0, 0));}
       

#include 
       
        int main(){
        printf("...o....\n......o.\n..o.....\n.......o\n.o......\n....o...\no.......\n.....o..\n");}
       

(defun queens (n &optional (m n))  (if (zerop n)      (list nil)      (loop for solution in (queens (1- n) m)            nconc (loop for new-col from 1 to m                         when (loop for row from 1 to n                                     for col in solution                                     always (/= new-col col (+ col row) (- col row)))                         collect (cons new-col solution)))))

#include 
       
         intmain(int argc, const char *argvp[]) {
            ::eightQueen();     return 0;}
       

#include 
       
        int dfs(int r, int p1, int p2) {
       	int ret = 0, pos = ((1<<8)-1) & ~(r|p1|p2);	for (int k = pos & (-pos); pos; pos -= k, k = pos & (-pos))		ret += dfs(r+k, (p1+k)<<1, (p2+k)>>1);	return r+1 == (1<<8) ? 1 : ret;}int main() {
       	printf("%d\n", dfs(0,0,0));}
       

#include 
       
        #define LOWBIT(x) x&(-x)int solve(int c, int lc, int rc, int sum) {
           if(c == 0xFF) return sum + 1;    for (int pos = ((c | lc | rc)&0xFF)^0xFF; pos; pos&=(~(LOWBIT(pos)))) {
               sum = solve(c|LOWBIT(pos), (lc|LOWBIT(pos))<<1, (rc|LOWBIT(pos))>>1, sum);    }    return sum;}int main() {
        printf("%d\n", solve(0, 0, 0, 0)); }
       

$ gcc -std=gnu99 -o 8 8.c && ./892

#include
       
         int main() {
          int i=0, j=0, s=0, v=0, l=0, k=0; int a[100];   for( scanf("%d",&s); *a-s; v=a[j*=v]-a[i],k=i
        
         
          <
          =s*k&&++a[--i]);   return 0;}
         
        
       

int queens (){
           int pos[] = {
       0,1,2,3,4,5,6,7},ans = 0;    while(next_permutation(pos,pos+8)){
               bool ok = true;        for(int* p = pos;p