1 Star 0 Fork 0

王赫辰/c语言

加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
贪吃蛇c实现 3.05 KB
一键复制 编辑 原始数据 按行查看 历史
王赫辰 提交于 2023-11-25 16:09 +08:00 . add 贪吃蛇c实现.
#include<stdio.h>
#include<time.h>
#include<stdlib.h>
int main()
{
printf("贪吃蛇游戏,显示食物。按1234分别控制蛇上下左右的移动,如果碰到食物则加分,按0初始化\n");
srand(time(NULL));
int a1 = rand() % 8 + 2;
int b1 = rand() % 16 + 2;
int a2 = rand() % 16 + 2;
int b2 = rand() % 9 + 2;
int a3 = rand() % 16 + 2;
int b3 = rand() % 17 + 2;
int a4 = rand() % 3 + 2;
int b4 = rand() % 16 + 2;
int map[20][20] = { 0 };
map[a1][b1] = 4;
map[a2][b2] = 4;
map[a3][b3] = 4;
map[a4][b4] = 4;
int count = 0;
int e = 11;
int f = 11;
int g = 12;
int h = 13;
int i = 10;
int l = 11;
int m = 11;
int z = 1;
while (z == 1)
{
int a = 0;
int b = 0;
int j;
scanf_s("%d", &j);
if (j == 0)
{
e = 11;
f = 11;
g = 12;
h = 13;
i = 10;
l = 11;
m = 11;
count = 0;
}
if (j == 1)
{
if (map[l - 1][i] == 4)
{
count++;
}
if (e != l - 1&&l!=1)
{
int n = l;
int o = i;
int p = e;
int q = f;
map[m][g] = 0;
l--;
e = n;
f = o;
m = p;
g = q;
}
if (e == l - 1||l==1)
{
printf("你输了\n");
break;
}
}
if (j == 2)
{
if (map[l + 1][i] == 4)
{
count++;
}
if (e != l + 1&&l!=18)
{
int n = l;
int o = i;
int p = e;
int q = f;
map[m][g] = 0;
l++;
e = n;
f = o;
m = p;
g = q;
}
if (e == l + 1||l==18)
{
printf("你输了\n");
break;
}
}
if (j == 3)
{
if (map[l][i-1] == 4)
{
count++;
}
if (f != i - 1&&i!=1)
{
int n = l;
int o = i;
int p = e;
int q = f;
map[m][g] = 0;
i--;
e = n;
f = o;
m = p;
g = q;
}
if (f == i - 1||i==1)
{
printf("你输了\n");
break;
}
}
if (j == 4)
{
if (map[l][i+1] == 4)
{
count++;
}
if (f != i + 1&&i!=18)
{
int n = l;
int o = i;
int p = e;
int q = f;
map[m][g] = 0;
i++;
e = n;
f = o;
m = p;
g = q;
}
if (f == i + 1||i==18)
{
printf("你输了\n");
break;
}
}
for (a = 0; a < 20; a++)
{
for (b = 0; b < 20; b++)
{
if (map[a][b] == 0)
{
if (a == 0 || b == 0 || a == 19 || b == 19)
{
map[a][b] = 1;
}
if ((a == e && b == f) || (a == m && b == g))
{
map[a][b] = 2;
}
if (a == l && b == i)
{
map[a][b] = 3;
}
}
}
}
int c = 0;
int d = 0;
for (c = 0; c < 20; c++)
{
for (d = 0; d < 20; d++)
{
if (map[c][d] == 1)
{
printf("* ");
}
if (map[c][d] == 0)
{
printf(" ");
}
if (map[c][d] == 2)
{
printf("* ");
}
if (map[c][d] == 3)
{
printf("@ ");
}
if (map[c][d] == 4)
{
printf("$ ");
}
}
printf("\n");
}
printf("得分为%d\n", count);
}
return 0;
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
C
1
https://gitee.com/hzau2303/c-language.git
git@gitee.com:hzau2303/c-language.git
hzau2303
c-language
c语言
master

搜索帮助