暴力法 注意边界条件的判断 是否超出边界 printf没有& 没有&
测试文本
0 0 0 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 1 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 2 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
2 1 0 0 2 2 2 2 0 0 0 0 0 0 0 0 0 0 0
1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 2 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 2 2 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 0 2 0 0 0 0 0
0 0 0 0 0 0 0 0 0 0 0 0 2 2 0 0 0 0 0
#include<stdio.h>
using namespace std;
int main(){
int pan[19][19];
for(int i=0;i<19;i++)
for(int j=0;j<19;j++)
scanf("%d",&pan[i][j]);
bool flag=false;
int t=0;
for(int i=0;i<19;i++)
for(int j=0;j<19;j++){
if(pan[i][j]!=0){
t=pan[i][j];
if(j<15&&t==pan[i][j+1]&&t==pan[i][j+2]&&t==pan[i][j+3]&&t==pan[i][j+4]){
printf("%d:%d,%d\n",t,i+1,j+1);
flag=true;
break;
}
if(i<15&&t==pan[i+1][j]&&t==pan[i+2][j]&&t==pan[i+3][j]&&t==pan[i+4][j]){
printf("%d:%d,%d\n",t,i+1,j+1);
flag=true;
break;
}
if(i<15&&j<15&&t==pan[i+1][j+1]&&t==pan[i+2][j+2]&&t==pan[i+3][j+3]&&t==pan[i+4][j+4]){
printf("%d:%d,%d\n",t,i+1,j+1);
flag=true;
break;
}
if(i<15&&j>3&&t==pan[i+1][j-1]&&t==pan[i+2][j-2]&&t==pan[i+3][j+-3]&&t==pan[i+4][j-4]){
printf("%d:%d,%d\n",t,i+1,j+1);
flag=true;
break;
}
}
}
if(flag==false)
printf("No\n");
return 0;
}