1912.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 1912 on 2005-12-08 at 16:28:45 */ 
#include <cstdio>

const int MAX = 256;

int main()
{
	int f[MAX][MAX], w[MAX][MAX];
	int n, r, i, j;
	
	for(i = 0; i < MAX; i++) {
		w[i][0] = w[0][i] = 0;
	}
	while(scanf("%d %d", &n ,&r) != EOF) {
		for(i = 0; i < n; i++) {
			int sum = 0;
			for(j = 0; j < n; j++) {
				scanf("%d", &f[i][j]);
				sum += f[i][j];
				w[i+1][j+1] = w[i][j+1] + sum;
			}
		}
		for(i = 0; i < n; i++) {
			for(j = 0; j < n; j++) {
				int lux = (i-r) > 0 ? (i-r) : 0;
				int luy = (j-r) > 0 ? (j-r) : 0;
				int drx = (i+r) < n ? (i+r+1) : n;
				int dry = (j+r) < n ? (j+r+1) : n;
				printf("%d", w[drx][dry]+w[lux][luy]-w[drx][luy]-w[lux][dry]);
				if(j == n-1) {
					putchar('\n');
				} else {
					putchar(' ');
				}
			}
		}
	}
	
	return 0;
}