1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88
|
#include <iostream>
#include <conio.h>
#include "map.h"
#include <windows.h>
using namespace std;
#define UP 119
#define S_LEFT 97
#define BACK 115
#define S_RIGHT 100
#define LIMIT 5
int maparr[7][7] = {
{1, 1, 1, 1, 1, 1, 1},
{1, 0, 0, 0, 0, 0, 1},
{1, 0, 5, 0, 0, 0, 1},
{1, 0, 0, 0, 0, 0, 1},
{1, 0, 0, 0, 0, 0, 1},
{1, 0, 0, 0, 0, 0, 1},
{1, 1, 1, 1, 1, 1, 1}};
int main(void)
{
int in;
displayMap(maparr);
while(in = getch()) {
if(in == S_RIGHT) {
system("cls");
for(int i = 0; i < LIMIT; i++) {
for(int j = 0; j < LIMIT; j++) {
if(maparr[i][j] == 5) {
maparr[i][j] = 0;
maparr[i][j+1] = 5;
break;
}
}
}
}
displayMap(maparr);
if(in == UP) {
system("cls");
for(int i = 0; i < LIMIT; i++) {
for(int j = 0; j < LIMIT; j++) {
if(maparr[i][j] == 5) {
maparr[i][j] = 0;
maparr[i-1][j] = 5;
break;
}
}
}
displayMap(maparr);
}
if(in == BACK) {
system("cls");
for(int i = 0; i < LIMIT; i++) {
for(int j = 0; j < LIMIT ; j++) {
if(maparr[i][j] == 5) {
maparr[i][j] = 0;
maparr[i+1][j] = 5;
break;
}
}
}
displayMap(maparr);
}
if(in == S_LEFT) {
system("cls");
for(int i = 0; i < LIMIT; i++)
for(int j = 0; j < LIMIT; j++) {
if(maparr[i][j] == 5) {
maparr[i][j] = 0;
maparr[i][j-1] = 5;
}
}
displayMap(maparr);
}
}
return 0;
}
|