pipiµÄСÎÑ

C++ÓïÑÔ: Codee#16944

#include <iostream>
#include<conio.h>

using namespace std;

//ÓÃqueens[]Êý×é´¢´æÿ¸ö»ÊºóµÄλÖÃ

#define  Max 8
int sum = 0;

class QueenPuzzle
{

    int queens[Max];
public:
    void printout();
    int  IsVaild(int n);//ÅжϵÚn¸ö»Êºó·ÅÉÏÈ¥ÒÔºó,ÊÇ·ñºÏ·¨
    void PlaceQueen(int i);
};

void QueenPuzzle::printout()
{
for (int i=0;i<Max;i++)
{
     for (int j=0;j<Max;j++)
     {
         if (j==queens[i])
             cout<<"¡ö";
         else
             cout<<"¡õ";

     }
     cout<<endl;

}

    cout<<"°´q¼üÍ˳ö,°´ÆäËû¼ü¼ÌÐø"<<endl<<endl;
     if(getch()=='q')
         exit(0);

}

void QueenPuzzle::PlaceQueen(int i)
{

    for(int j=0;j<Max;j++)
        //Èç¹ûÈ«²¿·ÅÍêÊä³ö½á¹û;
    {
        if (i==Max)
        {
            sum++;
            cout<<"µÚ"<<sum<<"×é½â"<<endl;
            printout();
            return;
        }

        //·ÅÖûʺó
        queens[i] = j;
       //ÅжÏÏÂһλÖÃÄܷŻʺó²»
        if (IsVaild(i))
        {
            PlaceQueen(i+1);
        }
   
    }
}

//Åжϻʺó·ÅÉÏÈ¥ÊÇ·ñºÏ·¨,ÊÇ·ñÎÞ³åÍ»
int QueenPuzzle::IsVaild(int n)
{
  //½«µÚn¸ö»ÊºóÓëµÚn+1¸ö»Êºó½øÐбȽÏ
   for (int i=0;i<n;i++)
   {
     if (queens[i]==queens[n])
         return 0;
     if(abs(queens[i]-queens[n])==(n-i))
         return 0;

   }

   return 1;
 
}

int  main()
{
QueenPuzzle queen;
queen.PlaceQueen(0);
cout<<"¹²ÓÐ"<<sum<<"×é½â"<<endl;

    return 0;
}