codeforce -14A A. Letter
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" #include "string.h" #include "stdlib.h" char mapx[55][55]; int a,b; int is_emh( int i ) { { int k=0,j; for ( j=0; j<b; j++ ) { if ( mapx[i][j]=='.' ) k++; } if ( k==b ) return 1; return 0; } } int is_eml( int i ) { { int k=0; int j; for ( j=0; j<a; j++ ) { if ( mapx[j][i]=='.' ) k++; } if ( k==a ) return 1; return 0; } } int main( ) { int i,j; while ( ~scanf( "%d%d",&a,&b ) ) { for ( i=0; i<a; i++ ) { scanf( "%s",&mapx[i] ); } for ( i=0; i<a; i++ ) { if ( is_emh( i ) ) continue; for ( j=0; j<b; j++ ) { if ( is_eml( j ) ) continue; printf("%c",mapx[i][j]); } printf("\n"); } } return 0; }
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· 开发者必知的日志记录最佳实践
· SQL Server 2025 AI相关能力初探
· Linux系列:如何用 C#调用 C方法造成内存泄露
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 被坑几百块钱后,我竟然真的恢复了删除的微信聊天记录!
· 没有Manus邀请码?试试免邀请码的MGX或者开源的OpenManus吧
· 【自荐】一款简洁、开源的在线白板工具 Drawnix
· 园子的第一款AI主题卫衣上架——"HELLO! HOW CAN I ASSIST YOU TODAY
· Docker 太简单,K8s 太复杂?w7panel 让容器管理更轻松!