CF1906A.Easy As ABC
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are playing a word puzzle. The puzzle starts with a 3 by 3 grid, where each cell contains either the letter A, B, or C.
The goal of this puzzle is to find the lexicographically smallest possible word of length 3 . The word can be formed by choosing three different cells where the cell containing the first letter is adjacent to the cell containing the second letter, and the cell containing the second letter is adjacent to the cell containing the third letter.
Two cells are adjacent to each other if they share a border or a corner, as shown in the following illustration. Formally, if (r,c) denotes the cell in the r -th row and c -th column, then cell (r,c) is adjacent to cell (r,c+1) , (r−1,c+1) , (r−1,c) , (r−1,c−1) , (r,c−1) , (r+1,c−1) , (r+1,c) , and (r+1,c+1) .
Determine the lexicographically smallest possible word of length 3 that you can find within the grid.
A string s of length n is lexicographically smaller than string t of the same length if there exists an integer 1≤i≤n such that sj=tj for all 1≤j<i , and si<ti in alphabetical order. The following illustration shows some examples on some grids and their the lexicographically smallest possible word of length 3 that you can find within the grids.
输入格式
Input consists of three lines, each containing three letters, representing the puzzle grid. Each letter in the grid can only be either A, B, or C.
输出格式
Output the lexicographically smallest possible word of length 3 that you can find within the grid.
输入输出样例
输入#1
BCB CAC BCB
输出#1
ABC
输入#2
BCB CCC CCA
输出#2
ACB
输入#3
ACA CBC ACA
输出#3
ABA
输入#4
ACA CAC ACA
输出#4
AAA
输入#5
CCC CBC CCC
输出#5
BCC