n=int(input())
aa=[]
x=[0]*10010
y=[0]*10010
count=0
for i in range(n):
aa.append(list(map(int,input().split())))
#print(aa)
bb=[]
maxn=-1
flag=0
'''
for i in range(n):
for j in range(n):
s=0
if aa[i][j]==0:
flag=1
for k in range(n):
s+=aa[i][k]+aa[k][j]
if s>maxn:
maxn=s
if flag==0:
print("Bad Game!")
else:
print(maxn)
'''
hang=[0]*n
lie=[0]*n
for i in range(n):
for j in range(n):
hang[i]+=aa[i][j]
lie[j]+=aa[i][j]
if aa[i][j]==0:
#print(i,j)
x[count]=i
y[count]=j
count+=1
flag=1
#print(hang)
#print(lie)
#print(x)
#print(y)
if flag==0:
print("Bad Game!")
else:
for i in range(count):
#print(x[i],y[i])
if hang[x[i]]+lie[y[i]]>maxn:
maxn=hang[x[i]]+lie[y[i]]
print(maxn)
题目不难,就是用python效率不高,提交老是超时,暴力枚举只能通过5个,中间改进的暴力解法只能通过7题,后来学了一种新方法,先将行列和一次算出来,这样就可以节省时间,终于全部AC了。