Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Nearest number - 2
Description Input is the matrix A of N by N non-negative integers.
A distance between two elements A _{ij} and A_{pq} is defined as |i − p| + |j − q|.
Your program must replace each zero element in the matrix with the nearest non-zero one. If there are two or more nearest non-zeroes, the zero must be left in place. Constraints
1 ≤ N ≤ 200, 0 ≤ Ai ≤ 1000000 Input Input contains the number N followed by N ^{2} integers, representing the matrix row-by-row. Output Output must contain N ^{2} integers, representing the modified matrix row-by-row. Sample Input 3 0 0 0 1 0 2 0 3 0 Sample Output 1 0 2 1 0 2 0 3 0 Source Northeastern Europe 2003, Far-Eastern Subregion |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator