扫雷

game.h

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<stdlib.h>
#include<time.h>
#include<string.h>
#define ROW 9
#define COL 9
#define ROWS (ROW+2)
#define COLS (COL+2)
#define numbers 20

void Init_arr(char arr[ROWS][COLS], int rows, int cols, char t);
void print_arr(char arr[ROWS][COLS], int row, int col);
void set_minearr(char mine[ROWS][COLS], int row, int col);
void find_mine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col);
int mine_count(char mine[ROWS][COLS], int  x, int  y);

test.h

#include"game.h"

void menu()
{
	printf("********************\n");
	printf("*****  1. play  ****\n");
	printf("*****  0. exit  ****\n");
	printf("********************\n");
}

void game()
{
	char mine[ROWS][COLS] = {0};
	char show[ROWS][COLS] = {0};
	Init_arr(mine, ROWS, COLS, '0');    //初始化雷数组
	Init_arr(show, ROWS, COLS, '*');    //初始化展示数组
	print_arr(show, ROW, COL);
	set_minearr(mine,ROW,COL);          //生成雷数组
	print_arr(mine, ROW, COL);
	find_mine(mine, show, ROW, COL);    //排雷
}
void test()
{
	srand((unsigned int)time(NULL));
	int input = 0;
	do
	{
		menu();
		printf("请选择->\n");
		scanf("%d", &input);
		switch (input)
		{
		case 1:
			game();
			break;
		case 0:
			break;
		default:
			printf("输入错误,请重新输入!\n");
		}

	} while (input);
}
int main()
{
	test();
	system("psuse");
	return 0;
}

 

game.c

#include"game.h"
void Init_arr(char arr[ROWS][COLS], int rows, int cols,char t)
{
	int i = 0;
	int j = 0;
	for (i = 0; i < rows; i++)
	{
		for (j = 0; j < cols; j++)
		{
			arr[i][j] = t;
		}
	}
	//memset(&arr[0][0], t, rows*cols*sizeof(arr[0][0]));
}
void print_arr(char arr[ROWS][COLS], int row, int col)
{
	int i = 0;
	int j = 0;
	for (i = 0; i <= row; i++)
	{
		printf("%d ", i);
	}
	printf("\n");
	for (i = 1; i <= row; i++)
	{
		printf("%d ", i);
		for (j = 1; j <= col; j++)
		{
			printf("%c ", arr[i][j]);
		}
		printf("\n");
	}
}
void set_minearr(char mine[ROWS][COLS], int row, int col)
{
	int x = 0;
	int y = 0;
	int num = numbers;
	while (num)
	{
		x = rand() % row + 1;
		y = rand() % col + 1;
		if (mine[x][y] == '0')
		{
	        mine[x][y] = '1';
			num--;
		}
	
	}
}

void find_mine(char mine[ROWS][COLS], char show[ROWS][COLS], int row, int col)
{
	int x = 0;
	int y = 0;
	int k = 0;
	int flag = 0;
	while (k<ROW*COL - numbers)
	{
		printf("请输入坐标:\n");
		scanf("%d %d", &x, &y);
		if (x >= 1 && x <= row&&y >= 1 && y <= col)
		{
			if (mine[x][y] == '1'&&flag == 0)
			{
				printf("重生机会!再次排雷!!!\n");
				mine[x][y] = '0';
				x = rand() % row + 1;
				y = rand() % col + 1;
				if (mine[x][y] == '0')
					mine[x][y] = '1';
				continue;
			}
			else if (mine[x][y] == '1' && flag == 1)
			{
				printf("被炸死!\n");
				print_arr(mine, row, col);
				break;
			}
			else
			{
				int count = mine_count(mine, x, y);
				show[x][y] = count + '0';
				print_arr(show, row, col);
				k++;
				flag = 1;
			}
		}
		else
		{
			printf("坐标输入有误,请重新输入!\n");
		}
	}
	if (k == ROW*COL - numbers)
		printf("排雷成功!\n");
}
int mine_count(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';
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值