C :

#include<stdio.h>
int main()
{
	int a[100][100];
	int n,m,i,j,s=0;
	scanf("%d %d",&n,&m);
	for(i=0;i<n;i++){
		for(j=0;j<m;j++){
			scanf("%d",&a[i][j]);
		}	
	}
	int x,y;
	scanf("%d %d",&x,&y);
	for(i=0;i<m;i++){
		if(a[x-1][i]==a[x-1][y-1]) s++;
	}
	for(i=0;i<n;i++){
		if(a[i][y-1]==a[x-1][y-1]) s++;
	}
	printf("%d",s-2);
	return 0;
 } 

C++ :

#include <bits/stdc++.h>
using namespace std;

int a[210][210];
int n,m,c = 0,x,y;

int main() {
	cin>>n>>m;
	for(int i = 1;i <= n;i++){
		for(int j = 1;j <= m;j++){
			cin>>a[i][j];
		}
	}
	cin>>x>>y;
	
	//循环第x行
	for(int i = 1;i <= m;i++){
		if(a[x][i] == a[x][y]) c++;
	}
	
	//循环第y列
	for(int i = 1;i <= n;i++){
		if(a[i][y] == a[x][y]) c++;
	} 
	
	cout<<c-2;
	
	return 0;
}

Java :

import java.util.Scanner;
public class Main {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int num1 = scanner.nextInt();
        int num2 = scanner.nextInt();
        int[][] a = new int[num1][num2];
//        int[][] b = new int[num1][num2];
        for (int i = 0; i < num1; i++) {
            for(int j = 0;j < num2;j++)
            a[i][j] = scanner.nextInt();
        }
        int count = 0;
        int num3 = scanner.nextInt();
        int num4 = scanner.nextInt();
        for (int i = 0; i < num1; i++) {
                if(a[num3-1][num4-1] == a[i][num4-1] && i != num3-1){
                    count++;
                }
        } for (int i = 0; i < num2; i++) {
                if(a[num3-1][num4-1] == a[num3-1][i] && i != num4-1){
                    count++;
                }
        }
        System.out.println(count);






    }public static void paiXu(int[] a,int length){
        int temp;
        for(int i = 0;i < length - 1;i++){
            for(int k = 0;k < length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXud(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] < a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    } public static void paiXux(int[] a){
        int temp;
        for(int i = 0;i < a.length - 1;i++){
            for(int k = 0;k < a.length - i - 1;k++){
                if(a[k] > a[k + 1]){
                    temp = a[k];
                    a[k] = a[k + 1];
                    a[k + 1] = temp;
                }
            }
        }
    }

    public static int MAX2(int[][] a){
        int max = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(max < a[i][j])max = a[i][j];
            }
        }
        return max;
    }public static int MIN2(int[][] a){
        int min = a[0][0];
        for (int i = 0; i < a.length; i++) {
            for(int j = 0;j < a[0].length;j++){
                if(min > a[i][j])min = a[i][j];
            }
        }
        return min;
    }
    public static int MAX(int[] a){
        int max = a[0];
        for (int i = 0; i < a.length; i++) {
            if(max < a[i]){
                max = a[i];
            }
        }
        return max;
    }

    public static int MIN(int[] a){
        int min = a[0];
        for (int i = 0; i < a.length; i++) {
            if(min > a[i]){
               min = a[i];
            }
        }
        return min;
    }
    public static int sum(int a){
        int x,s = 0;
        while(a != 0){
            x = a % 10;
            s = s + x;
            a /= 10;
        }
        return s;
    }
    public static boolean isPrime(int a){
        if(a <= 1)return false;
        else
        for(int i = 2;i <= Math.sqrt(a);i++){
            if(a % i == 0)return false;
        }return true;
    }

    public static long qiuYu(long i){
        long a;
        a = i % 10;
        return a;
    }
    public static int daoXu(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s * 10 + m;
            x /= 10;
        }
        return s;
    }

    public static int jiaWei(int x){
        int s = 0,m;
        while(x != 0){
            m = x % 10;
            s = s + m;
            x /= 10;
        }
        return s;
    }

    public static int fun(int x){
        if(x == 1 || x == 2)return 1;
        else return fun(x - 1) + fun(x - 2);
    }
}

Python :

n,m=list(map(int,input().split()))
a=list()


sum=0
for i in range(n):
    a.append(list(map(int,input().split())))
x,y=list(map(int,input().split()))
x,y=x-1,y-1

sum=-1
for i in range(n):
    for j in range(m):
        if i==x or j==y:
            if a[i][j]==a[x][y]:
                sum=sum+1
        
       
print(sum)