int nr_sa(int a[100][100],int n,int m)
{
    int minl,minc,maxl,maxc,nr=0;
    for(int i=0;i<n;i++) ///iau linia i
    {
        maxl=a[i][0];minl=a[i][0];
        for(int j=0;j<m;j++) ///o parcurg folosind toate coloanele j
        {
            if(a[i][j]>maxl){ maxl=a[i][j];}
            if(a[i][j]<minl){ minl=a[i][j];}
            minc=a[j][0]; maxc=a[j][0];
            for(int k=0;k<n;k++)
            {
                if(a[k][j]>maxl){ maxc=a[k][j];}
                if(a[k][j]<minl){ minc=a[k][j];}
            }
            if(minl==maxc || maxl==minc){nr++;}
        }
    }
    return nr;
}