A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet with n rows and m columns. Bob shaded some of the squares on the sheet. Having seen his masterpiece, he decided to share it with his elder brother, who lives in Flatland. Now Bob has to send his picture by post, but because of the world economic crisis and high oil prices, he wants to send his creation, but to spend as little money as possible. For each sent square of paper (no matter whether it is shaded or not) Bob has to pay 3.14 burles. Please, help Bob cut out of his masterpiece a rectangle of the minimum cost, that will contain all the shaded squares. The rectangle's sides should be parallel to the sheet's sides.
The first line of the input data contains numbers n and m (1 ≤ n, m ≤ 50), n — amount of lines, and m — amount of columns on Bob's sheet. The following n lines contain m characters each. Character «.» stands for a non-shaded square on the sheet, and «*» — for a shaded square. It is guaranteed that Bob has shaded at least one square.
Output the required rectangle of the minimum cost. Study the output data in the sample tests to understand the output format better.
6 7 ....... ..***.. ..*.... ..***.. ..*.... ..***..
*** *.. *** *.. ***
3 3 *** *.* ***
*** *.* ***
解题说明:此题是一道图形题,要求找到包含所有星号的最小的矩形,可以通过遍历图中的每个位置,确定出星号的位置,最终得出一个矩形。
#include<stdio.h>
int main()
{
char dizi[55][55],c;
int k,n,m,i,j,maxx=-999999,maxy=-999999,minx=99999,miny=999999,sayac=0;
scanf("%d %d",&n,&m);
for(i=0;i<n;i++)
{
scanf("%s",dizi[i]);
}
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
if(dizi[i][j]=='*')
{
if(i<=minx)
{
minx=i;
}
if(i>=maxx)
{
maxx=i;
}
if(j<=miny)
{
miny=j;
}
if(j>=maxy)
{
maxy=j;
}
}
}
}
for(i=minx;i<=maxx;i++)
{
for(j=miny;j<=maxy;j++)
{
printf("%c",dizi[i][j]);
}
printf("\n");
}
return 0;
}