不啰嗦了直接上代码
#include<bits/stdc++.h>
#include<windows.h>
using namespace std;
const int nans[8][2]={{1,0},{0,1},{-1,0},{0,-1},{1,-1},{-1,-1},{-1,1},{1,1}};
const int awsd[4][2]={{1,0},{0,1},{-1,0},{0,-1}};
int n,l;
string qp[1010][1010];
bool un[1010][1010]={0};
map<pair<int,int>,bool>pd;
void dfs(int x,int y){
pd[make_pair(x,y)]=1;
int ans=0;
for(int i=0;i<8;i++){
int a=x+nans[i][0],b=y+nans[i][1];
if(un[a][b])ans++;
}
l--;
qp[x][y]=ans+'0';
if(ans>0)return;
for(int i=0;i<4;i++){
int p=x+awsd[i][0],q=y+awsd[i][1];
if(p<1||q<1||p>n||q>n||pd[make_pair(p,q)])continue;
dfs(p,q);
pd[make_pair(p,q)]=1;
}
return;
}
int main(){
system("mode con cols=100 lines=30");
int x,y;
cout<<"请输入方阵边长:";
cin>>n;
l=n*n;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
qp[i][j]="■";
srand((unsigned)time(NULL));
for(int i=1;i<=l/6;i++){
int a=rand()%n+1,b=rand()%n+1;
if(!un[a][b])un[a][b]=1;
else i--;
}
while(true){
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cout<<qp[i][j];
if(qp[i][j]!="■")cout<<" ";
}
cout<<i<<endl;
}
for(int i=1;i<=n;i++){
cout<<i;
if(i<10)cout<<' ';
}
cout<<endl<<l<<endl;
if(l<=n*n/6)break;
cout<<"请输入你要排查的坐标:";
cin>>y>>x;
system("cls");
if(pd[make_pair(x,y)])continue;
if(un[x][y]){
system("color BC");
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
if(i==x&&j==y){
cout<<"※";
continue;
}
if(un[i][j]){
cout<<"x"<<' ';
continue;
}
dfs(i,j);
cout<<qp[i][j]<<' ';
}
cout<<endl;
}
cout<<"Game Over!";
MessageBox(0,"噫!好,你中了!","Game Over",MB_ICONWARNING);
return 0;
}
dfs(x,y);
}
cout<<"Perfect!!!";
MessageBox(0,"Congratulations!","Pass",0);
return 0;
}