实例介绍
【实例简介】SDU
【实例截图】
【实例截图】
【核心代码】
#include<stdio.h>
#include<string.h>
#include<windows.h>
#define N 15
#define M 3 //关卡数
//全局变量
int level = 0;
int x,y;
int map[M][N][N] = {
{ //
{1,1,1,1,1,0,0,0,0,0,0,0,0,0,0},
{1,1,1,1,1,0,3,1,1,0,0,0,0,0,0},
{1,1,1,1,1,0,0,0,1,0,0,0,0,0,0},
{1,1,1,1,1,0,0,0,1,0,0,0,0,0,0},
{1,1,1,1,1,0,0,0,1,1,1,1,1,0,0},
{1,1,1,1,1,0,0,0,0,0,0,0,1,0,0},
{1,1,1,1,1,0,0,0,0,0,0,0,1,0,0},
{1,1,1,1,1,0,0,0,0,0,0,0,1,1,0},
{1,1,1,1,1,0,0,0,0,0,0,0,0,1,0},
{1,1,1,1,1,0,0,0,0,0,0,0,0,4,0},
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
},
{
{1,1,0,0,0,0,0,0,0,0,0,0,0,0,0},
{1,1,0,3,1,1,1,1,1,0,0,0,0,0,0},
{1,1,0,1,1,0,0,0,1,0,0,0,0,0,0},
{1,1,0,0,0,0,0,0,1,0,0,0,0,0,0},
{1,1,0,1,1,0,0,0,1,1,1,1,1,0,0},
{1,1,0,1,1,0,0,0,0,0,0,0,1,0,0},
{1,1,0,1,1,0,0,0,0,0,0,0,1,0,0},
{1,1,0,1,1,0,0,0,0,0,1,1,1,1,0},
{1,1,0,1,1,0,0,0,0,0,1,0,0,1,0},
{1,1,0,1,1,0,0,0,0,0,1,0,0,0,0},
{1,1,0,1,1,1,1,1,1,0,1,0,1,1,0},
{1,1,0,1,1,1,1,1,1,1,1,1,1,1,0},
{1,1,0,0,0,0,0,0,0,0,0,0,0,4,0},
{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1},
{1,1,1,1,1,1,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,3,1,1,0,0,0,0,0,0,0,0,0,0,0},
{0,0,0,1,0,1,1,1,0,0,0,0,0,0,0},
{0,0,0,1,1,1,0,1,0,0,0,0,0,0,0},
{0,0,0,0,1,0,0,1,0,0,0,0,0,0,0},
{0,1,1,0,1,0,0,1,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,1,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,1,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0,1,0,0,0,0},
{0,0,0,0,0,0,0,0,0,0,1,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,1,0},
{0,0,0,0,0,0,0,0,0,0,0,0,0,4,0},
}
};
//函数声明
void print();
void menu();
void find();
int move();
int Up();
int Down();
int Right();
int Left();
int main(void)
{
int flag = 0;
menu();
while(1)
{
flag = move();
if(flag == 1 || flag == -1)
return 0;
}
return 0;
}
//找到自己的位置
void find()
{
int i= 0,j = 0;
for(i = 0;i < N;i )
{
for(j = 0;j < N;j )
{
if(map[level][i][j] == 3)
{
x = i;
y = j;
break;
}
}
}
}
int move()
{
int flag = 0;
while(1)
{
flag = 0;
find();
print();
switch(getch())//接收按键输入
{
case 'w':flag = Up();break;
case 'a':flag = Left();break;
case 's':flag = Down();break;
case 'd':flag = Right();break;
case 27:return -1;
}
if(flag == 1)
{
//通过了
if(level == M-1)
{
MessageBox(0,TEXT("恭喜你完成了所有关卡，圣诞节快乐"),TEXT("恭喜"),NULL);
return 1;
}
else
{
MessageBox(0,TEXT("恭喜你通过了这一关"),TEXT("恭喜"),NULL);
level ;
}
}
}
}
int Up()
{
if(x != 0)
{
if(map[level][x-1][y] == 1)//可走
{
map[level][x-1][y] = 3;
map[level][x][y] = 1;
}
else if(map[level][x-1][y] == 4)
{
return 1;
}
}
return 0;
}
int Down()
{
if(x != N-1)
{
if(map[level][x 1][y] == 1)//可走
{
map[level][x 1][y] = 3;
map[level][x][y] = 1;
}
else if(map[level][x 1][y] == 4)
{
return 1;
}
}
return 0;
}
int Right()
{
if(y != N-1)
{
if(map[level][x][y 1] == 1)//可走
{
map[level][x][y 1] = 3;
map[level][x][y] = 1;
}
else if(map[level][x][y 1] == 4)
{
return 1;
}
}
return 0;
}
int Left()
{
if(y != 0)
{
if(map[level][x][y-1] == 1)//可走
{
map[level][x][y-1] = 3;
map[level][x][y] = 1;
}
else if(map[level][x][y-1] == 4)
{
return 1;
}
}
return 0;
}
void menu()
{
char select[10];
printf("分别用wasd控制人物移动，按Esc退出游戏\n");
printf("请输入游戏难度(1、2、3):");
while(1)
{
scanf("%s",select);
if(strlen(select)>1)
{
printf("错误输入，请重新输入：");
}
else
{
if('1' == select[0])
{
level = 0;
break;
}
else if('2' == select[0])
{
level = 1;
break;
}
else if('3' == select[0])
{
level = 2;
break;
}
else
{
printf("错误输入，请重新输入：");
}
}
}
printf("%d\n",level);
}
//打印函数
void print()
{
int i= 0,j = 0;
system("cls");
for(i = 0;i < N;i )
{
for(j = 0;j < N;j )
{
if(map[level][i][j] == 0)
printf("■");
else if(map[level][i][j] == 1)
printf(" ");
else if(map[level][i][j] == 3)
printf("⊙");
else if(map[level][i][j] == 4)
printf("☆");
}
printf("\n");
}
}
好例子网口号：伸出你的我的手 — 分享！
小贴士
感谢您为本站写下的评论，您的评论对其它用户来说具有重要的参考价值，所以请认真填写。
- 类似“顶”、“沙发”之类没有营养的文字，对勤劳贡献的楼主来说是令人沮丧的反馈信息。
- 相信您也不想看到一排文字/表情墙，所以请不要反馈意义不大的重复字符，也请尽量不要纯表情的回复。
- 提问之前请再仔细看一遍楼主的说明，或许是您遗漏了。
- 请勿到处挖坑绊人、招贴广告。既占空间让人厌烦，又没人会搭理，于人于己都无利。
关于好例子网
本站旨在为广大IT学习爱好者提供一个非营利性互相学习交流分享平台。本站所有资源都可以被免费获取学习研究。本站资源来自网友分享，对搜索内容的合法性不具有预见性、识别性、控制性，仅供学习研究，请务必在下载后24小时内给予删除，不得用于其他任何用途，否则后果自负。基于互联网的特殊性，平台无法对用户传输的作品、信息、内容的权属或合法性、安全性、合规性、真实性、科学性、完整权、有效性等进行实质审查；无论平台是否已进行审查，用户均应自行承担因其传输的作品、信息、内容而可能或已经产生的侵权或权属纠纷等法律责任。本站所有资源不代表本站的观点或立场，基于网友分享，根据中国法律《信息网络传播权保护条例》第二十二与二十三条之规定，若资源存在侵权或相关问题请联系本站客服人员，点此联系我们。关于更多版权及免责申明参见 版权及免责申明
网友评论
我要评论