P1101 单词方阵 （单词方阵）

思路：就是白白的模拟

#include<iostream>
using namespace std;
int f[][];
char cc[][];
char kk[] = "yizhong";
int n;

void ff(int x, int y, int a, int b){
    bool flag = ;
    int xx, yy;
    for (int i = ; i < ; ++i){
        xx = x + a*i; yy = y + b*i;
        if (!(xx >=  && xx < n&&yy >=  && yy < n) || (cc[xx][yy] != kk[i])){ flag = ; break; }
    }
    if (flag)for (int i = ; i < ; ++i){
        xx = x + a*i; yy = y + b*i;
        f[xx][yy] = ;
    }
}

int main(){
    cin >> n;
    for (int i = ; i < n; ++i)
        cin >> cc[i];
    for (int i = ; i < n;++i)
    for (int j = ; j < n;++j)
    if (cc[i][j] == 'y'){
        ff(i, j, , ); ff(i, j, , ); ff(i, j, , -); ff(i, j, -, );
        ff(i, j, , ); ff(i, j, -, -); ff(i, j, -, ); ff(i, j, , -);
    }
    for (int i = ; i < n; ++i){
        for (int j = ; j < n;++j)
        if (f[i][j] == )cout << "*";
        else cout << cc[i][j];
        cout << endl;
    }
}