小试牛刀2:推箱子

#include <stdio.h>
#include <stdlib.h>
#include <conio.h>
#include <stdbool.h>
#include <string.h>
int cas = 0;
void draw_map(int map[][9][9], int row, int cols) 
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < cols; j++) 
		{
			switch (map[cas][i][j]) 
			{
			case 0:
				printf("  ");
				break;
			case 1:
				printf("■");
				break;
			case 3:
				printf("★");
				break;
			case 4:
				printf("☆");
				break;
			case 5:
			case 8:
				printf("㊣");
				break;
			case 7:
				printf("⊙");
				break;
			}
		}
		printf("\n");
	}
}

int  get_posI(int map[][9][9], int row, int cols)
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < cols; j++)
		{
			if (map[cas][i][j] == 5 || map[cas][i][j] == 8)
			{
				return i;
			}
		}
	}
	return -1;
}

int  get_posJ(int map[][9][9], int row, int cols)
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < cols; j++)
		{
			if (map[cas][i][j] == 5 || map[cas][i][j] == 8)
			{
				return j;
			}
		}
	}
	return -1;
}
void press_key(int map[][9][9], int row, int cols)
{
	int key = _getch();
	int i = get_posI(map, row, cols);
	int j = get_posJ(map, row, cols);
	switch (key)
	{
	case 72:
	case 'w':
	case 'W':
		if (map[cas][i - 1][j] == 0 || map[cas][i - 1][j] == 3)
		{
			map[cas][i][j] -= 5;
			map[cas][i - 1][j] += 5;
		}
		if (map[cas][i - 1][j] == 4 || map[cas][i - 1][j] == 7) 
		{
			if (map[cas][i - 2][j] == 0 || map[cas][i - 2][j] == 3) 
			{
				map[cas][i][j] -= 5;
				map[cas][i - 1][j] += 1;
				map[cas][i - 2][j] += 4;
			}
		}
		break;
	case 80:
	case 's':
	case 'S':
		if (map[cas][i + 1][j] == 0 || map[cas][i + 1][j] == 3)
		{
			map[cas][i][j] -= 5;
			map[cas][i + 1][j] += 5;
		}
		if (map[cas][i + 1][j] == 4 || map[cas][i + 1][j] == 7)
		{
			if (map[cas][i + 2][j] == 0 || map[cas][i + 2][j] == 3)
			{
				map[cas][i][j] -= 5;
				map[cas][i + 1][j] += 1;
				map[cas][i + 2][j] += 4;
			}
		}


		break;
	case 75:
	case 'A':
	case 'a':
		if (map[cas][i][j - 1] == 0 || map[cas][i][j - 1] == 3)
		{
			map[cas][i][j] -= 5;
			map[cas][i ][j - 1] += 5;
		}
		if (map[cas][i][j - 1] == 4 || map[cas][i ][j - 1] == 7)
		{
			if (map[cas][i][j - 2] == 0 || map[cas][i][j - 2] == 3)
			{
				map[cas][i][j] -= 5;
				map[cas][i][j - 1] += 1;
				map[cas][i][j - 2] += 4;
			}
		}
		break;
	case 77:
	case 'd':
	case 'D':
		if (map[cas][i][j + 1] == 0 || map[cas][i][j + 1] == 3)
		{
			map[cas][i][j] -= 5;
			map[cas][i][j + 1] += 5;
		}
		if (map[cas][i][j + 1] == 4 || map[cas][i][j + 1] == 7)
		{
			if (map[cas][i][j + 2] == 0 || map[cas][i][j + 2] == 3)
			{
				map[cas][i][j] -= 5;
				map[cas][i][j + 1] += 1;
				map[cas][i][j + 2] += 4;
			}
		}

		break;
	}
}
bool game_over(int map[][9][9], int row, int cols) 
{
	for (int i = 0; i < row; i++)
	{
		for (int j = 0; j < cols; j++)
		{
			if (map[cas][i][j] == 4) 
			{
				return false;
			}
		}
	}
	return true;
}

void input_password(char  password[])
{
	int i = 0;
	int key = 0;
	while ((key = _getch()) != '\r') 
	{
		if (key == '\b') 
		{
			if (i > 0)
			{
				printf("\b \b");
				i--;
			}
		}
		else 
		{
			password[i++] = key;
			putchar('*');
		}
	}
	password[i] = '\0';
	printf("\n");
	puts(password);
}
void login_box() 
{
	char name[20]="";
	char password[7]="";

	char login_name[20] = "";
	char login_password[7] = "";
	while (true)
	{
		printf("----------------\n");
		printf("\t0.退出\n");
		printf("\t1.登录\n");
		printf("\t2.注册\n");
		printf("----------------\n");
		int key = 0;
		scanf_s("%d", &key);
		switch (key) 
		{
		case 0:
			break;
		case 1:
			printf("用户名:");
			while (getchar() != '\n');
			gets_s(name, 20);
			printf("密  码:");
			input_password(password);
			break;
		case 2:
			printf("输入注册用户名:");
			while (getchar() != '\n');
			gets_s(login_name, 20);
			printf("输入注册密码:");
			input_password(login_password);
			//puts(login_password);
			break;
		}
		if (key == 0)
			exit(0);
		if (key == 1) 
		{
			if (strcmp(login_name, name) == 0 && strcmp(login_password, password) == 0)
			{
				system("pause");
				system("cls");
				break;
			}
		}
	}
}
int main()
{
	login_box();

	//1.墙 
	//0.路
	//3.目的地
	//4.箱子
	//5.人
	//5+3 人
	//4+3: 成功推上了
	int map[3][9][9] =
	{
		1,1,1,1,1,1,1,1,1,
		1,3,4,0,0,0,0,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,0,0,5,0,0,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,1,1,0,1,1,0,1,
		1,3,4,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,3,4,0,0,0,0,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,0,0,5,0,4,3,1,
		1,0,1,0,0,1,1,0,1,
		1,0,1,0,0,1,1,0,1,
		1,3,4,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,3,4,0,0,0,4,3,1,
		1,0,1,1,0,1,1,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,0,0,5,0,0,0,1,
		1,0,1,1,0,1,1,0,1,
		1,0,1,1,0,1,1,0,1,
		1,3,4,0,0,0,4,3,1,
		1,1,1,1,1,1,1,1,1,
	};
	while (true) 
	{
		printf("\t推箱子第【%d】关\n", cas + 1);
		draw_map(map, 9, 9);
		if (game_over(map, 9, 9))
		{
			cas++;
			if (cas >= 3)
			{
				printf("game Over");
				break;
			}
		}
		press_key(map,9,9);
		system("cls");
	}
	return 0;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值