关于带暴力
  • 板块灌水区
  • 楼主甄黫陻堙
  • 当前回复6
  • 已保存回复6
  • 发布时间2020/10/28 16:46
  • 上次更新2023/11/5 09:40:21
查看原帖
关于带暴力
352350
甄黫陻堙楼主2020/10/28 16:46

P1101

#include<cstdio>
using namespace std;
int n,ans;
char a[200][200];
bool bl[200][200];
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%s",a[i]);
		for(int j=0;j<n;j++){
			if(a[i][j]!='y'&&a[i][j]!='i'&&a[i][j]!='z'&&a[i][j]!='h'&&a[i][j]!='o'&&a[i][j]!='n'&&a[i][j]!='g'){
				a[i][j]='*';
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			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'){
				bl[i][j]=1,bl[i][j+1]=1,bl[i][j+2]=1,bl[i][j+3]=1,bl[i][j+4]=1,bl[i][j+5]=1,bl[i][j+6]=1;
			}
		}
		for(int j=n-1;j>=0;j--){
			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'){
				bl[i][j]=1,bl[i][j-1]=1,bl[i][j-2]=1,bl[i][j-3]=1,bl[i][j-4]=1,bl[i][j-5]=1,bl[i][j-6]=1;
			}
		}
		for(int k=0;k<n;k++){
			if(a[i][k]=='y'&&a[i+1][k+1]=='i'&&a[i+2][k+2]=='z'&&a[i+3][k+3]=='h'&&a[i+4][k+4]=='o'&&a[i+5][k+5]=='n'&&a[i+6][k+6]=='g'){
				bl[i][k]=1,bl[i+1][k+1]=1,bl[i+2][k+2]=1,bl[i+3][k+3]=1,bl[i+4][k+4]=1,bl[i+5][k+5]=1,bl[i+6][k+6]=1;
			}
			if(a[i][k]=='y'&&a[i+1][k-1]=='i'&&a[i+2][k-2]=='z'&&a[i+3][k-3]=='h'&&a[i+4][k-4]=='o'&&a[i+5][k-5]=='n'&&a[i+6][k-6]=='g'){
				bl[i][k]=1,bl[i+1][k-1]=1,bl[i+2][k-2]=1,bl[i+3][k-3]=1,bl[i+4][k-4]=1,bl[i+5][k-5]=1,bl[i+6][k-6]=1;
			}
			if(a[i][k]=='y'&&a[i-1][k+1]=='i'&&a[i-2][k+2]=='z'&&a[i-3][k+3]=='h'&&a[i-4][k+4]=='o'&&a[i-5][k+5]=='n'&&a[i-6][k+6]=='g'){
				bl[i][k]=1,bl[i-1][k+1]=1,bl[i-2][k+2]=1,bl[i-3][k+3]=1,bl[i-4][k+4]=1,bl[i-5][k+5]=1,bl[i-6][k+6]=1;
			}
			if(a[i][k]=='y'&&a[i-1][k-1]=='i'&&a[i-2][k-2]=='z'&&a[i-3][k-3]=='h'&&a[i-4][k-4]=='o'&&a[i-5][k-5]=='n'&&a[i-6][k-6]=='g'){
				bl[i][k]=1,bl[i-1][k-1]=1,bl[i-2][k-2]=1,bl[i-3][k-3]=1,bl[i-4][k-4]=1,bl[i-5][k-5]=1,bl[i-6][k-6]=1;
			}
		}	
	}
	
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(a[j][i]=='y'&&a[j+1][i]=='i'&&a[j+2][i]=='z'&&a[j+3][i]=='h'&&a[j+4][i]=='o'&&a[j+5][i]=='n'&&a[j+6][i]=='g'){
				bl[j][i]=1,bl[j+1][i]=1,bl[j+2][i]=1,bl[j+3][i]=1,bl[j+4][i]=1,bl[j+5][i]=1,bl[j+6][i]=1;
			}
		}
		for(int j=n-1;j>=0;j--){
			if(a[j][i]=='y'&&a[j-1][i]=='i'&&a[j-2][i]=='z'&&a[j-3][i]=='h'&&a[j-4][i]=='o'&&a[j-5][i]=='n'&&a[j-6][i]=='g'){
				bl[j][i]=1,bl[j-1][i]=1,bl[j-2][i]=1,bl[j-3][i]=1,bl[j-4][i]=1,bl[j-5][i]=1,bl[j-6][i]=1;
			}
		}
	}
	for(int i=0;i<n;i++){
		for(int j=0;j<n;j++){
			if(bl[i][j]==1)printf("%c",a[i][j]);
			else printf("*");
		}
		printf("\n");
	}
	return 0;
}
2020/10/28 16:46
加载中...