수다닷컴

질문 제목 : 오목질문 3질문 요약 :대각선이 생각보다 너무 어려워요...ㅠㅅ ㅠ

질문 내용 :
#include stdio.h
#include windows.h
#include conio.h

#define RIGHT 77
#define LEFT 75
#define UP 72
#define DOWN 80
#define ENTER 13
void draw();
int move();
void gotoxy();
int check();
void game();
void victory();
int x=16,y=8;
int xy[32][16]={0};
char stone[3][3] = {, ○,●};
int a=1;
int count[11][11];
int main()
{

game();
while(move()){

}

return 0;
}
void game()
{
int i,j;
printf(┌┬┬┬┬┬┬┬┬┬┬┬┬┬┬┐\n);
for(i=0;i=15;i++)
{
for(j=0;j=15;j++)
{
printf(┼);
}
printf(\n);
}
printf(└┴┴┴┴┴┴┴┴┴┴┴┴┴┴┘\n);
}
void gotoxy(int x, int y)
{
COORD XY = {x, y};
SetConsoleCursorPosition(GetStdHandle(STD_OUTPUT_HANDLE), XY);
}
int move()
{
static int Turn = 0;
char c;
c = getch();

switch(c)
{
case RIGHT:
{
if(x 30)
{
x = x+2;
gotoxy(x,y);
printf(★);
}
gotoxy(x-2,y);
printf(%s, stone[xy[x-2][y]]);
if(xy[x-2][y]==0)
printf(┼);
break;
}

case LEFT:
{
if(x0)
{
x = x-2;
gotoxy(x,y);
printf(★);
}
gotoxy(x+2,y);
printf(%s, stone[xy[x+2][y]]);
if(xy[x+2][y]==0)
printf(┼);break;}
case UP:
{
if(y0)
{
y = y-1;
gotoxy(x,y);
printf(★);
}
gotoxy(x,y+1);
printf(%s, stone[xy[x][y+1]]);
if(xy[x][y+1]==0)
printf(┼);

break;}
case DOWN:
{
if(y15)
{
y = y+1;
gotoxy(x,y);
printf(★);
}
gotoxy(x,y-1);printf(%s, stone[xy[x][y-1]]);if(xy[x][y-1]==0)
printf(┼);

break;}
case ENTER:
{if(xy[x][y] == 0 && !(Turn % 2))
{
xy[x][y] = 1;
Turn++;
}
if(xy[x][y] == 0 && (Turn % 2))
{
xy[x][y] = 2;
Turn++;
}
if(check() == 0 )
return 0;
break;
}
}
return 1;
}
int check()
{
int i, j;
int count = 0;
int dol = xy[x][y];
if(dol == 0)
return 1;

//수평
for( i = 2; i 32; i+=2 )
{
if( xy[i][y] == dol && xy[i-2][y] == dol )
{
count++;
}
else
{
count = 0;
}
if( count = 4 )
{
fprintf(stdout, Victory\n);
return 0;
}
}
count = 0;

// 수직
for( j = 1; j 16; j++ )
{
if( xy[x][j] == dol && xy[x][j-1] == dol )
{
count++;
}
else
{
count = 0;
}
if( count = 4 )
{
fprintf(stdout, Victory\n);
return 0;
}
}
return 1;
/*
for(i = x-5; i= x+5; i++)//우상+좌하
{
for(j = y-5; j= y+5; j++)
{
p;if(xy[i][j] == 2){
count++;
}
}
if(count == 5 && xy[i+1][j+1] !=1){

victory();
return 0;
}
else
count=0;
}

for(i = x-5; i= x+5; i++)//우상+좌하
{
for(j = y-5; j= y+5; j++)
{
if(xy[i][j] == 2){
count++;
}
}
if(count == 5 && xy[i+1][j+1] !=1){
return 0;
victory();
}
else
count=0;
}

return 1;
}
void victory()
{
printf(victory\n);
}

신청하기