回溯算法－－八皇后问题

#include <iostream>
using namespace std;

int e_q[8][8];
int r[15];
int le[15];
int q[8];
int count = 0;

void en_queens(int);

int main()
{
        for(int i=0;i<15;i++)
        {
                 r[i] = 0;
                 le[i]    = 0;
        }

        for(int i =0;i<8;i++)
        {
              q[i]        = 0;
               for(int j=0;j<8;j++)
               {
                     e_q[i][j] = 0;
               }
        }

        en_queens(0);
        cout<<endl;
        cout<<"总共有"<<count<<"个方法"<<endl;
        return 0;
}

void en_queens(int line)
{
         if(line == 8)
         {
                   count++;
                    for(int i =0;i<8;i++)
                    {
                           for(int j=0;j<8;j++)
                           {
                                   cout<<e_q[i][j]<<"   ";
                           }
                           cout<<endl;
                    }
                   cout<<endl;
                    return;
         }

         for(int c=0; c<8; c++)
         {
                  if(q[c] == 0 && r[line+c] == 0 && le[line-c +7] == 0)
                  {
                            e_q[line][c] = 1;
                            q[c]               = 1;
                            r[line+c] = 1;
                            le[line-c+7] = 1;
                             en_queens(line+1);
                             e_q[line][c] = 0;
                              q[c]               = 0;
                              r[line+c]      = 0;
                              le[line-c+7]=0;
                  }

         }
}