Ｃ＋＋实现八皇后问题

可以借鉴，但是不能拷贝 #include #include const int max_board=31; int ww=0; class queens{ public: queens(int size); bool is_sovled()const; void print()const; bool ungurarded(int col)const; void insert(int col); void remove(int col); int board_size; private: int count; bool queen_square[max_board][max_board]; }; queens::queens(int size) { board_size=size; count=0; int row, col; for( row=0;row=0)&&(col-i>=0);i++)ok=!queen_square[count-i][col-i]; for(i=1;ok&&(count-i>=0)&&(col+i>board_size; queens configuration(board_size); if(board_size<0||board_size>board_size)cout<<"ê?è???óú?D??μ?êy×?￡o"; else {s1=clock(); sovle_from(configuration); s2=clock(); } cout<<"?a??μ?·?°?óD￡o"<