P1101 单词方阵（深度优先搜索 ）

#include <bits/stdc++.h>
using namespace std;

char ans[105][105];
char chan[105][105];
/这道题要求用深搜，但其实用枚举也能过，下面是枚举代码。
就是判断烦了点。
通过枚举可行字符，进行双向判断（注意是两个方向。）
在进行复制粘贴的时候，特别要注意，因为，如果不改的话肯定会错。
（良心提示：读入不用getchar）
/
int main()
{
int n;
cin >> n;
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n;j++)
{
char c;
cin >> c;
ans[i][j] = '’;
if(c != ‘y’ && c != ‘i’ && c != ‘z’ && c != ‘h’ && c != ‘o’ && c != ‘n’ && c != ‘g’)
chan[i][j] = '’;
else chan[i][j] = c;
}
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n - 6;j++)
if((chan[i][j] == ‘y’ && chan[i][j + 1] == ‘i’ && chan[i][j + 2] == ‘z’ && chan[i][j + 3] == ‘h’ && chan[i][j + 4] == ‘o’ && chan[i][j + 5] == ‘n’ && chan[i][j + 6] == ‘g’) || (chan[i][j] == ‘g’ && chan[i][j + 1] == ‘n’ && chan[i][j + 2] == ‘o’ && chan[i][j + 3] == ‘h’ && chan[i][j + 4] == ‘z’ && chan[i][j + 5] == ‘i’ && chan[i][j + 6] == ‘y’))
for(int k = j;k <= j + 6;k++)
{
ans[i][k] = chan[i][k];
chan[i][k] = ‘’;
}
for(int i = 1;i <= n;i++)
for(int j = 1;j <= n - 6;j++)
if((chan[j][i] == ‘y’ && chan[j + 1][i] == ‘i’ && chan[j + 2][i] == ‘z’ && chan[j + 3][i] == ‘h’ && chan[j + 4][i] == ‘o’ && chan[j + 5][i] == ‘n’ && chan[j + 6][i] == ‘g’) || (chan[j][i] == ‘g’ && chan[j + 1][i] == ‘n’ && chan[j + 2][i] == ‘o’ && chan[j + 3][i] == ‘h’ && chan[j + 4][i] == ‘z’ && chan[j + 5][i] == ‘i’ && chan[j + 6][i] == ‘y’))
for(int k = j;k <= j + 6;k++)
{
ans[k][i] = chan[k][i];
chan[k][i] = '’;
}
for(int i = 1;i <= n - 6;i++)
for(int j = 1;j <= n - 6;j++)
if((chan[i][j] == ‘y’ && chan[i + 1][j + 1] == ‘i’ && chan[i + 2][j + 2] == ‘z’ && chan[i + 3][j + 3] == ‘h’ && chan[i + 4][j + 4] == ‘o’ && chan[i + 5][j + 5] == ‘n’ && chan[i + 6][j + 6] == ‘g’) || (chan[i][j] == ‘g’ && chan[i + 1][j + 1] == ‘n’ && chan[i + 2][j + 2] == ‘o’ && chan[i + 3][j + 3] == ‘h’ && chan[i + 4][j + 4] == ‘z’ && chan[i + 5][j + 5] == ‘i’ && chan[i + 6][j + 6] == ‘y’))
for(int k = 0;k < 7;k++)
{
ans[i + k][j + k] = chan[i + k][j + k];
chan[i + k][j + k] = ‘’;
}
for(int i = 6;i <= n;i++)
for(int j = 1;j <= n - 6;j++)
if((chan[i][j] == ‘y’ && chan[i - 1][j + 1] == ‘i’ && chan[i - 2][j + 2] == ‘z’ && chan[i - 3][j + 3] == ‘h’ && chan[i - 4][j + 4] == ‘o’ && chan[i - 5][j + 5] == ‘n’ && chan[i - 6][j + 6] == ‘g’) || (chan[i][j] == ‘g’ && chan[i - 1][j + 1] == ‘n’ && chan[i - 2][j + 2] == ‘o’ && chan[i - 3][j + 3] == ‘h’ && chan[i - 4][j + 4] == ‘z’ && chan[i - 5][j + 5] == ‘i’ && chan[i - 6][j + 6] == ‘y’))
for(int k = 0;k < 7;k++)
{
ans[i - k][j + k] = chan[i - k][j + k];
chan[i - k][j + k] = '’;
}
for(int i = 1;i <= n;i++)
{
for(int j = 1;j <= n;j++)
cout << ans[i][j];
cout << endl;
}
return 0;
}
/*附赠样例
7
aaaaaay
aaaaaia
aaaazaa
aaahaaa
aaoaaaa
anaaaaa
gaaaaaa
*/