


Density map
There are given:
If [i, j] and [i', j'] are two positions in the table F, the distance between them is max(i  i', j  j'). The table W, n x n, should be computed, where W[i, j] (the number in ith column and jth line of the table W) is equal to the sum of all the numbers F[x,y], such that the distance between [x,y] and [i,j] is not greater than r. TaskWrite a program, which:
InputIn the first line of the text file MAP.IN there are two positive integers separated by a single space: n and r, where 0 <= r < n <= 250. In the following n lines the table F is described. Each of these lines contains n integers from the set {0,1}, separated by single spaces. The ith number written in (j+1)st line is equal to F[i, j]. OutputThe text file MAP.OUT should contain exactly n lines. In the jth line the values W[1, j]...W[n, j] should be written respectively; they should be separated by single spaces. ExampleFor the input file MAP.IN: 5 1 1 0 0 0 1 1 1 1 0 0 1 0 0 0 0 0 0 0 1 1 0 1 0 0 0 The correct answer is the output file MAP.OUT: 3 4 2 2 1 4 5 2 2 1 3 4 3 3 2 2 2 2 2 2 1 1 2 2 2 Print friendly version 