Problem A. Tic-Tac-Toe-Tomek【解題報告】

Problem

Tic-Tac-Toe-Tomek is a game played on a 4 x 4 square board. The board starts empty, except that a single 'T' symbol may appear in one of the 16 squares. There are two players: X and O. They take turns
to make moves, with X starting. In each move a player puts her symbol in one of the empty squares. Player X's symbol is 'X', and player O's symbol is 'O'.

After a player's move, if there is a row, column or a diagonal containing 4 of that player's symbols, or containing 3 of her symbols and the 'T' symbol, she wins and the game ends. Otherwise the game continues
with the other player's move. If all of the fields are filled with symbols and nobody won, the game ends in a draw. See the sample input for examples of various winning positions.

Given an 4 x 4 board description containing 'X', 'O', 'T' and '.' characters (where '.' represents an empty square), describing the current state of a game, determine the status of the Tic-Tac-Toe-Tomek
game going on. The statuses to choose from are:

• "X won" (the game is over, and X won)
• "O won" (the game is over, and O won)
• "Draw" (the game is over, and it ended in a draw)
• "Game has not completed" (the game is not over yet)

Input

The first line of the input gives the number of test cases, T. T test cases follow. Each test case consists of 4 lines with 4 characters each, with each character being
'X', 'O', '.' or 'T' (quotes for clarity only). Each test case is followed by an empty line.

Output

For each test case, output one line containing "Case #x: y", where x is the case number (starting from 1) and y is one of the statuses given above. Make sure to get the statuses exactly right. When you
run your code on the sample input, it should create the sample output exactly, including the "Case #1: ", the capital letter "O" rather than the number "0", and so on.

Limits

The game board provided will represent a valid state that was reached through play of the game Tic-Tac-Toe-Tomek as described above.

Small dataset

1 ≤ T ≤ 10.

Large dataset

1 ≤ T ≤ 1000.

Sample

Input  6XXXT....OO......XOXTXXOOOXOXXXOOXOX.OX..........OOXXOXXXOX.TO..OXXXO..O..O..T...OXXXXO....O....OOutput Case #1: X wonCase #2: DrawCase #3: Game has not completedCase #4: O wonCase #5: O wonCase #6: O won

Note

Although your browser might not render an empty line after the last test case in the sample input, in a real input file there would be one.

解：只需判斷4行 4列 對角線10種狀態。 我用了sumx, sumo 兩個數來存10種狀態中x、o棋子的數量。每讀入一個棋子，在對應的數組中，行列分別對應的數+1. 最後看一遍是否有和為4的（T則在x，o數組中都加1）。有則有勝利者，如果沒有，輸入中有"." 則還在繼續。 沒有則和局。