题目

链接

https://www.luogu.com.cn/problem/CF1692C

字面描述

题面翻译

题目描述

有一个 $8\times8$ 的棋盘，列编号从左到右递增，行编号从上到下递增。

给出一个棋盘，上面用 $KaTeX parse error: Expected 'EOF', got '#' at position 1: #̲$ 标明了主教的攻击范围。请你找出主教的位置坐标，并输出其行、列编号。

保证：主教的行、列编号均在 $2$ 与 $7$ 之间。

你需要回答 $t$ 组测试数据。 $(1\le t \le 36)$

题目描述

Mihai has an $ 8 \times 8 $ chessboard whose rows are numbered from $ 1 $ to $ 8 $ from top to bottom and whose columns are numbered from $ 1 $ to $ 8 $ from left to right.

Mihai has placed exactly one bishop on the chessboard. The bishop is not placed on the edges of the board. (In other words, the row and column of the bishop are between $ 2 $ and $ 7 $ , inclusive.)

The bishop attacks in all directions diagonally, and there is no limit to the distance which the bishop can attack. Note that the cell on which the bishop is placed is also considered attacked.

An example of a bishop on a chessboard. The squares it attacks are marked in red.Mihai has marked all squares the bishop attacks, but forgot where the bishop was! Help Mihai find the position of the bishop.

输入格式

The first line of the input contains a single integer $ t $ ( $ 1 \leq t \leq 36 $ ) — the number of test cases. The description of test cases follows. There is an empty line before each test case.

Each test case consists of $ 8 $ lines, each containing $ 8 $ characters. Each of these characters is either ‘#’ or ‘.’, denoting a square under attack and a square not under attack, respectively.

输出格式

For each test case, output two integers $ r $ and $ c $ ( $ 2 \leq r, c \leq 7 $ ) — the row and column of the bishop.

The input is generated in such a way that there is always exactly one possible location of the bishop that is not on the edge of the board.

样例 #1

样例输入 #1

3

.....#..
#...#...
.#.#....
..#.....
.#.#....
#...#...
.....#..
......#.

#.#.....
.#......
#.#.....
...#....
....#...
.....#..
......#.
.......#

.#.....#
..#...#.
...#.#..
....#...
...#.#..
..#...#.
.#.....#
#.......

样例输出 #1

4 3
2 2
4 5

提示

The first test case is pictured in the statement. Since the bishop lies in the intersection row $ 4 $ and column $ 3 $ , the correct output is 4 3.

代码实现

遍历每一个点看他的四个角和本身是不是"#"即可

#include<bits/stdc++.h>
using namespace std;

const int maxn=20;
int t;
char a[maxn][maxn];
inline bool inbound(int x,int y){return x>=1&&x<=8&&y>=1&&y<=8;}
int main(){
	scanf("%d",&t);
	while(t--){
		for(int i=1;i<=8;i++){
			for(int j=1;j<=8;j++)scanf(" %c",&a[i][j]);
		}
		bool flag=false;
		for(int i=1;i<=8;i++){
			for(int j=1;j<=8;j++){
				if(a[i][j]=='#'&&a[i-1][j+1]=='#'&&a[i-1][j-1]=='#'&&a[i+1][j-1]=='#'&&a[i+1][j+1]=='#'){
					printf("%d %d\n",i,j);
					break;
				}
			}
			if(flag)break;
		}
	}
	return 0;
}