当前位置:网站首页>C語言實現掃雷(簡易版)

C語言實現掃雷(簡易版)

2022-06-24 20:27:00 AKA.瞳源治

#define ROW 9
#define COL 9

#define ROWS 2 + ROW
#define COLS 2 + COL

#define shuliang 10

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#include<Windows.h>

void quyu(char mine[ROWS][COLS], int rows, int cols, char n)
{
	int i = 0;
	int j = 0;
	for (i = 0; i < rows; i++)
	{
		for (j = 0; j < cols; j++)
		{
			mine[i][j] = n;
		}
	}
}

void xianshi(char show[ROWS][COLS], int row, int col)
{
	int i = 0;
	int j = 0;

	for (i = 0; i <= col; i++)
	{
		printf("%d ", i);
	}
	printf("\n");

	for (i = 1; i <= row; i++)
	{
		printf("%d ", i);
		for (j = 1; j <= col; j++)
		{
			printf("%c ", show[i][j]);
		}
		printf("\n");
	}
	printf("\n");
}

void buzhi(char mine[ROWS][COLS], int row, int col)
{
	int m = shuliang;
	int x = 0;
	int y = 0;
	while (m)
	{
		x = rand() % row + 1;
		y = rand() % row + 1;
		if (mine[x][y] == '0')
		{
			mine[x][y] = '1';
			m--;
		}
	}
}

int zhouweilei(char mine[ROWS][COLS], int x, int y)
{

	return mine[x - 1][y - 1] +
		mine[x - 1][y] +
		mine[x - 1][y + 1] +
		mine[x][y - 1] +
		mine[x][y + 1] +
		mine[x + 1][y - 1] +
		mine[x + 1][y] +
		mine[x + 1][y + 1] -
		8 * '0';
}

void play(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col)
{

	int x = 0;
	int y = 0;
	int win = 0;
	while (win < row * col - shuliang)
	{
		printf("請輸入坐標:");
		scanf("%d %d", &x, &y);
		if (x >= 1 && x <= row && y >= 1 && y <= col)
		{
			if (mine[x][y] == '1')
			{
				printf("死\n");
				xianshi(mine, ROW, COL);
				printf("遊戲結束\n");
				break;
			}
			else
			{
				int m = zhouweilei(mine, x, y);
				show[x][y] = m + '0';
				xianshi(show, ROW, COL);
			}
		}
		else
		{
			printf("請重新輸入\n");
			continue;
		}
		win++;
	}
	if (win == row * col - shuliang)
	{
		printf("贏了\n");
		xianshi(mine, ROW, COL);
	}
}
void meun()
{
	Sleep(5000);
	char a1[] = "******** 1.  play *******";
	char a2[] = "******** 0.  exit *******";
	char a3[] = "########          #######";
	char a4[] = "########          #######";
	int left1 = 0;
	int right1 = strlen(a1) - 1;
	int left2 = 0;
	int right2 = strlen(a2) - 1;
	while (left1 < right1 && left2 < right2)
	{
		a3[left1] = a1[left1];
		a3[right1] = a1[right1];
		a4[left2] = a2[left2];
		a4[right2] = a2[right2];

		printf("%s\n", a3);
		printf("%s\n", a4);

		left1++;
		right1--;
		left2++;
		right2--;

		Sleep(100);
		system("cls");
	}
	printf("%s\n", a3);
	printf("%s\n", a4);
}

void game()
{
	char mine[ROWS][COLS] = { 0 };
	char show[ROWS][COLS] = { 0 };

	quyu(mine, ROWS, COLS, '0');
	quyu(show, ROWS, COLS, '*');


	buzhi(mine, ROW, COL);

	xianshi(show, ROW, COL);

	play(mine, show, ROW, COL);


}

void saolei()
{

	int xuanze = 0;
	srand((unsigned int)time(NULL));
	do
	{
		meun();
		printf("請輸入:");
		scanf("%d", &xuanze);
		switch (xuanze)
		{
		case 1:
			printf("開始遊戲\n");
			game();
			break;
		case 0:
			printf("退出遊戲\n");
			break;
		default:
			printf("輸入錯誤\n");
			break;
		}
	} while (xuanze);
}

int main()
{
	saolei();
	return 0;
}

原网站

版权声明
本文为[AKA.瞳源治]所创,转载请带上原文链接,感谢
https://yzsam.com/2022/175/202206241416057910.html

随机推荐