蓝桥杯 扩散

Code

ans = 0

for x in range(-2020, 2020 + 2020 + 1):
    for y in range(-2020, 2020 + 2020 + 1):
        for x_, y_ in [(0, 0), (2020, 11), (11, 14), (2000, 2000)]:
             # 求曼哈顿距离,即横纵坐标每加一都要传播一次
            if abs(x - x_)+abs(y - y_) <= 2020:
                ans += 1
                break # 不重复传播
print(ans)

Result

20312088