题解

只需模拟一下就行了

#include<bits/stdc++.h>
using namespace std;
int n,m,g;
char a[30][30];
void grow(){
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            if(a[i][j] == 'g'){
                a[i + 1][j] = 'n';
                a[i - 1][j] = 'n';
                a[i][j + 1] = 'n';
                a[i][j - 1] = 'n';
            }
        }
    }
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            if(a[i][j] == 'n') a[i][j] = 'g';
        }
    }
    return ;
}
int main(){
    cin >> n >> m;
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            cin >> a[i][j];
        }
    }
    cin >> g;
    while(g--) grow();
    for(int i = 1;i <= n;i++){
        for(int j = 1;j <= m;j++){
            cout << a[i][j];
        }
        cout << endl;
    }
    return 0;
}