CodeForces-4A-Letter
2016-05-31 22:27
267 查看
Description
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.
Input
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
Output the required rectangle of the minimum cost. Study the output data in the sample tests to understand the output format better.
Sample Input
Input
Output
Input
Output
就是找最大的*和最小的*,然后输出期间,暴力解决
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
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;
}
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.
Input
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
Output the required rectangle of the minimum cost. Study the output data in the sample tests to understand the output format better.
Sample Input
Input
6 7 ....... ..***.. ..*.... ..***.. ..*.... ..***..
Output
*** *.. *** *.. ***
Input
3 3 *** *.* ***
Output
*** *.* ***
就是找最大的*和最小的*,然后输出期间,暴力解决
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
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;
}
相关文章推荐
- Android中的软件Watchdog
- shell之tr
- OpenGL与OpenCV实现增强现实
- iOS开发UI篇—UIScrollView控件实现图片缩放功能
- 【bzoj4385】[POI2015]Wilcze doły
- 推荐系统_全
- PHP检测url重定向的最终地址
- TFS 10周年生日快乐 – TFS与布莱恩大叔的故事
- css手风琴效果
- box-shadow讲解
- 深度学习实战——人脸识别
- hdoj-1754-I Hate It
- Java之多线程
- spry菜单栏(二)
- TFS 10周年生日快乐 – TFS与布莱恩大叔的故事
- 【DevOps敏捷开发动手实验】开源文档 v2015.2 stable 版发布
- Spring AOP 最终版实现
- 34 Search for a Range
- Java对象的序列化
- 【原创:毕业意味着什么】