C++EasyX 기반 간단 한 지뢰 제거 게임 실현

#include <cmath>
#include <time.h>
#include <easyx.h>
#include <conio.h>
using namespace std;
#define Size 500 //      
#define SquareSize 50 //      
#define BackGroundColor LIGHTGRAY //      
const int N = Size / SquareSize; //       N * N
const int Num = N * N / 5; //      
int num = Num, all = N * N - Num; //            
int Map[N + 10][N + 10]; //    (i, j)       ，  -1        
bool vis[N + 10][N + 10]; //    (i, j)   
bool vis_lm[N + 10][N + 10]; //  (i, j)        
int dx[] = { 0, 0, 1, -1, 1, -1, 1, -1 };
int dy[] = { 1, -1, 0, 0, 1, -1, -1, 1 };
void Init() {
 initgraph(Size, Size);
 setbkcolor(BackGroundColor);
 settextcolor(YELLOW);
 settextstyle(25, 0, _T("  "));
 cleardevice();
}
void BuildGameMap() { //    
 srand((unsigned int)time(NULL)); //     
 for (int i = 1; i <= Num; ++i) {
 int x = rand() % N + 1, y = rand() % N + 1;
 while (Map[x][y] == -1) {
 x = rand() % N + 1, y = rand() % N + 1;
 }
 Map[x][y] = -1;
 }
 //             
 for (int i = 1; i <= N; ++i) {
 for (int j = 1; j <= N; ++j) {
 if (Map[i][j] == -1) continue;
 for (int k = 0; k < 8; ++k) {
 if (Map[i + dx[k]][j + dy[k]] == -1) ++Map[i][j];
 }
 }
 }
}
void InitGameGraph() { //     
 memset(Map, 0, sizeof(Map));
 memset(vis, false, sizeof(vis));
 memset(vis_lm, false, sizeof(vis_lm));
 num = Num, all = N * N - Num;
 BuildGameMap();
 cleardevice(); //  
 setfillcolor(WHITE);
 for (int i = 0; i <= Size; i += SquareSize) {
 line(i, 0, i, Size);
 }
 for (int i = 0; i <= Size; i += SquareSize) {
 line(0, i, Size, i);
 }
}
int Translate_X(int x) { //    
 return x * SquareSize + SquareSize / 2;
}
void GameOver(bool tag) {
 RECT r = { 0, 0, Size - 1, Size - 1 };
 if (tag) {
 drawtext(_T("Win"), &r, DT_CENTER | DT_VCENTER | DT_SINGLELINE);
 }
 else {
 //          
 setfillcolor(RED);
 for (int i = 1; i <= N; ++i) {
 for (int j = 1; j <= N; ++j) {
 if (Map[i][j] == -1) {
 if (vis_lm[i][j]) continue; //         ，  
 outtextxy(Translate_X(i - 1), Translate_X(j - 1), 'X'); //      
 }
 else if (vis_lm[i][j]) { //          ，  
 fillcircle(Translate_X(i - 1), Translate_X(j - 1), SquareSize / 2 - 10);
 }
 }
 }
 drawtext(_T("Failed"), &r, DT_CENTER | DT_VCENTER | DT_SINGLELINE);
 }
}
void Help() { //    （    ）
 for (int i = 1; i <= N; ++i) {
 for (int j = 1; j <= N; ++j) {
 if (Map[i][j] == -1) {
 outtextxy(Translate_X(i - 1), Translate_X(j - 1), 'X');
 }
 }
 }
}
void StartGame() {
 Init();
 while (true) {
 InitGameGraph();
 //Help();
 bool IF_WIN = true;
 while (all || num) { //                         
 MOUSEMSG msg = GetMouseMsg(); //        
 int x = ceil(msg.x * 1.0 / SquareSize * 1.0), y = ceil(msg.y * 1.0 / SquareSize * 1.0);
 if (vis[x][y]) continue; //      ，  
 if (msg.mkLButton) { //      
 if (Map[x][y] == -1) { //           
 IF_WIN = false;
 break;
 }
 outtextxy(Translate_X(x - 1), Translate_X(y - 1), Map[x][y] + '0');
 --all;
 vis[x][y] = true;
 }
 else if (msg.mkRButton) { //      
 if (!vis_lm[x][y]) { //         ，    
 vis_lm[x][y] = true;
 if (Map[x][y] == -1) --num;
 solidcircle(Translate_X(x - 1), Translate_X(y - 1), SquareSize / 2 - 10);
 }
 else if (vis_lm[x][y]) { //    
 vis_lm[x][y] = false;
 if (Map[x][y] == -1) ++num;
 clearrectangle((x - 1) * SquareSize + 1, (y - 1) * SquareSize + 1, x * SquareSize - 1, y * SquareSize - 1);
 }
 }
 }
 GameOver(IF_WIN);
 int t = _getch();
 }
}
int main() {
 StartGame();
 return 0;
}