codefores 14A
来源:互联网 发布:手机淘宝怎样注册网店 编辑:程序博客网 时间:2024/06/03 16:55
Description
A boy Bob likes to draw. Not long ago he bought a rectangular graph (checked) sheet withn 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 andm (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
6 7.........***....*......***....*......***..
****..****..***
3 3****.****
****.****
#include<iostream>#include<string>#include<cstdio>#include<cstring>#include<cstdlib>#include<algorithm>#include<cmath>using namespace std;char a[101][101];int n,m;int tx,ty,xx,tt;int main(){cin>>n>>m;for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){cin>>a[j][i];}}for(int i=1;i<=n;i++){for(int j=1;j<=m;j++){if(a[j][i]=='*'){tx=i;break;}}}for(int i=n;i>=1;i--){for(int j=1;j<=m;j++){if(a[j][i]=='*'){ty=i;break;}}}for(int i=1;i<=m;i++){for(int j=1;j<=n;j++){if(a[i][j]=='*'){tt=i;break;}}}for(int i=m;i>=1;i--){for(int j=1;j<=n;j++){if(a[i][j]=='*'){xx=i;break;}}}for(int i=ty;i<=tx;i++){for(int j=xx;j<=tt;j++){cout<<a[j][i];}cout<<endl;}return 0;}
- codefores 14A
- Codefores 539A 字符串基础
- The Monster (Codefores-787A)
- codefores 13A(进制数和最大公约数)
- Codefores 398A Cards(贪心+暴力)
- Codefores Good Bye 2014 - A,B,C
- 【codefores 587 E】Duff as a Queen——线段树+线性基
- Codefores #185E (div1) Biologist
- codefores 352 D. Robin Hood
- codefores 352 C. Recycling Bottles
- Codefores Round #419 (Div.2)
- codefores #267C George and Job(dp)
- codefores 73C LionAge II (dp)
- CodeFores 665D Simple Subset(贪心)
- codefores New Year Cards(模拟题)
- Codefores 785E Anton and Permutation(分块)
- Codefores 821C Okabe and Boxes
- codefores 834B The Festive Evening
- 《TCP/IP详解--卷1:协议》读书笔记一(持续更新)
- php文件操作的总结
- 《鸟哥的linux私房菜》笔记之例行性工作排程(crontab/at)
- 【java学习】java中字符串转换编码的代码片段
- 在php中XML 的读,写,删除,修改的操作
- codefores 14A
- [小结]遇到的各种错误。。希望下次别再犯
- php 文件上传类
- element.addEventListener DOM事件模型
- 被Visual Studio 2008 Release配置下的调试功能“忽悠”了
- 行人检测简述
- 在window下使用linux工具
- 读取文件路径
- 在godaddy上注册的域名安全吗?