1 Star 0 Fork 0

习美红/盖世英雄

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
3.1 生命游戏4.0.cpp 1.90 KB
一键复制 编辑 原始数据 按行查看 历史
习美红 提交于 2019-05-31 10:48 +08:00 . 在原有的基础上增加了按Esc键暂停
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <windows.h>
#include <time.h>
#define High 25
#define Width 50
int cells[High][Width],z=50,flag=0;
void gotoxy(int x,int y)
{
HANDLE handle = GetStdHandle(STD_OUTPUT_HANDLE);
COORD pos;
pos.X = x;
pos.Y = y;
SetConsoleCursorPosition(handle,pos);
}
void startup()
{
int i,j;
for (i=0;i<High;i++)
for (j=0;j<Width;j++)
{
cells[i][j] = 1;
}
}
void show()
{
gotoxy(0,0);
int i,j;
for (i=1;i<=High-1;i++)
{
for (j=1;j<=Width-1;j++)
{
if (cells[i][j]==1)
printf("*");
else
printf(" ");
}
printf("\n");
}
Sleep(z);
}
void updateWithoutInput()
{
int NewCells[High][Width];
int NeibourNumber;
int i,j;
for (i=1;i<=High-1;i++)
{
for (j=1;j<=Width-1;j++)
{
NeibourNumber = cells[i-1][j-1] + cells[i-1][j] + cells[i-1][j+1]
+ cells[i][j-1] + cells[i][j+1] + cells[i+1][j-1] + cells[i+1][j] + cells[i+1][j+1];
if (NeibourNumber==3)
NewCells[i][j] = 1;
else if (NeibourNumber==2)
NewCells[i][j] = cells[i][j];
else
NewCells[i][j] = 0;
}
}
NeibourNumber = cells[i-1][j-1] + cells[i-1][j] + cells[i-1][j+1]
+ cells[i][j-1] + cells[i][j+1] + cells[i+1][j-1] + cells[i+1][j] + cells[i+1][j+1];
if(High<=5&&Width<=5)
{
if(NeibourNumber==1||NeibourNumber==2)
NewCells[i][j] = 1;
}
for (i=1;i<=High-1;i++)
for (j=1;j<=Width-1;j++)
cells[i][j] = NewCells[i][j];
}
void updateWithInput()
{
char input;
if(kbhit())
{
input = getch();
if(input == '+')
z--;
if(input == '-')
z++;
if(input == 'R')
system("pause");
if(input == 27)
flag=1;
return;
}
}
int main()
{
startup();
while (1)
{
show();
updateWithoutInput();
updateWithInput();
}
return 0;
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C
1
https://gitee.com/ximeihong/the_greatest_hero_in_the_world.git
git@gitee.com:ximeihong/the_greatest_hero_in_the_world.git
ximeihong
the_greatest_hero_in_the_world
盖世英雄
master

搜索帮助