C :

#include <stdio.h>
//回文数
int huiWen(int x){
	int h=0,y = x;
	while(x > 0){
		h = h * 10 + x % 10;
		x /= 10;
	}
	if(h == y)
		return 1;
	else
		return 0;
} 
 
int main(){
	int n,m;
	scanf("%d %d",&n,&m);
	int a[n][m],i,j;  //二维数组 

	int s = 0;  //回文数个数 
	//二维数组赋值,并删选回文数 
	for(i = 0;i < n;i++){
		for(j = 0;j < m;j++){
			scanf("%d",&a[i][j]);
			if(huiWen(a[i][j]))
				s++;
		}
	} 
	
	int b[s],z=0;  //存放回文数
	for(i = 0;i < n;i++){
		for(j = 0;j < m;j++){
			if(huiWen(a[i][j]))
				b[z++] = a[i][j];
		}
	}
	
	//遍历回文数
	for(i = 0;i < s;i++){
		printf("%d\n",b[i]);
	} 	 
	return 0;
}

C++ :

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

//判断一个四位数是否是回文 
bool huiwen(int n){
	bool r = false;//假设不是回文
	int q,b,s,g;
	q = n / 1000;
	b = n / 100 % 10;
	s = n / 10 % 10;
	g = n % 10;
	
	if(n < 10){
		r = true;
	}else if(n >= 10 && n < 100 && g == s){
		r = true;
	}else if(n >= 100 && n < 1000 && g == b){
		r = true;
	}else if(n >= 1000 && n < 10000 && g == q && s == b){
		r = true;
	}
	
	return r; 
}

int main(){
	int n,m,a[110][110],i,j,c = 0;
	cin>>n>>m;
	for(i = 0;i < n;i++){
		for(j = 0;j < m;j++){
			cin>>a[i][j];
		}
	}
	
	for(i = 0;i < n;i++){
		for(j = 0;j < m;j++){
			if(huiwen(a[i][j])){
				cout<<a[i][j]<<endl;
			}
		}
	}
}

Python :

n,m=list(map(int,input().split()))
a=list()
for i in range(n):
    a.append(list(map(int,input().split())))

js,os=0,0

for i in range(n):
    for j in range(m):
        str1=str(a[i][j])
        if str1==str1[::-1]:
            print(str1)