{"raw_statement":[{"iden":"statement","content":"Given a tic-tac-toe board, return if you can win the game in one move or not.\n\nThe first line will be the side that you are on, X or O. The next three lines are the are the current board.\n\nIf you can win print \"Yes you can.\", otherwise print \"No you can't.\"\n\n"},{"iden":"input","content":"The first line will be the side that you are on, X or O. The next three lines are the are the current board."},{"iden":"output","content":"If you can win print \"Yes you can.\", otherwise print \"No you can't.\""}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ s \\in \\{X, O\\} $ be the current player's symbol.  \nLet $ B \\in \\{X, O, \\cdot\\}^{3 \\times 3} $ be the tic-tac-toe board, where $ \\cdot $ denotes an empty cell.\n\n**Constraints**  \n- $ B $ contains exactly $ s $ and $ \\cdot $ (opponent’s symbol may be present, but only $ s $ is to be placed in empty cells).  \n- The board is in a valid intermediate state (no game-over condition already satisfied for either player).\n\n**Objective**  \nDetermine if there exists an empty cell $ (i, j) $ such that placing $ s $ at $ (i, j) $ results in $ s $ occupying an entire row, column, or diagonal.  \nFormally, output \"Yes you can.\" if  \n$$\n\\exists (i,j) \\in \\{0,1,2\\}^2 \\text{ s.t. } B[i][j] = \\cdot \\text{ and } s \\text{ wins after placing at } (i,j),\n$$  \notherwise output \"No you can't.\"","simple_statement":"Given your symbol (X or O) and a 3x3 tic-tac-toe board, check if you can win in one move. Print \"Yes you can.\" if you can, otherwise print \"No you can't.\"","has_page_source":false}