#include<stdio.h>
#include<stdlib.h>
#include<conio.h>
#include<stdbool.h>
#define space 0
#define wall 1
#define dest 2
#define box 3
#define yin 4
#define boxdest 5
#define yindest 6
#define row 10
#define col 10
#define ceng 3
int dangqian = 0;
void show(void);
void move(void);
int judge(void);
int map[ceng][row][col] = {
{
{0,0,0,0,0,0,0,0,0,0},
{0,0,0,1,1,1,0,0,0,0},
{0,0,0,1,2,1,0,0,0,0},
{0,0,0,1,3,1,1,1,1,0},
{0,1,1,1,0,3,0,2,1,0},
{0,1,2,3,4,0,1,1,1,0},
{0,1,1,1,1,3,1,0,0,0},
{0,0,0,0,1,2,1,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,1,1,0,0,1,1,0,0},
{0,1,0,2,1,1,2,0,1,0},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,3,4,0,3,0,0,1},
{0,1,0,0,3,3,0,0,1,0},
{0,0,1,0,0,0,0,1,0,0},
{0,0,0,1,2,2,1,0,0,0},
{0,0,0,0,1,1,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0}
},
{
{1,0,0,0,0,0,0,0,0,1},
{1,1,0,1,1,1,1,0,1,1},
{1,0,1,1,0,0,1,1,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,1,1,0,1,1,0,1},
{1,0,1,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1,1}
}
};
int map2[ceng][row][col] = {
{
{0,0,0,0,0,0,0,0,0,0},
{0,0,0,1,1,1,0,0,0,0},
{0,0,0,1,2,1,0,0,0,0},
{0,0,0,1,3,1,1,1,1,0},
{0,1,1,1,0,3,0,2,1,0},
{0,1,2,3,4,0,1,1,1,0},
{0,1,1,1,1,3,1,0,0,0},
{0,0,0,0,1,2,1,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,1,1,0,0,1,1,0,0},
{0,1,0,2,1,1,2,0,1,0},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,3,4,0,3,0,0,1},
{0,1,0,0,3,3,0,0,1,0},
{0,0,1,0,0,0,0,1,0,0},
{0,0,0,1,2,2,1,0,0,0},
{0,0,0,0,1,1,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0}
},
{
{1,0,0,0,0,0,0,0,0,1},
{1,1,0,1,1,1,1,0,1,1},
{1,0,1,1,0,0,1,1,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,1,1,0,1,1,0,1},
{1,0,1,0,0,0,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1,1}
}
};
void csh(int dangqian)
{
for (int i = dangqian; i <= dangqian; i++)
{
for (int j = 0; j < row; j++)
{
for (int k = 0; k < col; k++)
{
map[i][j][k] = map2[i][j][k];
}
}
}
}
int main(void)
{
//int i = 0;
while (true)
{
system("cls");
show();
if (judge())
{
printf("是否重置本关,是输入1\n");
int shi;
scanf("%d", &shi);
if (shi==1)
{
csh(dangqian);
//shi = 0;
}
else
{
dangqian++;
}
}
move();
}
return 0;
}
int judge(void)
{
int i, j;
for (i = 0; i < 9; i++)
{
for (j = 0; j < 10; j++)
{
if (map[dangqian][i][j] == box)
{
return 0;
}
}
}
return 1;
}
void show(void)
{
int i,j;
for (i = 0; i < row; i++)
{
for (j = 0; j < col; j++)
{
switch (map[dangqian][i][j])
{
case 0:
printf(" ");
break;
case 1:
printf("▓ ");
break;
case 2:
printf("☆");
break;
case 3:
printf("□");
break;
case 4:
printf("♀");
break;
case 5:
printf("★");
break;
case 6:
printf("♂");
break;
}
}
printf("\n");
}
}
void move(void)
{
int ren_i = 0, ren_j = 0;
int i, j;
bool find = false;
for (i = 0; i < 9; i++)
{
for (j = 0; j < 10; j++)
{
if (map[dangqian][i][j] == yin|| map[dangqian][i][j] == yindest)
{
ren_i = i;
ren_j = j;
find = true;
}
}
if (find)
{
break;
}
}
//printf("%d %d\n", map[ren_i][ren_j],key);
switch (_getch())
{
case 87://向上
case 119:
case 72:
if((map[dangqian][ren_i-1][ren_j] == space)|| (map[dangqian][ren_i - 1][ren_j] == dest))
{
map[dangqian][ren_i - 1][ren_j] += yin;
map[dangqian][ren_i][ren_j]-=yin;
}
if ((map[dangqian][ren_i - 1][ren_j] == box))
{
if ((map[dangqian][ren_i - 2][ren_j] == dest)|| (map[dangqian][ren_i - 2][ren_j] == space))
{
map[dangqian][ren_i - 2][ren_j] += box;
map[dangqian][ren_i-1][ren_j] -= box;
map[dangqian][ren_i - 1][ren_j] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
}
break;
case 83://向下
case 115:
case 80:
if ((map[dangqian][ren_i+1][ren_j] == space) || (map[dangqian][ren_i + 1][ren_j] == dest))
{
map[dangqian][ren_i + 1][ren_j] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
if ((map[dangqian][ren_i + 1][ren_j] == box))
{
if ((map[dangqian][ren_i + 2][ren_j] == dest)|| (map[dangqian][ren_i + 2][ren_j] == space))
{
map[dangqian][ren_i + 2][ren_j] += box;
map[dangqian][ren_i + 1][ren_j] -= box;
map[dangqian][ren_i + 1][ren_j] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
}
break;
case 65://向左
case 97:
case 75:
if ((map[dangqian][ren_i][ren_j-1] == space) || (map[dangqian][ren_i][ren_j-1] == dest))
{
map[dangqian][ren_i][ren_j-1] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
if ((map[dangqian][ren_i][ren_j - 1] == box))
{
if ((map[dangqian][ren_i][ren_j - 2] == dest)|| (map[dangqian][ren_i][ren_j - 2] == space))
{
map[dangqian][ren_i ][ren_j - 2] += box;
map[dangqian][ren_i ][ren_j - 1] -= box;
map[dangqian][ren_i][ren_j - 1] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
}
break;
case 68:
case 100:
case 77:
if ((map[dangqian][ren_i][ren_j + 1] == space) || (map[dangqian][ren_i][ren_j + 1] == dest))
{
map[dangqian][ren_i][ren_j + 1] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
if ((map[dangqian][ren_i][ren_j + 1] == box))
{
if ((map[dangqian][ren_i][ren_j + 2] == dest)|| (map[dangqian][ren_i][ren_j + 2] == space))
{
map[dangqian][ren_i][ren_j + 2] += box;
map[dangqian][ren_i][ren_j + 1] -= box;
map[dangqian][ren_i][ren_j + 1] += yin;
map[dangqian][ren_i][ren_j] -= yin;
}
}
break;
}
}
/*
* WALL:▓
DEST:☆
BOX:□
PLAYER:♀
BOX+DEST:★
PLAYER+DEST:♂
*/
后续还会出easyx版本的推箱子,大家敬请期待