C语言 推箱子小游戏 可重玩 可选关 保存记录

转载请保留此行，来自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,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,