提交时间:2025-07-24 15:41:25
运行 ID: 335967
#include <iostream> #include <vector> using namespace std; bool isPalindrome(int num) { if(num < 0) return false; int original = num, reversed = 0; while(num > 0) { reversed = reversed * 10 + num % 10; num /= 10; } return original == reversed; } int main() { int n, m; cin >> n >> m; vector<vector<int>> matrix(n, vector<int>(m)); // 读取输入矩阵 for(int i = 0; i < n; i++) { for(int j = 0; j < m; j++) { cin >> matrix[i][j]; } } // 检查并输出回文数 for(int i = 0; i < n; i++) { for(int j = 0; j < m; j++) { if(isPalindrome(matrix[i][j])) { cout << matrix[i][j] << endl; } } } return 0; }