Certainly, everyone is familiar with tic-tac-toe game. The rules are very simple indeed. Two players take turns marking the cells in a 3 × 3grid (one player always draws crosses, the other — noughts). The player who succeeds first in placing three of his marks in a horizontal, vertical or diagonal line wins, and the game is finished. The player who draws crosses goes first. If the grid is filled, but neither Xs, nor 0s form the required line, a draw is announced.
You are given a 3 × 3 grid, each grid cell is empty, or occupied by a cross or a nought. You have to find the player (first or second), whose turn is next, or print one of the verdicts below:
- illegal — if the given board layout can't appear during a valid game;
- the first player won — if in the given board layout the first player has just won;
- the second player won — if in the given board layout the second player has just won;
- draw — if the given board layout has just let to a draw.
The input consists of three lines, each of the lines contains characters ".", "X" or "0" (a period, a capital letter X, or a digit zero).
Print one of the six verdicts: first, second, illegal, the first player won, the second player won or draw.
X0X .0. .X.
second
一道我WA了n遍的题目(可能是晚上状态不好)
完整代码:
/*30ms,0KB*/
#include<cstdio>
char grid[3][3];
int main(void)
{
int fcount = 0, scount = 0;
bool fwin = false, swin = false; ///局部变量一定要赋值后才能用
for (int i = 0; i < 3; ++i)
{
for (int j = 0; j < 3; j++)
{
grid[i][j] = getchar();
if (grid[i][j] == 'X')
++fcount;
else if (grid[i][j] == '0')
++scount;
}
getchar();
}
if (fcount - scount > 1 || fcount - scount < 0) ///永远是X(first)先走
printf("illegal");
else
{
///行
for (int i = 0; i < 3; ++i)
{
if (grid[i][0] == grid[i][1] && grid[i][0] == grid[i][2] && grid[i][0] != '.')
{
if (grid[i][0] == 'X')
fwin = true;
else
swin = true;
}
}
if (fwin && swin)
{
printf("illegal");
return 0;
}
else if (fwin || swin)
{
if (fwin && fcount == scount || swin && fcount > scount)
{
printf("illegal");
return 0;
}
printf(fwin ? "the first player won" : "the second player won");
return 0;
}
///列
for (int i = 0; i < 3; ++i)
{
if (grid[0][i] == grid[1][i] && grid[0][i] == grid[2][i] && grid[0][i] != '.')
{
if (grid[0][i] == 'X')
fwin = true;
else
swin = true;
}
}
if (fwin && swin)
{
printf("illegal");
return 0;
}
else if (fwin || swin)
{
if (fwin && fcount == scount || swin && fcount > scount)
{
printf("illegal");
return 0;
}
printf(fwin ? "the first player won" : "the second player won");
return 0;
}
///斜
if (grid[1][1] != '.' && (grid[0][0] == grid[1][1] && grid[2][2] == grid[1][1] || grid[0][2] == grid[1][1] && grid[2][0] == grid[1][1]))
{
if (grid[1][1] == 'X')
fwin = true;
else
swin = true;
}
if (fwin || swin)
{
if (fwin && fcount == scount || swin && fcount > scount)
{
printf("illegal");
return 0;
}
printf(fwin ? "the first player won" : "the second player won");
return 0;
}
printf(fcount + scount == 9 ? "draw" : fcount > scount ? "second" : "first");
}
return 0;
}

本文介绍了一个井字游戏(Tic-tac-toe)胜负判断的算法实现,通过分析游戏盘面的状态来判断游戏的胜负情况或是平局,并确定下一步由哪位玩家行动。
447

被折叠的 条评论
为什么被折叠?



