《颜色消除》游戏

已于 2022-11-29 21:03:13 修改
阅读量686 收藏 2
点赞数 1
分类专栏： 游戏 文章标签： 游戏 c++
于 2022-11-29 21:03:05 首次发布
版权声明：本文为博主原创文章，遵循 CC 4.0 BY-SA 版权协议，转载请附上原文出处链接和本声明。
本文链接：https://blog.csdn.net/liuyuxuan_0315/article/details/128105258
版权

分享一个有趣的自创C++小游戏

别忘了一连三键哦

#include <bits/stdc++.h>
#include <windows.h>
#include <time.h>
#include <conio.h>
using namespace std;
int jiu1[11], jiu2[11], jiu3[11];
int yi,er,sa;
int die;
//上：1 下：2 左：4 右：6
int a[1111][30][30] = {
	{
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,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,2,2,2,2,2,0,0,0,0,0},
		{0,0,0,0,0,0,1,0,0,0,0,0,0,0,6,0,0,0,0,0},
		{0,0,0,0,0,0,4,4,4,4,4,6,6,6,6,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,1,1,1,1,1,1,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,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,4,4,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,4,4,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,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,0,0,0,0,0},
		{0,0,0,0,0,0,0,1,1,2,0,1,0,2,1,1,0,0,0,0},
		{0,0,0,0,0,0,1,1,1,2,0,1,0,2,1,1,1,0,0,0},
		{0,0,0,0,0,0,0,1,1,2,0,6,0,2,1,1,0,0,0,0},
		{0,0,0,0,0,0,0,0,1,2,0,6,0,2,1,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,0,2,0,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,2,2,4,1,6,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,1,1,1,1,1,1,1,1,4,1,4,6,0,0,0,0},
		{0,0,0,0,2,2,2,2,2,2,2,2,2,2,4,6,0,0,0,0},
		{0,0,0,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,2,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,2,2,2,2,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,2,0,0,0,0,0,0,0,6,2,2,2,2,2,2,2},
		{0,0,0,0,2,2,2,2,0,0,0,0,2,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,2,2,2,2,2,2,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
	},
	{
		{1,0,0,0,0,6,6,6,2,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,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,4,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,4,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,1,0,0,0,0,0,0},
		{0,0,1,0,0,0,0,0,0,2,0,0,0,0,0,4,0,0,0,0},
		{0,0,0,1,0,0,0,0,0,0,2,0,0,0,0,4,0,0,0,0},
		{0,0,0,0,1,0,0,0,0,0,0,2,0,0,1,4,0,0,0,0},
		{0,0,0,0,0,1,0,0,0,0,0,0,2,1,0,4,0,0,0,0},
		{0,0,0,0,0,0,1,0,0,0,0,1,1,4,0,4,0,0,0,0},
		{0,0,0,0,0,0,0,6,0,0,0,6,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,1,0,1,0,0,6,0,4,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,1,0,0,0,6,0,4,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,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 xcc[1111][30][30] = {
	{
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,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,2,2,2,2,2,0,0,0,0,0},
		{0,0,0,0,0,0,1,0,0,0,0,0,0,0,6,0,0,0,0,0},
		{0,0,0,0,0,0,4,4,4,4,4,6,6,6,6,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,1,0,0,1,0,0,1,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,1,1,1,1,1,1,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,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,4,4,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,4,4,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
	},{
		{0,0,0,0,0,0,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,0,0,0,0,0},
		{0,0,0,0,0,0,0,1,1,2,0,1,0,2,1,1,0,0,0,0},
		{0,0,0,0,0,0,1,1,1,2,0,1,0,2,1,1,1,0,0,0},
		{0,0,0,0,0,0,0,1,1,2,0,6,0,2,1,1,0,0,0,0},
		{0,0,0,0,0,0,0,0,1,2,0,6,0,2,1,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,0,2,0,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,4,1,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,2,2,4,1,6,0,0,0,0,0,0,0,0},
	},
	{
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0,0,0},
		{0,0,0,0,1,1,1,1,1,1,1,1,4,1,4,6,0,0,0,0},
		{0,0,0,0,2,2,2,2,2,2,2,2,2,2,4,6,0,0,0,0},
		{0,0,0,2,2,2,2,2,2,2,2,2,2,2,2,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,2,2,2,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,2,2,2,2,2,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,2,0,0,0,0,0,0,0,6,2,2,2,2,2,2,2},
		{0,0,0,0,2,2,2,2,0,0,0,0,2,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,2,2,2,2,2,2,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
	},
	{
		{1,0,0,0,0,6,6,6,2,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,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,1,1,1,1,1,1,0,0,1,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,4,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,4,0,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,2,0,0,0,1,0,0,0,0,0,0},
		{0,0,1,0,0,0,0,0,0,2,0,0,0,0,0,4,0,0,0,0},
		{0,0,0,1,0,0,0,0,0,0,2,0,0,0,0,4,0,0,0,0},
		{0,0,0,0,1,0,0,0,0,0,0,2,0,0,1,4,0,0,0,0},
		{0,0,0,0,0,1,0,0,0,0,0,0,2,1,0,4,0,0,0,0},
		{0,0,0,0,0,0,1,0,0,0,0,1,1,4,0,4,0,0,0,0},
		{0,0,0,0,0,0,0,6,0,0,0,6,0,6,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,1,0,1,0,0,6,0,4,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,1,0,0,0,6,0,4,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
		{0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0},
	},
};
#define KEY_DOWN(VK_NONAME) ((GetAsyncKeyState(VK_NONAME) & 0x8000) ? 1:0)
VOID SetPosC(COORD a) { // set cursor
	HANDLE out=GetStdHandle(STD_OUTPUT_HANDLE);
	SetConsoleCursorPosition(out, a);
}
VOID SetPos(int x, int y) { // set cursor2
	COORD pos= {x, y};
	SetPosC(pos);
}
//1蓝 2绿 3淡蓝 4红 5粉 6土黄 7白 8灰 color(前景,背景)
void color(int ForgC, int BackC) {
	WORD wColor = ((BackC & 0x0F) << 4) + (ForgC & 0x0F);
	SetConsoleTextAttribute(GetStdHandle(STD_OUTPUT_HANDLE), wColor);
}
void HideCursor(bool Visible) {
	CONSOLE_CURSOR_INFO Cursor;
	Cursor.bVisible = !Visible;
	Cursor.dwSize = sizeof(Cursor);
	HANDLE Hand = GetStdHandle(STD_OUTPUT_HANDLE);
	SetConsoleCursorInfo(Hand, &Cursor);
}
void slowsay(string s) {
	for (int i = 0; i < s.size(); i++) {
		cout << s[i];
		Sleep(30);
	}
}
int read() {
	char ch=_getch();
	while(ch>'9'||ch<'0') ch=_getch();
	return ch-48;
}
bool ok(int guan) {
	for (int i = 0; i < 20; i++) {
		for (int j = 0; j < 20; j++) {
			if (a[guan][i][j]) return false;
		}
	}
	return true;
}
void go(int guan) {
	SetPos(0, 0);
	printf("第%d关\n\n", guan + 1);
	for (int i = 0; i < 20; i++) {
		if (i == 0) {
			color(1, 0);
			for (int j = 0; j < 40; j++) {
				printf("-");
			}
			printf("\n");
		}
		for (int j = 0; j < 20; j++) {
			if (j == 0) {
				color(4, 0);
				printf("|");
			}
			color(a[guan][i][j], 0);
			printf("■");
			if (j == 19) {
				color(6, 0);
				printf("|");
			}
		}
		printf("\n");
		if (i == 19) {
			color(2, 0);
			for (int j = 0; j < 40; j++) {
				printf("-");
			}
			printf("\n");
		}
	}
}
void start(int guan) {
abc:
	SetPos(0, 0);
	printf("第%d关\n\n", guan + 1);
	for (int i = 0; i < 20; i++) {
		if (i == 0) {
			color(1, 0);
			for (int j = 0; j < 40; j++) {
				printf("-");
			}
			printf("\n");
		}
		for (int j = 0; j < 20; j++) {
			if (j == 0) {
				color(4, 0);
				printf("|");
			}
			color(a[guan][i][j], 0);
			printf("■");
			if (j == 19) {
				color(6, 0);
				printf("|");
			}
		}
		printf("\n");
		if (i == 19) {
			color(2, 0);
			for (int j = 0; j < 40; j++) {
				printf("-");
			}
			printf("\n");
		}
	}
	if (ok(guan)) {
		MessageBox(NULL, "做答成功！", "作答成功", MB_OK);
		SetPos(0, 0);
		return;
	}
	int x = _getch();
	int op = -1;
	if (KEY_DOWN(VK_UP)) op = 1;
	if (KEY_DOWN(VK_DOWN)) op = 2;
	if (KEY_DOWN(VK_LEFT)) op = 3;
	if (KEY_DOWN(VK_RIGHT)) op = 4;
	if (x == 27) {
		MessageBox(NULL, "失败乃成功之母", "作答“成功”", MB_OK);
		exit(0);
	} else if (x == 13) {
		MessageBox(NULL, "再来一遍！", "AGAIN！", MB_OK);
		for (int i = 0; i < 20; i++) {
			for (int j = 0; j < 20; j++) {
				a[guan][i][j] = xcc[guan][i][j];
			}
		}
		goto abc;
	}
	if (op == 1) {
		for (int i = 0; i < 20; i++) {
			for (int j = 0; j < 20; j++) {
				if (a[guan][i][j]) {
					int k = 0;
					while (a[guan][k][j]) k++;
					if (k >= i) continue;
					a[guan][k][j] = a[guan][i][j];
					a[guan][i][j] = 0;
					if (a[guan][k][j] == 1 && k == 0) {
						a[guan][k][j] = 0;
					}
					go(guan);
				}
			}
		}
	} else if (op == 2) {
		for (int i = 19; i >= 0; i--) {
			for (int j = 19; j >= 0; j--) {
				if (a[guan][i][j]) {
					int k = 19;
					while (a[guan][k][j]) k--;
					if (k <= i) continue;
					a[guan][k][j] = a[guan][i][j];
					a[guan][i][j] = 0;
					if (a[guan][k][j] == 2 && k == 19) {
						a[guan][k][j] = 0;
					}
					go(guan);
				}
			}
		}
	} else if (op == 3) {
		for (int j = 0; j < 20; j++) {
			for (int i = 0; i < 20; i++) {
				if (a[guan][i][j]) {
					int k = 0;
					while (a[guan][i][k]) k++;
					if (k >= j) continue;
					a[guan][i][k] = a[guan][i][j];
					a[guan][i][j] = 0;
					if (a[guan][i][k] == 4 && k == 0) {
						a[guan][i][k] = 0;
					}
					go(guan);
				}
			}
		}
	} else if (op == 4) {
		for (int j = 19; j >= 0; j--) {
			for (int i = 0; i < 20; i++) {
				if (a[guan][i][j]) {
					int k = 19;
					while (a[guan][i][k]) k--;
					if (k <= j) continue;
					a[guan][i][k] = a[guan][i][j];
					a[guan][i][j] = 0;
					if (a[guan][i][k] == 6 && k == 19) {
						a[guan][i][k] = 0;
					}
					go(guan);
				}
			}
		}
	}
	start(guan);
}
signed main() {
	srand(time(NULL));
	HideCursor(true);
	SetPos(50, 6);
	color(2, 0);
	slowsay("【版本7.2.16】最新版本————更新中(目前共6关)");
	SetPos(50, 8);
	slowsay("作者『逍遥君』");
	SetPos(50, 10);
	slowsay("「板块消除」");
	SetPos(50, 12);
	slowsay("逍遥君办公室");
	SetPos(50, 14);
	slowsay("放弃挑战按[ESC]，重来此关按[ENTER]");
	SetPos(50, 16);
	slowsay("一直打完所有关卡才算通关");
	SetPos(0, 25);
	slowsay("玩法：按上、下、左、右键可以让所有颜色的方块向上、下、左、右移动");
	SetPos(0, 26);
	slowsay("上、下、左、右各有一栏颜色条，和它相同的颜色碰到它会消失");
	SetPos(0, 27);
	slowsay("你需要让整个盘面里面的颜色全部消失【注意：当颜色本来就在消除线旁边时，再继续移动则不会被消除】\n");
	SetPos(15, 10);
	printf("  ■■■■");
	SetPos(15, 11);
	printf(" ■      ■");
	SetPos(15, 12);
	printf("          ■");
	SetPos(15, 13);
	printf("         ■  ");
	SetPos(15, 14);
	printf("      ■■   ");
	SetPos(15, 15);
	printf("         ■ ");
	SetPos(15, 16);
	printf("          ■");
	SetPos(15, 17);
	printf(" ■      ■");
	SetPos(15, 18);
	printf("  ■■■■");
	Sleep(1000);
	SetPos(15, 10);
	cout << "           \n                              \n                              \n                              \n                              \n                              \n                              \n                              \n                              \n";
	SetPos(0, 0);
	SetPos(15, 10);
	printf("   ■■■■");
	SetPos(15, 11);
	printf(" ■       ■");
	SetPos(15, 12);
	printf("         ■");
	SetPos(15, 13);
	printf("       ■  ");
	SetPos(15, 14);
	printf("     ■   ");
	SetPos(15, 15);
	printf("   ■ ");
	SetPos(15, 16);
	printf(" ■");
	SetPos(15, 17);
	printf("■");
	SetPos(15, 18);
	printf("■■■■■");
	Sleep(1000);
	SetPos(15, 10);
	cout << "             \n                              \n                              \n                              \n                              \n                              \n                              \n                              \n                              \n";
	SetPos(15, 10);
	printf("      ■");
	SetPos(15, 11);
	printf("   ■ ■");
	SetPos(15, 12);
	printf("      ■");
	SetPos(15, 13);
	printf("      ■  ");
	SetPos(15, 14);
	printf("      ■   ");
	SetPos(15, 15);
	printf("      ■ ");
	SetPos(15, 16);
	printf("      ■");
	SetPos(15, 17);
	printf("      ■");
	SetPos(15, 18);
	printf("■■■■■■■");
	Sleep(1000);
	SetPos(15, 10);
	cout << "             \n                              \n                              \n                              \n                              \n                              \n                              \n                              \n                              \n";
	SetPos(0, 0);
	int end = 6;
	for (int i = 0; i < end; i++) {
		MessageBox(NULL, "开始游戏", "下一关", MB_OK);
		start(i);
	}
	system("cls");
	slowsay("Thanks for playing...\n");
	slowsay("您已通关，亲爱的大脑玩家，您还没玩够吗？");
	return 0;
}

逍遥君子乐『逍遥君』
关注
  • 1
    点赞
  • 踩
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
专栏目录
消除类游戏解题思路（ccf 201512-2）
douyh的专栏
03-06 786
问题描述消除类游戏是深受大众欢迎的一种游戏，游戏在一个包含有n行m列的游戏棋盘上进行，棋盘的每一行每一列的方格上放着一个有颜色的棋子，当一行或一列上有连续三个或更多的相同颜色的棋子时，这些棋子都被消除。当有多处可以被消除时，这些地方的棋子将同时被消除。现在给你一个n行m列的棋盘，棋盘中的每一个方格上有一个棋子，请给出经过一次消除后的棋盘。请注意：一个棋子可能在某一行和某一列同时被消除。输入格式输入的第一行包含两个整数n, m，用空格分隔，分别表示棋盘的行数和列数。
怎么制作一个消除游戏
weixin_42577735的博客
12-30 297
要制作一个消除游戏，首先需要考虑游戏的基本构造和规则。消除游戏通常包括一个由多种不同颜色的小方块组成的游戏板，玩家需要消除与周围方块颜色相同的方块，使得至少三个相同颜色的方块排成一条线(横、竖或斜线)即可消除。 接下来，需要考虑如何实现这个游戏。常见的做法是使用一种编程语言(例如 C++、Java 或 Python)编写游戏的代码，并使用游戏引擎或图形库(例如 Unity 或 Pygame)来帮助...
消除类游戏
L_WH_的博客
12-27 402
【问题描述】消除类游戏是深受大众欢迎的一种游戏，游戏在一个包含有n行m列的游戏棋盘上进行，棋盘的每一行每一列的方格上放着一个有颜色的棋子，当一行或一列上有连续三个或更多的相同颜色的棋子时，这些棋子都被消除。当有多处可以被消除时，这些地方的棋子将同时被消除。 现在给你一个n行m列的棋盘，棋盘中的每一个方格上有一个棋子，请给出经过一次消除后的棋盘。 请注意：一个棋子可能在某一行和某一列同时被消除。 【...
C++消除游戏
qjsssss的博客
12-03 923
消除游戏 【问题描述】 消除类游戏是深受大众欢迎的一种游戏，游戏在一个包含有n行m列的游戏棋盘上进行，棋盘的每一行每一列的方格上放着一个有颜色的棋子，当一行或一列上有连续三个或更多的相同颜色的棋子时，这些棋子都被消除。当有多处可以被消除时，这些地方的棋子将同时被消除。 现在给定一个n行m列的棋盘，棋盘中的每一个方格上有一个棋子（用数字1-9表示各种颜色的棋子），请给出经过消除后的棋盘。 请注意：一个棋子可能在某一行和某一列同时被消除。 【输入形式】 从标准输入读取数据，第一行包含两个整数n和m，分别表示.
XDOJ消除类游戏
kkzzjx
12-13 3364
题目5：消除类游戏 问题描述 　　消除类游戏是深受大众欢迎的一种游戏，游戏在一个包含有n行m列的游戏棋盘上进行，棋盘的每一行每一列的方格上放着一个有颜色的棋子，当一行或一列上有连续三个或更多的相同颜色的棋子时，这些棋子都被消除。当有多处可以被消除时，这些地方的棋子将同时被消除。 　　现在给你一个n行m列的棋盘，棋盘中的每一个方格上有一个棋子，请给出经过一次消除后的棋盘。 　　请注意：一个棋子可能在...
VBA颜色消除游戏代码
11-22
使用VBA在Execel中实现类似Pop Star的同色消除游戏，个人练习作品
消除类游戏candy
04-01
总的来说，开发一款Candy风格的消除游戏，需要掌握cocos2d-js的基本语法和特性，理解消除游戏的规则和设计思路，结合JavaScript编程技巧和游戏设计原理，才能制作出一款既美观又有趣的消除游戏。通过这样的实践，...
基于QT的方块消除游戏
04-02
【基于QT的方块消除游戏】是一款利用C++编程语言和QT框架开发的简单休闲游戏。QT是一个跨平台的应用程序开发框架，它提供了一系列丰富的库和工具，使得开发者能够便捷地创建用户界面和应用程序，支持Windows、Linux...
JAVA编写的消除游戏
03-14
大二时编写的一个消除游戏，Java选修课，只能实现单色双消除（仅对一个颜色进行判断，相同颜色图形个数>=2时消除并掉落上方图形）
unity2D游戏开发16弹弓动画
最新发布
m0_58498702的博客
07-30 172
设置属性为2D Simple Directional，再点击加号选择Add Motion Field。创建这三个参数isWalking:Bool ,xDir:Float，yDir:Float。选择player-idle，右键MakeTransition,链接到Walk Tree。选中PlayerObject，打开Animator,删除原来的四个状态。双击Walk Tree查看Blend Tree Graph。将Any State到idle之间的转换，设置false。点击四个节点，勾选Loop Time。
unity2D游戏开发12单例
m0_58498702的博客
07-29 31
当一个类提供了游戏中其他几个类使用的功能时，单例会很有用，例如，在Game Manager 类中协调游戏逻辑，单例可以提供对该类及其功能的公共统一访问入口。因为现在是动态生成玩家，所以，Virtual Camera的follow属性没有实例，为了让摄像机跟随玩家走动，我们将创建一个类来设置Virtual Camera。给SpawnPoint添加SpawnPoint脚本，再将SpawnPoint拖到Prefabs文件夹生成预购件，再删除Hierarhy面板的SpawnPoint。
「Unity3D」场景中的距离单位Unit与相关设置PixelsToUnits、PixelsPerUnit
scott.cgi
07-25 435
这就涉及到一个问题，即如何按照比例显示像素？或说如何显示2D图片的大小？
cocos creator 3学习记录01——如何替换图片
SilenceJude的博客
07-26 330
指的是 loader.loaderRes、loader.loadResDir、loader.release等loader开头的API，并不是 resources.load，因此无需担心。3、对于图片类型，直接访问路径所对应的图片地址，得到的图片类型会是ImageAsset，此时必须指定具体的子资源。2、调用resources.load API，路径是默认在resources文件夹下，所以直接写后面的路径即可。不过吧，这种方法我并不推荐，因为需要提前声明好属性，甚至需要提前关联好。
Unity Yaml
记录
07-29 158
选择用于存储序列化资产的格式。
ScriptableObject使用
记录
07-26 613
结合两者特点，可将SO数据存储在JSON中，修改时，直接修改JSON文件;JSON和XML等文件格式可能很难在编辑器中修改，在Unity外，使用文本编辑都可轻松修改。多个对象共享一份So实例，多个对象共享的数据可提取出来作为so实例，减少重复，节约内存。So脚本可正常使用，但显示不正确，集合元素显示为“Type mismatch”。需要监听或触发该委托的对象可获取该So实例，监听者注册方法，广播者触发方法。，有点类似静态数据，同一个实例文件可被多个对象引用；此外可拓展So脚本，直接触发方法，方便测试。
Unity GameObject学习笔记
2402_83809362的博客
07-29 228
GameObject成员变量。GameObject成员变量。GameObject静态方法。
Unity--UI事件触发器--EventTrigger
qq_40669895的博客
07-29 597
Unity--UI事件触发器--EventTrigger
右手系转Unity左手系坐标系
薛文旺
07-26 374
【代码】右手系转Unity左手系坐标系。
消除游戏javascript技术
09-01
消除游戏是一种在网页上开发和实现的游戏，利用 JavaScript 技术可以轻松实现。消除游戏的规则通常是根据一定的标准，通过点击或拖动相同颜色或形状的方块、宝石或其他图形，来消除它们从而得分。下面将详细介绍如何用 JavaScript 技术来实现消除游戏。 首先，我们需要创建一个 HTML 文件作为游戏界面的基础。在该文件中，需要包含游戏的画布，用于显示游戏界面和交互元素。 接下来，使用 JavaScript 来实现游戏的逻辑。首先，我们需要定义方块或其他图形的类，包括位置、颜色和形状等属性。然后，我们可以创建一个游戏板块的二维数组，用于存储和管理方块的位置和状态。 在游戏过程中，玩家需要通过点击或拖动方块来进行消除。通过监听鼠标或触摸事件，可以实现玩家的交互行为。当玩家选择方块时，我们需要判断其相邻的方块是否与之相同，并将它们标记为待消除状态。待消除的方块可以通过修改它们的状态或属性来实现，例如改变颜色或形状。 一旦选择了一组待消除的方块，我们需要执行消除逻辑。这包括计算得分、移除方块、更新游戏板块等操作。消除过程中，我们可以使用动画效果来增加游戏的吸引力和可玩性。 在游戏进行过程中，我们还可以添加时间限制、关卡变化、道具系统等元素来增加游戏的难度和乐趣。 最后，我们可以添加游戏的音效和背景音乐，来增强游戏的音频体验。 总结来说，消除游戏使用 JavaScript 技术可以轻松实现。通过定义方块类、管理游戏板块、处理玩家交互等步骤，可以创造出有趣又具有挑战性的消除游戏。通过不断优化和完善，可以提升游戏的可玩性和娱乐性。
评论
添加红包

请填写红包祝福语或标题

个

红包个数最小为10个

元

红包金额最低5元

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

抵扣说明：

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

余额充值