转载请保留此行,来自Vic___
这是DLNU大一的题目,估计我发上来后,这个课题的难度大大降低。
可以随意增加地图
根据20*20的画就行
0:可移动 1:墙 2:目的地 3:箱子 5:玩家
记得也要增加“存在关数”

//-----------------------------------
//
// version 1.0
// From Vic___
//
//-----------------------------------
#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <fstream.h>
void DisplayMap();
const int completelevel=5;//存在关数
int dataMap[30][20][20]=
{
{
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,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,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,1,2,1,0,0,0,0,0,0,0,0,0, //0:可移动 1:墙 2:目的地 3:箱子 5:玩家
0,0,0,0,0,0,0,1,1,3,1,1,1,0,0,0,0,0,0,0,
0,0,0,0,0,1,1,2,3,5,3,2,1,0,0,0,0,0,0,0,
0,0,0,0,0,1,2,3,0,0,1,1,1,0,0,0,0,0,0,0,
0,0,0,0,0,1,1,1,0,0,1,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,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,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
},
{
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
0,0,0,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,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,2,2,2,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,1,3,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,1,5,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,0,3,3,0,1,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,0,0,0,1,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1,0,0,1,0,0,0,0,0,0,0,0,0,
0,0,0,0,0,0,0,1

这是一款使用C语言编写的推箱子小游戏,具备可重玩性和选择关卡功能,并能保存游戏记录。适合DLNU大一学生练习,游戏地图可自定义,支持20*20格子布局,用不同数字标记不同的游戏元素,如0表示可移动区域,1表示墙壁,2表示目的地,3表示箱子,5表示玩家。
最低0.47元/天 解锁文章
926

被折叠的 条评论
为什么被折叠?



