poj_2339

参考：https://blog.csdn.net/yzl_rex/article/details/7600906

https://blog.csdn.net/acm_JL/article/details/50200355

https://blog.csdn.net/qq_35040828/article/details/71123521

https://zhidao.baidu.com/question/49762862.html

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int N=105;
char old[N][N],news[N][N];//old存旧数组，news存新数组
int dir[2][4]={{-1,0,1,0},{0,1,0,-1}};//周围四个格
int r,l,n;
int lawful(int x,int y)//判断是否超出边界
{
    if (x>=0&&x<r&&y>=0&&y<l)
    {
        return 1;
    }
    else
    {
        return 0;
    }
}
char change(int x,int y)//依据规则改变
{
    for (int i=0;i<4;i++)
    {
        int xx=x+dir[0][i];
        int yy=y+dir[1][i];
        if (lawful(xx,yy))
        {
            if (old[xx][yy]=='R'&&old[x][y]=='S')
            {
                return 'R';
            }
            else if (old[xx][yy]=='S'&&old[x][y]=='P')
            {
                return 'S';
            }
            else if (old[xx][yy]=='P'&&old[x][y]=='R')
            {
                return 'P';
            }
        }
    }
    return old[x][y];
}
int main()
{
    int t;
//    freopen("bin.txt","r",stdin);
    while (cin>>t)
    {
        while (t--)
        {
            cin>>r>>l>>n;
            memset(old,0,sizeof(old));
            memset(news,0,sizeof(news));
            for (int i=0;i<r;i++)
            {
                for (int j=0;j<l;j++)
                {
                    cin>>old[i][j];
                }
            }
            for (int i=0;i<n;i++)
            {
                for (int j=0;j<r;j++)
                {
                    for (int k=0;k<l;k++)
                    {
                        news[j][k]=change(j,k);//更新news
                    }
                }
                memcpy(old,news,sizeof(news));
            }
            for (int i=0;i<r;i++)
            {
                for (int j=0;j<l;j++)
                {
                    cout<<old[i][j];
                }
                cout<<endl;
            }
            cout<<endl;
        }
    }

    return 0;
}