수다닷컴

일단 제가 그냥 스테이지를 넘기는거를 구현을 해볼려고 하는데 메인함수에서 일단 p();호출하고 그다음 esc를 눌러 빠져나간다음 if문써서 2이면 cls하고 다시 p();호출하는거까지 되는데 다시 호출된 p()함수에서 작동 시킬려고하면 안되네요....#include stdio.h
#include conio.h
#include Windows.h#define UP 72
#define DOWN 80
#define LEFT 75
#define RIGHT 77
#define ESC 27
#define SPACE 32#define SIZE 10int MAP[SIZE][SIZE]={
{1,1,1,1,1,1,1,1,1,1},
{1,0,0,1,0,0,0,0,1,1},
{1,0,1,3,1,0,0,1,3,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,0,2,0,0,0,0,1},
{1,0,0,0,0,4,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,0,0,0,0,2,0,0,0,1},
{1,0,0,0,0,0,0,0,0,1},
{1,1,1,1,1,1,1,1,1,1}
};
typedef struct{
int x;
int y;
}dir;void gotoxy(int x, int y)
{ COORD Pos = { x-1, y-1 }; SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), Pos);}void drawmap (int m[][SIZE],dir * D)
{
int i, j;
for(i=0; iSIZE; i++)
{
for(j=0; jSIZE; j++)
{
gotoxy(j*2+2,i+2);
switch(MAP[i][j])
{
case 0:
printf( );
break;
case 1:
printf(■);
break;
case 2:
printf(●);
break;
case 3:
printf(♨);
break;
case 4:
printf(Ω);
MAP[i][j]=0;
D-x=j*2+2;
D-y=i+2;
break;
}
}
}
}
int check_end(int m[][SIZE])
{
int i,j;
int total=0;for(i=0; iSIZE; i++)
{
for(j=0; jSIZE; j++)
{
if(m[i][j]==3)
total++;
}
}
return total;
}
int p()
{
char junk, real;
int point=0;
dir D;
dir * P=&D;drawmap(MAP,P);
while(1)
{
junk=getch();
if(junk==27)
real=junk;
else
real=getch();
gotoxy(D.x,D.y);
switch(MAP[D.y-2][D.x/2-1])
{
case 3://집도 지나갈수 있다는 것을 표현.
printf(♨);
break;

default ://플레이어 위치할시 이전 위치를 지워주기 위함.
printf( );
break;
}switch(real)
{
case UP:
D.y--;
switch(MAP[D.y-2][D.x/2-1])
{
case 0:
gotoxy(D.x,D.y);
printf(Ω);
break;
case 1:
D.y++;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2:
switch(MAP[D.y-2-1][D.x/2-1]) //Y-2-1은 2칸위를....
{
case 0 :
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-3][D.x/2-1]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x,D.y-1);
printf(●);
break;
case 1 :
D.y+=1;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2 :
D.y+=1;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-3][D.x/2-1]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x,D.y-1);
printf(●);
point++;
break;
}
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
break;

}
break;
case DOWN:
D.y++;
switch(MAP[D.y-2][D.x/2-1])
{
case 0:
gotoxy(D.x,D.y);
printf(Ω);
break;
case 1:
D.y--;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2:
switch(MAP[D.y-2+1][D.x/2-1])
p;{
case 0 :
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-1][D.x/2-1]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x,D.y+1);
printf(●);
break;
case 1 :
D.y-=1;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2 :
D.y-=1;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-1][D.x/2-1]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x,D.y+1);
printf(●);
point++;
break;
}
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
break;
}
break;case LEFT:
D.x-=2;
switch(MAP[D.y-2][D.x/2-1])
{
case 0:
gotoxy(D.x,D.y);
printf(Ω);
break;
case 1:
D.x+=2;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2:
switch(MAP[D.y-2][D.x/2-2])
{
case 0 :
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-2][D.x/2-2]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x-2,D.y);
printf(●);
break;
case 1 :
D.x+=2;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2 :
D.x+=2;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-2][D.x/2-2]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x-2,D.y);
printf(●);
point++;
break;
}
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
break;
}
break;case RIGHT:
D.x+=2;
switch(MAP[D.y-2][D.x/2-1])
{
case 0:
gotoxy(D.x,D.y);
printf(Ω);
break;
case 1:
D.x-=2;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2:
switch(MAP[D.y-2][D.x/2-0])
{
case 0 :
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-2][D.x/2-0]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x+2,D.y);
printf(●);
break;
case 1 :
D.x-=2;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 2 :
D.x-=2;
gotoxy(D.x,D.y);
printf(Ω);
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
/*맵의 공위치 변경*/
MAP[D.y-2][D.x/2-0]=2;
MAP[D.y-2][D.x/2-1]=0;gotoxy(D.x+2,D.y);
printf(●);
point++;
break;
}
break;
case 3:
gotoxy(D.x,D.y);
printf(Ω);
break;
}
break;
case ESC:
gotoxy (20, 17);
printf(Game End...);
getchar();
return 0;
}
}

}
int main(void)
{

int end;
end = check_end(MAP);

p();
if(end == 2)
system(cls);
Sleep(1000);
p();
return 0;
}

신청하기