Time Limit: Java: 2000 ms / Others: 2000 ms
Memory Limit: Java: 65536 KB / Others: 65536 KB
Given an n*n matrix A, whose entries Ai,j are integer numbers ( 0 <= i SHIFT at row i ( 0 <= i
You can do the SHIFT operation at arbitrary row, and as many times as you like. Your task is to minimize
The input consists of several test cases. The first line of each test case contains an integer n. Each of the following n lines contains n integers, indicating the matrix A. The input is terminated by a single line with an integer -1. You may assume that 1 <= n <= 7 and |Ai,j| 4.