U E D R , A S I H C RSS

Eight Queen Problem/허아영

..
함-_- ...

~cpp
// 8  ..    . 
#include <iostream>
using namespace std;

#define MAX_SIZE 8
#define QUEEN_MAX_NUM 8

int main()
{
	int board[8][8];
	unsigned int queenNum = 0; 
	bool isMaxQueen = false;
	unsigned int tryX = 0, tryY = 0;
	while(!isMaxQueen)
	{
		cout<< ".";
		// 화
		for(int i = 0; i < MAX_SIZE; i++)
			for(int j = 0; j < MAX_SIZE; j++)
				board[i][j] = 0;
			//  
			for(i = tryX; i < MAX_SIZE; i++)
			{
				for(int j = tryY; j < MAX_SIZE; j++)
				{
					if(board[i][j] == 0)
					{
						board[i][j] = 1;	//  .     -1
						// ,,  함,  -_-
						
					}					
				}
			}
			
			if(queenNum == QUEEN_MAX_NUM)
			{
				isMaxQueen = true;
				// . 
				for(i = 0; i < MAX_SIZE; i++)
				{
					for(int j = 0; j < MAX_SIZE; j++)
						cout << board[i][j];
					cout << endl;
				}
			}
			tryY += 1;
			
	}
	return 0;
}
Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:23:12
Processing time 0.0082 sec