codeforce -14A A. Letter

本文指导如何在有限预算下,从矩形纸上裁剪出包含所有阴影区域的最小成本矩形图案。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

A. Letter
time limit per test
1 second
memory limit per test
64 megabytes
input
standard input
output
standard output

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 test(s)
input
6 7
.......
..***..
..*....
..***..
..*....
..***..
output
***
*..
***
*..
***
input
3 3
***
*.*
***
output
***
*.*
***

代码

#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;
	}


转载于:https://www.cnblogs.com/slankka/p/9158630.html

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值