由于没学二维数组所以就没用
但是我对着题解看了好几遍也看不出来哪里错啊！！

#include <bits/stdc++.h>
using namespace std;

int n, k, cnt = 0;
long long maxn = 0, x[1005], y[1005];
struct node
{
	int x, y;
} di[1005];

int main()
{
	cin >> n;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= n; j++)
		{
			cin >> k;
			x[i] += k;
			y[j] += k;
			if (k == 0)
			{
				di[i].x = j;
				di[i].y = i;
				cnt++;
			}
		}
	}
	if (cnt == 0)
	{
		cout << "Bad Game!" << endl;
		return 0;
	}
	
	for (int i = 1; i <= cnt; i++)
		maxn = max(x[di[i].x] + y[di[i].y], maxn);
	
	cout << maxn << endl;
	
	return 0;
}