Buggy python submission (verdict: Runtime Error):
c = []
for i in range(3):
    x, y, z = map(int, input().split())
    c.append(x)
    c.append(y)
    c.append(z)

for a1 in range(100):
    for a2 in range(100):
        for a3 in range(100):
            b1 = c[0] - a1
            b2 = c[1] - a2
            b3 = c[2] - a3
            if c[4] == a2 + b1 and c[5] == a2 + b2 and c[6] == a2 + b3 and c[7] == a3 + b1 and c[8] == a3 + b2 and c[9] == a3 + b3:
                print('Yes')
                exit()
print('No')


Fixed submission:
c = []
for i in range(3):
    x, y, z = map(int, input().split())
    c.append(x)
    c.append(y)
    c.append(z)

for a1 in range(101):
    for a2 in range(101):
        for a3 in range(101):
            b1 = c[0] - a1
            b2 = c[1] - a1
            b3 = c[2] - a1
            if c[3] == a2 + b1 and c[4] == a2 + b2 and c[5] == a2 + b3 and c[6] == a3 + b1 and c[7] == a3 + b2 and c[8] == a3 + b3:
                print('Yes')
                exit()
print('No')

Buggy python submission (verdict: Time Limit Exceeded):
c = []
for i in range(3):
    x, y, z = map(int, input().split())
    c.append(x)
    c.append(y)
    c.append(z)

I = max(c[0:3]) + 1
J = max(c[3:6]) + 1
K = max(c[6:9]) + 1
L = max(c[0], c[3], c[6]) + 1
M = max(c[1], c[4], c[7]) + 1
N = max(c[2], c[5], c[8]) + 1

for i in range(I):
    for j in range(J):
        for k in range(K):
            for l in range(L):
                for m in range(M):
                    for n in range(N):
                        if c[0] == i + l and c[1] == i + m and c[2] == i + n and c[3] == j + l and c[4] == j + m and c[5] == j + n and c[6] == k + l and c[7] == k + m and c[8] == k + n:
                            print('Yes')
                            exit()
print('No')


Fixed submission:
c = []
for i in range(3):
    x, y, z = map(int, input().split())
    c.append(x)
    c.append(y)
    c.append(z)

for a1 in range(101):
    for a2 in range(101):
        for a3 in range(101):
            b1 = c[0] - a1
            b2 = c[1] - a1
            b3 = c[2] - a1
            if c[3] == a2 + b1 and c[4] == a2 + b2 and c[5] == a2 + b3 and c[6] == a3 + b1 and c[7] == a3 + b2 and c[8] == a3 + b3:
                print('Yes')
                exit()
print('No')

Buggy python submission (verdict: Time Limit Exceeded):
c = []
for i in range(3):
    x, y, z = map(int, input().split())
    c.append(x)
    c.append(y)
    c.append(z)

max_c = max(c) + 1

for i in range(max_c):
    for j in range(max_c):
        for k in range(max_c):
            for l in range(max_c):
                for m in range(max_c):
                    for n in range(max_c):
                        if c[0] == i + l and c[1] == i + m and c[2] == i + n and c[3] == j + l and c[4] == j + m and c[5] == j + n and c[6] == k + l and c[7] == k + m and c[8] == k + n:
                            print('Yes')
                            exit()
print('No')


Fixed submission:
c = []
for i in range(3):
    x, y, z = map(int, input().split())
    c.append(x)
    c.append(y)
    c.append(z)

for a1 in range(101):
    for a2 in range(101):
        for a3 in range(101):
            b1 = c[0] - a1
            b2 = c[1] - a1
            b3 = c[2] - a1
            if c[3] == a2 + b1 and c[4] == a2 + b2 and c[5] == a2 + b3 and c[6] == a3 + b1 and c[7] == a3 + b2 and c[8] == a3 + b3:
                print('Yes')
                exit()
print('No')