C++之扫雷2.0

大家好，我是阳了个阳C++，扫雷第二版终于做完了

本次更新优化了以下几点：

一、玩家可以自选地图大小以及地雷数量

二、新增无尽模式

三、新增坐标轴

四、新增递归翻格机制

在放代码之前，作者还是想说一句：

能不能点个赞！！！

​
#include<bits/stdc++.h>
#include<windows.h>
using namespace std;
int floormap[101][101];
char ceilmap[101][101];
bool vst[101][101];
int n,m,b;
char key;
void cls(){
	system("cls");
}
void start(){
	cout<<"扫雷游戏\n\n";
	cout<<"作者：阳了个阳C++\n\n";
	cout<<"进入游戏请按e\n\n";
	cin>>key;
	while(key!='e'){
		cls();
		cout<<"进入游戏请按e\n\n";
		cin>>key; 
	}
}
void makemap(){
	int B=b;
	int tmpx[b+1],tmpy[b+1];
	for(int i=1;i<=b;i++){
		tmpx[i]=rand()%n+1;
		tmpy[i]=rand()%m+1;
	}
	for(int i=1;i<=b;i++){
		floormap[tmpx[i]][tmpy[i]]=-1;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			ceilmap[i][j]='?';
			if(floormap[i][j]==-1) continue;
			if(floormap[i-1][j]==-1) floormap[i][j]++;
			if(floormap[i+1][j]==-1) floormap[i][j]++;
			if(floormap[i][j-1]==-1) floormap[i][j]++;
			if(floormap[i][j+1]==-1) floormap[i][j]++;
			if(floormap[i-1][j-1]==-1) floormap[i][j]++;
			if(floormap[i-1][j+1]==-1) floormap[i][j]++;
			if(floormap[i+1][j-1]==-1) floormap[i][j]++;
			if(floormap[i+1][j+1]==-1) floormap[i][j]++;
		}
	}
}
void coutmap(){
	SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);
	for(int i=0;i<=m;i++){
		cout<<i;
		if(i<10) cout<<"  ";
		else cout<<" ";
	}
	cout<<"\n";
	for(int i=1;i<=n;i++){
		SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_GREEN);
		cout<<i<<" ";
		if(i<10) cout<<" ";
		for(int j=1;j<=m;j++){
			if(ceilmap[i][j]=='?') SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);
			else SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_BLUE);
			cout<<ceilmap[i][j]<<"  ";
		}
		cout<<"\n";
	}
}
void dfs(int x,int y){
	if(!x||!y||x==n+1||y==m+1){
		return;
	}
	if(vst[x][y]){
		return;
	}
	vst[x][y]=1;
	ceilmap[x][y]=floormap[x][y]+'0';
	if(floormap[x][y]){
		return;
	}
	dfs(x+1,y);
	dfs(x-1,y);
	dfs(x,y-1);
	dfs(x,y+1);
	dfs(x+1,y-1);
	dfs(x+1,y+1);
	dfs(x-1,y-1);
	dfs(x-1,y+1);
	return;
}
void clean(){
	for(int i=1;i<=100;i++){
		for(int j=1;j<=100;j++){
			vst[i][j]=0;
		}
	}
}
void lose(){
	cls();
	cout<<"很遗憾，你踩到了雷！";
	exit(0);
}
void open(int x,int y){
	if(floormap[x][y]==-1){
		lose();
	}else{
		ceilmap[x][y]=floormap[x][y]+'0';
		if(!floormap[x][y]){
			dfs(x,y);
			clean();
		}
	}
}
int judge(){
	int cnt=n*m-b;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			if(ceilmap[i][j]!='?'){
				cnt--;
			}
		}
	}
	if(!cnt) return 0;
	return 1;
}
void win(){
	cls();
	cout<<"恭喜你，你通过了这张地图！\n\n";
	cout<<"将在三秒后进入下一关";
	Sleep(3000);
}
int main(){
	cls();
	srand(time(NULL));
	SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);
	start();
	while(1){
		cls();
		cout<<"请输入地图的长、宽和地雷数量\n\n";
		cout<<"长、宽<50，地雷数量<长*宽\n\n";
		cout<<"友情提示：不推荐大家把地雷数设的太少\n";
		cout<<"否则可能出现翻一个格子就结束的情况（因为有连锁翻格机制）\n";
		cin>>n>>m>>b;
		cls();
		cout<<"Loading……\n";
		makemap();
		Sleep(1500);
		cls(); 
		while(1){
			coutmap();
			SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), FOREGROUND_INTENSITY | FOREGROUND_RED);
			int x,y;
			cout<<"\n请输入坐标：\n\n";
			cin>>x>>y;
			open(x,y);
			cls();
			int jud=judge();
			if(jud==0){
				win();
				break;
			}		
		}
	}
	return 0;
}

​

如果有大佬发现bug，欢迎向我提出

今天的文章就到这里，感谢大家的观看，我们下期再见！