蟹特代码
  • 板块灌水区
  • 楼主lichengzhe
  • 当前回复2
  • 已保存回复2
  • 发布时间2024/11/30 18:33
  • 上次更新2024/11/30 18:55:01
查看原帖
蟹特代码
1129410
lichengzhe楼主2024/11/30 18:33

甚至一遍A ......

P1101

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

int n;
char a[105][105];
bool mk[105][105];

int main(){
	cin>>n;
	for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) cin>>a[i][j];
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(a[i][j]=='y'&&a[i-1][j]=='i'&&a[i-2][j]=='z'&&a[i-3][j]=='h'&&a[i-4][j]=='o'&&a[i-5][j]=='n'&&a[i-6][j]=='g')				//上
				mk[i][j]=1,mk[i-1][j]=1,mk[i-2][j]=1,mk[i-3][j]=1,mk[i-4][j]=1,mk[i-5][j]=1,mk[i-6][j]=1;
			if(a[i][j]=='y'&&a[i-1][j+1]=='i'&&a[i-2][j+2]=='z'&&a[i-3][j+3]=='h'&&a[i-4][j+4]=='o'&&a[i-5][j+5]=='n'&&a[i-6][j+6]=='g')	//右上
				mk[i][j]=1,mk[i-1][j+1]=1,mk[i-2][j+2]=1,mk[i-3][j+3]=1,mk[i-4][j+4]=1,mk[i-5][j+5]=1,mk[i-6][j+6]=1;
			if(a[i][j]=='y'&&a[i][j+1]=='i'&&a[i][j+2]=='z'&&a[i][j+3]=='h'&&a[i][j+4]=='o'&&a[i][j+5]=='n'&&a[i][j+6]=='g')				//右
				mk[i][j]=1,mk[i][j+1]=1,mk[i][j+2]=1,mk[i][j+3]=1,mk[i][j+4]=1,mk[i][j+5]=1,mk[i][j+6]=1;
			if(a[i][j]=='y'&&a[i+1][j+1]=='i'&&a[i+2][j+2]=='z'&&a[i+3][j+3]=='h'&&a[i+4][j+4]=='o'&&a[i+5][j+5]=='n'&&a[i+6][j+6]=='g')	//右下
				mk[i][j]=1,mk[i+1][j+1]=1,mk[i+2][j+2]=1,mk[i+3][j+3]=1,mk[i+4][j+4]=1,mk[i+5][j+5]=1,mk[i+6][j+6]=1;
			if(a[i][j]=='y'&&a[i+1][j]=='i'&&a[i+2][j]=='z'&&a[i+3][j]=='h'&&a[i+4][j]=='o'&&a[i+5][j]=='n'&&a[i+6][j]=='g')				//下
				mk[i][j]=1,mk[i+1][j]=1,mk[i+2][j]=1,mk[i+3][j]=1,mk[i+4][j]=1,mk[i+5][j]=1,mk[i+6][j]=1;
			if(a[i][j]=='y'&&a[i+1][j-1]=='i'&&a[i+2][j-2]=='z'&&a[i+3][j-3]=='h'&&a[i+4][j-4]=='o'&&a[i+5][j-5]=='n'&&a[i+6][j-6]=='g')	//左下
				mk[i][j]=1,mk[i+1][j-1]=1,mk[i+2][j-2]=1,mk[i+3][j-3]=1,mk[i+4][j-4]=1,mk[i+5][j-5]=1,mk[i+6][j-6]=1;
			if(a[i][j]=='y'&&a[i][j-1]=='i'&&a[i][j-2]=='z'&&a[i][j-3]=='h'&&a[i][j-4]=='o'&&a[i][j-5]=='n'&&a[i][j-6]=='g')				//左
				mk[i][j]=1,mk[i][j-1]=1,mk[i][j-2]=1,mk[i][j-3]=1,mk[i][j-4]=1,mk[i][j-5]=1,mk[i][j-6]=1;
			if(a[i][j]=='y'&&a[i-1][j-1]=='i'&&a[i-2][j-2]=='z'&&a[i-3][j-3]=='h'&&a[i-4][j-4]=='o'&&a[i-5][j-5]=='n'&&a[i-6][j-6]=='g')	//左上
				mk[i][j]=1,mk[i-1][j-1]=1,mk[i-2][j-2]=1,mk[i-3][j-3]=1,mk[i-4][j-4]=1,mk[i-5][j-5]=1,mk[i-6][j-6]=1;
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(mk[i][j])
				cout<<a[i][j];
			else cout<<'*';
		}
		cout<<endl;
	}
	return 0;
}
2024/11/30 18:33
加载中...