def cp(r,c):
if d[r][c] >0:
d[r][c] = -d[r][c]
h =[0]*5
for i in range(5):
cn = 0
for j in range(5):
if d[i][j]<0:cn+=1
if cn==5:h[i]=1
v =[0]*5
for i in range(5):
cn = 0
for j in range(5):
if d[j][i]<0:cn+=1
if cn==5:v[i]=1
x =[0]*2
cn = 0
for i in range(5):
for j in range(5):
if i==j and d[i][j]<0:cn+=1
if cn==5:x[0]=1
cn = 0
for i in range(5):
for j in range(5):
if 4==i+j and d[i][j]<0:cn+=1
if cn==5:x[1]=1
d[r][c] = -d[r][c]
return sum(h)+sum(v)+sum(x)
else:
return 0
d = []
for i in range(5):
dd = [int(i) for i in input().split()]
d.append(dd)
# print(d)
dd = int(input())
while dd!=-1:
for i in range(5):
for j in range(5):
if d[i][j]==dd:
d[i][j]=-d[i][j]
dd = int(input())
# for i in d:
# for j in i:
# print(j,end='\t')
# print()
q =[ [0]*5 for _ in range(5)]
mr,mc = 0,0
mq = 0
for r in range(5):
for c in range(5):
q[r][c]=cp(r,c)
if q[r][c]>mq:
mq = q[r][c]
mr,mc =r,c
if q[r][c]==mq and d[r][c]<d[mr][mc]:
mq = q[r][c]
mr,mc =r,c
# for i in q:
# print(i)
# print(mr,mc)
print(d[mr][mc])
# Output:
# 6
沒有留言:
張貼留言