c语言五子棋卡死,【新人】误打误撞写的五子棋不知道为什么运行特别卡

该楼层疑似违规已被系统折叠 隐藏此楼查看此楼

初学C语言,还不太懂,求dalao解答!

#include

int qipan[19][19];

int main()

{

int white=1;

int black=1;

int i, j;

int x, y;

int color = 0;

for (i = 0; i < 19; i++)

for (j = 0; j < 19; j++)

qipan[i][j] = 2;

while (1)

{

if (color == 1)

printf("白棋请落子:\n");

if (color == 0)

printf("黑棋请落子:\n");

scanf_s("%d %d", &x, &y);

if (qipan[x - 1][y - 1] != 2)

{

printf("该位置已有落子或落子位置超出棋盘范围!请重新输入:\n");

continue;

}

color = (color + 1) % 2;

qipan[x - 1][y - 1] = color;

for (i = 1; i <= 19; i++)

{

if (i == 1)

{

if (qipan[i - 1][0] == 1)//j=1

printf("●");

if (qipan[i - 1][0] == 0)//j=1

printf("○");

if (qipan[i - 1][0] == 2)//j=1

printf("┌");

for (j = 2; j <= 18; j++)

{

if (qipan[i - 1][j - 1] == 1)//j=1

printf("●");

if (qipan[i - 1][j - 1] == 0)//j=1

printf("○");

if (qipan[i - 1][j - 1] == 2)//j=1

printf("┬");

}

if (qipan[i - 1][18] == 1)//j=1

printf("●");

if (qipan[i - 1][18] == 0)//j=1

printf("○");

if (qipan[i - 1][18] == 2)//j=1

printf("┐");

printf("\n");

}

if (i <= 18 && i >= 2)

{

if (qipan[i - 1][0] == 1)//j=1

printf("●");

if (qipan[i - 1][0] == 0)//j=1

printf("○");

if (qipan[i - 1][0] == 2)//j=1

printf("├");

for (j = 2; j <= 18; j++)

{

if (qipan[i - 1][j - 1] == 1)//j=1

printf("●");

if (qipan[i - 1][j - 1] == 0)//j=1

printf("○");

if (qipan[i - 1][j - 1] == 2)//j=1

printf("┼");

}

if (qipan[i - 1][18] == 1)//j=1

printf("●");

if (qipan[i - 1][18] == 0)//j=1

printf("○");

if (qipan[i - 1][18] == 2)//j=1

printf("┤");

printf("\n");

}

if (i == 19)

{

if (qipan[i - 1][0] == 1)//j=1

printf("●");

if (qipan[i - 1][0] == 0)//j=1

printf("○");

if (qipan[i - 1][0] == 2)//j=1

printf("└");

for (j = 2; j <= 18; j++)

{

if (qipan[i - 1][j - 1] == 1)//j=1

printf("●");

if (qipan[i - 1][j - 1] == 0)//j=1

printf("○");

if (qipan[i - 1][j - 1] == 2)//j=1

printf("┴");

}

if (qipan[i - 1][18] == 1)//j=1

printf("●");

if (qipan[i - 1][18] == 0)//j=1

printf("○");

if (qipan[i - 1][18] == 2)//j=1

printf("┘");

printf("\n");

}

}

if (color == 1)

{

for (i = x - 2; i >= -1; i--)//统计同行左侧连续同样棋子个数。

if (qipan[i][y - 1] == 1)

black++;

else

break;

for (i = x; i < 19; i++)//统计同行右侧连续同样棋子个数。

if (qipan[i][y - 1] == 1)

black++;

else

break;

}

if (black >= 5)

break;

black = 1;

if (color == 1)

{

for (i = y; i < 19; i++)//统计同上侧连续同样棋子个数。

if (qipan[x - 1][i] == 1)

black++;

else

break;

for (i = y - 2; i >= -1; i--)//统计同行下侧连续同样棋子个数。

if (qipan[x - 1][i] == 1)

black++;

else

break;

}

if (black >= 5)

break;

black = 1;

if (color == 0)

{

for (i = x - 2; i >= -1; i--)//统计同行左侧连续同样棋子个数。

if (qipan[i][y - 1] == 0)

white++;

else

break;

for (i = x; i < 19; i++)//统计同行右侧连续同样棋子个数。

if (qipan[i][y - 1] == 0)

white++;

else

break;

}

if (white >= 5)

break;

white = 1;

if (color == 0)

{

for (i = y; i < 19; i++)//统计同上侧连续同样棋子个数。

if (qipan[x - 1][i] == 0)

white++;

else

break;

for (i = y - 2; i >= -1; i--)//统计同行下侧连续同样棋子个数。

if (qipan[x - 1][i] == 0)

white++;

else

break;

}

if (white >= 5)

break;

white = 1;

if (color == 1)

{

for (i = x - 2; i >= -1; i--)

for (j = y; j <19; j++)

{

if (qipan[i][j] == 1)

black++;

else

break;

}

for (i = x; i < 19; i++)

for (j = y - 2; j >= -1; j++)

if (qipan[i][j] == 1)

black++;

else break;

}

if (black >= 5)

break;

black = 1;

if (color == 1)

{

for (i = x; i < 19; i++)

for (j = y; j < 19; j++)

{

if (qipan[i][j] == 1)

black++;

else

break;

}

for(i = x - 2; i >= -1;i--)

for (j = y - 2; j >= -1; j--)

{

if (qipan[i][j] == 1)

black++;

else

break;

}

if (black >= 5)

break;

black = 1;

}

if (color == 1)

{

for (i = x; i < 19; i++)

for (j = y - 2; j >= -1; j--)

{

if (qipan[i][j] == 1)

black++;

else

break;

}

for (i = x - 2; x >= -1; x++)

for (j = y; j < 19; j++)

{

if (qipan[i][j] == 1)

black++;

else

break;

}

}

if (black >= 5)

break;

black = 1;

if (color == 0)

{

for (i = x - 2; i >= -1; i--)

for (j = y; j <19; j++)

{

if (qipan[i][j] == 0)

white++;

else

break;

}

for (i = x; i < 19; i++)

for (j = y - 2; j >= -1; j++)

if (qipan[i][j] == 0)

white++;

else break;

}

if (white >= 5)

break;

white = 1;

if (color == 0)

{

for (i = x; i < 19; i++)

for (j = y; j < 19; j++)

{

if (qipan[i][j] == 0)

white++;

else

break;

}

for (i = x - 2; i >= -1; i--)

for (j = y - 2; j >= -1; j--)

{

if (qipan[i][j] == 0)

white++;

else

break;

}

if (white >= 5)

break;

white = 1;

}

if (color == 0)

{

for (i = x; i < 19; i++)

for (j = y - 2; j >= -1; j--)

{

if (qipan[i][j] == 0)

white++;

else

break;

}

for (i = x - 2; x >= -1; x++)

for (j = y; j < 19; j++)

{

if (qipan[i][j] == 0)

white++;

else

break;

}

}

if (white >= 5)

break;

white = 1;

}

if (white == 5)

printf("白棋获胜!!!\n");

if (black == 5)

printf("黑棋获胜!!!\n");

}

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值