简易推箱子

#include<stdio.h>
#include<conio.h> 
#include<windows.h>
#include "stdlib.h"

//图形显示数组 
char buff[13][22] = {
	{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,1,0,0,0,0,0,0,0,0,1,4,1},
	{1,0,0,0,0,0,4,0,0,0,0,0,0,3,0,0,0,0,0,1,0,1},
	{1,0,0,0,0,0,3,0,0,0,0,0,0,0,0,0,0,0,0,1,0,1},
	{1,0,0,0,0,0,2,0,0,0,1,0,0,0,0,1,1,1,1,1,0,1},
	{1,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,1},
	{1,0,0,0,0,0,0,0,0,0,0,0,0,0,0,1,1,1,1,0,0,1},
	{1,0,0,0,0,0,0,0,0,0,1,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,1,1,1,1,1,0,0,1},
	{1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,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,1},
	{1,0,0,0,0,0,0,0,0,0,0,0,0,0,1,0,0,0,0,0,0,1},
	{1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1,1}
};


int Qiang()
{
	int i = 0,j = 0;
	for(i = 0;i < 13;i++)
	{
		for(j = 0;j < 22;j++)
		{
			switch(buff[i][j])
			{
				case 1:
					printf("■");//代表墙 
					break;
				case 0:
					printf("  ");//代表空,可移动到此处 
					break;
				case 2:
					printf("♀");//代表人 
				 	break;
				case 3:
					printf("☆");//代表箱子 
					break;
				case 4:
					printf("▼");//代表终点 
					break;
				case 5:
					printf("★");//代表箱子推到终点 
					break;
			}			
		}
		printf ("\n");
	}
	
}
 
int main(void)
{
	int a;
	system("title 推箱子");
	system("mode con cols=44 lines=14");
	system("color 0e");
	
	
	while(1)
	{
		int i,j,num=0;
		Qiang();
		a=getch();	//获取键盘输入键值 上72 下80 左75 右77  
		switch(a)
		{
			case 'w': 	//向上移动 
			case 72 : 	for(i = 0;i < 13;i++)
						{
							for(j = 0;j < 22;j++)
							{
								if(buff[i][j]==2 && buff[i-1][j]==0 ) //人周围为空 
								{
									if(i==2&&j==6 || i==1&&j==21)	//人在终点
									{
										buff[i][j]=4;
										buff[i-1][j]=2;
									}
									else//人不在终点 
									{
										buff[i][j]=0;
										buff[i-1][j]=2;
									}	
								}
								else if(buff[i][j]==2 && buff[i-1][j]==3 && buff[i-2][j]==0)//人上方有箱子,并且箱子上方为空 
								{
									buff[i][j]=0;
									buff[i-1][j]=2;
									buff[i-2][j]=3;
								}
								else if(buff[i][j]==2 && buff[i-1][j]==3 && buff[i-2][j]==4)//人上方有箱子,并且箱子上方为终点 
								{
									buff[i][j]=0;
									buff[i-1][j]=2;
									buff[i-2][j]=5;
								}
								else if(buff[i][j]==2 && buff[i-1][j]==4)//人上方为空 
								{
									buff[i][j]=0;
									buff[i-1][j]=2;	
								}
							}
						}break;
			case 's':  //向下移动 
			case 80 : 	for(i = 0;i < 13;i++)
						{
							for(j = 0;j < 22;j++)
							{
								if(buff[i][j]==2 && buff[i+1][j]==0) //人周围为空 
								{
									if(i==2&&j==6 || i==1&&j==21)	//人在终点
									{
										buff[i][j]=4;
										buff[i+1][j]=2;
									}
									else//人不在终点 
									{
										buff[i][j]=0;
										buff[i+1][j]=2;
									}
									goto aa;
								}
								else if(buff[i][j]==2 && buff[i+1][j]==3 && buff[i+2][j]==0)//人下方有箱子,并且箱子下方为空 
								{
									buff[i][j]=0;
									buff[i+1][j]=2;
									buff[i+2][j]=3;
									goto aa;
								}
								else if(buff[i][j]==2 && buff[i+1][j]==3 && buff[i+2][j]==4)//人下方有箱子,并且箱子下方为终点 
								{
									buff[i][j]=0;
									buff[i+1][j]=2;
									buff[i+2][j]=5;
									goto aa;
								}
								else if(buff[i][j]==2 && buff[i+1][j]==4)//人下方为终点
								{
									buff[i][j]=0;
									buff[i+1][j]=2;	
									goto aa;
								}
							}
						}break;
			case 'a':	//向左移动 
			case 75 : 	for(i = 0;i < 13;i++)
						{
							for(j = 0;j < 22;j++)
							{
								if(buff[i][j]==2 && buff[i][j-1]==0) //人周围为空 
								{
									if(i==2&&j==6 || i==1&&j==21)	//人在终点 
									{
										buff[i][j]=4;
										buff[i][j-1]=2;
									}
									else	//人左侧为空 
									{
										buff[i][j]=0;
										buff[i][j-1]=2;
									}
								}
								else if(buff[i][j]==2 && buff[i][j-1]==3 && buff[i][j-2]==0) //人左侧有箱子,并且箱子左侧为空 
								{
									buff[i][j]=0;
									buff[i][j-1]=2;
									buff[i][j-2]=3;
								}
								else if(buff[i][j]==2 && buff[i][j-1]==3 && buff[i][j-2]==4) //人左侧有箱子,并且箱子左侧为终点 
								{
									buff[i][j]=0;
									buff[i][j-1]=2;
									buff[i][j-2]=5;	
								}
								else if(buff[i][j]==2 && buff[i][j-1]==4)	//人左侧为终点 
								{
									buff[i][j]=0;
									buff[i][j-1]=2;	
								} 
							}
						}break;
			case 'd':	//向右移动 
			case 77 : for(i = 0;i < 13;i++)
						{
							for(j = 0;j < 22;j++)
							{
								if(buff[i][j]==2 && buff[i][j+1]==0) //人周围为空 
								{
									if(i==2&&j==6 || i==1&&j==21)//人在终点
									{
										buff[i][j]=4;
										buff[i][j+1]=2;
									}
									else//人不在终点 
									{
										buff[i][j]=0;
										buff[i][j+1]=2;
									}
									goto aa;
								}
								else if(buff[i][j]==2 && buff[i][j+1]==3 && buff[i][j+2]==0)//人右侧有箱子,并且箱子右侧为空 
								{
									buff[i][j]=0;
									buff[i][j+1]=2;
									buff[i][j+2]=3;
									goto aa;
								}
								else if(buff[i][j]==2 && buff[i][j+1]==3 && buff[i][j+2]==4)//人右侧有箱子,并且箱子右侧为终点 
								{
									buff[i][j]=0;
									buff[i][j+1]=2;
									buff[i][j+2]=5;
									goto aa;
								}
								else if(buff[i][j]==2 && buff[i][j+1]==4)//人右侧为终点 
								{
									buff[i][j]=0;
									buff[i][j+1]=2;
									goto aa;	
								}
								
							}
						}break;
		}
		aa:	
		
		for(i = 0;i < 13;i++)	//判断箱子是否到达终点 
		{
			for(j = 0;j < 22;j++)
			{
				if(buff[i][j]==5)
				{
					num++;
				}
			}
		}
		
		if(num==2)
		{
			system("cls");  
			printf("恭喜通关");
			break;
		}
		system("cls");  // 清屏
	}
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值