※ 引述《Sugarwithkis (sugarwithkis)》之铭言：
: 最后一题看了一个小时
: 还是没解出来
: 不过前面都有过
: 手写题output看起来也对
: 应该还有90
: 姆咪
: https://i.imgur.com/1SoyCE8.jpg
不知道你用什么语言 先帮你用python暴力破解
bingleList = [0] * 25
def main():
print('Output: ', bingle())
def bingle():
numbers = input('Input: ').split(' ')
numbers = [int(n) for n in numbers]
# 11条内不会bingle不用检查
for n in numbers[:11]:
bingleList[n - 1] = 1
for n in numbers[11:]:
line = 0
bingleList[n - 1] = 1
# 算横的
for i in range(5):
c = 0
for j in range(5):
c += bingleList[i * 5 + j]
if c == 5:
line += 1
# 算直得
for i in range(5):
c = 0
for j in range(5):
c += bingleList[j * 5 + i]
if c == 5:
line += 1
# 算斜率1那条
c = 0
for i in range(5):
c += bingleList[i * 6]
if c == 5:
line += 1
# 算斜率-1那条
c = 0
for i in range(1, 6):
c += bingleList[i * 4]
if c == 5:
line += 1
# 检查几条线
if line >= 3:
return numbers.index(n) + 1
return 'No'
if __name__ == "__main__":
main()
大概长这样 但速率应该不会很好