2891: 矩阵剪刀石头布

解题思路:

注意事项:

参考代码:

from copy import deepcopy

r,c,day = map(int,input().split())

matrix = [[i for i in input().strip()] for _ in range(r)]

dx = [0,0,-1,1]

dy = [-1,1,0,0]

for _ in range(day):

    tmp = deepcopy(matrix)

    for i in range(r):

        for j in range(c):

            for k in range(4):

                tx = i + dx[k]

                ty = j + dy[k]

                if 0<=tx<=r-1 and 0<=ty<=c-1:

                    if matrix[i][j]=='R' and matrix[tx][ty]=='S':

                        tmp[tx][ty] = 'R'

                    if matrix[i][j]=='S' and matrix[tx][ty]=='P':

                        tmp[tx][ty] = 'S'

                    if matrix[i][j]=='P' and matrix[tx][ty]=='R':

                        tmp[tx][ty] = 'P'

    matrix = tmp

for i in range(r):

    for j in range(c):

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

    print()