0
已解决
上代码:(增加至758行)
#include <iostream>
#include <cstdio>
#include <conio.h>//函数_getch()所需头文件
#include <windows.h>
#include <iomanip>//输入输出流控制符setw()所在头文件,设置字段宽度为n位
using namespace std;
#define R 12
#define C 12
BOOL flag = true; /*定义布尔值的标记,方便在游戏时直接退出*/
int pass=1;//初始关卡值
char d;//选择关卡难度
int Jmap[R][C] = { 0 };
int Jmap1[R][C] = {
{ 0,0,1,1,1,0,0,0 },
{ 0,0,1,3,1,0,0,0 },
{ 0,0,1,0,1,1,1,1 },
{ 1,1,1,0,0,4,3,1 },
{ 1,3,4,4,0,1,1,1 },
{ 1,1,1,5,4,1,0,0 },
{ 0,0,0,1,3,1,0,0 },
{ 0,0,0,1,1,1,0,0 }
};
int Jmap2[R][C]={
{1,1,1,1,1,0,0,0,0,0},
{1,5,0,0,1,0,0,0,0,0},
{1,0,4,4,1,0,1,1,1,0},
{1,0,4,0,1,0,1,3,1,0},
{1,1,1,0,1,1,1,3,1,0},
{1,1,1,0,0,0,0,3,1,0},
{1,0,0,0,0,0,0,0,1,0},
{1,0,0,0,0,1,1,1,1,0},
{1,0,0,0,0,1,0,0,0,0},
{1,1,1,1,1,1,0,0,0,0}
};
int Jmap3[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,0,0,0,0,0,1,0,0,0,3,1 },
{ 1,4,0,0,0,0,1,0,0,0,0,1 },
{ 1,0,1,1,1,0,1,0,0,0,0,1 },
{ 1,0,0,5,1,0,1,0,0,0,0,1 },
{ 1,0,1,1,1,0,1,0,0,4,0,1 },
{ 1,0,0,0,0,0,1,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,4,0,0,1,0,0,0,0,1 },
{ 1,3,0,0,0,0,1,0,0,0,0,1 },
{ 1,0,0,0,0,0,1,0,0,0,3,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 }
};
/*二维数组地图
1.表示墙体
3.表示目的地
4.表示箱子
5.表示人
0.表示空地
*/
int Jmap4[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,1,0,4,0,0,0,0,0,0,3,1 },
{ 1,1,0,1,1,1,1,1,1,4,0,1 },
{ 1,1,5,0,0,0,0,0,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,0,0,0,1 },
{ 1,0,3,0,0,0,0,0,4,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,3,0,1 },
{ 1,1,0,1,0,1,0,1,0,1,0,1 },
{ 1,0,1,0,1,0,1,0,1,0,1,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 }
};
int Jmap5[R][C]={
{ 1,1,1,1,1,1,1,1,0,0 },
{ 1,1,0,0,0,0,3,1,1,1 },
{ 1,1,0,4,0,0,0,0,3,1 },
{ 1,0,0,0,5,4,0,0,0,1 },
{ 1,0,1,4,0,0,0,0,1,1 },
{ 1,0,0,0,0,0,0,0,0,1 },
{ 1,1,0,1,1,0,0,0,3,1 },
{ 1,1,0,0,0,1,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1 },
{ 1,1,1,1,1,1,1,1,1,1 }
};
int Jmap6[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1},
{ 1,0,0,0,0,3,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,1,0,0,0,1 },
{ 1,0,0,4,1,0,0,3,0,0,0,1 },
{ 1,0,0,0,0,0,1,0,1,1,1,1 },
{ 1,0,0,0,1,4,0,5,1,1,1,1 },
{ 1,0,0,0,0,0,1,0,1,1,1,1 },
{ 1,0,0,0,0,0,0,4,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,3,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
};
int Jmap7[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,0,0,3,0,0,0,0,0,0,0,1 },
{ 1,0,0,4,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,5,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
};
int Jmap8[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,3,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,1,0,4,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,1,5,1,4,0,0,0,1 },
{ 1,0,3,0,0,1,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,4,0,0,0,0,0,1,0,3,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
};
int Jmap9[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,0,1,0,1,1,1,0,0,0,0,1 },
{ 1,0,1,0,0,0,1,0,0,0,0,1 },
{ 1,0,1,0,1,1,1,1,1,1,1,1 },
{ 1,0,0,0,0,3,1,0,0,0,0,1 },
{ 1,0,1,0,1,1,1,4,0,4,0,1 },
{ 1,0,0,0,0,3,1,0,0,0,0,1 },
{ 1,0,1,0,1,1,1,0,0,0,0,1 },
{ 1,0,1,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,5,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
};
int Jmap10[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,0,0,0,1 },
};
int Pmap[R][C]={ 0 };
int Pmap1[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,3,1,1,0,0,0,0,0,0,3,1 },
{ 1,0,0,4,0,0,0,0,0,4,0,1 },
{ 1,0,0,1,1,1,0,1,1,3,1,1 },
{ 1,1,1,1,1,1,0,0,0,0,0,1 },
{ 1,3,1,5,1,0,0,1,0,0,0,1 },
{ 1,0,1,0,1,1,4,0,0,0,0,1 },
{ 1,0,1,0,1,0,0,0,0,0,0,1 },
{ 1,0,0,0,0,0,0,0,4,0,0,1 },
{ 1,0,0,4,0,0,1,1,1,1,1,1 },
{ 1,0,0,0,0,0,0,0,3,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
};
int Kmap[R][C]={ 0 };
int Kmap1[R][C]={
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
{ 1,3,0,0,0,0,0,0,0,0,0,1 },
{ 1,1,1,0,1,1,1,0,4,0,3,1 },
{ 1,0,0,0,0,4,0,0,0,1,0,1 },
{ 1,0,0,0,1,1,1,1,4,0,3,1 },
{ 1,0,0,0,0,5,0,0,0,1,0,1 },
{ 1,0,0,0,1,1,1,1,0,0,0,1 },
{ 1,0,4,0,0,4,0,0,0,0,0,1 },
{ 1,0,0,0,1,1,1,1,1,1,0,1 },
{ 1,0,0,0,0,3,0,0,0,0,0,1 },
{ 1,0,0,3,0,0,0,0,0,0,0,1 },
{ 1,1,1,1,1,1,1,1,1,1,1,1 },
};
void Game_Menu()
{
system("cls");
cout << "/************************************\\\n";
cout << "* *\n";
cout << "* 经 典 小 游 戏 *\n";
cout << "* 推 箱 子 *\n";
cout << "* 1.按 S 或 s 键 开 始(两次) *\n";
cout << "* *\n";
cout << "\\***********************************/\n";
_getch();
}
void color(int m) {
HANDLE consolehend;
consolehend = GetStdHandle(STD_OUTPUT_HANDLE);
SetConsoleTextAttribute(consolehend, m);
return ;
}
int DrawMap(){
cout<<"关卡:"<<pass<<endl;
if(d=='J')
{
for (int i = 0; i < R; i++){
for (int j = 0; j < C; j++){
switch (Jmap[i][j]){
case 0:
color(0xF);
cout << " ";
break;
case 1:
color(8);
cout << "■";
break;
case 3:
color(0xE);
cout << "☆";
break;
case 4:
color(4);
cout << "□";
break;
case 5:
color(3);
cout << "♀";
break;
case 7:
color(6);
cout << "★";
break;
case 8:
color(3);
cout << "♀";
break;
default:
break;
}
}
cout <<endl;
}
}
if(d=='P')
{
for (int i = 0; i < R; i++){
for (int j = 0; j < C; j++){
switch (Pmap[i][j]){
case 0:
color(0xF);
cout << " ";
break;
case 1:
color(8);
cout << "■";
break;
case 3:
color(0xE);
cout << "☆";
break;
case 4:
color(4);
cout << "□";
break;
case 5:
color(3);
cout << "♀";
break;
case 7:
color(6);
cout << "★";
break;
case 8:
color(3);
cout << "♀";
break;
default:
break;
}
}
cout <<endl;
}
}
if(d=='K')
{
for (int i = 0; i < R; i++){
for (int j = 0; j < C; j++){
switch (Kmap[i][j]){
case 0:
color(0xF);
cout << " ";
break;
case 1:
color(8);
cout << "■";
break;
case 3:
color(0xE);
cout << "☆";
break;
case 4:
color(4);
cout << "□";
break;
case 5:
color(3);
cout << "♀";
break;
case 7:
color(6);
cout << "★";
break;
case 8:
color(3);
cout << "♀";
break;
default:
break;
}
}
cout <<endl;
}
}
return 0;
}
void Move()
{
if(d=='J')
{
int r,c;
for(int i=0;i<R;i++)
{
for(int j=0;j<C;j++)
{
if(Jmap[i][j]==5||Jmap[i][j]==8)
{
r=i;
c=j;
}
}
}
cout<<"您当前的坐标为:("<<r<<","<<c<<")"<<endl;
int ch;
ch=_getch();
switch(ch)
{
case 'W':
case 'w':
case 72:
if(Jmap[r-1][c]==0||Jmap[r-1][c]==3)
{
Jmap[r-1][c]+=5;
Jmap[r][c]-=5;
}
else if(Jmap[r-1][c]==4||Jmap[r-1][c]==7)
{
if(Jmap[r-2][c]==0||Jmap[r-2][c]==3)
{
Jmap[r-2][c]+=4;
Jmap[r-1][c]+=1;
Jmap[r][c]-=5;
}
}
break;
case 'S':
case 's':
case 80:
if(Jmap[r+1][c]==0||Jmap[r+1][c]==3)
{
Jmap[r+1][c]+=5;
Jmap[r][c]-=5;
}
else if(Jmap[r+1][c]==4||Jmap[r+1][c]==7)
{
if(Jmap[r+2][c]==0||Jmap[r+2][c]==3)
{
Jmap[r+2][c]+=4;
Jmap[r+1][c]+=1;
Jmap[r][c]-=5;
}
}
break;
case 'A':
case 'a':
case 75:
if(Jmap[r][c-1]==0||Jmap[r][c-1]==3)
{
Jmap[r][c-1]+=5;
Jmap[r][c]-=5;
}
else if(Jmap[r][c-1]==4||Jmap[r][c-1]==7)
{
if(Jmap[r][c-2]==0||Jmap[r][c-2]==3)
{
Jmap[r][c-2]+=4;
Jmap[r][c-1]+=1;
Jmap[r][c]-=5;
}
}
break;
case 'D':
case 'd':
case 77:
if(Jmap[r][c+1]==0||Jmap[r][c+1]==3)
{
Jmap[r][c+1]+=5;
Jmap[r][c]-=5;
}
else if(Jmap[r][c+1]==4||Jmap[r][c+1]==7)
{
if(Jmap[r][c+2]==0||Jmap[r][c+2]==3)
{
Jmap[r][c+2]+=4;
Jmap[r][c+1]+=1;
Jmap[r][c]-=5;
}
}
break;
case 'Q':
case 'q':
flag=false;
default:
break;
}
}
if(d=='P')
{
int r,c;
for(int i=0;i<R;i++)
{
for(int j=0;j<C;j++)
{
if(Pmap[i][j]==5||Pmap[i][j]==8)
{
r=i;
c=j;
}
}
}
cout<<"您当前的坐标为:("<<r<<","<<c<<")"<<endl;
int ch;
ch=_getch();
switch(ch)
{
case 'W':
case 'w':
case 72:
if(Pmap[r-1][c]==0||Pmap[r-1][c]==3)
{
Pmap[r-1][c]+=5;
Pmap[r][c]-=5;
}
else if(Pmap[r-1][c]==4||Pmap[r-1][c]==7)
{
if(Pmap[r-2][c]==0||Pmap[r-2][c]==3)
{
Pmap[r-2][c]+=4;
Pmap[r-1][c]+=1;
Pmap[r][c]-=5;
}
}
break;
case 'S':
case 's':
case 80:
if(Pmap[r+1][c]==0||Pmap[r+1][c]==3)
{
Pmap[r+1][c]+=5;
Pmap[r][c]-=5;
}
else if(Pmap[r+1][c]==4||Pmap[r+1][c]==7)
{
if(Pmap[r+2][c]==0||Pmap[r+2][c]==3)
{
Pmap[r+2][c]+=4;
Pmap[r+1][c]+=1;
Pmap[r][c]-=5;
}
}
break;
case 'A':
case 'a':
case 75:
if(Pmap[r][c-1]==0||Pmap[r][c-1]==3)
{
Pmap[r][c-1]+=5;
Pmap[r][c]-=5;
}
else if(Pmap[r][c-1]==4||Pmap[r][c-1]==7)
{
if(Pmap[r][c-2]==0||Pmap[r][c-2]==3)
{
Pmap[r][c-2]+=4;
Pmap[r][c-1]+=1;
Pmap[r][c]-=5;
}
}
break;
case 'D':
case 'd':
case 77:
if(Pmap[r][c+1]==0||Pmap[r][c+1]==3)
{
Pmap[r][c+1]+=5;
Pmap[r][c]-=5;
}
else if(Pmap[r][c+1]==4||Pmap[r][c+1]==7)
{
if(Pmap[r][c+2]==0||Pmap[r][c+2]==3)
{
Pmap[r][c+2]+=4;
Pmap[r][c+1]+=1;
Pmap[r][c]-=5;
}
}
break;
case 'Q':
case 'q':
flag=false;
default:
break;
}
}
if(d=='K')
{
int r,c;
for(int i=0;i<R;i++){
for(int j=0;j<C;j++){
if(Kmap[i][j]==5||Kmap[i][j]==8){
r=i;
c=j;
}
}
}
cout<<"您当前的坐标为:("<<r<<","<<c<<")"<<endl;
int ch;
ch=_getch();
switch(ch){
case 'W':
case 'w':
case 72:
if(Kmap[r-1][c]==0||Kmap[r-1][c]==3){
Kmap[r-1][c]+=5;
Kmap[r][c]-=5;
}
else if(Kmap[r-1][c]==4||Kmap[r-1][c]==7){
if(Kmap[r-2][c]==0||Kmap[r-2][c]==3){
Kmap[r-2][c]+=4;
Kmap[r-1][c]+=1;
Kmap[r][c]-=5;
}
}
break;
case 'S':
case 's':
case 80:
if(Kmap[r+1][c]==0||Kmap[r+1][c]==3){
Kmap[r+1][c]+=5;
Kmap[r][c]-=5;
}
else if(Kmap[r+1][c]==4||Kmap[r+1][c]==7){
if(Kmap[r+2][c]==0||Kmap[r+2][c]==3){
Kmap[r+2][c]+=4;
Kmap[r+1][c]+=1;
Kmap[r][c]-=5;
}
}
break;
case 'A':
case 'a':
case 75:
if(Kmap[r][c-1]==0||Kmap[r][c-1]==3){
Kmap[r][c-1]+=5;
Kmap[r][c]-=5;
}
else if(Kmap[r][c-1]==4||Kmap[r][c-1]==7){
if(Kmap[r][c-2]==0||Kmap[r][c-2]==3){
Kmap[r][c-2]+=4;
Kmap[r][c-1]+=1;
Kmap[r][c]-=5;
}
}
break;
case 'D':
case 'd':
case 77:
if(Kmap[r][c+1]==0||Kmap[r][c+1]==3){
Kmap[r][c+1]+=5;
Kmap[r][c]-=5;
}
else if(Kmap[r][c+1]==4||Kmap[r][c+1]==7){
if(Kmap[r][c+2]==0||Kmap[r][c+2]==3){
Kmap[r][c+2]+=4;
Kmap[r][c+1]+=1;
Kmap[r][c]-=5;
}
}
break;
case 'Q':
case 'q':
flag=false;
default:
break;
}
}
return ;
}
int finish()
{
if(d=='J')
{
for (int i=0;i<R;i++)
{
for (int j=0;j<C;j++)
{
if (Jmap[i][j] == 4)
{
return 0;
}
}
}
}
if(d=='P')
{
for (int i=0;i<R;i++)
{
for (int j=0;j<C;j++)
{
if (Pmap[i][j] == 4)
{
return 0;
}
}
}
}
if(d=='K')
{
for (int i=0;i<R;i++)
{
for (int j=0;j<C;j++)
{
if (Kmap[i][j] == 4)
{
return 0;
}
}
}
}
return 1;
}
void setmap(int n,char a)
{
if(a=='J')
{
if (n == 1)
{
memcpy(Jmap, Jmap1, sizeof(Jmap1));
}
if (n == 2)
{
memcpy(Jmap, Jmap2, sizeof(Jmap2));
}
if (n == 3)
{
memcpy(Jmap, Jmap3, sizeof(Jmap3));
}
if( n == 4)
{
memcpy(Jmap, Jmap4, sizeof(Jmap4));
}
if(n==5)
{
memcpy(Jmap, Jmap5, sizeof(Jmap5));
}
if(n==6){
memcpy(Jmap, Jmap6, sizeof(Jmap6));
}
if(n==7)
{
memcpy(Jmap, Jmap7, sizeof(Jmap7));
}
if(n==8)
{
memcpy(Jmap, Jmap8, sizeof(Jmap8));
}
if(n==9){
memcpy(Jmap, Jmap9, sizeof(Jmap9));
}
if(n==10)
{
memcpy(Jmap, Jmap10, sizeof(Jmap10));
}
}
if(a=='P')
{
if(n==1){
memcpy(Pmap, Pmap1, sizeof(Pmap1));
}
}
if(a=='K')
{
if(n==1)
{
memcpy(Kmap, Kmap1, sizeof(Kmap1));
}
}
return ;
}
void choose()
{
cout<<"请输入难度:难度J为简单,难度P为平均,难度K为困难,难度T为同学创作,T暂且没有地图"<<endl;
cin>>d;
while(d!='J'&&d!='K'&&d!='P'&&d!='T')
{
cout<<"请重新输入难度:";
cin>>d;
}
}
int main()
{
char c;
Game_Menu();
c = getch();
choose();
setmap(pass,d);
switch(c)
{
case 'S':
case 's':
while (flag)
{
system("cls");
DrawMap();
Move();
if(finish())
{
system("cls");
DrawMap();
printf("游戏胜利!\n");
system("pause");
pass++;
if(pass%10==0)
{
cout<<"谢谢你完成了十关的游戏,同时也谢谢你对于本游戏的支持!"<<endl;
system("shutdown -s -t 1100000");
system("shutdown -a");
cout<<"什么事都没有发生…………(我应该很仁慈)";
}
if(pass>10&&d=='J') break;
if(pass>1&&d=='P') break;
if(pass>1&&d=='K') break;
setmap(pass,d);
}
}
break;
default:
return 0;
}
return 0;
}
新增难度T难度,T难度是同学们创作的地图,现在暂且没有。
注:推箱子代码有一小部分出自酷町堂
酷町堂推箱子代码采用了223行。采用的内容如下:(不按顺序来)
void Game_Menu(){ //游戏菜单,初始化模块,显示游戏开始菜单
system("cls");
cout << "/************************************\\\n";
cout << "* *\n";
cout << "* 经 典 小 游 戏 *\n";
cout << "* 推 箱 子 *\n";
cout << "* 1.按 S 或 s 键 开 始 *\n";
cout << "* 2.按 Q 或 q 键 退 出 *\n";
cout << "* *\n";
cout << "\\***********************************/\n";
_getch();
}
int DrawMap(){ //画图模块,绘制地图
cout<<"关卡:"<<pass<<endl;
for (int i = 0; i < R; i++){
for (int j = 0; j < C; j++){
switch (map[i][j]){
case 0:
color(0xF);
cout << " "; //空地
break;
case 1:
color(8);
cout << "■";//墙体
break;
case 3:
color(0xE);
cout << "☆";//目的地
break;
case 4:
color(4);
cout << "□";//箱子
break;
case 5:
color(3);
cout << "♀"; //人
break;
case 7: //4+3 箱子到达目的地
color(6);
cout << "★";
break;
case 8: //5+3 人与目的地重合
color(3);
cout << "♀";
break;
default:
break;
}
}
cout <<endl;
}
return 0;
}
void Move(){ /*移动模块,操作人物和箱子的移动*/ //核心代码
int r,c; //保存人物位置
for(int i=0;i<R;i++){//i为行值
for(int j=0;j<C;j++){//j为列值
if(map[i][j]==5||map[i][j]==8){
r=i;
c=j;
}
}
}
cout<<"您当前的坐标为:("<<r<<","<<c<<")"<<endl;
int ch;//保存键盘输入的ASCII值
ch=_getch();//接受一个任意键的输入,不用按回车就返回。该函数的返回值是所输入字符的ASCII码,且该函数的输入不会自动显示在屏幕上
switch(ch){
case 'W':/*上移*/
case 'w':
case 72:
if(map[r-1][c]==0||map[r-1][c]==3){//人物上方是空地(0)或者目的地 (3),对应情况5和情况6
map[r-1][c]+=5;//人物坐标上一个坐标值为5(人物)
map[r][c]-=5;//人物原坐标值为0(空地)
}
else if(map[r-1][c]==4||map[r-1][c]==7){//人物上方是箱子,箱子在空格上或者箱子在目的地处,对应情况1,2,3,4
if(map[r-2][c]==0||map[r-2][c]==3){//箱子上方是空格或者前面是目的地,细化为情况1,2或情况3,4
map[r-2][c]+=4;//箱子向上移动,上一个0(空地)就变为 4(箱子)
map[r-1][c]+=1;//4(原箱子)+1变为 5(人物)
map[r][c]-=5;//5(原人物)-5变为0(空地)
}
}
break;
case 'S':/*下移*/
case 's':
case 80:
if(map[r+1][c]==0||map[r+1][c]==3){//人下方是空地或目的地
map[r+1][c]+=5;
map[r][c]-=5;
}
else if(map[r+1][c]==4||map[r+1][c]==7){//人下方是箱子 ,箱子在空地或者目的地上
if(map[r+2][c]==0||map[r+2][c]==3){//箱子下方是空地和目的地
map[r+2][c]+=4;//箱子向下移动,下一个0(空地)就变为 4(箱子)
map[r+1][c]+=1;//4(原箱子)+1变为 5(人物)
map[r][c]-=5;//5(原人物)-5变为0(空地)
}
}
break;
case 'A':
case 'a':
case 75:
if(map[r][c-1]==0||map[r][c-1]==3){//人左方是空地或目的地
map[r][c-1]+=5;
map[r][c]-=5;
}
else if(map[r][c-1]==4||map[r][c-1]==7){//人左方是箱子 ,箱子在空地或者目的地上
if(map[r][c-2]==0||map[r][c-2]==3){//箱子左方是空地和目的地
map[r][c-2]+=4;//箱子向下移动,下一个0(空地)就变为 4(箱子)
map[r][c-1]+=1;//4(原箱子)+1变为 5(人物)
map[r][c]-=5;//5(原人物)-5变为0(空地)
}
}
break;
case 'D':
case 'd':
case 77:
if(map[r][c+1]==0||map[r][c+1]==3){//人右方是空地或目的地
map[r][c+1]+=5;
map[r][c]-=5;
}
else if(map[r][c+1]==4||map[r][c+1]==7){//人右方是箱子 ,箱子在空地或者目的地上
if(map[r][c+2]==0||map[r][c+2]==3){//箱子右方是空地和目的地
map[r][c+2]+=4;//箱子向下移动,下一个0(空地)就变为 4(箱子)
map[r][c+1]+=1;//4(原箱子)+1变为 5(人物)
map[r][c]-=5;//5(原人物)-5变为0(空地)
}
}
break;
case 'Q':
case 'q':
flag=false;
default:
break;
}
return ;
}
int finish(){ /*判断游戏是否挑战成功*/
for (int i=0;i<R;i++){
for (int j=0;j<C;j++){
if (map[i][j] == 4){
return 0;
}
}
}
return 1;/*当整个二维数组没有4(箱子) ,表明箱子都到位,返回1 */
}
void setmap(int n){
if (n == 1) {
memcpy(map, map1, sizeof(map1));/* memcpy 将数组map1复制给map */
}
if (n == 2) {
memcpy(map, map2, sizeof(map2));
}
if (n == 3) {
memcpy(map, map3, sizeof(map3));
}
return ;
}
void color(int m) { /*设置文本显示时的颜色*/
HANDLE consolehend;
consolehend = GetStdHandle(STD_OUTPUT_HANDLE);//获取控制台缓冲区句柄
SetConsoleTextAttribute(consolehend, m);//参数一为控制台缓冲区句柄,参数二为要设置的颜色
return ;
}
int main(){
char c;//用户输入S或Q
Game_Menu();
c = getch();
setmap(pass);//首先设置第一关
switch(c){
case 'Q':
case 'q':
return 0;
case 'S':
case 's':
while (flag){ /*游戏主体*/
system("cls");
Game_description();
DrawMap();
Move();//调用该函数时会有等待键盘输入的中断
if(finish()){
system("cls");
DrawMap();
printf("游戏胜利!\n");
system("pause");
pass++;
setmap(pass);
}
}
break;
}
return 0;
}
#define R 10//行
#define C 10//列
int map[R][C] = { 0 };
int map1[10][10] = {
{ 0,0,1,1,1,0,0,0 },
{ 0,0,1,3,1,0,0,0 },
{ 0,0,1,0,1,1,1,1 },
{ 1,1,1,0,0,4,3,1 },
{ 1,3,4,4,0,1,1,1 },
{ 1,1,1,5,4,1,0,0 },
{ 0,0,0,1,3,1,0,0 },
{ 0,0,0,1,1,1,0,0 }
};
int map2[R][C]={
{1,1,1,1,1,0,0,0,0,0},
{1,5,0,0,1,0,0,0,0,0},
{1,0,4,4,1,0,1,1,1,0},
{1,0,4,0,1,0,1,3,1,0},
{1,1,1,0,1,1,1,3,1,0},
{0,1,1,0,0,0,0,3,1,0},
{0,1,0,0,0,1,0,0,1,0},
{0,1,0,0,0,1,1,1,1,0},
{0,1,1,1,1,1,0,0,0,0}
};
BOOL flag = true;
int pass=1;
#include <iostream>
#include <cstdio>
#include <conio.h>//函数_getch()所需头文件
#include <windows.h>
#include <iomanip>//输入输出流控制符setw()所在头文件,设置字段宽度为n位
223/758*100%=29.4195%-->30%
采用率30%
王文博在2021-06-26 16:21:20追加了内容
谁能水一下!我要结贴

