2579.txt

来自「北大ACM题目例程 详细的解答过程 程序实现 算法分析」· 文本 代码 · 共 36 行

Problem Id:2579  User Id:fzk 
Memory:24K  Time:0MS
Language:C++  Result:Accepted

Source 

#include"stdio.h"
char map[10][10];

int main()
{
	int i, j, m, n;

	scanf( "%*s" );
	while( scanf( "%d %d", &n, &m ) == 2 )
	{
		for( i=0; i<n; i++ )
			scanf( "%s", &map[i] );
		
		for( i=0; i<n-1; i++ )
		{
			for( j=0; j<m-1; j++ )
				printf( "%d", ( (int)map[i][j] + map[i+1][j] + map[i][j+1] + map[i+1][j+1] - (int)'0'*4 ) / 4 );

			printf( "\n" );
		}
		
		scanf( "%*s" );
		scanf( "%*s" );
	}

	return 0;
}