310968: CF1915B. Not Quite Latin Square

Memory Limit:256 MB Time Limit:1 S
Judge Style:Text Compare Creator:
Submit:2 Solved:0

Description

B. Not Quite Latin Squaretime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard output

A Latin square is a $3 \times 3$ grid made up of the letters $\texttt{A}$, $\texttt{B}$, and $\texttt{C}$ such that:

  • in each row, the letters $\texttt{A}$, $\texttt{B}$, and $\texttt{C}$ each appear once, and
  • in each column, the letters $\texttt{A}$, $\texttt{B}$, and $\texttt{C}$ each appear once.
For example, one possible Latin square is shown below. $$\begin{bmatrix} \texttt{A} & \texttt{B} & \texttt{C} \\ \texttt{C} & \texttt{A} & \texttt{B} \\ \texttt{B} & \texttt{C} & \texttt{A} \\ \end{bmatrix}$$

You are given a Latin square, but one of the letters was replaced with a question mark $\texttt{?}$. Find the letter that was replaced.

Input

The first line of the input contains a single integer $t$ ($1 \leq t \leq 108$) — the number of testcases.

Each test case contains three lines, each consisting of three characters, representing the Latin square. Each character is one of $\texttt{A}$, $\texttt{B}$, $\texttt{C}$, or $\texttt{?}$.

Each test case is a Latin square with exactly one of the letters replaced with a question mark $\texttt{?}$.

Output

For each test case, output the letter that was replaced.

ExampleInput
3
ABC
C?B
BCA
BCA
CA?
ABC
?AB
BCA
ABC
Output
A
B
C
Note

The correct Latin squares for the three test cases are shown below:

$$\begin{bmatrix} \texttt{A} & \texttt{B} & \texttt{C} \\ \texttt{C} & \color{red}{\texttt{A}} & \texttt{B} \\ \texttt{B} & \texttt{C} & \texttt{A} \\ \end{bmatrix} \quad \begin{bmatrix} \texttt{B} & \texttt{C} & \texttt{A} \\ \texttt{C} & \texttt{A} & \color{red}{\texttt{B}} \\ \texttt{A} & \texttt{B} & \texttt{C} \\ \end{bmatrix} \quad \begin{bmatrix} \color{red}{\texttt{C}} & \texttt{A} & \texttt{B} \\ \texttt{B} & \texttt{C} & \texttt{A} \\ \texttt{A} & \texttt{B} & \texttt{C} \\ \end{bmatrix}$$

Output

题目大意:
一个3x3的拉丁方阵由字母A、B、C组成,要求每一行和每一列中A、B、C各出现一次。现在给定一个拉丁方阵,其中一个字母被“?”替代,需要找出被替代的字母。

输入数据格式:
第一行输入一个整数t(1≤t≤10^8),代表测试用例的数量。
接下来每个测试用例包含3行,每行3个字符,代表一个拉丁方阵,字符只能是A、B、C或“?”。
每个测试用例中恰好有一个字母被“?”替代。

输出数据格式:
对于每个测试用例,输出被替代的字母。

示例输入输出:
输入:
3
ABC
C?B
BCA
BCA
CA?
ABC
?AB
BCA
ABC

输出:
A
B
C题目大意: 一个3x3的拉丁方阵由字母A、B、C组成,要求每一行和每一列中A、B、C各出现一次。现在给定一个拉丁方阵,其中一个字母被“?”替代,需要找出被替代的字母。 输入数据格式: 第一行输入一个整数t(1≤t≤10^8),代表测试用例的数量。 接下来每个测试用例包含3行,每行3个字符,代表一个拉丁方阵,字符只能是A、B、C或“?”。 每个测试用例中恰好有一个字母被“?”替代。 输出数据格式: 对于每个测试用例,输出被替代的字母。 示例输入输出: 输入: 3 ABC C?B BCA BCA CA? ABC ?AB BCA ABC 输出: A B C

加入题单

上一题 下一题 算法标签: