当前位置:网站首页>C langage pour le déminage (version simplifiée)
C langage pour le déminage (version simplifiée)
2022-06-24 20:27:00 【AKA. Traitement de la pupille】
#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("Veuillez saisir les coordonnées:");
scanf("%d %d", &x, &y);
if (x >= 1 && x <= row && y >= 1 && y <= col)
{
if (mine[x][y] == '1')
{
printf("Mort.\n");
xianshi(mine, ROW, COL);
printf("Fin du jeu\n");
break;
}
else
{
int m = zhouweilei(mine, x, y);
show[x][y] = m + '0';
xianshi(show, ROW, COL);
}
}
else
{
printf("Veuillez saisir à nouveau\n");
continue;
}
win++;
}
if (win == row * col - shuliang)
{
printf("J'ai gagné.\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("Veuillez entrer:");
scanf("%d", &xuanze);
switch (xuanze)
{
case 1:
printf("Commencez le jeu\n");
game();
break;
case 0:
printf("Quitter le jeu\n");
break;
default:
printf("Erreur d'entrée\n");
break;
}
} while (xuanze);
}
int main()
{
saolei();
return 0;
}边栏推荐
- Information theory of popular science Shannon
- Data backup and recovery of PgSQL
- Uninstall tool v3.5.10.5670 single file portable official version
- 大一女生废话编程爆火!懂不懂编程的看完都拴Q了
- Cooking business experience of young people: bloggers are busy selling classes and bringing goods, and the organization earns millions a month
- [cloud resident co creation] ModelBox draws your own painting across the air
- Openstack actual installation and deployment tutorial, openstack installation tutorial
- 建立自己的网站(14)
- Comparative analysis of arrayblockingqueue and linkedblockingqueue
- 情绪识别AI竟「心怀鬼胎」,微软决定封杀它!
猜你喜欢

Two fellow countrymen from Hunan have jointly launched a 10 billion yuan IPO
The name of the button in the Siyuan notes toolbar has changed to undefined. Has anyone ever encountered it?

Material management system based on SSM (source code + document + database)

Cooking business experience of young people: bloggers are busy selling classes and bringing goods, and the organization earns millions a month

图像PANR

Saltstack state state file configuration instance

Stackoverflow 年度报告 2022:开发者最喜爱的数据库是什么?

Redis installation of CentOS system under Linux, adding, querying, deleting, and querying all keys

苹果、微软、谷歌不再掐架,今年要合力干一件大事

The agile way? Is agile development really out of date?
随机推荐
托管服务与SASE,纵享网络与安全融合 | 一期一会回顾
It is said that Tencent officially announced the establishment of "XR" department to bet on yuanuniverse; Former CEO of Google: the United States is about to lose the chip competition. We should let T
【云驻共创】ModelBox隔空作画 绘制你的专属画作
Otaku can't save yuan universe
Error in Android connection database query statement
得物多活架构设计之路由服务设计
Where are Xiaomi mobile phone's favorite SMS and how to delete them
两位湖南老乡,联手干出一个百亿IPO
The Network Security Review Office launched a network security review on HowNet, saying that it "has a large amount of important data and sensitive information"
What is CNN (convolutional neural network)
[cloud resident co creation] ModelBox draws your own painting across the air
2022年最新四川建筑八大员(电气施工员)模拟题库及答案
Hosting service and SASE, enjoy the integration of network and security | phase I review
[go language questions] go from 0 to entry 4: advanced usage of slice, elementary review and introduction to map
华为云ModelArts第四次蝉联中国机器学习公有云服务市场第一!
Using dynamic time warping (DTW) to solve the similarity measurement of time series and the similarity identification analysis of pollution concentration in upstream and downstream rivers
二叉树的基本性质与遍历
RF_ DC system clock setting gen1/gen2
lol手游之任务进度条精准计算
Coinbase will launch the first encryption derivative for individual investors