题解

#include<bits/stdc++.h>
using namespace std;
int n,a[105][105];
int x1=1,Y1=2,x2=1,Y2=3,x3=2,Y3=3;
int g1=1,h1=1,g2=1,h2=2,g3=2,h3=1;
int J1=2,k1=1,J2=3,k2=1,J3=3,k3=2;
int e1=2,f1=3,e2=3,f2=3,e3=3,f3=2;  
int main(){
   cin>>n;
   for(int i=0;i<n;i++){
      for(int j=0;j<n;j++){
         cin>>a[i][j];
      }
   }
   if(a[x1-1][Y1-1]==a[x2-1][Y2-1]&&a[x1-1][Y1-1]==a[x3-1][Y3-1]||a[g1-1][h1-1]==a[g2-1][h2-1]&&a[g1-1][h1-1]==a[g3-1][h3-1]||a[J1-1][k1-1]==a[J2-1][k2-1]&&a[J1-1][k1-1]==a[J3-1][k3-1]||a[e1-1][f1-1]==a[e2-1][f2-1]&&a[e1-1][f1-1]==a[e3-1][f3-1]) 
     cout<<"YES";
   else cout<<"NO";  
       return 0;
}