1097 : [기초-종합+배열] 바둑알 십자 뒤집기

# Python3

# 1097 : [기초-종합+배열] 바둑알 십자 뒤집기

# https://codeup.kr/problem.php?id=1097

 

MAX_VALUE = 19

data = [[0 for i in range(MAX_VALUE)] for j in range(MAX_VALUE)]

 

for i in range(MAX_VALUE):

    temp = list(map(int, input().split()))

    for j in range(MAX_VALUE):

        data[i][j] = temp[j]

 

n = int(input())

 

for i in range(n):

    x, y = map(int, input().split())

 

    for k in range(MAX_VALUE):

        if data[x - 1][k] == 1:

            data[x - 1][k] = 0

        elif data[x - 1][k] == 0:

            data[x - 1][k] = 1

 

    for k in range(MAX_VALUE):

        if data[k][y - 1] == 1:

            data[k][y - 1] = 0

        elif data[k][y - 1] == 0:

            data[k][y - 1] = 1

 

for i in range(MAX_VALUE):

    for j in range(MAX_VALUE):

        print(data[i][j], end=' ')

    print(end='\n')