贪吃蛇（1.2）

已于 2023-02-16 15:31:24 修改
阅读量1k 收藏
点赞数
分类专栏： 游戏 文章标签： c++ 算法 图论
于 2020-08-18 18:27:07 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/DONGJIE_06/article/details/108065574
版权

贪吃蛇 (1.2)

感谢大家的支持哦~
——暂时没有写注释呢…(请读者见谅哈~)

  • 1.1 修复闪屏bug
  • 1.2 修复不好看的倒计时
#include <cstdio>
#include <cstring>
#include <ctime>

#include <algorithm>
#include <iostream>
#include <string>

#include <map>
#include <set>
#include <vector>

#include <bits/stdc++.h>
#include <conio.h>
#include <windows.h>
using namespace std;

const int MAP = 21;
int TOT = (MAP - 1) * (MAP - 1) - 2;
struct Snake {
	int R, C;
}head, tail, node[900];
map<char, char> mp;
int cnt;
bool book;
int fraction = 1;
bool wall[MAP][MAP] =
{
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1 }, 
	{ 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1 }, 
};
bool bean[MAP][MAP] =
{
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
};
int snake[MAP][MAP] =
{
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 2, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
	{ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }, 
};
char direc[MAP][MAP] = 
{
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', 'd', 'd', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
	{ '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0', '0' }, 
};

void Put_String(char *s)
{
	while (1)
	{
		if (*s != 0) printf("%c", *s++);
		else break;
		Sleep(100);
	}
}

void Jin_Du_Tiao(int T)
{
	COORD Pos0, Pos1, Pos2;
	Pos1.X = 2, Pos1.Y = 1;
	Pos2.X = 50, Pos2.Y = 1;
	system("cls");
	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos0);
	cout << "╔══════════════════════════════════════════╗" << endl;
	cout << "║ ║"<<endl;
	cout << "╚══════════════════════════════════════════╝" << endl;
	for (int i = 1; i <= 20; i++)
	{
		Sleep(T);
		SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos1);
		cout << "█";
		Pos1.X += 2;
		SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos2);
		printf("%d%%\n\n", i * 5);
	}
	system("cls");
	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos0);
	cout << "■■■■■■■■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "■■■■■■■■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "■■■■■■■■" << endl;
	Sleep(1000);
	system("cls");
	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos0);
	cout << "■■■■■■■■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "■■■■■■■■" << endl;
	cout << "■              " << endl;
	cout << "■              " << endl;
	cout << "■              " << endl;
	cout << "■■■■■■■■" << endl;
	Sleep(1000);
	system("cls");
	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos0);
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	cout << "              ■" << endl;
	Sleep(1000);
	system("cls");
}

void Rand_Bean()
{
	int num = rand() % cnt + 1;
	bean[node[num].R][node[num].C] = 1;
	book = 1;
}

void Print_Map()
{
	COORD Pos;
	Pos.X = 0, Pos.Y = 0;
	SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos);
	cnt = 0;
	for (int r = 1; r <= MAP - 1; r++)
	{
		for (int c = 1; c <= MAP - 1; c++)
		{
			if (wall[r][c]) printf("■");
			else if (snake[r][c] == 1) printf("●");
			else if (snake[r][c] == 2) printf("★");
			else if (bean[r][c] == 1) printf("◇");
			else printf("  "), ++cnt, node[cnt].R = r, node[cnt].C = c;
		}
		printf("\n");
	}
	printf("尾巴长度:%d\n", fraction);
}

void over()
{
	system("cls");
	Put_String("游戏结束...\n");
	exit(0);
}

bool Check()
{
	int sr = head.R, sc = head.C;
	return bean[sr][sc];
}

void Move()
{
	if (kbhit())
	{
		int sr = head.R, sc = head.C;
		int tr = tail.R, tc = tail.C;
		char C = getch();
		if (C != direc[sr][sc] && C != mp[direc[sr][sc]])
		{
			if (C == 'w')
			{
				if (snake[sr - 1][sc] == 2 || wall[sr - 1][sc]) over();
				else
				{
					direc[sr - 1][sc] = 'w', direc[sr][sc] = 'w';
					snake[sr - 1][sc] = 1, snake[sr][sc] = 2;
					--head.R;
					char dir = direc[tr][tc];
					if (!Check())
					{
						if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					}
					else bean[sr - 1][sc] = 0, book = 0, fraction += 1;
				}
			}
			if (C == 's')
			{
				if (snake[sr + 1][sc] == 2 || wall[sr + 1][sc]) over();
				else
				{
					direc[sr + 1][sc] = 's', direc[sr][sc] = 's';
					snake[sr + 1][sc] = 1, snake[sr][sc] = 2;
					++head.R;
					char dir = direc[tr][tc];
					if (!Check())
					{
						if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					}
					else bean[sr + 1][sc] = 0, book = 0, fraction += 1;
				}
			}
			if (C == 'a')
			{
				if (snake[sr][sc - 1] == 2 || wall[sr][sc - 1]) over();
				else
				{
					direc[sr][sc - 1] = 'a', direc[sr][sc] = 'a';
					snake[sr][sc - 1] = 1, snake[sr][sc] = 2;
					--head.C;
					char dir = direc[tr][tc];
					if (!Check())
					{
						if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					}
					else bean[sr][sc - 1] = 0, book = 0, fraction += 1;
				}
			}
			if (C == 'd')
			{
				if (snake[sr][sc + 1] == 2 || wall[sr][sc + 1]) over();
				else
				{
					direc[sr][sc + 1] = 'd', direc[sr][sc] = 'd';
					snake[sr][sc + 1] = 1, snake[sr][sc] = 2;
					++head.C;
					char dir = direc[tr][tc];
					if (!Check())
					{
						if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
						if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					}
					else bean[sr][sc + 1] = 0, book = 0, fraction += 1;
				}
			}
		}
	}
	else
	{
		int sr = head.R, sc = head.C;
		int tr = tail.R, tc = tail.C;
		char C = direc[sr][sc];
		if (C == 'w')
		{
			if (snake[sr - 1][sc] == 2 || wall[sr - 1][sc]) over();
			else
			{
				direc[sr - 1][sc] = 'w', direc[sr][sc] = 'w';
				snake[sr - 1][sc] = 1, snake[sr][sc] = 2;
				--head.R;
				char dir = direc[tr][tc];
				if (!Check())
				{
					if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
				}
				else bean[sr - 1][sc] = 0, book = 0, fraction += 1;
			}
		}
		if (C == 's')
		{
			if (snake[sr + 1][sc] == 2 || wall[sr + 1][sc]) over();
			else
			{
				direc[sr + 1][sc] = 's', direc[sr][sc] = 's';
				snake[sr + 1][sc] = 1, snake[sr][sc] = 2;
				++head.R;
				char dir = direc[tr][tc];
				if (!Check())
				{
					if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
				}
				else bean[sr + 1][sc] = 0, book = 0, fraction += 1;
			}
		}
		if (C == 'a')
		{
			if (snake[sr][sc - 1] == 2 || wall[sr][sc - 1]) over();
			else
			{
				direc[sr][sc - 1] = 'a', direc[sr][sc] = 'a';
				snake[sr][sc - 1] = 1, snake[sr][sc] = 2;
				--head.C;
				char dir = direc[tr][tc];
				if (!Check())
				{
					if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
				}
				else bean[sr][sc - 1] = 0, book = 0, fraction += 1;
			}
		}
		if (C == 'd')
		{
			if (snake[sr][sc + 1] == 2 || wall[sr][sc + 1]) over();
			else
			{
				direc[sr][sc + 1] = 'd', direc[sr][sc] = 'd';
				snake[sr][sc + 1] = 1, snake[sr][sc] = 2;
				++head.C;
				char dir = direc[tr][tc];
				if (!Check())
				{
					if (dir == 'w') --tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 's') ++tail.R, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'a') --tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
					if (dir == 'd') ++tail.C, direc[tr][tc] = '0', snake[tr][tc] = 0;
				}
				else bean[sr][sc + 1] = 0, book = 0, fraction += 1;
			}
		}
	}
	Check();
}

void init()
{
	head.R = 2, head.C = 3;
	tail.R = 2, tail.C = 2;
	mp['w'] = 's', mp['s'] = 'w';
	mp['a'] = 'd', mp['d'] = 'a';
	cnt = 0;
	for (int r = 1; r <= MAP - 1; r++)
	{
		for (int c = 1; c <= MAP - 1; c++)
		{
			++cnt;
			node[cnt].R = r;
			node[cnt].C = c;
		}
	}
}

int main()
{
	Jin_Du_Tiao(100);
	init();
	while (1)
	{
		Print_Map();
		if (book == 0) Rand_Bean();
		Move();
		Sleep(50);
		Check();
	}
	return 0;
}
DONGJIE_06
关注
专栏目录
汇编32做的贪吃蛇游戏
12-28
【描述】提到的"MASMPlus1.2"是Microsoft Macro Assembler的一个增强版本，是用于编写x86汇编程序的工具。"od"则通常指的是"Object Dump"，它是Windows系统下的一个调试工具，用于查看二进制文件的内容，如内存、...
android 贪吃蛇
06-08
1.2 Android游戏开发基础 在Android上开发游戏，通常会用到SurfaceView或GLSurfaceView来创建高性能的游戏画布。贪吃蛇游戏需要一个持续运行的游戏循环，这可以通过Handler和Runnable来实现，同时利用定时器控制游戏...
初级贪吃蛇-霍氏贪吃蛇1.2版
冈崎渚的博客
08-23 364
#include &lt;iostream&gt;#include &lt;string&gt;#include &lt;Windows.h&gt;#include &lt;conio.h&gt;#include &lt;time.h&gt;#include &lt;stdio.h&gt;#include &lt;iomanip&gt;#include &lt;cstdlib&gt
简易贪吃蛇V1.2
学无涯
04-08 882
其实老早就写好了,就是忘了
C语言之贪吃蛇！
wuwuku123的博客
12-25 1961
用C语言写贪吃蛇小游戏，操作方式：w a s d分别控制蛇的上、左、下、右运动！ 蛇头撞到墙或自身程序结束，每吃掉一个食物，蛇身长增加一个，蛇的运动会变快！ 源代码如下： //有问题，请联系 WeChat:God_Father_LZ #include <stdio.h> #include <stdlib.h> #include <time.h> #in...
MFC贪吃蛇
Have a nice day.
08-16 3388
1多人贪吃蛇项目描述 1.1功能描述 实现多人对战贪吃蛇，具体实现功能：A.可以选择游戏人数，最多设置4人同时游戏；B.显示玩家得到的分数；C.可以设置游戏的速度；D.能实现最高分的记录 1.2所需技术 1.在对话框中创建窗口；2.双缓冲绘图；3.蛇身移动处理；4.碰撞检测；5.Ini文件操作 2多人贪吃蛇运行流程 3多人贪吃蛇详细设计 3.1贪吃蛇个体类设计
javaScript贪吃蛇
平安喜乐
11-16 4183
javaScript写的贪吃蛇，有注解和图片。
贪吃蛇html对战,贪吃蛇.html
weixin_29150151的博客
06-14 129
//1.定义地图类function Map(){//1.1定义地图的属性this.width = 800;this.height = 400;this.color = "gray";this.position = "absolute";//1.2定义show方法，用于显示地图this.show = function(){//生成div元素，用于放置地图var div = document.crea...
项目小游戏-贪吃蛇
2301_81577798的博客
04-21 2942
项目小游戏贪吃蛇游戏的实现,项目实现中会涉及C语言语法，WIn32 API ,链表，本地化设置等等，下面就跟着我一起来实现吧！
html实现贪吃蛇游戏(源码)
接受定制，友情互惠，致力于前端的全类型模板，打造通用模板源码，进阶于前后端联合模板，适用于全类型。
11-01 4654
html实现贪吃蛇源码，酷炫的界面效果，点击开始游戏后，通过键盘的上下左右按键，操作移动方向，代码备注详细，一看就明白。
制作贪吃蛇步骤
weixin_68174842的博客
03-20 5098
1.构造小蛇 #include<stdio.h> #include<stdlib.h> #include<conio.h> #include<windows.h> #define High 20 //游戏画面尺寸 #define Width 30 int canvas[High][Width]={0}; //二维数组存储游戏画布中对应的元素 //0为空格，-1为边框#，1为蛇头@，大于1的正数为蛇身* void goto
c语言课程设计贪吃蛇.doc
06-29
1.2 课程设计的实验环境 课程设计的实验环境主要包括计算机、C语言编译器、编辑器等。学生需要在这类环境中进行实践，掌握C语言编程的基础知识，较熟练地编写C语言应用程序，了解C语言的常用标准函数、编程技巧、...
arm.rar_ADS1.2_ADS1.2 ucos_ARM s3c44b0_arm ads_s3c44b0 ads1.2
09-14
4. "游戏贪吃蛇 基于UCOSII多任务 液晶zlggui"表明这里有使用UCOSII（UCOS的第二个主要版本）进行多任务编程，实现经典游戏贪吃蛇，并且使用了ZLGGUI（可能是指Zhongke Lingguang GUI，一种嵌入式图形用户界面库）的...
C++——用选择法对10个数值进行排序。
2303_80770781的博客
09-20 991
cout<<"数组a从小到大的排序结果为："<<endl;cout<<"请输入数组a的十个值："<<endl;
C语言：链表
2302_80978287的博客
09-15 1033
");return 0;p=head;//p先指向头结点=NULL) //若p所指不是链尾p=p->next;//p后移一个结点//链尾的next存储新结点指针//使新结点成为链尾return 1;
用最新的C++技术，如何实现一个序列化工具库？
最新发布
hebhljdx的博客
09-24 522
随着C++标准的不断进化，实现简洁又实用的序列化工具变得越来越简单。目前我们还无法完全实现对结构体无侵入地实现反射，但是未来即将可以轻松实现。
配置VS Code以进行C/C++编程：深入探讨与实操指南
GZM888888的博客
09-19 764
打开VS Code，点击左侧边栏中的Extensions图标（或按下快捷键），搜索“C/C++”，找到由Microsoft提供的官方扩展，点击Install按钮进行安装。在这个示例中，我们定义了一个名为“（gdb） Launch”的配置，它将使用GDB调试器来调试当前打开的文件。为了让VS Code知道如何构建你的项目，你需要创建一个名为的文件。在这个示例中，我们定义了一个名为“build”的任务，它将使用命令来编译当前打开的文件。如果你计划调试你的C/C++程序，你还需要创建一个名为的文件。
Java技术实现的贪吃蛇游戏设计
1.2 主要设计内容 游戏由两个主要模块构成：游戏主界面模块和游戏控制模块。这两个模块涵盖了游戏的基本操作，如开始、暂停和退出功能。 1.3 设计目标 设计目标主要包括： - 游戏主界面模块：提供吸引人的游戏入口...
评论 2
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值