zoukankan      html  css  js  c++  java
  • codeforce -14A A. Letter

    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("
    ");
    			}
    		}
    	return 0;
    	}
    


  • 相关阅读:
    归并排序
    将文件存储到数据库中(MySQL)
    JS实现日历控件选择后自动填充
    HDU 1358 Period KMP
    Adobe Flash Player已经终止一项可能不安全的操作,解决方案
    将文件从数据库(MySQL)中进行读取
    Ubuntu java开发环境配置
    硬盘结构和原理
    杭电 HDU 1242 Rescue
    mysql workbench建表时PK,NN,UQ,BIN,UN,ZF,AI
  • 原文地址:https://www.cnblogs.com/slankka/p/9158630.html
Copyright © 2011-2022 走看看