扫雷

最新推荐文章于 2024-07-26 16:01:24 发布

hulingerlinjin

最新推荐文章于 2024-07-26 16:01:24 发布

阅读量133

点赞数

文章标签：经典问题

本文链接：https://blog.csdn.net/hulingerlinjin/article/details/70257525

版权

#include "stdafx.h"
#include
   
   
    
    
#include
    
    
     
     
#include
     
     
      
      
int main(void)
{
	//扫雷  10行10列  
	int map[10][10] = { 0 };
	int row = 0, col = 0;
	srand(time(0));
	int count = 10;
	do
	{
		row = rand() % 10;
		col = rand() % 10;
		if (!map[row][col])
		{
			map[row][col] = -1;
			count--;
		}
	} while (count>0);
	for (row = 0; row <= 9; row++)
	{
		for (col = 0; col <= 9; col++)
		{
			if (!map[row][col])
			{
				printf("0");
			}
			else if (map[row][col] == -1)
			{
				printf("X");
			}
		}
		printf("\n");
	}
	printf("填入数字\n");
	//周围的 
	int zhouwei[3][3] = { 0 };
	//存储每个位置周围有几个雷
	int map_number[10][10] = { 0 };
	int number = 0;
	for (row = 0; row <= 9; row++)
	{
		for (col = 0; col <= 9; col++)
		{
			if (row - 1 == -1)
			{
				for (int i = 0; i<3; i++)
				{
					zhouwei[0][i] = -1;
				}
			}
			if (row + 1 == 10)
			{
				for (int i = 0; i<3; i++)
				{
					zhouwei[2][i] = -1;
				}
			}
			if (col - 1 == -1)
			{
				for (int j = 0; j<3; j++)
				{
					zhouwei[j][0] = -1;
				}
			}
			if (col + 1 == 10)
			{
				for (int j = 0; j<3; j++)
				{
					zhouwei[j][2] = -1;
				}
			}
			zhouwei[1][1] = -1;
			for (int i = 0; i<3; i++)
			{
				for (int j = 0; j<3; j++)
				{
					if (zhouwei[i][j] == 0)
					{
						if (map[row + i - 1][col + j - 1] == -1)
						{
							number++;
						}
					}
				}
			}
			map_number[row][col] = number;
			if (map[row][col] == -1)
			{
				printf("X");
			}
			else
			{
				printf("%d", number);
			}
			number = 0;
			for (int i = 0; i<3; i++)
			{
				for (int j = 0; j<3; j++)
				{
					zhouwei[i][j] = 0;
				}
			}
		}
		printf("\n");
	}
	getchar();
	return 0;
}