
ZOJ Problem Set  1636
Given a matrix, the elements of which are all integer number from 0 to 50, you are required to evaluate the square sum of its specified submatrix. The first line of the input contains a single integer T (1 <= T <= 5), the number of test cases. For each test case, the first line contains two integers m and n (1 <= m, n <= 500), which are the row and column sizes of the matrix, respectively. The next m lines with n numbers each gives the elements of the matrix. The next line contains a single integer N (1 <= N <= 100,000), the number of queries. The next N lines give one query on each line, with four integers r1, c1, r2, c2 (1 <= r1 <= r2 <= m, 1 <= c1 <= c2 <= n), which are the indices of the upperleft corner and lowerright corner of the submatrix in question. For each test case, first print the number of the test case, then N lines with one number on each line, the required square sum. Refer to the sample output for details. 2 2 3 1 2 3 4 5 6 2 1 1 2 2 1 3 2 3 3 3 4 2 3 2 5 1 7 9 2 1 1 1 3 3 Case 1: 46 45 Case 2: 193
Author: DU, Peng Source: Zhejiang University Local Contest 2003 