题解 | #井字棋#
井字棋
https://www.nowcoder.com/practice/0375c1d206ef48a3894f72aa07b2fdde
#include <stdio.h>
int main()
{
char zu[3][3] = { 0 };
int i1, i2, i3;
int t = 0;
for (i1 = 0; i1 < 3; i1++)
{
for (i2 = 0; i2 < 3; i2++)
{
scanf("%c", &zu[i1][i2]);
getchar();
}
}
for (i1 = 0; i1 < 3; i1++)//横向判断
{
t = 0;
t = zu[i1][0] + zu[i1][1] + zu[i1][2];
if(t%'K'==0)
{
printf("KiKi wins!");
goto jie;
}
if (t % 'B' == 0)
{
printf("BoBo wins!");
goto jie;
}
}
for (i1 = 0; i1 < 3; i1++)//竖向判断
{
t = 0;
t = zu[0][i1] + zu[1][i1] + zu[2][i1];
if (t % 'K' == 0)
{
printf("KiKi wins!");
goto jie;
}
if (t % 'B' == 0)
{
printf("BoBo wins!");
goto jie;
}
}
t = 0;
t = zu[0][0] + zu[1][1] + zu[2][2];
if (t % 'K' == 0)
{
printf("KiKi wins!");
goto jie;
}
if(t % 'B' == 0)
{
printf("BoBo wins!");
goto jie;
}
t = 0;
t = zu[2][0] + zu[1][1] + zu[0][2];
if (t % 'K' == 0)
{
printf("KiKi wins!");
goto jie;
}
if (t % 'B' == 0)
{
printf("BoBo wins!");
goto jie;
}
printf("No winner!");
jie:
return 0;
}
查看14道真题和解析