天梯练习 7-19 福到了

#include <iostream>

using namespace std;

char a[110][110];

int main(){
    
    char c;
    int n;
    cin >> c >> n;
    getchar();
    for(int i = 1; i <= n; i ++ ){
        for(int j = 1; j <= n; j ++ ){
            scanf("%c", &a[i][j]);
        }
        getchar();
    }
    
    
    
    bool flag = false;
    for(int i = 1; i <= n; i ++ ){
        for(int j = 1; j <= n ;j ++ ){
            if(a[i][j] != a[n - i + 1][n - j + 1]) flag = true;
        }
    }
    
    if(!flag) cout << "bu yong dao le" << endl;
    
    for(int i = 1; i <= n; i ++ ){
        for(int j = 1; j <= n; j ++ ){
            if(a[n - i + 1][n - j + 1] == '@') cout << c;
            else cout << " ";
        }
        cout << endl;
    }

    
    return 0;
}