A. Find Square

最新推荐文章于 2019-05-02 16:57:35 发布

chen_zan_yu

最新推荐文章于 2019-05-02 16:57:35 发布

阅读量193

点赞数

CC 4.0 BY-SA版权

分类专栏： CF

本文链接：https://blog.youkuaiyun.com/qq_41374539/article/details/82635186

CF 专栏收录该内容

14 篇文章

订阅专栏

本文介绍了一种算法，用于在一个初始全为白色的表格中找出一个黑色的奇数边长正方形，并确定其几何中心的位置。输入包括表格的尺寸及各单元格的颜色，输出则为黑色正方形中心的坐标。

A. Find Square

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Consider a table of size n×mn×m, initially fully white. Rows are numbered 11 through nn from top to bottom, columns 11 through mm from left to right. Some square inside the table with odd side length was painted black. Find the center of this square.

Input

The first line contains two integers nn and mm (1≤n,m≤1151≤n,m≤115) — the number of rows and the number of columns in the table.

The ii-th of the next nn lines contains a string of mm characters si1si2…simsi1si2…sim (sijsij is 'W' for white cells and 'B' for black cells), describing the ii-th row of the table.

Output

Output two integers rr and cc (1≤r≤n1≤r≤n, 1≤c≤m1≤c≤m) separated by a space — the row and column numbers of the center of the black square.

Examples

input

Copy

5 6
WWBBBW
WWBBBW
WWBBBW
WWWWWW
WWWWWW

output

Copy

2 4

input

Copy

3 3
WWW
BWW
WWW

output

Copy

2 1

#include<iostream>
#include<stdio.h>
#include<map>
#include<math.h>
using namespace std;
const int N=101;
int main()
{
    int n,m;
    scanf("%d%d",&n,&m);
    int i,j;
    char s;
    int ans=0;
    int x=0,y=0;
    for(i=1; i<=n; i++)
    {
        for(j=1; j<=m; j++)
        {cin>>s;
            if(s=='B')
            {
                x+=i;
                y+=j;
                ans++;
            }
        }
    }
    printf("%d %d\n",x/ans,y/ans);
    return 0;
}