bac august 2019 matrice

#include <iostream>

using namespace std;
int a²¹²¹,i,j,m,n;
int lineg(int a²¹²¹,int n, int l)
{ int j,x=a[l]¹,y; for(j=1; j<n; j++) if(x!=a[l][j+1]) y=j;
return y;
}
int coleg(int a²¹²¹,int n, int c)
{ int i,x=a¹©,y; for(i=1; i<n; i++) if(x!=a[i+1][c]) y=i;
return y;
}
int main()
{ int mi=22; cin>>n; for(i=1; i<=n; i++) for(j=1; j<=n; j++) cin>>a[i][j];

for(i=1; i<=n; i++) if(lineg(a,n,i)!=1) if(lineg(a,n,i)<mi) mi=lineg(a,n,i); for(j=1; j<=n; j++) if(coleg(a,n,j)!=1) if(coleg(a,n,j)<mi) mi=coleg(a,n,j); cout<<mi; return 0; }