View Code of Problem 3569

#include<stdio.h>
#define N 100
int main()
{
	int a[N][N];
	int T;
	scanf("%d", &T);
	int round;
	int n, i, j;
	int sum;
	int i1, j1, i2, j2;
	int MAX ;
	for (round = 1; round <= T; round++)
	{
		
		scanf("%d", &n);
		for (i = 0; i < n; i++)
			for (j = 0; j < n; j++)
			{
				if (j == n - 1)scanf("%d", &a[i][j]);
				else
					scanf("%d ", &a[i][j]);
			}
		MAX = a[0][0];
		for (i1 = 0; i1 < n - 1; i1++)
			for (j1 = 0; j1 < n - 1; j1++)
				for (i2 = 1; i2 < n; i2++)
					for (j2 = 1; j2 < n; j2++)
					{
						sum = 0;
						for (i = i1; i <= i2; i++)
							for (j = j1; j <= j2; j++)
							{
								sum = sum + a[i][j];
								
							}
						if (sum > MAX)MAX = sum;
					}
		printf("%d", MAX);
			
			
	}
	return 0;
}